Abstract In this chapter, we propose a novel approach for solving the coordination of a fleet of mobile robots, which consists of finding a set of collision-free trajectories for individual robots in the fleet. This problem is studied for several decades, and many approaches have been introduced. However, only a small minority is applicable in practice because of their properties - small computational requirement, producing solutions near-optimum, and completeness. The approach we present is based on a multi-robot variant of Rapidly Exploring Random Tree algorithm (RRT) for discrete environments and significantly improves its performance. Although the solutions generated by the approach are slightly worse than one of the best state-of-the-art algorithms presented in [23], it solves problems where ter Morses algorithm fails.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On Randomized Searching for Multi-robot Coordination


    Contributors:


    Publication date :

    2019-10-26


    Size :

    20 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    On Randomized Searching for Multi-robot Coordination

    Hvězda, Jakub / Kulich, Miroslav / Přeučil, Libor | TIBKAT | 2020


    On Randomized Searching for Multi-robot Coordination

    Hvězda, Jakub / Kulich, Miroslav / Přeučil, Libor | British Library Conference Proceedings | 2020


    Deformable ruin searching robot

    ZHOU MEIJIE / ZHENG JUNQI / CHAI YI et al. | European Patent Office | 2024

    Free access

    Introduction to Multi-Robot Coordination Algorithms

    Liu, Shihan / Niu, Yiming / Wu, Boyang | IEEE | 2022


    Underwater searching and rescuing robot

    JING MEI / WANG YAN / KYONG YONG et al. | European Patent Office | 2024

    Free access