Skip to main content
SpringerLink
Log in

BoB: an online coverage approach for multi-robot systems

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Online complete coverage is required in many applications, such as in floor cleaning, lawn mowing, mine hunting, and harvesting, and can be performed by single- or multi-robot systems. Motivated by the efficiency and robustness of multi-robot systems, this study proposes a solution to provide online complete coverage through a boustrophedon and backtracking mechanism called the BoB algorithm. This approach designs robots in the system according to a market-based approach. Without a central supervisor, the robots use only local interactions to coordinate and construct simultaneously non-overlapping regions in an incremental manner via boustrophedon motion. To achieve complete coverage, that is, the union of all covered regions in the entire accessible area of the workspace, each robot is equipped with an intelligent backtracking mechanism based on a proposed greedy A* search (GA*) to move to the closest unvisited region. The robots complete the coverage task when no more backtracking points are detected. Computer simulations show that the BoB approach is efficient in terms of the coverage rate, the length of the coverage path, and the balance of the workload distribution of robots.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Agmon N, Hazon N, Kaminka GA (2006) Constructing spanning trees for efficient multi-robot coverage. In: Proceedings of the 2006 IEEE international conference on robotics and automation, Orlando, Florida, USA, pp 1698–1703

  2. Agmon N, Hazon N, Kaminka GA (2008) The giving tree: constructing trees for efficient offline and online multi-robot coverage. J Ann Math Artif Intell 52(1):143–168

    Article  MATH  MathSciNet  Google Scholar 

  3. Ahmadi M., Stone P. (2006) A multi-robot system for continuous area sweeping tasks. In: Proceedings of the 2006 IEEE international conference on robotics and automation, Orlando, Florida, USA, pp 1724–1729

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

    Google Scholar 

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

    Article  Google Scholar 

  6. Choset H (2001) Coverage for robotics ? a survey of recent results. Ann Math Artif Intell 31(1):113?-126

    Article  Google Scholar 

  7. 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

  8. Daniel K, Nash A, Koenig S (2010) Theta*: any-angle path planning on grids. J Artif Intell Res 39(1):533–579

    MATH  MathSciNet  Google Scholar 

  9. Dias MB, Stentz A A market approach to multirobot coordination. Tech. rep. CMU-RI -TR-01-26

  10. Dias MB, Stentz A (2003) A comparative study between centralized, market-based, and behavioral multirobot coordination approaches. In: Proceedings of the 2003 IEEE/RSJ internaltional conference on intelligent robots and systems, Las Vegas, Nevada, USA, pp 2279–2284

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Ferguson D, Stentz A (2006) Using interpolation to improve path planning: the field d* algorithm. J Field Robot 23(2):79–101

    Article  MATH  Google Scholar 

  13. 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 

  14. Gerlein E, Gonzalez E (2011) Multirobot cooperative model applied to coverage of unknown regions. In: Dr. T. Yasuda (ed) Multi-Robot Systems, Trends and Development. InTech

  15. Gonzalez E, Alvarez O, Diaz 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

  16. Guruprasad K, Wilson Z, Dasgupta P (2012) Complete coverage of an initially unknown environment by multiple robots using voronoi partition. In: Proceedings of the 2nd international conference on advances in control and optimization of dynamical systems. Bengaluru, India

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

    Article  Google Scholar 

  18. Hazon N, Kaminka GA (2005) Redundancy, efficiency and robustness in multi-robot coverage. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, pp 735–741

  19. Hazon N, Kaminka GA (2008) On redundancy, efficiency, and robustness in coverage for multiple robots. Robot Auton Syst 56(1):1102–1114

    Article  Google Scholar 

  20. Hazon N, Mieli F, Kaminka GA (2006) Towards robust on-line multi-robot coverage. In: Proceedings of the 2006 IEEE international conference on robotics and Automation, Orlando, Florida, USA, pp 1710–1715

  21. Jager M, Nebel B (2002) Dynamic decentralized area partitioning for cooperating cleaning robots. In: Proceedings of the 2002 IEEE international conference on robotics and automation, Washington, DC, USA, pp 3577–3582

  22. Koenig S, Liu Y (2001) Terrain coverage with ant robots: a simulation study. In: Proceedings of the International Conference on Autonomous Agents, Montreal, QC, Canada, pp 600–607

  23. Koenig S, Szymanski B, Liu Y (2001) Efficient and inefficient ant coverage methods. Ann Math Artif Intell 31(1):41–76

    Article  Google Scholar 

  24. Kong CS, Peng NA, Rekleitis I (2006) Distributed coverage with multi-robot system. Proceedings of the 2006 IEEE international conference on robotics and automation, Orlando, Florida, USA, pp 2423–2429

  25. Lee JH, Choi JS, Lee BH, Lee KW (2009) Complete coverage path planning for cleaning task using multiple robots. In: Proceedings of the 2009 IEEE international conference on systems, man, and cybernetics, San Antonio, TX, USA, pp 3618–3622

  26. Mendonca M, de Arruda Jr FN (2012) Autonomous navigation system using event driven-fuzzy cognitive maps. Appl Intell 37(2):175–188

    Article  Google Scholar 

  27. Min TW, Yin HK (1998) A decentralized approach for cooperative sweeping by multiple mobile robots. In: Proceedings of the 1998 IEEE/RSJ international conference on intelligent robots and systems, Victoria, B.C., Canada, pp 380–385

  28. 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

  29. Rekleitis I, Lee-Shue V, New AP, Choset H (2004) Limited communication, multi-robot team based coverage. In: Proceedings of the 2004 IEEE international conference on robotics and automation, New Orleans, LA, USA, pp 3462–3468

  30. Rekleitis I, New AP, Rankin ES, Choset H (2008) Efficient boustrophedon multi-robot coverage: an algorithmic approach. J Ann Math Artif Intell 52(1):109–142

    Article  MATH  MathSciNet  Google Scholar 

  31. Russel SJ, Norvig P (2003) Artificial intelligence a modern approach, 2nd edn. Pearson Education

  32. Senthilkumar K, Bharadwaj K (2010) Multi-robot terrain coverage by constructing multiple spanning trees simultaneously. Int J Robot Autom 25(3):195–203

    Google Scholar 

  33. Senthilkumar K, Bharadwaj K (2012) Multi-robot exploration and terrain coverage in an unknown environment. Robot Auton Syst 60(1):123–132

    Article  Google Scholar 

  34. Svennebring J, Koenig S (2003) Trail-laying robots for robust terrain coverage. In: Proceedings of the 2003 IEEE International Conference on Robotics and Automation, Taipei, Taiwan, pp 75–82

  35. Svennebring J, Koenig S (2004) Building terrain-covering ant robots: a feasibility study. Auton Robot 16(1):313–332

    Article  Google Scholar 

  36. Thorpe CE (1984) Path relaxation: Path planning for a mobile robot. In: Proceedings of the AAAI Conference on Artificial Intelligence, Austin, Texas, USA, pp 318–321

  37. Viet HH, Dang VH, Laskar MNU, Chung T (2013) BA*: an online complete coverage algorithm for cleaning robots. Appl Intell 39(2):217–235

    Article  Google Scholar 

  38. Zheng X, Jain S, Koenig S, Kempe D (2005) Multi-robot forest coverage. In: Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, Edmonton, Alberta, Canada, pp 3852–3857

  39. Zheng X, Koenig S, Kempe D, Jain S (2010) Multirobot forest coverage for weighted and unweighted terrain. IEEE Trans Robot 26(6):1018–1031

    Article  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 Information Technology, Vinh University, 182-Le Duan, Vinh City, Nghe An, Vietnam

    Hoang Huu Viet

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

    Viet-Hung Dang

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

    SeungYoon Choi & Tae Choong Chung

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. SeungYoon Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tae Choong Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hoang Huu Viet.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Viet, H.H., Dang, VH., Choi, S. et al. BoB: an online coverage approach for multi-robot systems. Appl Intell 42, 157–173 (2015). https://doi.org/10.1007/s10489-014-0571-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-014-0571-8

Keywords

Search

Navigation