An Effective Polynomial Technique for Compiling Conditional Effects Away
DOI:
https://doi.org/10.1609/aaai.v38i18.29989Keywords:
PRS: Deterministic PlanningAbstract
The paper introduces a novel polynomial compilation technique for the sound and complete removal of conditional effects in classical planning problems. Similar to Nebel's polynomial compilation of conditional effects, our solution also decomposes each action with conditional effects into several simpler actions. However, it does so more effectively by exploiting the actual structure of the given conditional effects. We characterise such a structure using a directed graph and leverage it to significantly reduce the number of additional atoms required, thereby shortening the size of valid plans. Our experimental analysis indicates that this approach enables the effective use of polynomial compilations, offering benefits in terms of modularity and reusability of existing planners. It also demonstrates that a compilation-based approach can be more efficient, either independently or in synergy with state-of-the-art optimal planners that directly support conditional effects.Downloads
Published
2024-03-24
How to Cite
Gerevini, A. E., Percassi, F., & Scala, E. (2024). An Effective Polynomial Technique for Compiling Conditional Effects Away. Proceedings of the AAAI Conference on Artificial Intelligence, 38(18), 20104-20112. https://doi.org/10.1609/aaai.v38i18.29989
Issue
Section
AAAI Technical Track on Planning, Routing, and Scheduling