Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects
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 P C ce 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.
Cite
Text
Haslum. "Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects." International Joint Conference on Artificial Intelligence, 2013.Markdown
[Haslum. "Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/haslum2013ijcai-optimal/)BibTeX
@inproceedings{haslum2013ijcai-optimal,
title = {{Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects}},
author = {Haslum, Patrik},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {2291-2297},
url = {https://mlanthology.org/ijcai/2013/haslum2013ijcai-optimal/}
}