| Title: |
A Sound (But Incomplete) Polynomial Translation from Discretised PDDL+ to Numeric Planning |
| Authors: |
Percassi F.; Scala E.; Vallati M. |
| Contributors: |
Percassi F.; Scala E.; Vallati M. |
| Publisher Information: |
Springer Science and Business Media Deutschland GmbH |
| Publication Year: |
2022 |
| Collection: |
Università degli Studi di Brescia: OPENBS - Open Archive UniBS |
| Subject Terms: |
Automated planning for hybrid system; Planning via translation |
| Description: |
pddl+ is an expressive planning formalism that enables the modelling of domains having both discrete and continuous dynamics. Recently, two mappings for translating discretised pddl+ problems into a numeric a-temporal task have been proposed. Such translations produce a task of exponential or polynomial size w.r.t. the size of the native task. In this work, starting from the above-mentioned polynomial translation, we introduce a sound but not generally complete variant that has the potential to improve the performance of numeric planning engines. We define the subclass of problems where the variant is safely applicable, and we assess the advantages of such a translation. |
| Document Type: |
conference object |
| Language: |
English |
| Relation: |
info:eu-repo/semantics/altIdentifier/isbn/978-3-031-08420-1; info:eu-repo/semantics/altIdentifier/isbn/978-3-031-08421-8; info:eu-repo/semantics/altIdentifier/wos/WOS:000876859300002; ispartofbook:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 20th International Conference of the Italian Association for Artificial Intelligence, AIxIA 2021; volume:13196; firstpage:18; lastpage:31; numberofpages:14; serie:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11379/569605 |
| DOI: |
10.1007/978-3-031-08421-8_2 |
| Availability: |
https://hdl.handle.net/11379/569605; https://doi.org/10.1007/978-3-031-08421-8_2 |
| Accession Number: |
edsbas.B6A2A385 |
| Database: |
BASE |