[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

BA*: an online complete coverage algorithm for cleaning robots

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

This paper presents a novel approach to solve the online complete coverage task of autonomous cleaning robots in unknown workspaces based on the boustrophedon motions and the A* search algorithm (BA*). In this approach, the robot performs a single boustrophedon motion to cover an unvisited region until it reaches a critical point. To continue covering the next unvisited region, the robot wisely detects backtracking points based on its accumulated knowledge, determines the best backtracking point as the starting point of the next boustrophedon motion, and applies an intelligent backtracking mechanism based on the proposed A* search with smoothed path on tiling so as to reach the starting point with the shortest collision-free path. The robot achieves complete coverage when no backtracking point is detected. Computer simulations and experiments in real workspaces prove that our proposed BA* is efficient for the complete coverage task of cleaning robots.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Algorithm 2
Fig. 2
Algorithm 3
Fig. 3
Fig. 4
Algorithm 4
Fig. 5
Algorithm 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. If our method is implemented in a commercial cleaning robot such as the Samsung Robotic Vacuum Cleaner VC-RL87W (2011), then the robot may cover the entire workspace (100 %) because it is equipped with side brushes.

  2. The experimental video files are available at the URL: http://163.180.116.135:8080/

References

  1. Acar EU, Choset H, Rizzi AA, Atkar PN, Hull D (2002) Morse decompositions for coverage tasks. Int J Robot Res 21(4):331–344

    Article  Google Scholar 

  2. Botea A, Müller M, Schaeffer J (2004) Near optimal hierarchical path-finding. J Game Dev 1(1):7–28

    Google Scholar 

  3. Chibin Z, Xingsong W, Yong D (2008) Complete coverage path planning based on ant colony algorithm. In: Proceedings of the 15th international conference on mechatronics and machine vision in practice, Auckland, New-Zealand, pp 357–361

    Chapter  Google Scholar 

  4. Choset H (2000) Coverage of known spaces: the boustrophedon cellular decomposition. Auton Robots 9(1):247–253

    Article  Google Scholar 

  5. Choset H (2001) Coverage for robotics—a survey of recent results. Ann Math Artif Intell 31(1–4):113–126

    Article  Google Scholar 

  6. Choset H, Pignon P (1997) Coverage path planning: the boustrophedon cellular decomposition. In: Proceedings of the international conference on field and service robotics, Canberra, Australia

    Google Scholar 

  7. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271

    Article  MathSciNet  MATH  Google Scholar 

  8. Dlouhy M, Brabec F, Svestka P (2000) A genetic approach to the cleaning path planning problem. In: Proceedings of the 16th European workshop on computational geometry, Eilat, Israel

    Google Scholar 

  9. Dudek G, Jenkin M (2010) Computational principles of mobile robotics, 2nd edn. Cambridge Univerity Press, Cambridge

    Book  MATH  Google Scholar 

  10. Esposito JM, Barton O, Koehler J, Lim D (2011) Matlab toolbox for the create robot. www.usna.edu/Users/weapsys/esposito/roomba.matlab/

  11. Gabriely Y, Rimon E (2001) Spanning-tree based coverage of continuous areas by a mobile robot. Ann Math Artif Intell 31(4):77–98

    Article  Google Scholar 

  12. Gabriely Y, Rimon E (2002) Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot. In: Proceedings of the IEEE international conference on robotics and automation, Washington, DC, USA, pp 954–960

    Google Scholar 

  13. González E, Aristizábal PT, Alarcón MA (2002) Backtracking spiral algorithm: a mobile robot region filling strategy. In: Proceeding of the 2002 international symposium on robotics and automation, Toluca, Mexico, pp 261–266

    Google Scholar 

  14. González E, Álvarez O, Díaz Y, Parra C, Bustacara C (2005) BSA: a complete coverage algorithm. In: Proceedings of the IEEE international conference on robotics and automation, Barcelona, Spain, pp 2040–2044

    Google Scholar 

  15. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107

    Article  Google Scholar 

  16. Koenig S, Liu Y (2001) Terrain coverage with ant robots: a simulation study. In: Proceedings of the international conference on autonomous agents, Montreal, Quebec, Canada, pp 600–607

    Chapter  Google Scholar 

  17. Korf RE, Reid M, Edelkamp S (2001) Time complexity of iterative-deepening-A*. Artif Intell 129(1–2):199–218

    Article  MathSciNet  MATH  Google Scholar 

  18. Latombe JC (1991) Robot motion planning. Kluwer Academic, Amsterdam

    Book  Google Scholar 

  19. Luo C, Yang SX (2008) A bioinspired neural network for real-time concurrent map building and complete coverage robot navigation in unknown environments. IEEE Trans Neural Netw 19(1):1279–1298

    Article  Google Scholar 

  20. Mannadiar R, Rekleitis I (2010) Optimal coverage of a known arbitrary environment. In: Proceedings of the IEEE international conference on robotics and automation, Anchorage, Alaska, USA, pp 5525–5530

    Google Scholar 

  21. Mendonça M, de Arruda LVR, Jr FN (2012) Autonomous navigation system using event driven-fuzzy cognitive maps. Appl Intell 37(1):175–188

    Article  Google Scholar 

  22. Nash A, Daniel K, Koenig S, Felner A (2007) Theta*: any-angle path planning on grids. In: Proceedings of the AAAI conference on artificial intelligence, Vancouver, Canada, pp 1177–1183

    Google Scholar 

  23. Oh JS, Choi YH, Park JB, Zheng YF (2004) Complete coverage navigation of cleaning robots using triangular-cell-based map. IEEE Trans Ind Electron 51(3):718–726

    Article  Google Scholar 

  24. Palacín J, Palleja T, Valgañón I, Pernia R, Roca J (2005) Measuring coverage performances of a floor cleaning mobile robot using a vision system. In: Proceedings of the IEEE international conference on robotics and automation, Barcelona, Spain, pp 4236–4241

    Google Scholar 

  25. Palleja T, Tresanchez M, Teixido M, Palacin J (2010) Modeling floor-cleaning coverage performances of some domestic mobile robots in a reduced scenario. Robot Auton Syst 58(1):37–45

    Article  Google Scholar 

  26. Russel SJ, Norvig P (2003) In: Artificial intelligence a modern approach. Pearson Education, Upper Saddle River

    Google Scholar 

  27. The iRobot Create Team: iRobot Create owner’s guide (2006). www.irobot.com/hrd_right_rail/create_rr/create_fam/createFam_rr_manuals.html

  28. Wong S (2006) Qualitative topological coverage of unknown environments by mobile robots. PhD dissertation, The University of Auckland, New Zealand

  29. Yang SX, Luo C (2004) A neural network approach to complete coverage path planning. IEEE Trans Syst Man Cybern, Part B, Cybern 34(1):718–724

    Article  Google Scholar 

  30. Yap P (2002) Grid-based path-finding. In: Lecture notes in artificial intelligence, vol 2338. Springer, Berlin, pp 44–55

    Google Scholar 

Download references

Acknowledgements

The authors are grateful to the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science, and Technology (2010-0012609) for its tremendous support to this work’s completion.

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Kyung Hee University, 1-Seocheon, Giheung, Yongin, Gyeonggi, 446-701, South Korea

    Hoang Huu Viet, Md Nasir Uddin Laskar & TaeChoong Chung

  2. Research and Development Center, Duy Tan University, K7/25 Quang Trung, Da Nang City, VietNam

    Viet-Hung Dang

Authors
  1. Hoang Huu Viet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Viet-Hung Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Md Nasir Uddin Laskar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. TaeChoong Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to TaeChoong Chung.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Viet, H.H., Dang, VH., Laskar, M.N.U. et al. BA*: an online complete coverage algorithm for cleaning robots. Appl Intell 39, 217–235 (2013). https://doi.org/10.1007/s10489-012-0406-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-012-0406-4

Keywords

Search

Navigation