Abstract
Sensor-based mobile robot coverage path planning (MRCPP) problem is a challenging problem in robotic management. We here develop a genetic algorithm (GA) for MRCPP problems. The area subject to coverage is modeled with disks representing the range of sensing devices. Then the problem is defined as finding a path which runs through the center of each disk at least once with minimal cost of full coverage. The proposed GA utilizes prioritized neighborhood-disk information to generate practical and high-quality paths for the mobile robot. Prioritized movement patterns are designed to generate efficient rectilinear coverage paths with no narrow-angle turn; they enable GA to find optimal or near-optimal solutions. The results of GA are compared with a well-known approach called backtracking spiral algorithm (BSA). Experiments are also carried out using P3-DX mobile robots in the laboratory environment.
Chapter PDF
Similar content being viewed by others
References
Choset, H.: Coverage for robotics - A survey of recent results. Annals of Mathematics and Artificial Intelligence 31, 113–126 (2001)
Guo, Y., Balakrishnan, M.: Complete coverage control for nonholonomic mobile robots in dynamic environments. In: Proceedings of 2006 IEEE International Conference on Robotics and Automation, pp. 1704–1709 (2006)
Acar, E.U., Choset, H., Lee, J.Y.: Sensor-based coverage with extended range detectors. IEEE Transactions on Robotics 22(1), 189–198 (2006)
Gonzalez, E., Alvarez, O., Diaz, Y., Parra, C., Bustacara, C.: BSA: A Complete Coverage Algorithm. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, pp. 2040–2044 (2005)
Gabriely, Y., Rimon, E.: Spanning-tree based coverage of continuous areas by a mobile robot. Annals of Mathematics and Artificial Intelligence 31, 77–98 (2001)
Ryerson, A.E.F., Zhang, Q.: Vehicle Path Planning for Complete Field Coverage Using Genetic Algorithms. Agricultural Engineering International: the CIGR E journal IX, 1–11 (2007) (Manuscript, ATOE-07-014)
Jimenez, P.A., Shirinzadeh, B., Nicholson, A., Alici, G.: Optimal area covering using genetic algorithms. In: Proceedings of the 2007 IEEE /ASME International Conference on Advanced Intelligent Mechatronics, pp. 1–5 (2007)
Kapanoglu, M., Ozkan, M., Yazici, A., Parlaktuna, O.: A Genetic Algorithm with Orientation Compasses for Single or Multi-Robot Coverage Path Planning. In: Proceedings of 6th International Symposium on Intelligent & Manufacturing Systems, pp. 668–678 (2008)
Goldberg, D.E.: Genetic Algorithm in search, optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Castillo, O., Trujillo, L., Melin, P.: Multiple objective genetic algorithms for path-planning optimization in autonomous mobile robots. Soft Computing 11(3), 269–279 (2007)
Erinc, G., Caprin, S.: A genetic algorithm for nonholonomic motion planning. In: Proceedings of the 2007 IEEE International Conference on Robotics and Automation, pp. 1843–1849 (2007)
Artificial Intelligence and Robotic laboratory, Eskisehir Osmangazi University, Turkey, http://www.ai-robotlab.ogu.edu.tr
Aria- ARNL software module (2009), http://robots.mobilerobots.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapanoglu, M., Ozkan, M., Yazıcı, A., Parlaktuna, O. (2009). Pattern-Based Genetic Algorithm Approach to Coverage Path Planning for Mobile Robots. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2009. Lecture Notes in Computer Science, vol 5544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01970-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-01970-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01969-2
Online ISBN: 978-3-642-01970-8
eBook Packages: Computer ScienceComputer Science (R0)