The reviewed record of science sign in
Pith

arxiv: 2501.01559 · v1 · pith:FFKTZXSU · submitted 2025-01-02 · cs.RO · cs.MA

K-ARC: Adaptive Robot Coordination for Multi-Robot Kinodynamic Planning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FFKTZXSUrecord.jsonopen to challenge →

classification cs.RO cs.MA
keywords k-arcplanningapproachescoordinationkinodynamicrobotadaptiveincreasing
0
0 comments X
read the original abstract

This work presents Kinodynamic Adaptive Robot Coordination (K-ARC), a novel algorithm for multi-robot kinodynamic planning. Our experimental results show the capability of K-ARC to plan for up to 32 planar mobile robots, while achieving up to an order of magnitude of speed-up compared to previous methods in various scenarios. K-ARC is able to achieve this due to its two main properties. First, K-ARC constructs its solution iteratively by planning in segments, where initial kinodynamic paths are found through optimization-based approaches and the inter-robot conflicts are resolved through sampling-based approaches. The interleaving use of sampling-based and optimization-based approaches allows K-ARC to leverage the strengths of both approaches in different sections of the planning process where one is more suited than the other, while previous methods tend to emphasize on one over the other. Second, K-ARC builds on a previously proposed multi-robot motion planning framework, Adaptive Robot Coordination (ARC), and inherits its strength of focusing on coordination between robots only when needed, saving computation efforts. We show how the combination of these two properties allows K-ARC to achieve overall better performance in our simulated experiments with increasing numbers of robots, increasing degrees of problem difficulties, and increasing complexities of robot dynamics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.