Any-angle path planning with limit-cycle circle set for marine surface vehicle

Most path planning algorithms for a marine surface vehicle in the ocean environment have been developed only for a 2-D (x,y) plane without considering the vehicle heading angle. As a result, the vehicle has a difficulty in following the path correctly. In this paper, we propose a limit-cycle circle set that applies to the Theta* algorithm. The minimum turning radius of a marine surface vehicle is calculated using a limit-cycle circle set, and circles of this radius is used to generate a configuration space of an occupancy grid map. After applying Theta* to this configuration space, the limit-cycle circle set is also applied to the start and end nodes to find the appropriate path with specified heading angles. The benefit of this algorithm is its fast computation time compared to other 3-D (x,y,θ) path planning algorithms, along with the fact that it can be applied to the 3-D kinematic state of the vehicle. We simulate the proposed algorithm and compare it with 3-D A* and 3-D A* with post smoothing algorithms.

[1]  Daniel Hernández-Sosa,et al.  Path planning for underwater gliders using iterative optimization , 2011, 2011 IEEE International Conference on Robotics and Automation.

[2]  Sunglok Choi,et al.  Any-angle path planning on non-uniform costmaps , 2011, 2011 IEEE International Conference on Robotics and Automation.

[3]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[4]  Gabriel Oliver,et al.  Path Planning of Autonomous Underwater Vehicles in Current Fields with Complex Spatial Variability: an A* Approach , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[5]  Keun-Ho Rew,et al.  Limit-cycle Navigation Method for Fast Mobile Robots , 2008 .

[6]  Matthew Dunbabin,et al.  Go with the flow : optimal AUV path planning in coastal environments , 2009, ICRA 2009.

[7]  Michaël Soulignac,et al.  Feasible and Optimal Path Planning in Strong Current Fields , 2011, IEEE Transactions on Robotics.

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

[9]  David F. Rogers,et al.  THE SOCIETY OF NAVAL ARCHITECTS AND MARINE ENGINEERS , 1977 .

[10]  Ariel Felner,et al.  Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.

[11]  E.J. Barth,et al.  Real-time Dynamic Path Planning for Dubins' Nonholonomic Robot , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[12]  C. Tam,et al.  Review of Collision Avoidance and Path Planning Methods for Ships in Close Range Encounters , 2009, Journal of Navigation.

[13]  Amit Konar,et al.  Innovations in Robot Mobility and Control , 2005, Studies in Computational Intelligence.

[14]  Hyun Myung,et al.  Multi-resolution path planning for marine surface vehicle considering environmental effects , 2011, OCEANS 2011 IEEE - Spain.

[15]  Jean-Paul Laumond,et al.  Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot , 1987, IJCAI.

[16]  Weiping Li,et al.  Applied Nonlinear Control , 1991 .

[17]  Rustam Stolkin,et al.  Optimal AUV path planning for extended missions in complex, fast-flowing estuarine environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[18]  R. Szlapczynski A new method of ship routing on raster grids, with turn penalties and collision avoidance , 2005 .