2 papers
cs.RO2023
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…
cs.RO2023
A Homotopy Invariant Based on Convex Dissection Topology and a Distance Optimal Path Planning Algorithm
Jinyuan Liu, Minglei Fu, Andong Liu +2
The concept of path homotopy has received widely attention in the field of path planning in recent years. In this article, a homotopy invariant based on convex dissection for a two…