Optimal ship navigation with safety distance and realistic turn constraints

We consider the optimal ship navigation problem wherein the goal is to find the shortest path between two given coordinates in the presence of obstacles subject to safety distance and turn-radius constraints. These obstacles can be debris, rock formations, small islands, ice blocks, other ships, or even an entire coastline. We present a graph-theoretic solution on an appropriately-weighted directed graph representation of the navigation area obtained via 8-adjacency integer lattice discretization and utilization of the A∗ algorithm. We explicitly account for the following three conditions as part of the turn-radius constraints: (1) the ship’s left and right turn radii are different, (2) ship’s speed reduces while turning, and (3) the ship needs to navigate a certain minimum number of lattice edges along a straight line before making any turns. The last constraint ensures that the navigation area can be discretized at any desired resolution. Once the optimal (discrete) path is determined, we smoothen it to emulate the actual navigation of the ship. We illustrate our methodology on an ice navigation example involving a 100,000 DWT merchant ship and present a proof-of-concept by simulating the ship’s path in a full-mission ship handling simulator.

[1]  Tomas Berglund,et al.  Path-Planning with Obstacle-Avoiding Minimum Curvature Variation B-splines , 2003 .

[2]  P. Pardalos,et al.  Optimal Risk Path Algorithms , 2002 .

[3]  Gilbert Laporte,et al.  Designing a home-to-work bus service in a metropolitan area , 2011 .

[4]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[5]  Efstathios Bakolas,et al.  Optimal Synthesis of the Asymmetric Sinistral/Dextral Markov–Dubins Problem , 2011, J. Optim. Theory Appl..

[6]  Joshua Ho,et al.  The implications of Arctic sea ice decline on shipping , 2010 .

[7]  Jin-Jang Leou,et al.  New polygonal approximation schemes for object shape representation , 1993, Pattern Recognit..

[8]  David Soler,et al.  The capacitated general windy routing problem with turn penalties , 2011, Oper. Res. Lett..

[9]  Ilya V. Kolmanovsky,et al.  Predictive energy management of a power-split hybrid electric vehicle , 2009, 2009 American Control Conference.

[10]  Ming-Ling Lee,et al.  A Nonlinear Mathematical Model for Ship Turning Circle Simulation in Waves , 2005 .

[11]  S. Uryasev,et al.  Aircraft routing under the risk of detection , 2006 .

[12]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[13]  Jeffrey K. Uhlmann,et al.  An Efficient Algorithm for Computing Least Cost Paths with Turn Constraints , 1998, Inf. Process. Lett..

[14]  G Laporte,et al.  Solving arc routing problems with turn penalties , 2000, J. Oper. Res. Soc..

[15]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[16]  Nils J. Nilsson,et al.  Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" , 1972, SGAR.

[17]  Tal Shima,et al.  Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms , 2011, Comput. Oper. Res..

[18]  Max J. van Hilten,et al.  The Rate of Turn Required for Geographically Fixed Turns: A Formula and Fast-Time Simulations , 2000 .

[19]  Guy Desaulniers,et al.  The shortest path problem with forbidden paths , 2002, Eur. J. Oper. Res..

[20]  Nengjian Wang,et al.  Near optimal path planning for vehicle with heading and curvature constraints , 2010, 2010 8th World Congress on Intelligent Control and Automation.

[21]  RaphaelBertram,et al.  Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" , 1972 .

[22]  R. Takei,et al.  A practical path-planning algorithm for a simple car: a Hamilton-Jacobi approach , 2010, Proceedings of the 2010 American Control Conference.

[23]  Prakash Ramanan,et al.  Euclidean shortest path in the presence of obstacles , 1991, Networks.

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

[25]  Andrés L. Medaglia,et al.  Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks , 2008, Ann. Oper. Res..

[26]  Eulalia Martínez,et al.  A transformation for the mixed general routing problem with turn penalties , 2008, J. Oper. Res. Soc..

[27]  Hiroshi Imai,et al.  A fast algorithm for finding better routes by AI search techniques , 1994, Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference.

[28]  Johannes O. Royset,et al.  Routing Military Aircraft with a Constrained Shortest-Path Algorithm , 2009 .

[29]  Veerle Fack,et al.  Route planning with turn restrictions: A computational experiment , 2012, Oper. Res. Lett..

[30]  George W. Rogers,et al.  Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints , 1995, Neurocomputing.

[31]  Robert Geisberger,et al.  Efficient Routing in Road Networks with Turn Costs , 2011, SEA.

[32]  S. K. Bhattacharyya,et al.  Parametric Identification for Nonlinear Ship Maneuvering , 2006 .

[33]  Robert J. Szczerba,et al.  Robust algorithm for real-time route planning , 2000, IEEE Trans. Aerosp. Electron. Syst..

[34]  Kjetil Fagerholt,et al.  Shortest path in the presence of obstacles: An application to ocean shipping , 2000, J. Oper. Res. Soc..

[35]  Luigi Di Puglia Pugliese,et al.  Shortest path problem with forbidden paths: The elementary version , 2013, Eur. J. Oper. Res..

[36]  Thomas Charles Gillmer.  Modern Ship Design , 1970 .

[37]  Roger de Abreu,et al.  Shipping in the Canadian Arctic: other possible climate change scenarios , 2004, IGARSS 2004. 2004 IEEE International Geoscience and Remote Sensing Symposium.

[38]  Tom Caldwell,et al.  On finding minimum routes in a network with turn penalties , 1961, CACM.

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

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

[41]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[42]  José María Sanchis,et al.  An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation , 2008, Eur. J. Oper. Res..

[43]  Heeyong Lee,et al.  Optimum Ship Routing and It's Implementation on the Web , 2002, AISA.

[44]  Antonio Bicchi,et al.  Planning shortest bounded-curvature paths for a class of nonholonomic vehicles among obstacles , 1996, J. Intell. Robotic Syst..

[45]  Chun Shen,et al.  Review of Climate Change in the Arctic , 2011 .

[46]  Kwangjin Yang,et al.  Real-time continuous curvature path planning of UAVS in cluttered environments , 2008, 2008 5th International Symposium on Mechatronics and Its Applications.