Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 2291-2296.
Abstract
Recently, several methods have been proposed for optimal delete-free planning. We present an incremental compilation approach that enables these methods to be applied to problems with conditional effects, which none of them support natively. With an h+ solver for problems with conditional effects in hand, we also consider adapting the h++ anytime lower bound function to use the more space-efficient PCce compilation. This avoids the memory limitation of the original h++ caused by its reliance on an exponential-space compilation. It also leads to improvements on some problems where memory is not an issue.
@inproceedings{ijcai2013p338,
title = {Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects},
author = {Haslum, Patrik},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {2291--2296},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/338},
}
TY - CPAPER TI - Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects AU - Haslum, Patrik T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 2291 EP - 2296 UR - https://ijcai.org/proceedings/2013/338 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
