Artificial Intelligence
Artificial Intelligence - Special issue on knowledge representation
Fast transformation of temporal plans for efficient execution
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Backtracking algorithms for disjunctions of temporal constraints
Artificial Intelligence
Introduction to Algorithms
A Probabilistic Approach to Robust Execution of Temporal Plans with Uncertainty
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
AND/OR search spaces for graphical models
Artificial Intelligence
Conflict-directed A* and its role in model-based embedded systems
Discrete Applied Mathematics
Distributed management of flexible times schedules
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Robust execution of contingent, temporally flexible plans
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Controllability in Temporal Conceptual Workflow Schemata
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Journal of Artificial Intelligence Research
Temporal constraint reasoning with preferences
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Executing reactive, model-based programs through graph-based temporal planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Dynamic control of plans with temporal uncertainty
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Disjunctive temporal planning with uncertainty
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Strengthening schedules through uncertainty analysis
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
TIME '09 Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning
Controlling inequality reasoning in a TMS-based analog diagnosis system
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
Towards Temporal Controllabilities for Workflow Schemata
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
Contexts and Data Dependencies: A Synthesis
IEEE Transactions on Pattern Analysis and Machine Intelligence
A structural characterization of temporal dynamic controllability
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Flexible execution of partial order plans with temporal constraints
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Distributed reasoning for multiagent simple temporal problems
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
This work presents Drake, a dynamic executive for temporal plans with choice. Dynamic plan execution strategies allow an autonomous agent to react quickly to unfolding events, improving the robustness of the agent. Prior work developed methods for dynamically dispatching Simple Temporal Networks, and further research enriched the expressiveness of the plans executives could handle, including discrete choices, which are the focus of this work. However, in some approaches to date, these additional choices induce significant storage or latency requirements to make flexible execution possible. Drake is designed to leverage the low latency made possible by a preprocessing step called compilation, while avoiding high memory costs through a compact representation. We leverage the concepts of labels and environments, taken from prior work in Assumption-based Truth Maintenance Systems (ATMS), to concisely record the implications of the discrete choices, exploiting the structure of the plan to avoid redundant reasoning or storage. Our labeling and maintenance scheme, called the Labeled Value Set Maintenance System, is distinguished by its focus on properties fundamental to temporal problems, and, more generally, weighted graph algorithms. In particular, the maintenance system focuses on maintaining a minimal representation of non-dominated constraints. We benchmark Drake's performance on random structured problems, and find that Drake reduces the size of the compiled representation by a factor of over 500 for large problems, while incurring only a modest increase in run-time latency, compared to prior work in compiled executives for temporal plans with discrete choices.