This paper presents a human-aided cleaning algorithm that can be implemented on low-cost robot architecture while the cleaning performance far exceeds the conventional random style cleaning. We clarify the advantages and disadvantages of the two notable cleaning robot styles: the random and the mapping styles, and show the possibility how we can achieve the performance of the complicated mapping style under the random style-like robot architecture using the idea of human-aided cleaning algorithm. Experimental results are presented to show the cleaning performance. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Kim, S., Kim, K., & Kim, T. H. (2007). Human-aided cleaning algorithm for low-cost robot architecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4552 LNCS, pp. 366–375). Springer Verlag. https://doi.org/10.1007/978-3-540-73110-8_39
Mendeley helps you to discover research relevant for your work.