Extending Hierarchical Partial-Order Causal-Link Planning to Temporal Problem Solving
This paper introduces TEP (Temporal Event Planning), a novel POCL (Partial Ordered Causal Link) HTN approach tailored for temporal Hierarchical Task Networks (HTNs). TEP stands out for its capability to address all three categories of temporal problems, as categorized by Cushing, distinguishing it from prevailing approaches that primarily tackle the initial two categories. TEP accomplishes this by translating temporal HTN problems into non-temporal counterparts and excels in performance by leveraging heuristics developed in non-temporal HTN planning to steer the search for temporal solutions. This innovative strategy initiates by refining tasks into instantaneous actions and relaxing duration constraints, ensuring alignment with conventional search heuristics while upholding the problem's innate expressiveness.
Authors
- Humbert Fiorino (ORCID: https://orcid.org/0000-0002-6612-5549)
- Damien Pellier (ORCID: https://orcid.org/0000-0003-3791-8985)
- Nicolas Cavrel
Institutions
- Laboratoire d'Informatique de Grenoble (FR)
- Université Grenoble Alpes (FR)
Publication Details
- Published
- 2024-10-28
- DOI
- https://doi.org/10.1109/ictai62512.2024.00019
- Primary Topic
- AI-based Problem Solving and Planning
- Type
- article
- Field-Weighted Citation Impact
- 0.00