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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

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



    Erscheinungsdatum :

    2012-01-01


    Anmerkungen:

    doi:10.1007/s13173-012-0071-9



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629



    Cooperative path planning for multiple MAVs operating in unknown environments

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


    Path planning for autonomous driving in unknown environments

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


    Reactive Path Planning Approach for Docking Robots in Unknown Environment

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

    Freier Zugriff

    Nonholonomic path planning of space robots

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


    Online path planning for autonomous underwater vehicles in unknown environments

    Hernandez, Juan David / Vidal, Eduard / Vallicrosa, Guillem et al. | IEEE | 2015