Online Coverage of Planar Environments by a Battery Powered Autonomous Mobile Robot

Abstract

This paper is concerned with online coverage of unknown planar environments by a mobile robot of size D operating with a limited energy capacity battery. The battery capacity is represented by the path length L that the robot can travel under a full battery charge. Starting at S, the robot has to cover a planar environment containing unknown obstacles, and return to S upon task completion. During task execution, the robot may return to S at any time to recharge its battery. This paper first describes a battery powered offline coverage methodology, then introduces the battery powered coverage (BPC) algorithm that performs online battery powered coverage using position and local obstacle detection sensors. The performance of the BPC algorithm is measured by its competitiveness, determined by measuring the mobile robot's total online path length, l, relative to the optimal offline solution lopt. This paper establishes that the BPC algorithm has a competitive performance of l ≤ ( L/ D) lopt. This paper additionally establishes a universal lower bound of l ≥ log( L/ 4 D) lopt over all online battery powered coverage algorithms. Execution example illustrates the usefulness of the BPC algorithm.