Open AccessProceedings Article
Systematic nonlinear planning
David McAllester,David Rosenblitt +1 more
- pp 634-639
Reads0
Chats0
TLDR
A simple, sound, complete, and systematic algorithm for domain independent STRIPS planning by starting with a ground procedure and then applying a general, and independently verifiable, lifting transformation.Abstract:
This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is achieved by starting with a ground procedure and then applying a general, and independently verifiable, lifting transformation. Previous planners have been designed directly as lifted procedures. Our ground procedure is a ground version of Tate's NONLIN procedure. In Tate's procedure one is not required to determine whether a prerequisite of a step in an unfinished plan is guaranteed to hold in all linearizations. This allows Tate's procedure to avoid the use of Chapman's modal truth criterion. Systematicity is the property that the same plan, or partial plan, is never examined more than once. Systematicity is achieved through a simple modification of Tate's procedure.read more
Citations
More filters
Journal ArticleDOI
Planning and Acting in Partially Observable Stochastic Domains
TL;DR: A novel algorithm for solving pomdps off line and how, in some cases, a finite-memory controller can be extracted from the solution to a POMDP is outlined.
Journal ArticleDOI
The FF planning system: fast plan generation through heuristic search
Jörg Hoffmann,Bernhard Nebel +1 more
TL;DR: A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space.
Proceedings Article
Fast planning through planning graph analysis
Avrim Blum,Merrick L. Furst +1 more
TL;DR: A new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure the authors call a Planning Graph is introduced, and a new planner, Graphplan, is described that uses this paradigm.
Journal ArticleDOI
Fast planning through planning graph analysis
Avrim Blum,Merrick L. Furst +1 more
TL;DR: Graphplan as mentioned in this paper is a partial-order planner based on constructing and analyzing a compact structure called a planning graph, which can be used to find the shortest possible partial order plan or state that no valid plan exists.
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
References
More filters
Journal ArticleDOI
A Machine-Oriented Logic Based on the Resolution Principle
TL;DR: The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.
Journal ArticleDOI
Strips: A new approach to the application of theorem proving to problem solving
Richard Fikes,Nils J. Nilsson +1 more
TL;DR: In this paper, the authors describe a problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to transform a given initial world model in which a given goal formula can be proven to be true.
Book
A Structure for Plans and Behavior
TL;DR: Progress to date in the ability of a computer system to understand and reason about actions is described, and the structure of a plan of actions is as important for problem solving and execution monitoring as the nature of the actions themselves.
Journal ArticleDOI
Planning in a hierarchy of abstraction spaces
TL;DR: Examples of the ABSTRIPS system's performance are presented that demonstrate the significant increases in problem-solving power that this approach provides, and some further implications of the hierarchical planning approach are explored.
Journal ArticleDOI
Planning for Conjunctive Goals
TL;DR: Theorems that suggest that efficient general purpose planning with more expressive action representations is impossible are presented, and ways to avoid this problem are suggested.