Sciweavers

59 search results - page 1 / 12
» Heuristic Motion Planning with Many Degrees of Freedom
Sort
View
CCCG
1996
13 years 6 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
13 years 10 months ago
Single-Query Entropy-Guided Path Planning
Motion planning for robots with many degrees of freedom requires the exploration of an exponentially large configuration space. Single-query motion planners restrict exploration ...
Brendan Burns, Oliver Brock
ISER
2000
Springer
117views Robotics» more  ISER 2000»
13 years 8 months ago
Motion Planning for a Self-Reconfigurable Modular Robot
: This paper addresses motion planning of a homogeneous modular robotic system. The modules have self-reconfiguration capability so that a group of the modules can construct a robo...
Eiichi Yoshida, Satoshi Murata, Akiya Kamimura, Ko...
IROS
2008
IEEE
93views Robotics» more  IROS 2008»
13 years 11 months ago
Adaptive motion planning for humanoid robots
— Motion planning for robots with many degrees of freedom (DoF) is a generally unsolved problem in the robotics context. In this work an approach for trajectory planning is prese...
Niko Vahrenkamp, Christian Scheurer, Tamim Asfour,...
IJRR
2007
171views more  IJRR 2007»
13 years 4 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars