edoc

Safe, strong and tractable relevance analysis for planning

Haslum, Patrik and Helmert, Malte and Jonsson, Anders. (2013) Safe, strong and tractable relevance analysis for planning. In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013) : [held 10 - 14 June 2013 in Rome, Italy]. Palo Alto, Calif., pp. 317-321.

[img]
Preview
PDF - Published Version
283Kb

Official URL: http://edoc.unibas.ch/dok/A6212199

Downloads: Statistics Overview

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.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Helmert, Malte
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Bibsysno:Link to catalogue
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Language:English
Related URLs:
Last Modified:19 Nov 2018 14:56
Deposited On:05 Jun 2015 08:53

Repository Staff Only: item control page