Journal of System Simulation ›› 2018, Vol. 30 ›› Issue (6): 2390-2398.doi: 10.16182/j.issn1004731x.joss.201806049

• Orginal Article • Previous Articles     Next Articles

Route Planning for Vessel Based on Dynamic Complexity Map

Du Zhe1, 2, Wen Yuanqiao1, 2, 3, Huang Liang1, 2, Zhou Chunhui1, 2, 3, Xiao Changshi1, 2, 3   

  1. 1. School of Navigation, Wuhan University of Technology, Wuhan 430063, China;
    2. Hubei Key Laboratory of Inland Shipping Technology, Wuhan 430063, China;
    3. National Engineering Research Center for Water Transport Safety, Wuhan 430063, China
  • Received:2016-08-01 Revised:2016-12-12 Online:2018-06-08 Published:2018-06-14

Abstract: Aiming at multiple mobile objects in complex navigation environment, a route planning method based on the dynamic complexity map is proposed. According to the theory of complexity measurement, a dynamic complexity map is established. By taking advantage of the idea of A * algorithm, the complexity value is taken as an actual cost and the Euclidean Distance from current point to the target is taken as a heuristic costs. Considering the ship dimensions, the channel boundary constraint function is added. The experimental results show that on the premises of satisfying the constraint of ship dimensions, the planned route avoids all the high complexity areas and it is close to the shortest path.

Key words: Dynamic Complexity Map, A * Algorithm, Multiple Mobile Objects, Route Planning

CLC Number: