Abstract In this work we analyze the behavior of a swarm of autonomous robotic agents, or drones, designed for cooperatively exploring an unknown area (for purposes of cleaning, painting, etc.). We assume that each robot can acquire only the information which is available in its immediate vicinity, and the only way of inter-robot communication is by leaving traces on the common ground and sensing the traces left by other robots. We present a protocol for cleaning a dirty area that guarantees task completion (unless all robots die) and prove an upper bound on the time complexity of this protocol. We also show simulation results of the protocol on several types of regions. These simulations indicate that the precise cleaning time depends on the number of robots, their initial locations, and the shape of the dirty region.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Cooperative “Swarm Cleaning” of Stationary Domains


    Contributors:


    Publication date :

    2017-08-04


    Size :

    35 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    Overview of cooperative UAV swarm localization

    Shangguan, Runzong / Lin, Lin / Zhou, Yanbo | SPIE | 2025


    Research on Swarm Munitions Cooperative Warfare

    Wei, Wuchen / He, Xiaofu / Wang, Xiaoguang et al. | British Library Conference Proceedings | 2022


    Research on Swarm Munitions Cooperative Warfare

    Wei, Wuchen / He, Xiaofu / Wang, Xiaoguang et al. | Springer Verlag | 2022


    Research on Swarm Munitions Cooperative Warfare

    Wei, Wuchen / He, Xiaofu / Wang, Xiaoguang et al. | TIBKAT | 2022