Minimum-risk Time-Expanded planning for AUVs using Ocean Current Predictions

Slow moving Autonomous Underwater Vehicles (AUVs) such as gliders typically run missions that take several days to weeks. When such vehicles are operating in coastal regions it is important to plan paths that avoid areas with high ship trafc. In previous work we proposed a minimumrisk method which can plan safe paths for gliders if the ocean currents are much slower than the speed of the glider. Unfortunately, ocean currents are usually strong enough to inuence the times of ight of gliders, such that they may experience very different routes and times of travel than those planned statically a priori. This results in vehicles surfacing in regions which may be high risk. In this paper, we propose a novel method of risk-averse planning which uses a predictive ocean model to plan a path that minimizes risk in the presence of ocean currents subject to constraints on the maximum time between consecutive surfacing locations and the total length of the path. We solve this problem by constructing a timeexpanded network and nding the minimum cost path from the source node to the goal node. Our algorithm nds a resource constrained path which exploits the ocean current eld while surfacing in low-risk areas. We discuss the results obtained in eld experiments in the Southern California Bight to evaluate our algorithm.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[3]  E. L. Nelson,et al.  AUV path planning: an A* approach to path planning with consideration of variable vehicle speeds and multiple, overlapping, time-dependent exclusion zones , 1992, Proceedings of the 1992 Symposium on Autonomous Underwater Vehicle Technology.

[4]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[5]  Ismaïl Chabini,et al.  Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks , 2002, IEEE Trans. Intell. Transp. Syst..

[6]  Hissam Tawfik,et al.  Path planning in construction sites: performance evaluation of the Dijkstra, A*, and GA search algorithms , 2002, Adv. Eng. Informatics.

[7]  Alexander F. Shchepetkin,et al.  The regional oceanic modeling system (ROMS): a split-explicit, free-surface, topography-following-coordinate oceanic model , 2005 .

[8]  Geoffrey J. Gordon,et al.  Finding Approximate POMDP solutions Through Belief Compression , 2011, J. Artif. Intell. Res..

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

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

[11]  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.

[12]  Oscar Schofield,et al.  Slocum Gliders: Robust and ready , 2007, J. Field Robotics.

[13]  Yan Pailhas,et al.  Path Planning for Autonomous Underwater Vehicles , 2007, IEEE Transactions on Robotics.

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

[15]  Gaurav S. Sukhatme,et al.  Planning and Implementing Trajectories for Autonomous Underwater Vehicles to Track Evolving Ocean Processes Based on Predictions from a Regional Ocean Model , 2010, Int. J. Robotics Res..

[16]  Gaurav S. Sukhatme,et al.  Simultaneous Tracking and Sampling of Dynamic Oceanographic Features with Autonomous Underwater Vehicles and Lagrangian Drifters , 2010, ISER.

[17]  Hans C. Woithe,et al.  Improving Slocum Glider dead reckoning using a Doppler Velocity Log , 2011, OCEANS'11 MTS/IEEE KONA.

[18]  Gaurav S. Sukhatme,et al.  Toward risk aware mission planning for Autonomous Underwater Vehicles , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Marin Kobilarov,et al.  Cross-Entropy Randomized Motion Planning , 2011, Robotics: Science and Systems.

[20]  Mike Eichhorn,et al.  Opportunities to parallelize path planning algorithms for autonomous underwater vehicles , 2011, OCEANS'11 MTS/IEEE KONA.

[21]  Giorgio Guglieri,et al.  A Minimum Risk Approach for Path Planning of UAVs , 2011, J. Intell. Robotic Syst..

[22]  Er. Waghoo Parvez,et al.  Path planning in construction sites : performance evaluation of the Dijkstra , A * , and GA search algorithms , 2013 .