@article{ART001238021},
author={Heung Seok Jeon and Sam H. Noh},
title={Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2008},
volume={13},
number={2},
pages={242-250}
TY - JOUR
AU - Heung Seok Jeon
AU - Sam H. Noh
TI - Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots
JO - Journal of The Korea Society of Computer and Information
PY - 2008
VL - 13
IS - 2
PB - The Korean Society Of Computer And Information
SP - 242
EP - 250
SN - 1598-849X
AB - The coverage algorithm based on Boustrophedon path has been known to be the most efficient in places without or less obstacles If the map of an environmental area thru SLAM algorithm can be obtainable . However, the efficiency of the coverage algorithm based on Boustrophedon path drops drastically when obstacles are complex. In this paper, we propose and implement a new algorithm, which we call Group-k, that efficiently handles the complex area. The Group-k algorithm groups the obstacles and prioritizes the covering sequences with complex rank of the groups. Implementation-based experiments show about 20% improved performance when applying the new algorithm, compared to the Boustrophedon path algorithm.
KW - 지능형로봇(Intelligent robot);커버리지(coverage);복잡성(complex rank)
DO -
UR -
ER -
Heung Seok Jeon and Sam H. Noh. (2008). Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots. Journal of The Korea Society of Computer and Information, 13(2), 242-250.
Heung Seok Jeon and Sam H. Noh. 2008, "Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots", Journal of The Korea Society of Computer and Information, vol.13, no.2 pp.242-250.
Heung Seok Jeon, Sam H. Noh "Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots" Journal of The Korea Society of Computer and Information 13.2 pp.242-250 (2008) : 242.
Heung Seok Jeon, Sam H. Noh. Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots. 2008; 13(2), 242-250.
Heung Seok Jeon and Sam H. Noh. "Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots" Journal of The Korea Society of Computer and Information 13, no.2 (2008) : 242-250.
Heung Seok Jeon; Sam H. Noh. Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots. Journal of The Korea Society of Computer and Information, 13(2), 242-250.
Heung Seok Jeon; Sam H. Noh. Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots. Journal of The Korea Society of Computer and Information. 2008; 13(2) 242-250.
Heung Seok Jeon, Sam H. Noh. Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots. 2008; 13(2), 242-250.
Heung Seok Jeon and Sam H. Noh. "Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots" Journal of The Korea Society of Computer and Information 13, no.2 (2008) : 242-250.