436 research outputs found

    A review on robot motion planning approaches

    Get PDF
    The ability of a robot to plan its own motion seems pivotal to its autonomy, and that is why the motion planning has become part and parcel of modern intelligent robotics. In this paper, about 100 research are reviewed and briefly described to identify and classify the amount of the existing work for each motion planning approach. Meanwhile, around 200 research were used to determine the percentage of the application of each approach. The paper includes comparative tables and charts showing the application frequency of each approach in the last 30 years. Finally, some open areas and challenging topics are presented based on the reviewed papers

    k-Color Multi-Robot Motion Planning

    Full text link
    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 and polygonal robots translating in the plane. We show that the algorithm successfully and efficiently copes with a variety of challenging scenarios, involving many robots, while a simplified version of this algorithm, that can be viewed as an extension of a prevalent sampling-based algorithm for the k-color case, fails even on simple scenarios. Interestingly, our algorithm outperforms a well established implementation of PRM for the standard multi-robot problem, in which each robot has a distinct color.Comment: 2
    corecore