DocumentCode :
2385538
Title :
Global vector field computation for feedback motion planning
Author :
Zhang, Liangjun ; LaValle, Steven M. ; Manocha, Dinesh
Author_Institution :
Dept. of Comput. Sci., Univ. of North Carolina, Chapel Hill, NC, USA
fYear :
2009
fDate :
12-17 May 2009
Firstpage :
477
Lastpage :
482
Abstract :
We present a global vector field computation algorithm in configuration spaces for smooth feedback motion planning. Our algorithm performs approximate cell decomposition in the configuration space and approximates the free space using rectanguloid cells. We compute a smooth local vector field for each cell in the free space and address the issue of the smooth composition of the local vector fields between the non-uniform adjacent cells. We show that the integral curve over the computed vector field is guaranteed to converge to the goal configuration, be collision-free, and maintain Cinfin smoothness. As compared to prior approaches, our algorithm works well on non-convex robots and obstacles.We demonstrate its performance on planar robots with 2 or 3 DOFs, articulated robots composed of 3 serial links and multi-robot systems with 6 DOFs.
Keywords :
collision avoidance; feedback; mobile robots; cell decomposition approximation; collision avoidance; configuration space; feedback motion planning; global vector field computation algorithm; nonconvex robot; rectanguloid cell; Computer science; Contracts; Feedback; Motion analysis; Motion planning; Multirobot systems; Orbital robotics; Path planning; Robots; Shape;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Robotics and Automation, 2009. ICRA '09. IEEE International Conference on
Conference_Location :
Kobe
ISSN :
1050-4729
Print_ISBN :
978-1-4244-2788-8
Electronic_ISBN :
1050-4729
Type :
conf
DOI :
10.1109/ROBOT.2009.5152665
Filename :
5152665
Link To Document :
بازگشت