Skip navigation
Skip navigation

A new approach to tractable planning

Haslum, Patrik


We describe a restricted class of planning problems and polynomial time membership and plan existence decision algorithms for this class. The definition of the problem class is based on a graph representation of planning problems, similar to Petri nets, and the use of a graph grammar to characterise a subset of such graphs. Thus, testing membership in the class is a graph parsing problem. The planning algorithm also exploits this connection, making use of the parse tree. We show that the new...[Show more]

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
Source: Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008)


File Description SizeFormat Image
01_Haslum_A_new_approach_to_tractable_2008.pdf281.76 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator