Sciweavers

128 search results - page 1 / 26
» A Complete Bidirectional Planner
Sort
View
AIPS
1998
14 years 15 days ago
A Complete Bidirectional Planner
The PRODIGY system is based on bidirectional planning, which is a combination of goal-directed backward chaining with simulation of plan execution. Experiments have demonstrated t...
Eugene Fink, Jim Blythe
IJCAI
2007
14 years 18 days ago
Transferring Learned Control-Knowledge between Planners
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
Susana Fernández, Ricardo Aler, Daniel Borr...
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
14 years 3 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
KR
1992
Springer
14 years 3 months ago
UCPOP: A Sound, Complete, Partial Order Planner for ADL
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have co...
J. Scott Penberthy, Daniel S. Weld
DM
2008
63views more  DM 2008»
13 years 11 months ago
Nomadic decompositions of bidirected complete graphs
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
Daniel W. Cranston