Global vector field computation for feedback motion planning

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 C∞ 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.

[1]  Dinesh Manocha,et al.  Star-shaped Roadmaps - A Deterministic Sampling Approach for Complete Motion Planning , 2005, Robotics: Science and Systems.

[2]  D. Manocha,et al.  Fast Polygon Triangulation Based on Seidel's Algorithm , 1995 .

[3]  Calin Belta,et al.  A Framework for Automatic Deployment of Robots in 2D and 3D Environments , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Steven M. LaValle,et al.  Smooth Feedback for Car-Like Vehicles in Polygonal Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[5]  Dinesh Manocha,et al.  Directing Crowd Simulations Using Navigation Fields , 2011, IEEE Transactions on Visualization and Computer Graphics.

[6]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[7]  Steven M. LaValle,et al.  Algorithms for Computing Numerical Optimal Feedback Motion Strategies , 2001, Int. J. Robotics Res..

[8]  Dinesh Manocha,et al.  Generalized penetration depth computation , 2006, SPM '06.

[9]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[10]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[11]  G. Swaminathan.  Robot Motion Planning , 2006 .

[12]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Konstantin Mischaikow,et al.  Vector field design on surfaces , 2006, TOGS.

[14]  Calin Belta,et al.  Discrete abstractions for robot motion planning and control in polygonal environments , 2005, IEEE Transactions on Robotics.

[15]  Steven M. LaValle,et al.  The sampling-based neighborhood graph: an approach to computing and executing feedback motion strategies , 2004, IEEE Transactions on Robotics and Automation.

[16]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[17]  Steven M. LaValle,et al.  Simple and Efficient Algorithms for Computing Smooth, Collision-free Feedback Laws Over Given Cell Decompositions , 2009, Int. J. Robotics Res..

[18]  Howie Choset,et al.  Composition of local potential functions for global robot control and navigation , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[19]  Dinesh Manocha,et al.  Efficient Cell Labelling and Path Non-existence Computation using C-obstacle Query , 2008, Int. J. Robotics Res..