Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2009.16-A.1.35

An Efficient Coverage Algorithm for Intelligent Robots with Deadline  

Jeon, Heung-Seok (건국대학교 컴퓨터소프트웨어)
Jung, Eun-Jin (아이오와 대학교 컴퓨터과학과)
Kang, Hyun-Kyu (건국대학교 컴퓨터소프트웨어)
Noh, Sam-H. (홍익대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartA / v.16A, no.1, 2009 , pp. 35-42 More about this Journal
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.
Keywords
Intelligent Robot; Coverage Algorithm; Set Cover; Greedy Algorithm; Deadline;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. Garcia and P. Gonzalez de Santos, “Mobile robot navigation with complete coverage of unstructured environments”, Robotics and Autonomous Systems, 46, pp.195-204, 2004   DOI   ScienceOn
2 G. Dissanayake, P. Newman, H. F. Durrant Whyte, S. Clark, and M. Csobra, “A Solution to the Simultaneous Localisation and Mapping (SLAM) Problem”, IEEE Transactions on Robotics and Automation., Vol.17, No.3, pp.229-241, 2001   DOI   ScienceOn
3 M. Montemerlo, S. Thrun, D. Koller, and B. Wegbreit, “Fast SLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem”, In Proceedings of AAAI National Conference on Artificial Intelligence, 2002, pp.593-598
4 M. Montemerlo, S. Thrun, D. Koller, and B. Wegbreit, “Fast SLAM 2.0: An Improved Particle Filtering Algorithm for Simultaneous Localization and Mapping that Probably Converges”, Proceedings of International Joint Conference on Artificial Intelligence, pp.1151-1156, 2003
5 Richard M. Karp, “Reducibility Among Combinatorial Problems”, Complexity of Computer Computations, R. E. Miller, J. W. Thatcher, Eds., Plenum Press, 1972
6 Uriel Feige, “A Threshold of lnn for Approximating Set Cover”, Journal of the ACM (JACM), Vol.45 No.4, pp.634-652, July, 1998   DOI   ScienceOn
7 Chan Sze Kong, New Ai Peng, and Ioannis Rekleitis, “Distributed Coverage with Multi Robot System”, Proceedings of the 2006 IEEE International Conference on Robotics and Automation, Orlando, Florida, May, 2006
8 Wesley H. Huang, “Optimal Line sweep based Decompositions for Coverage Algorithms”, Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001
9 Ian Stewart, “Squaring the Square”, Scientific American, pp.74-76, July, 1997
10 H. Choset and P. Pignon, “Coverage Path Planning: the boustrophedon cellular decomposition”, Proceedings of the International Conference on Field and Service Robotics, Dec., 1997