Abstract
This paper presents a novel coverage path planning method in indoor environment for a mobile robot such as cleaning robot. Overall region is divided into several sub-regions based on the virtually extracted doors. The algorithm is inspired from the usual way of dividing an indoor environment into sub-regions, i.e., rooms based on the identification of doors. The virtual door algorithm extracts the virtual doors by combining a Generalized Voronoi Diagram (GVD) and a configuration space eroded by the half of the door size. The region to region cleaning algorithm is also proposed based on the closing and opening operations of virtual doors. The performance of the proposed algorithm has been tested on various real indoor environments using a commercially available cleaning robot.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Choset, H.: Coverage for robotics - A survey of recent results. Annals of Mathematics and Artificial Intelligence 31(1-4), 113–126 (2001)
Choset, H.: Coverage of known spaces: the Boustrophedon cellular decomposition. Autonomous Robots 9(3), 247–253 (2000)
Acar, E.U., Choset, H., Rizzi, A.A., Atkar, P.N., Hull, D.: Morse Decompositions for Coverage Tasks. The International Journal of Robotics Research 21(4), 331–344 (2002)
Choset, H., Acar, E., Rizzi, A.A., Luntz, J.: Exact cellular decomposition in terms of critical points of Morse functions. In: Proc. of the IEEE International Conference on Robotics and Automation, San Francisco, USA, pp. 2270–2277 (2000)
Wong, S.C., MacDonald, B.A.: A topological coverage algorithm for mobile robots. In: Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Lag Vegas, USA, pp. 1685–1690 (2003)
Wong, S.C., MacDonald, B.A.: Complete coverage by mobile robots using slice decomposition based on natural landmarks. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS, vol. 3157, pp. 683–692. Springer, Heidelberg (2004)
Huang, W.H.: Optimal line-sweep-based decompositions for coverage algorithms. In: Proc. of the IEEE International Conference on Robotics and Automation, Seoul, Korea, pp. 27–32 (2001)
Kang, J.W., Kim, S.J., Chung, M.J., Myung, H., Park, J.H., Bang, S.W.: Path Planning for Complete and Efficient Coverage Operation of Mobile Robots. In: Proc. of the 2007 IEEE International Conference on Mechatronics and Automation, Harbin, China, pp. 2126–2131 (2007)
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
Myung, H., Jeon, Hm., Jeong, WY., Bang, SW. (2009). Virtual Door-Based Coverage Path Planning for Mobile Robot. In: Kim, JH., et al. Advances in Robotics. FIRA 2009. Lecture Notes in Computer Science, vol 5744. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03983-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-03983-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03982-9
Online ISBN: 978-3-642-03983-6
eBook Packages: Computer ScienceComputer Science (R0)