Abstract
Conditional effects are a key feature in classical planning, enabling the description of actions whose outcomes are statedependent. It is well known that removing conditional effects in a polynomial way necessarily increases the size of a valid plan by a polynomial factor. However, preserving the exact plan size requires encoding the problem exponentially. The paper proposes and empirically evaluates optimisations for existing polynomial compilations. These optimisations aim to make the resulting compilations more suitable for planners while limiting the increase in plan size, which is inevitable if we want to keep the compilation polynomial. Specifically, the paper introduces a polynomial compilation technique that expands conditional effects when their number is below a certain threshold and sequentialises them otherwise. Additionally, the paper demonstrates that even straightforward optimisations can have a notable impact.
Original language | English |
---|---|
Title of host publication | Proceedings of the 17th Annual Symposium on Combinatorial Search (SoCS 2024) |
Editors | Ariel Felner, Jiaoyang Li |
Publisher | AAAI press |
Pages | 100-108 |
Number of pages | 9 |
Volume | 17 |
Edition | 1 |
ISBN (Print) | 9781577358916 |
DOIs | |
Publication status | Published - 1 Jun 2024 |
Event | 17th International Symposium on Combinatorial Search - Pomeroy Kananaskis Mountain Lodge , Kananaskis, Canada Duration: 6 Jun 2024 → 8 Jun 2024 Conference number: 17 https://socs24.search-conference.org/ |
Publication series
Name | The International Symposium on Combinatorial Search |
---|---|
Publisher | Association for the Advancement of Artificial Intelligence |
ISSN (Print) | 2832-9171 |
Conference
Conference | 17th International Symposium on Combinatorial Search |
---|---|
Abbreviated title | SoCS 2024 |
Country/Territory | Canada |
City | Kananaskis |
Period | 6/06/24 → 8/06/24 |
Internet address |