Journal of System Simulation
Abstract
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.
Recommended Citation
Du, Zhe; Wen, Yuanqiao; Liang, Huang; Zhou, Chunhui; and Xiao, Changshi
(2018)
"Route Planning for Vessel Based on Dynamic Complexity Map,"
Journal of System Simulation: Vol. 30:
Iss.
6, Article 49.
DOI: 10.16182/j.issn1004731x.joss.201806049
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol30/iss6/49
First Page
2390
Revised Date
2016-12-12
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.201806049
Last Page
2398
CLC
TP391.9
Recommended Citation
Du Zhe, Wen Yuanqiao, Huang Liang, Zhou Chunhui, Xiao Changshi. Route Planning for Vessel Based on Dynamic Complexity Map[J]. Journal of System Simulation, 2018, 30(6): 2390-2398.
DOI
10.16182/j.issn1004731x.joss.201806049
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons