Sciweavers

50 search results - page 6 / 10
» Heuristics and Symmetries in Classical Planning
Sort
View
AIPS
2000
13 years 11 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
ECAI
2008
Springer
14 years 4 days ago
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessan...
IJCAI
2003
13 years 11 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
PUK
2003
13 years 11 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
JAIR
2010
167views more  JAIR 2010»
13 years 8 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal