Generalizing Temporal Controllability

被引:0
|
作者
Moffitt, Michael D. [1 ]
Pollack, Martha E. [1 ]
机构
[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we focus on extending the expressive power of constraint-based temporal reasoning formalisms. We begin with the well-known Simple Temporal Problem with Uncertainty, and incorporate three extensions: prior observability, in which the values of uncontrollable events become known prior to their actual occurrence; partial shrinkage, in which an observation event triggers the reduction of a contingent temporal interval; and a generalization of partial shrinkage to requirement links, making it possible to express certain types of uncertainty that may arise even when the time points in a problem are themselves fully controllable. We describe levels of controllability in the resulting formalism, the Generalized STPU, and relate this formalism to related developments in disjunctive temporal reasoning. Throughout, we motivate our approach with simple, real-world examples that illustrate the limitations of existing formalisms and the flexibility of our proposed extensions.
引用
收藏
页码:1985 / 1990
页数:6
相关论文
共 50 条
  • [41] Capturing Telic/Atelic Temporal Data Semantics: Generalizing Conventional Conceptual Models
    Khatri, Vijay
    Ram, Sudha
    Snodgrass, Richard T.
    Terenziani, Paolo
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (03) : 528 - 548
  • [42] Magic Loops and the Dynamic Controllability of Simple Temporal Networks with Uncertainty
    Hunsberger, Luke
    [J]. AGENTS AND ARTIFICIAL INTELLIGENCE, ICAART 2013, 2014, 449 : 332 - 350
  • [43] Dynamic Controllability of Temporal Plans in Uncertain and Partially Observable Environments
    Bit-Monnot, Arthur
    Morris, Paul
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2023, 77 : 1311 - 1369
  • [44] Dynamic Controllability of Temporal Plans in Uncertain and Partially Observable Environments
    Bit-Monnot, Arthur
    Morris, Paul
    [J]. Journal of Artificial Intelligence Research, 2023, 77 : 1311 - 1369
  • [45] Faster Dynamic Controllability Checking in Temporal Networks with Integer Bounds
    Bhargava, Nikhil
    Williams, Brian C.
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 5509 - 5515
  • [46] Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
    Bhargava, Nikhil
    Williams, Brian C.
    [J]. ARTIFICIAL INTELLIGENCE, 2019, 271 : 1 - 17
  • [47] A temporal segmentation algorithm for restoring the controllability of networked control systems
    Cui, Yulong
    Wu, Mincheng
    Shao, Cunqi
    He, Shibo
    [J]. IET CONTROL THEORY AND APPLICATIONS, 2022, 16 (03): : 318 - 329
  • [48] Solving strong controllability of temporal problems with uncertainty using SMT
    Alessandro Cimatti
    Andrea Micheli
    Marco Roveri
    [J]. Constraints, 2015, 20 : 1 - 29
  • [49] Solving strong controllability of temporal problems with uncertainty using SMT
    Cimatti, Alessandro
    Micheli, Andrea
    Roveri, Marco
    [J]. CONSTRAINTS, 2015, 20 (01) : 1 - 29