Application of Dijkstra Algorithm in Path Planning for Geomagnetic Navigation
ID:151 View Protection:ATTENDEE Updated Time:2020-08-05 10:17:28 Hits:405 Oral Presentation

Start Time:2020-06-08 14:00(Asia/Shanghai)

Duration:20min

Session:S Special Session » SS03Multi-Sensor Data Fusion For Underwater Application

Video No Permission

Tips: Only the registered participant can access the file. Please sign in first.

Abstract
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.
Keywords
Speaker
Lihui Wang
Southeast University, China

Submission Author
Lihui Wang Southeast University, China
Submit Comment
Verify Code Change Another
All Comments
Important Date
  • Conference Date

    Jun 08

    2020

    to

    Jun 11

    2020

  • Jan 12 2020

    Draft paper submission deadline

  • Apr 15 2020

    Early Bird Registration

  • Dec 31 2020

    Registration deadline

Sponsored By
IEEE Signal Processing Society
Contact Information