An Efficient Coverage Algorithm for Intelligent Robots with Deadline

Abstract

This paper proposes a new coverage algorithm for intelligent robot. Many algorithms for improving the performance of coverage have been focused on minimizing the total coverage completion time. However, if one does not have enough time to finish the whole coverage,the optimal path could be different. To tackle this problem, we propose a new coverage algorithm, which we call MaxCoverage algor ithm, for covering maximal area within the deadline. The MaxCoverage algorithm decides the navigation flow by greedy algorithm for Set Covering Problem. The experimental results show that the MaxCoverage algorithm performs better than other algorithms for random deadlines.clos