727 search results - page 53 / 146 » Planning motions with intentions |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
ICRA
2002
IEEE
14 years 21 days ago
2002
IEEE
— Despite the many significant advances made in robotics research, few works have focused on the tight integration of task planning and motion control. Most integration works in...
ICRA
2000
IEEE
13 years 11 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— Single-query sampling-based motion planners are an efficient class of algorithms widely used today to solve challenging motion planning problems. This paper exposes the common...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
Motion planning for robots with many degrees of freedom requires the exploration of an exponentially large configuration space. Single-query motion planners restrict exploration ...