Minimizing Time, Travel, and Energy Consumption in Uniform Dispersion of Robotic Swarms in Unknown Environments

There exist algorithms that can minimize makespan and travel in uniform dispersion of robotic swarms in unknown environments, but no algorithm can minimize energy consumption in all environments, assuming robots have bounded sensing range. However, energy can be minimized in simply connected environments using a simple, "ant-like" algorithm.