CDT-Dijkstra: Fast Planning of Globally Optimal Paths for All Points in 2D Continuous Space
Jinyuan Liu,Minglei Fu,Wenan Zhang,Bo Chen,Ryhor Prakapovich,Uladzislau Sychou,Jinyuan Liu,Minglei Fu,Wenan Zhang,Bo Chen,Ryhor Prakapovich,Uladzislau Sychou
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 and all other nodes in the graph. However, to the best of our knowledge, there is no effective method that achieves a function similar to that of the Dijkstra's algorithm in a continuous space. In this study, an optimal...