Optimal planning with axioms

Franc Ivankovic, Patrik Haslum

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    15 Citations (Scopus)

    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 negationas-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.

    Original languageEnglish
    Title of host publicationIJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence
    EditorsMichael Wooldridge, Qiang Yang
    PublisherInternational Joint Conferences on Artificial Intelligence
    Pages1580-1586
    Number of pages7
    ISBN (Electronic)9781577357384
    Publication statusPublished - 2015
    Event24th International Joint Conference on Artificial Intelligence, IJCAI 2015 - Buenos Aires, Argentina
    Duration: 25 Jul 201531 Jul 2015

    Publication series

    NameIJCAI International Joint Conference on Artificial Intelligence
    Volume2015-January
    ISSN (Print)1045-0823

    Conference

    Conference24th International Joint Conference on Artificial Intelligence, IJCAI 2015
    Country/TerritoryArgentina
    CityBuenos Aires
    Period25/07/1531/07/15

    Fingerprint

    Dive into the research topics of 'Optimal planning with axioms'. Together they form a unique fingerprint.

    Cite this