Open AccessProceedings Article
Enumerating Preferred Solutions to Conditional Simple Temporal Networks Quickly Using Bounding Conflicts
Eric Timmons,Brian C. Williams +1 more
TLDR
This work introduces conditional simple temporal networks with preference (CSTNP), where preference is a function over both choice and schedule, and presents an algorithm for enumerating solutions to CSTNPs efficiently and a novel variant of conflicts, called bounding conflicts, for learning heuristic functions.Abstract:
To achieve high performance, autonomous systems, such as science explorers, should adapt to the environment to improve utility gained, as well as robustness. Flexibility during temporal plan execution has been explored extensively to improve robustness, where flexibility exists both in activity choices and schedules. These problems are framed as conditional constraint networks over temporal constraints. However, flexibility has been exploited in a limited form to improve utility. Prior work considers utility in choice or schedule, but not their coupling. To exploit fully flexibility, we introduce conditional simple temporal networks with preference (CSTNP), where preference is a function over both choice and schedule. Enumerating best solutions to a CSTNP is challenging due to the cost of scheduling a candidate STPP and the exponential number of candidates. Our contribution is an algorithm for enumerating solutions to CSTNPs efficiently, called A star with bounding conflicts (A*BC), and a novel variant of conflicts, called bounding conflicts, for learning heuristic functions. A*BC interleaves Generate, Test, and Bound. When A*BC bounds a candidate, by solving a STPP, it generates a bounding conflict, denoting neighboring candidates with similar bounds. A*BC's generator then uses these conflicts to steer away from sub-optimal candidates.read more
Citations
More filters
Proceedings ArticleDOI
The Resilient Spacecraft Executive: An Architecture for Risk-Aware Operations in Uncertain Environments
Catharine L. R. McGhan,Tiago Stegun Vaquero,Anatha R. Subrahmanya,Oktay Arslan,Richard M. Murray,Michel D. Ingham,Masahiro Ono,Tara Estlin,Brian C. Williams,Maged Elaasar +9 more
TL;DR: This paper discusses some feasible, useful RSE configurations and deployments for a Mars rover case and an autonomous underwater vehicle case, and discusses additional capabilities that the architecture requires to support needed resiliency, such as onboard analysis and learning.
Proceedings ArticleDOI
Approximability of Constant-horizon Constrained POMDP
TL;DR: The first Fully Polynomial Time Approximation Scheme (FPTAS) that computes (near) optimal deterministic policies for constant-horizon (C)C-POMDP in polynomial time is presented.
Proceedings Article
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty
Jing Cui,Patrik Haslum +1 more
TL;DR: In this article, the authors define dynamic controllability of a CCTPU as the existence of a strategy that decides on both the values of discrete choice variables and the scheduling of controllable time points dynamically.
References
More filters
Journal ArticleDOI
Temporal constraint networks
TL;DR: It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.
Journal ArticleDOI
SHOP2: an HTN planning system
TL;DR: The SHOP2 planning system as discussed by the authors received one of the awards for distinguished performance in the 2002 International Planning Competition and described the features that enabled it to excel in the competition, especially those aspects of SHOP 2 that deal with temporal and metric planning domains.
Journal Article
Dynamic backtracking
TL;DR: The technique developed is a variant of dependency-directed backtracking that uses only polynomial space while still providing useful control information and retaining the completeness guarantees provided by earlier approaches.
Journal ArticleDOI
Conflict-directed A* and its role in model-based embedded systems
TL;DR: This paper introduces conflict-directed A^* a method for solving optimal constraint satisfaction problems, which searches the state space in best first order, but accelerates the search process by eliminating subspaces around each state that are inconsistent.
Journal ArticleDOI
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning
TL;DR: This paper develops the Conditional Temporal Problem (CTP) formalism, an extension of standard temporal constraint-satisfaction processing models used in non-conditional temporal planning that allows for the construction of conditional plans that are guaranteed to satisfy complex temporal constraints.