ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Complexity, decidability and undecidability results for domain-independent planning
Complexity, decidability and undecidability results for domain-independent planning
Planning with first-order temporally extended goals using heuristic search
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
On the compilability and expressive power of propositional planning formalisms
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Complexity results for planning
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Compiling uncertainty away in conformant planning problems with bounded width
Journal of Artificial Intelligence Research
Partial weighted MaxSAT for optimal planning
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
| Hi-index | 0.00 |
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 PceC 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.