Virtual Door-Based Coverage Path Planning for Mobile Robot

  • Hyun Myung
  • Hae-min Jeon
  • Woo-Yeon Jeong
  • Seok-Won Bang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5744)

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.

Keywords

Virtual Door Coverage Path Planning Mobile Robot 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Choset, H.: Coverage for robotics - A survey of recent results. Annals of Mathematics and Artificial Intelligence 31(1-4), 113–126 (2001)CrossRefMATHGoogle Scholar
  2. 2.
    Choset, H.: Coverage of known spaces: the Boustrophedon cellular decomposition. Autonomous Robots 9(3), 247–253 (2000)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hyun Myung
    • 1
  • Hae-min Jeon
    • 1
  • Woo-Yeon Jeong
    • 2
  • Seok-Won Bang
    • 3
  1. 1.Department of Civil and Environmental and EngineeringKAISTYuseong-guRepublic of Korea
  2. 2.Samsung Advanced Institute of TechnologySamsung Electronics, Co. Ltd.GiheungRepublic of Korea
  3. 3.Robotics InstituteCarnegie Mellon Univ.PittsburghUSA

Personalised recommendations