An Efficient Coverage Algorithm for Intelligent Robots with Deadline


The KIPS Transactions:PartA, Vol. 16, No. 1, pp. 35-42, Feb. 2009
10.3745/KIPSTA.2009.16.1.35,   PDF Download:

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 algorithm, 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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. S. Jeon, E. J. Jung, H. K. Kang, S. H. Noh, "An Efficient Coverage Algorithm for Intelligent Robots with Deadline," The KIPS Transactions:PartA, vol. 16, no. 1, pp. 35-42, 2009. DOI: 10.3745/KIPSTA.2009.16.1.35.

[ACM Style]
Heung Seok Jeon, Eun Jin Jung, Hyun Kyu Kang, and Sam H. Noh. 2009. An Efficient Coverage Algorithm for Intelligent Robots with Deadline. The KIPS Transactions:PartA, 16, 1, (2009), 35-42. DOI: 10.3745/KIPSTA.2009.16.1.35.