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.MA2020
A Combination of Theta*, ORCA and Push and Rotate for Multi-agent Navigation
Stepan Dergachev, Konstantin Yakovlev, Ryhor Prakapovich
We study the problem of multi-agent navigation in static environments when no centralized controller is present. Each agent is controlled individually and relies on three algorithm…