Plan-refinement strategies and search-space size
Authors:
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 414-426
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and PruningJournal of Artificial Intelligence Research, 1996
- Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planningArtificial Intelligence, 1995
- Partial-order planningArtificial Intelligence, 1994
- On the complexity of blocks-world planningArtificial Intelligence, 1992
- O-Plan: The open planning architectureArtificial Intelligence, 1991
- An Analysis of Backtracking with Search RearrangementSIAM Journal on Computing, 1983
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- Planning with constraints (MOLGEN: Part 1)Artificial Intelligence, 1981
- A minimax algorithm better than alpha-beta?Artificial Intelligence, 1979
- Backtrack programming techniquesCommunications of the ACM, 1975