db-LaCAM: Fast and Scalable Multi-Robot Kinodynamic Motion Planning with Discontinuity-Bounded Search and Lightweight MAPF

Akmaral Moldagalieva, Keisuke Okumura, Amanda Prorok, Wolfgang Hönig

Keywords: Multi-Robot Kinodynamic Motion Planning, Multi-Agent Path Finding, Robotics

TL;DR: db-LaCAM is a fast, scalable multi-robot kinodynamic planner that handles arbitrary robot dynamics. It achieves up to ten times faster planning than state-of-the-art methods, scales efficiently to large teams.

Abstract:

State-of-the-art multi-robot kinodynamic motion planners struggle to handle more than a few robots due to high computational burden, which limits their scalability and results in slow planning time.
In this work, we combine the scalability and speed of modern multi-agent path finding (MAPF) algorithms with the dynamic-awareness of kinodynamic planners to address these limitations.
To this end, we propose discontinuity-Bounded LaCAM (db-LaCAM), a planner that utilizes a precomputed set of motion primitives that respect robot dynamics to generate horizon-length motion sequences, while allowing a user-defined discontinuity between successive motions.
The planner db-LaCAM is resolution-complete with respect to motion primitives and supports arbitrary robot dynamics.
Extensive experiments demonstrate that db-LaCAM scales efficiently to scenarios with up to $50$ robots, achieving up to ten times faster runtime compared to state-of-the-art planners, while maintaining comparable solution quality.
The approach is validated in both 2D and 3D environments with dynamics such as the unicycle and 3D double integrator.
We demonstrate the safe execution of trajectories planned with db-LaCAM in two distinct physical experiments involving teams of flying robots and car-with-trailer robots.

Email Sharing: We authorize the sharing of all author emails with Program Chairs.

Data Release: We authorize the release of our submission and author names to the public in the event of acceptance.

Submission Number: 7