Path Planning Method Based on D* lite Algorithm for Unmanned Surface Vehicles in Complex Environments

被引:22
|
作者
Yao Yan-long [1 ,3 ]
Liang Xiao-feng [1 ,2 ]
Li Ming-zhi [1 ]
Yu Kai [1 ]
Chen Zhe [1 ,3 ]
Ni Chong-ben [1 ]
Teng Yue [2 ]
机构
[1] Shanghai Jiao Tong Univ, State Key Lab Ocean Engn, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Key Lab Marine Intelligent Equipment & Syst, Minist Educ, Shanghai 200240, Peoples R China
[3] Shanghai Jiao Tong Univ, Joint Inst, Shanghai 200240, Peoples R China
关键词
path planning; unmanned surface vehicle; D* lite algorithm; complex environment; AVOIDANCE ALGORITHM;
D O I
10.1007/s13344-021-0034-z
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
In recent decades, path planning for unmanned surface vehicles (USVs) in complex environments, such as harbours and coastlines, has become an important concern. The existing algorithms for real-time path planning for USVs are either too slow at replanning or unreliable in changing environments with multiple dynamic obstacles. In this study, we developed a novel path planning method based on the D* lite algorithm for real-time path planning of USVs in complex environments. The proposed method has the following advantages: (1) the computational time for replanning is reduced significantly owing to the use of an incremental algorithm and a new method for modelling dynamic obstacles; (2) a constrained artificial potential field method is employed to enhance the safety of the planned paths; and (3) the method is practical in terms of vehicle performance. The performance of the proposed method was evaluated through simulations and compared with those of existing algorithms. The simulation results confirmed the efficiency of the method for real-time path planning of USVs in complex environments.
引用
收藏
页码:372 / 383
页数:12
相关论文
共 50 条
  • [21] Online Path Planning Based on MILP for Unmanned Surface Vehicles
    Leng, Jing
    Liu, Jian
    Xu, Hongli
    2013 OCEANS - SAN DIEGO, 2013,
  • [22] Path Planning Based on A* Algorithm for Unmanned Surface Vehicle
    Hou, Kang
    Lan, Xiaojuan
    Zhang, Yucheng
    Tyagi, Sumarga Kumar Sah
    HUMAN SYSTEMS ENGINEERING AND DESIGN, IHSED2018, 2019, 876 : 783 - 788
  • [23] A Method of Path Planning on Safe Depth for Unmanned Surface Vehicles Based on Hydrodynamic Analysis
    Liu, Shuai
    Wang, Chenxu
    Zhang, Anmin
    APPLIED SCIENCES-BASEL, 2019, 9 (16):
  • [24] An Improved Trajectory Planning Method for Unmanned Aerial Vehicles in Complex Environments
    Zhang, Chen
    Yu, Moduo
    Huang, Wentao
    Hu, Yi
    Chen, Yang
    Fan, Qinqin
    BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PT 2, BIC-TA 2023, 2024, 2062 : 148 - 158
  • [25] Path planning of moving robot based on path optimization of D* Lite algorithm
    Huang L.
    Zhou F.-T.
    Kongzhi yu Juece/Control and Decision, 2020, 35 (04): : 877 - 884
  • [26] A Review of Path Planning for Unmanned Surface Vehicles
    Xing, Bowen
    Yu, Manjiang
    Liu, Zhenchong
    Tan, Yinchao
    Sun, Yue
    Li, Bing
    JOURNAL OF MARINE SCIENCE AND ENGINEERING, 2023, 11 (08)
  • [27] Optimal path planning of unmanned surface vehicles
    Singh, Yogang
    Sharma, Sanjay
    Hatton, Daniel
    Sutton, Robert
    INDIAN JOURNAL OF GEO-MARINE SCIENCES, 2018, 47 (07): : 1325 - 1334
  • [28] Efficient path planning based on A*algorithm and annealing algorithm for Agricultural Unmanned Vehicles
    Zhou, Lingzhi
    Chen, Yuqi
    Xia, Han
    Cao, Yujin
    Yang, Miaoyu
    Yuan, Yuan
    Zhou, Man
    PROCEEDINGS OF 2024 INTERNATIONAL CONFERENCE ON POWER ELECTRONICS AND ARTIFICIAL INTELLIGENCE, PEAI 2024, 2024, : 858 - 862
  • [29] Conflict-based search with D* lite algorithm for robot path planning in unknown dynamic environments
    Jin, Jianzhi
    Zhang, Yin
    Zhou, Zhuping
    Jin, Mengyuan
    Yang, Xiaolian
    Hu, Fang
    COMPUTERS & ELECTRICAL ENGINEERING, 2023, 105
  • [30] A new method for unmanned aerial vehicle path planning in complex environments
    He, Yong
    Hou, Ticheng
    Wang, Mingran
    SCIENTIFIC REPORTS, 2024, 14 (01):