Computer Science – Robotics
Scientific paper
2012-02-28
Computer Science
Robotics
16 pages
Scientific paper
We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a sampling-based algorithm specifically designed for solving it. At the heart of the algorithm is a novel technique where the k-color problem is reduced to several discrete multi-robot motion planning problems. These reductions amplify basic samples into massive collections of free placements and paths for the robots. We demonstrate the performance of the algorithm by an implementation for the case of disc robots in the plane and show that it successfully and efficiently copes with a variety of challenging scenarios, involving many robots, while a straightforward extension of prevalent sampling-based algorithms for the k-color case, fails even on simple scenarios. Interestingly, our algorithm outperforms a state-of-the-art implementation for the standard multi-robot problem, in which each robot has a distinct color.
Halperin Dan
Solovey Kiril
No associations
LandOfFree
k-Color Multi-Robot Motion Planning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with k-Color Multi-Robot Motion Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-Color Multi-Robot Motion Planning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-606609