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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Planning with Reduced Operator Sets
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
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, p. 150-158Conference paper, Published 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.

Place, publisher, year, edition, pages
AAAI Press , 2000. p. 150-158
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-59901ISBN: 978-1-57735-111-5 (print)OAI: oai:DiVA.org:liu-59901DiVA, id: diva2:354004
Conference
5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS), Breckenridge, Colorado, USA, 14-17 April 2000
Available from: 2010-09-29 Created: 2010-09-29 Last updated: 2018-01-12

Open Access in DiVA

No full text in DiVA

Authority records

Haslum, PatrikJonsson, Peter

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 149 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf