CDT-Dijkstra: Fast Planning of Globally Optimal Paths for All Points in 2D Continuous Space

Jinyuan Liu, Minglei Fu, Wenan Zhang +3

The Dijkstra algorithm is a classic path planning method, which in a discrete graph space, can start from a specified source node and find the shortest path between the source node…