liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Planning with Reduced Operator Sets
2000 (English)In: Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS) / [ed] Steve Chien, Subbarao Kambhampati, Craig A. Knoblock, AAAI Press, 2000, 150-158Conference paper (Refereed)
Abstract [en]

Classical propositional STRIPS planning is nothing but the search for a path in the state transition graph induced by the operators in the planning problem. What makes the problem hard is the size and the sometimes adverse structure of this graph. We conjecture that the search for a plan would be more efficient if there were only a small number of paths from the initial state to the goal state. To verify this conjecture, we define the notion of reduced operator sets and describe ways of finding such reduced sets. We demonstrate that some state-of-the-art planners run faster using reduced operator sets.

National Category
Computer Science
urn:nbn:se:liu:diva-59901 (URN)978-1-57735-111-5 (ISBN) (OAI)diva2:354004 (DiVA)
Available from2010-09-29 Created:2010-09-29 Last updated:2011-03-21

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Haslum, PatrikJonsson, Peter
By organisation
KPLAB - Knowledge Processing LabThe Institute of TechnologyTCSLAB - Theoretical Computer Science Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 12 hits
ReferencesLink to record
Permanent link

Direct link