An Efficient Coverage Algorithm for Intelligent Robots with Deadline 


Vol. 16,  No. 1, pp. 35-42, Feb.  2009
10.3745/KIPSTA.2009.16.1.35


PDF
  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
  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.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals