Optimal Planning with Axioms
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 1580-1585.
Abstract
The use of expressive logical axioms to specify derived predicates often allows planning domains to be formulated more compactly and naturally. We consider axioms in the form of a logic program with recursively defined predicates and negation-as-failure, as in PDDL 2.2. We show that problem formulations with axioms are not only more elegant, but can also be easier to solve, because specifying indirect action effects via axioms removes unnecessary choices from the search space of the planner. Despite their potential, however, axioms are not widely supported, particularly by cost-optimal planners. We draw on the connection between planning axioms and answer set programming to derive a consistency-based relaxation, from which we obtain axiom-aware versions of several admissible planning heuristics, such as hmax and pattern database heuristics.
@inproceedings{ijcai2015p226,
title = {Optimal Planning with Axioms},
author = {Ivankovic, Franc and Haslum, Patrik},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {1580--1585},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/226},
}
TY - CPAPER TI - Optimal Planning with Axioms AU - Ivankovic, Franc AU - Haslum, Patrik T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 1580 EP - 1585 UR - https://ijcai.org/proceedings/2015/226 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
