1219 search results - page 60 / 244 » Combining planning and motion planning |
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
COMPGEOM
2004
ACM
15 years 3 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
2005
IEEE
15 years 3 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 ...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— Target tracking among obstacles is an interesting class of motion planning problems that combine the usual motion constraints with robot sensors’ visibility constraints. In t...
108
click to vote
MTA
2011
14 years 19 days ago
2011
This paper presents a novel approach for individual agent’s motion simulation in real-time virtual environments. In our model, we focus on addressing two problems: 1) the control...