Safe, strong and tractable relevance analysis for planning

Patrik Haslum, Malte Helmert, Anders Jonsson

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

    7 Citations (Scopus)

    Abstract

    In large and complex planning problems, there will almost inevitably be aspects that are not relevant to a specific problem instance. Thus, identifying and removing irrelevant parts from an instance is one of the most important techniques for scaling up automated planning. We examine the path-based relevance analysis method, which is safe (preserves plan existence and cost) and powerful but has exponential time complexity, and show how to make it run in polynomial time with only a minimal loss of pruning power.

    Original languageEnglish
    Title of host publicationICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling
    Pages317-321
    Number of pages5
    Publication statusPublished - 2013
    Event23rd International Conference on Automated Planning and Scheduling, ICAPS 2013 - Rome, Italy
    Duration: 10 Jun 201314 Jun 2013

    Publication series

    NameICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling

    Conference

    Conference23rd International Conference on Automated Planning and Scheduling, ICAPS 2013
    Country/TerritoryItaly
    CityRome
    Period10/06/1314/06/13

    Fingerprint

    Dive into the research topics of 'Safe, strong and tractable relevance analysis for planning'. Together they form a unique fingerprint.

    Cite this