EUVIMEDEUVIMED entdecken
Crossref

Compiling Temporal Numeric Planning into Discrete PDDL+

Andrea Micheli, Enrico Scala, Alessandro Valentini

Proceedings of the International Conference on Automated Planning and Scheduling · 08.06.2026 · 36 (1) · 399-403

DOI: 10.1609/icaps.v36i1.42853 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the International Conference on Automated Planning and Scheduling, online erschienen am 08.06.2026. Verfasst von Andrea Micheli und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Since the introduction of the PDDL+ modeling language, it was known that temporal planning with durative actions (as in PDDL 2.1) could be compiled into PDDL+. However, no practical compilation was presented in the literature ever since. We present a practical compilation from temporal planning with durative actions into PDDL+, fully capturing the semantics and only assuming the non-self-overlapping of actions. Our compilation is polynomial, retains the plan length up to a constant factor and is experimentally shown to be of practical relevance for hard temporal numeric problems.

Zitieren

APA

Micheli, A., Scala, E., & Valentini, A. (2026). Compiling Temporal Numeric Planning into Discrete PDDL+. Proceedings of the International Conference on Automated Planning and Scheduling, 36(1), 399-403. https://doi.org/10.1609/icaps.v36i1.42853

Vancouver

Micheli A, Scala E, Valentini A. Compiling Temporal Numeric Planning into Discrete PDDL+. Proceedings of the International Conference on Automated Planning and Scheduling. 2026;36(1):399-403. doi:10.1609/icaps.v36i1.42853

BibTeX
@article{Micheli2026,
  author = {Micheli, Andrea and Scala, Enrico and Valentini, Alessandro},
  title = {Compiling Temporal Numeric Planning into Discrete PDDL+},
  journal = {Proceedings of the International Conference on Automated Planning and Scheduling},
  year = {2026},
  volume = {36},
  number = {1},
  pages = {399--403},
  doi = {10.1609/icaps.v36i1.42853}
}
Kostenlos starten →