Domain-independent planning: representation and plan generation
Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Interleaving Planning and Robot Execution for Asynchronous User Requests
Autonomous Robots - Special issue on autonomous agents
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
SHOP: simple hierarchical ordered planner
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Total-order planning with partially ordered subtasks
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Pengi: an implementation of a theory of activity
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited to predictable domains. In this paper we present HOPPER (Hierarchical Ordered Partial-Plan Executor and Re-planner), a hierarchical planning agent that produces partial plans in a similar way to HTNs but can also handle unexpected events in unpredictable domains by interleaving planning and execution. HOPPER can detect and recover from unexpected events that invalidate the plan, and it can detect and exploit unexpected opportunities both serendipitously and by interleaving decompositions.