This paper describes a new method of pathplanning for multiple robots in unknown environments. The method, called Space D*, is based on two algorithms: the D*, which is an incremental graph search algorithm, and the Space Colonization algorithm, previously used to simulate crowd behaviors. The path-planning is achieved through the exchange of information between the robots. So decentralized, each robot performs its path-planning, which provides an obstacle-free path with the least number of robots around. The major contribution of the proposed method is that it generates paths in spacious environments facilitating the control of robots and thus presenting itself in a viable way for using in areas populated with multiple robots. The results obtained validate the approach and show the advantages in comparison with using only the D* method.


    Access

    Download


    Export, share and cite



    Title :

    Space D*: a path-planning algorithm for multiple robots in unknown environments



    Publication date :

    2012-01-01


    Remarks:

    doi:10.1007/s13173-012-0071-9



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Cooperative path planning for multiple MAVs operating in unknown environments

    Ahmad, Afzal / Vonasek, Vojtech / Saska, Martin | IEEE | 2020


    Path Planning of Mobile Robots in Unknown Environments using Fuzzy Logic Based Hybrid Controller

    Mohanty, Prases K. / Singh, Anand Kumar / Kumar, Amit et al. | IEEE | 2021


    Path planning for autonomous driving in unknown environments

    Dolgov, Dmitri / Thrun, Sebastian / Montemerlo, Michael et al. | Tema Archive | 2009


    Reactive Path Planning Approach for Docking Robots in Unknown Environment

    Peng Cui / Weisheng Yan / Yintao Wang | DOAJ | 2017

    Free access

    Nonholonomic path planning of space robots

    Nakamura, Y. / Mukherjee, R. | Tema Archive | 1989