Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

HDDL 2.1: Towards Defining a Formalism and a Semantics for Temporal HTN Planning (2306.07353v1)

Published 12 Jun 2023 in cs.AI

Abstract: Real world applications as in industry and robotics need modelling rich and diverse automated planning problems. Their resolution usually requires coordinated and concurrent action execution. In several cases, these problems are naturally decomposed in a hierarchical way and expressed by a Hierarchical Task Network (HTN) formalism. HDDL, a hierarchical extension of the Planning Domain Definition Language (PDDL), unlike PDDL 2.1 does not allow to represent planning problems with numerical and temporal constraints, which are essential for real world applications. We propose to fill the gap between HDDL and these operational needs and to extend HDDL by taking inspiration from PDDL 2.1 in order to express numerical and temporal expressions. This paper opens discussions on the semantics and the syntax needed for a future HDDL 2.1 extension.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Formal Semantics and Formally Verified Validation for Temporal Planning. In AAAI, 9635–9643.
  2. Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way. In IJCAI, 1629–1634.
  3. Hierarchical Planning: Relating Task and Goal Decomposition with Task Sharing. In IJCAI, 3022–3029.
  4. A really abstract concurrent model and its temporal logic. In ACM SIGACT-SIGPLAN symposium on Principles of programming languages, 173–183.
  5. Behnke, G. 2021. Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN Planning. In ICAPS, 25–35.
  6. Hierarchical planning in the IPC. In ICAPS Workshop on the International Planning Competition.
  7. totSAT-Totally-ordered hierarchical planning through SAT. In AAAI, volume 32.
  8. Bringing order to chaos–A compact representation of partial order in SAT-based HTN planning. In AAAI, volume 33, 7520–7529.
  9. On Succinct Groundings of HTN Planning Problems. In AAAI, 9775–9784.
  10. Making Translations to Classical Planning Competitive with Other HTN Planners. In AAAI, 9687–9697.
  11. A Survey on Hierarchical Planning - One Abstract Idea, Many Concrete Realizations. In IJCAI, 6267–6275.
  12. An Admissible HTN Planning Heuristic. In IJCAI, 480–488.
  13. Delete-Free Reachability Analysis for Temporal and Hierarchical Planning. In ECAI, volume 285, 1698–1699.
  14. Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity. Theoretical Computer Science, 560: 269–291.
  15. Point algebras for temporal reasoning: Algorithms and complexity. Artif. Intell., 149(2): 179–220.
  16. When is temporal planning really temporal? In IJCAI, 1852–1859.
  17. Planning and Acting with Temporal and Hierarchical Decomposition Models. In ICTAI, 115–121.
  18. HTN Planning: Complexity and Expressivity. In AAAI, 1123–1128.
  19. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Int. J. of Artif. Intell. Res., 20: 61–124.
  20. Cloud Ready Applications Composed via HTN Planning. In IEEE Conference on Service-Oriented Computing and Applications, 81–89.
  21. Plan constraints and preferences in PDDL3 - the language of the fifth International Planning Competition. Technical Report 2005-08-07, Department of Electronics for Automation (Imperial College).
  22. Automated Planning and Acting. Cambridge University Press. Chap. 4.
  23. Helmert, M. 2009. Concise finite-domain representations for PDDL planning tasks. Artif. Intell., 173(5-6): 503–535.
  24. HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems. In AAAI, 9883–9891.
  25. Landmark Generation in HTN Planning. In AAAI, 11826–11834.
  26. On Guiding Search in HTN Planning with Classical Planning Heuristics. In IJCAI, 6171–6175.
  27. PDDL - The Planning Domain Definition Language. Technical report, CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control.
  28. SHPE: HTN Planning for Video Games. In Workshop on Computer Games, 119–132.
  29. Solving Hierarchical Auctions with HTN Planning. In ICAPS Workshop on Hierarchical Planning.
  30. PDDL4J: a planning domain description library for Java. J. Exp. Theor. Artif. Intell., 30(1): 143–176.
  31. Grounding of HTN Planning Domain. Int. J. of Artif. Intell. Tools, 26(5).
  32. Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell., 170(12-13): 1031–1080.
  33. Schreiber, D. 2021. Lilotane: A Lifted SAT-based Approach to Hierarchical Planning. J. of Artif. Intell. Res., 70: 1117–1181.
  34. Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. In ICAPS, 382–390.
  35. Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning. In AAAI, 3658–3664.
  36. The ANML Language. In ICAPS Workshop on Knowledge Engineering for Planning and Scheduling.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Damien Pellier (28 papers)
  2. Alexandre Albore (2 papers)
  3. Humbert Fiorino (21 papers)
  4. Rafael Bailon-Ruiz (1 paper)
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now