Extending Hierarchical Partial-Order Causal-Link Planning to Temporal Problem Solving - Laboratoire d'Informatique de Grenoble
Communication Dans Un Congrès Année : 2024

Extending Hierarchical Partial-Order Causal-Link Planning to Temporal Problem Solving

Nicolas Cavrel
  • Fonction : Auteur
  • PersonId : 1142799
Humbert Fiorino
  • Fonction : Auteur
  • PersonId : 933277
Damien Pellier

Résumé

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 the 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.
Fichier principal
Vignette du fichier
pellier24e.pdf (448.02 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04728807 , version 1 (09-10-2024)

Identifiants

  • HAL Id : hal-04728807 , version 1

Citer

Nicolas Cavrel, Humbert Fiorino, Damien Pellier. Extending Hierarchical Partial-Order Causal-Link Planning to Temporal Problem Solving. IEEE International Conference on Tools with Artificial Intelligence, Oct 2024, Herndon, VA, United States. ⟨hal-04728807⟩
17 Consultations
20 Téléchargements

Partager

More