On Guiding Search in HTN Temporal Planning with non Temporal Heuristics
Abstract: The Hierarchical Task Network (HTN) formalism is used to express a wide variety of planning problems as task decompositions, and many techniques have been proposed to solve them. However, few works have been done on temporal HTN. This is partly due to the lack of a formal and consensual definition of what a temporal hierarchical planning problem is as well as the difficulty to develop heuristics in this context. In response to these inconveniences, we propose in this paper a new general POCL (Partial Order Causal Link) approach to represent and solve a temporal HTN problem by using existing heuristics developed to solve non temporal problems. We show experimentally that this approach is performant and can outperform the existing ones.
- Formal Semantics and Formally Verified Validation for Temporal Planning. In AAAI Conference on Artificial Intelligence, 9635–9643.
- SIADEX: An interactive knowledge-based planner for decision support in forest fire fighting. AI Commun., 18: 257–268.
- SHOP2: An HTN Planning System. J. of Artif. Intell. Res., 20: 379–404.
- A Heuristic Search Approach to Planning with Temporally Extended Preferences. Artif. Intell., 173: 593–618.
- EUROPA: A platform for AI planning, scheduling, constraint programming, and optimization. 4th International Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS).
- HiPOP: Hierarchical Partial-Order Planning. In Starting AI Researchers’ Symposium.
- An Admissible HTN Planning Heuristic. In IJCAI, 480–488.
- Hybrid Planning Heuristics Based on Task Decomposition Graphs. Proceedings of the International Symposium on Combinatorial Search.
- FAPE: a Constraint-based Planner for Generative and Hierarchical Temporal Planning. CoRR, 2010.13121.
- Point algebras for temporal reasoning: Algorithms and complexity. Artif. Intell., 149(2): 179–220.
- Temporal Planning With Required Concurrency Using Classical Planning. In ICAPS, 129–137.
- Cushing, W. 2007. Evaluating Temporal Planning Domains. ICAPS, 105–112.
- Temporal Constraint Networks. Artif. Intell., 49(1-3): 61–95.
- PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. J. of Artif. Intell. Res., 20: 61–124.
- Goldman, R. 2006. Durative Planning in HTNs. In Proceedings of the International Conference on Automated Planning and Scheduling, 382–385.
- The FF Planning System: Fast Plan Generation Through Heuristic Search. J. of Artif. Intell. Res., 14.
- HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems. In AAAI Conference on Artificial Intelligence, 9883–9891.
- Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning. In Hayes-Roth, B.; and Korf, R. E., eds., NCAI, 1004–1009.
- HATP: Hierarchical Agent-Based Task Planner. In AAMAS, 1823–1825.
- Lemai, S. 2004. IXTET-EXEC: planning, plan repair and execution control with time and resource management.
- Solving Hierarchical Auctions with HTN Planning. In ICAPS workshop on Hierarchical Planning.
- Reviving Partial Order Planning. In IJCAI, 459–464.
- HDDL 2.1: Towards Defining an HTN Formalism with Time. In 6th ICAPS Workshop on Hierarchical Planning (HPlan 2023).
- VHPOP: Versatile Heuristic Partial Order Planner. J. of Artif. Intell. Res., 20: 405–430.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.