Search Results for author:
Found 2 papers, 0 papers with code
EHL*: Memory-Budgeted Indexing for Ultrafast Optimal Euclidean Pathfinding
The Euclidean Shortest Path Problem (ESPP), which involves finding the shortest path in a Euclidean plane with polygonal obstacles, is a classic problem with numerous real-world applications.
Tracking Progress in Multi-Agent Path Finding
Multi-Agent Path Finding (MAPF) is an important core problem for many new and emerging industrial applications.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
