Near-Optimal Multi-Robot Motion Planning with Finite Sampling

• Published in: IEEE transactions on robotics Vol. 39; no. 5; pp. 1 - 15
• Main Authors: Dayan, Dror, Solovey, Kiril, Pavone, Marco, Halperin, Dan
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Collision avoidance; Mathematical analysis; Motion planning; multi-agent systems; Multi-robot systems; Multiple robots; Optimization; Planning; Robot dynamics; Robot kinematics; Robots; Sampling; sampling methods; Tensors; Tires; Trajectory
• ISSN: 1552-3098; 1941-0468
• DOI: 10.1109/TRO.2023.3281152

An underlying structure in several sampling-based methods for continuous multirobot motion planning (MRMP) is the tensor roadmap , which emerges from combining multiple probabilistic roadmap (PRM) graphs constructed for the individual robots via a tensor product. We study the conditions under which the tensor roadmap encodes a near-optimal solution for MRMP-satisfying these conditions implies near optimality for a variety of popular planners, including dRRT*, and the discrete methods M* and conflict-based search, when applied to the continuous domain. We develop the first finite-sample analysis of this kind, which specifies the number of samples, their deterministic distribution, and magnitude of the connection radii that should be used by each individual PRM graph, to guarantee near-optimality using the tensor roadmap. This significantly improves upon a previous asymptotic analysis, wherein the number of samples tends to infinity. Our new finite sample-size analysis supports guaranteed high-quality solutions in practice within finite time. To achieve our new result, we first develop a sampling scheme, which we call the staggered grid , for finite-sample motion planning for individual robots, which requires significantly fewer samples than previous work. We then extend it to the much more involved MRMP setting, which requires to account for interactions among multiple robots. Finally, we report on a few experiments that serve as a verification of our theoretical findings and raise interesting questions for further investigation.