— In this paper, a communication-efficient dynamic task scheduling algorithm for a heterogeneous multi-robot system is proposed. To make this task scheduling algorithm to be scal...
We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot coverage algorithm, a boustrophed...
DeWitt Latimer IV, Siddhartha S. Srinivasa, Vincen...
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...