Abstract
PDDL+ is an expressive planning formalism that enables the modelling of hybrid discrete-continuous domains. The resulting models are notoriously difficult to cope with, and few planning engines are natively supporting PDDL+. To foster the use of PDDL+, this paper revisits a set of recently proposed translations allowing to reformulate a PDDL+ task into a PDDL2.1 one. Such translations permit the use of a wider set of engines to solve complex hybrid problems.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 15th International Symposium on Combinatorial Search, SoCS 2022 |
| Publisher | AAAI press |
| Pages | 314-316 |
| Number of pages | 3 |
| Volume | 15 |
| Edition | 1 |
| ISBN (Print) | 1577358732 |
| Publication status | Published - 17 Jul 2022 |
| Event | 15th International Symposium on Combinatorial Search - TU Wien, Vienna, Austria Duration: 21 Jul 2022 → 23 Jul 2022 Conference number: 15 https://socs2022.unibs.it/ |
Conference
| Conference | 15th International Symposium on Combinatorial Search |
|---|---|
| Abbreviated title | SoCS 2022 |
| Country/Territory | Austria |
| City | Vienna |
| Period | 21/07/22 → 23/07/22 |
| Internet address |
Fingerprint
Dive into the research topics of 'On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract)'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver