본문 바로가기
  • Home

Efficient Robot Cleaning Algorithm based on Set Cover Algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2008, 13(3), pp.85-90
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Heung Seok Jeon 1

1건국대학교

Accredited

ABSTRACT

In this paper, we propose a new robot cleaning algorithm, which we call SetClean. The new algorithm cleans from the most less complex area. Sometimes, when the cleaning completion time can be longer or can not be estimated, cleaning larger area first is better than optimizing the whole time for cleaning. To do this, SetClean algorithm divides the whole area into cleanable sub-areas using Set Cover algorithm and cleans the area in the order of high efficiency that maximize the cleanable area per unit time. SetClean algorithm decides the navigation flow by considering not only the size of the area but also the distance from the current robot location to the area to be cleaned and the delay time caused by the number of turns within the area. The experimental results show the mechanism and performance of the SetClean algorithm.

Citation status

* References for papers published after 2023 are currently being built.

This paper was written with support from the National Research Foundation of Korea.