Exploration of a Line by Minimum Number of Asynchronous Oblivious Robots in a Symmetric Configuration
摘要
This paper considers the exploration of a grid line by a swarm of autonomous, oblivious, asynchronous robots in the discrete domain. The robots are randomly arranged on nodes of a grid line in a symmetric configuration with one axis of symmetry. They follow the standard CORDA model. The algorithm achieves successful exploration of a grid line while preserving the initial symmetry, ensuring completion within a finite time and avoiding any collision. The study also demonstrates that a minimum of two robots is sufficient to successfully complete the exploration task.