A topologically guided path planner for an AUV using homotopy classes

The paper proposes a method that uses topological information to guide the path search in any 2D workspace. As a first contribution, we have extended the method proposed by Jenkins to generate the topological information by taking into consideration the constraints of the workspace during the construction of the topological environment, which is then used to compute topological paths. As a second contribution, a planner based on the Rapidly-exploring Random Tree (RRT), called Homotopic RRT (HRRT) is proposed to use the topological information to guide the path search in the workspace. Finally, simulated and real results with an Autonomous Underwater Vehicle (AUV) are presented showing the feasibility of the proposal. Comparison with well-known path planning algorithms has also been included.

[1]  Anthony Stentz,et al.  Anytime, Dynamic Planning in High-dimensional Search Spaces , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[2]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[3]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[4]  Chun-Jen Chen,et al.  A linear-time component-labeling algorithm using contour tracing technique , 2004, Comput. Vis. Image Underst..

[5]  Kevin Dean Jenkins.  The shortest path problem in the plane with obstacles: a graph modeling approach to producing finite search lists of homotopy classes , 1991 .

[6]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[7]  Sebastian Thrun,et al.  Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.

[8]  Anthony Stentz,et al.  A Guide to Heuristic-based Path Planning , 2005 .

[9]  Pere Ridao,et al.  Occupancy Grid Mapping in an Underwater Structured Environment , 2009 .

[10]  Jack Snoeyink,et al.  Testing Homotopy for Paths in the Plane , 2002, SCG '02.

[11]  Alessandro Saffiotti,et al.  Extracting topology-based maps from gridmaps , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[12]  Anthony Stentz,et al.  Anytime RRTs , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

[14]  Nidhi Kalra,et al.  Replanning with RRTs , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

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

[16]  James P. Ostrowski,et al.  Motion planning a aerial robot using rapidly-exploring random trees with dynamic constraints , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).