Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · 2001 · 107 citations · 7 references
Open access
ComputingAutonomous SystemsMotion PlanningPath PlanningPlanning TheoryGoal PlanningHeuristic SearchConstraintsGoal-directed PlanningGraph Search PlanningHeuristic Search PlanningTask Planning
. Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and use them for guiding search, in the hope to speed up the planning process. We go beyond the previous approaches by defining ordering constraints not only over the (top level) goals, but also over the sub-goals that will arise during planning. Landmarks are facts that must be true at some point in every valid solution plan. We show how such landmarks can be found, how their inherent ordering constraints can be approximated, and how this information can be used to decompose a given planning task into several smaller sub-tasks. Our methodology is completely domain- and plannerindependent. The implementation demonstrates that the approach can yield significant performance improvements in both heuristic forward search and GRAPHPLAN-style planning. 1
7
Fast planning through planning graph analysis
Avrim Blum, Merrick L. Furst · Artificial Intelligence · 1997 · 1.6K citations
The computational complexity of propositional STRIPS planning
Tom Bylander · Artificial Intelligence · 1994 · 863 citations