This research presents novel algorithms for online multi-robot exploration to achieve full coverage of unknown environments. The focus has been on using small teams of basic robots with limited capabilities and restricted communication. We show the performance compared to other algorithms through simulation and physical robot experiments. We also conducted theoretical analysis to show the algorithms provide a guarantee of full coverage.

In the event of an earthquake or fire, search and rescue efforts may be delayed until it is safe for a human team to enter the area. A team of robots could enter in advance to provide maps, images and locations of interest to the human team, allowing them to prepare their approach when they can enter. In a disaster area, communication may also be limited. We have developed a set of distributed algorithms that make use of a small number of robots to fully explore an unknown environment even with restrictions on communication, team size, and available sensors. We show, through proofs and experiments, that the algorithm will allow the team of robots to fully explore the environment and maintain the necessary communication to return the information to the search and rescue team waiting outside.

We propose a novel algorithm that allows a small team of robots to fully explore an unknown environment, even in the face of extreme communication restrictions. We verify, through proofs and experiments, that the algorithm will achieve full exploration.

We present an algorithm that maintains coverage of an open polyline patrolled by a team of robots. While previous work has focused on the uniformity of patrolling, we focus on ensuring the longevity of the system in the face of robot failures. A central control tower monitors the battery levels of the robots, and recalls them when they are low on power replacing them with fully charged robots. We compare two methods for replacement, both of which aim to keep coverage interruptions to a minimum. We present results obtained through physical experiments and simulations.