Multi-Arm Motion Planning Based on Conflict Elimination
Abstract
: Motion planning for simultaneous movement of multiple robotic arms that interact spatially is a challenging problem in robotics. It is usually solved by planning in a composite configuration space with a high dimensionality. However, this approach can lead to a low success rate of motion planning with increasing number of arms. In this paper, we study the feasibility of using conflict elimination instead, where each motion planning step is done only in the configuration space of a single arm and uses a state-of-the-art sampling-based algorithm. To accomplish this, we adapt techniques from the related field of multi-agent path finding (MAPF), specifically we reformulated the CCBS algorithm from MAPF. We propose and implement a novel algorithm MP-CCBS that solves the continuous-time multi-arm motion planning problem. We evaluate the MP-CCBS algorithm on a diverse set of planning scenarios with 2-8 robotic arms. We compare the results to composite planning using state-of-the-art motion planning algorithm RRT-Connect. Except for the easiest scenario with 2 robotic arms, MP-CCBS outperforms composite planning by large margins in terms of success rate.