Sciweavers

206 search results - page 4 / 42
» Learning Heuristic Functions from Relaxed Plans
Sort
View
JAIR
2006
90views more  JAIR 2006»
14 years 9 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
AI
2010
Springer
14 years 10 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
IJCAI
2007
14 years 11 months ago
Using Learned Policies in Heuristic-Search Planning
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...
Sung Wook Yoon, Alan Fern, Robert Givan
ICRA
2005
IEEE
106views Robotics» more  ICRA 2005»
15 years 3 months ago
A Fast Online Gait Planning with Boundary Condition Relaxation for Humanoid Robots
— A fast online gait planning method is proposed. Based on an approximate dynamical biped model whose mass is concentrated to COG, general solution of the equation of motion is a...
Tomomichi Sugihara, Yoshihiko Nakamura
ICRA
1994
IEEE
105views Robotics» more  ICRA 1994»
15 years 1 months ago
Harmonic Functions and Collision Probabilities
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
Christopher I. Connolly