Abstract
The exploration of unknown environments is an essential application of multi-robot systems, particularly in critical missions, such as hazard detection and search and rescue. These missions share the need to reach full coverage of the explorable space in the shortest time possible. To minimize the completion time, robots in the fleet must be able to reliably exchange information about the environment with one another. One of the main methods to expand coverage is by placing relays. Existing relay-placement algorithms tend to either require prior knowledge of the environment, or they rely on maintaining specific distances between the relays and the rest of the robots. These approaches lack flexibility and adaptability to the environment. This paper introduces the "Connectivity-Aware Relay Algorithm" (CARA), a dynamic context-aware relay-placement algorithm that does not require any prior knowledge of the environment. We compare CARA against a state-of-the-art distance-based relay-placement algorithm. Our results demonstrate that CARA outperformed the state-of-the-art algorithm in terms of the time to completion by a factor of 10 as it placed, on average, half the number of relays.