Application of Dijkstra Algorithm in Path Planning for Geomagnetic Navigation
编号:151 访问权限:仅限参会人 更新:2020-08-05 10:17:28 浏览:568次 口头报告

报告开始:2020年06月08日 14:00(Asia/Shanghai)

报告时间:20min

所在会场:[S] Special Session [SS03] Multi-Sensor Data Fusion For Underwater Application

视频 无权播放

提示:该报告下的文件权限为仅限参会人,您尚未登录,暂时无法查看。

摘要
Path planning is one of the key technologies to realize the hidden navigation of underwater vehicles during long-haul. Path planning efficiency and accuracy are at the core of submarine track planning. Combining the navigation task with the geomagnetic map adaptability, the optimal path between the starting point and the target point is searched in the target space. The underwater geomagnetic navigation path planning model is established, and the principle and implementation method of Dijkstra algorithm are analyzed. An underwater geomagnetic navigation path planning model is established, and the Dijkstra algorithm is used for underwater geomagnetic navigation path planning. Combining different local windows in the adaptation area, the path planning calculation time and track cost are optimized. The simulation analyzes the influence of different local windows on the path planning in the adaptation area. The experiment results demonstrate that the Dijkstra algorithm can effectively find the optimal path that satisfies the constraints.
关键词
暂无
报告人
Lihui Wang
Southeast University, China

稿件作者
Lihui Wang Southeast University, China
发表评论
验证码 看不清楚,更换一张
全部评论
重要日期
  • 会议日期

    06月08日

    2020

    06月11日

    2020

  • 01月12日 2020

    初稿截稿日期

  • 04月15日 2020

    提前注册日期

  • 12月31日 2020

    注册截止日期

主办单位
IEEE Signal Processing Society
承办单位
Zhejiang University
移动端
在手机上打开
小程序
打开微信小程序
客服
扫码或点此咨询