46 search results - page 5 / 10 » Kinodynamic Motion Planning Amidst Moving Obstacles |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires r...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...