TL;DR
This paper introduces a novel hierarchical search-based approach for multi-agent path finding tailored to car-like robots with kinematic and spatiotemporal constraints, demonstrating scalability and real-world applicability.
Contribution
It formalizes CL-MAPF and proposes Car-like Conflict-Based Search and Spatiotemporal Hybrid-State A* algorithms, addressing nonholonomic constraints in multi-agent path planning.
Findings
Scales well to many agents in complex scenarios.
Produces solutions directly applicable to real-world car-like robots.
Outperforms baseline algorithms on a large benchmark.
Abstract
Multi-Agent Path Finding has been widely studied in the past few years due to its broad application in the field of robotics and AI. However, previous solvers rely on several simplifying assumptions. They limit their applicability in numerous real-world domains that adopt nonholonomic car-like agents rather than holonomic ones. In this paper, we give a mathematical formalization of Multi-Agent Path Finding for Car-Like robots (CL-MAPF) problem. For the first time, we propose a novel hierarchical search-based solver called Car-like Conflict-Based Search to address this problem. It applies a body conflict tree to address collisions considering shapes of the agents. We introduce a new algorithm called Spatiotemporal Hybrid-State A* as the single-agent path planner to generate path satisfying both kinematic and spatiotemporal constraints. We also present a sequential planning version of our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
