Sciweavers

49 search results - page 8 / 10
» Forward-Chaining Partial-Order Planning
Sort
View
ECP
1997
Springer
102views Robotics» more  ECP 1997»
13 years 9 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
IJCAI
1989
13 years 6 months ago
Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
Joachim Hertzberg, Alexander Horz
IGPL
2008
103views more  IGPL 2008»
13 years 5 months ago
Transition Logic Revisited
A new version of transition logic is presented. It integrates (dynamic) transitions, which change world states, and classical (static) reasoning, restricted in the paper to Horn l...
Wolfgang Bibel
AAAI
1996
13 years 6 months ago
Is "Early Commitment" in Plan Generation Ever a Good Idea?
Partial-Order Causal Link planners typically take a "least-commitment" approach to some decisions (notably, step ordering), postponing those decisions until constraints ...
David Joslin, Martha E. Pollack
AAAI
2004
13 years 7 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner