Specifying real-time properties with metric temporal logic
Real-Time Systems
Artificial Intelligence - Special issue on knowledge representation
Theoretical Computer Science
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Planning with problems requiring temporal coordination
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Partial-order planning with concurrent interacting actions
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
When is temporal planning really temporal?
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Executing reactive, model-based programs through graph-based temporal planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems
Autonomous Agents and Multi-Agent Systems
Runtime Verification for LTL and TLTL
ACM Transactions on Software Engineering and Methodology (TOSEM)
Drake: an efficient executive for temporal plans with choice
Journal of Artificial Intelligence Research
Monitoring the execution of partial-order plans via regression
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
We propose a unified approach to plan execution and schedule dispatching that converts a plan, which has been augmented with temporal constraints, into a policy for dispatching. Our approach generalizes the original plan and temporal constraints so that the executor need only consider the subset of state that is relevant to successful execution of valid plan fragments. We can accommodate a variety of calamitous and serendipitous changes to the state of the world by supporting the seamless re-execution or omission of plan fragments, without the need for costly replanning. Our methodology for plan generalization and online dispatching is a novel combination of plan execution and schedule dispatching techniques. We demonstrate the effectiveness of our method through a prototype implementation and a series of experiments.