Skip to main content

A Minimalist Solution to the Multi-robot Barrier Coverage Problem

  • Conference paper
  • First Online:
Towards Autonomous Robotic Systems (TAROS 2021)

Abstract

This paper addresses the multi-robot barrier coverage problem. It presents a group of memory-less robots that encircle a group of herd agents, by moving along a polygonal barrier. The results, produced from simulations in CoppeliaSim, demonstrate high retention of herd agents, and robust performance across a range of simulated scenarios.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Gauci, M., Chen, J., Li, W., Dodd, T.J., Groß, R.: Self-organized aggregation without computation. Int. J. Robot. Res. 33(8), 1145–1161 (2014)

    Article  Google Scholar 

  2. Gonçalves, et al.: The e-puck, a robot designed for education in engineering. In: 9th Conference on Autonomous Robot Systems and Competitions, vol. 1, pp. 59–65 (2009)

    Google Scholar 

  3. Green, T., et al.: A minimalist solution to the multi-robot barrier coverage problem (supplementary video material) (2021). https://doi.org/10.15131/shef.data.15082653

  4. Howard, A., Matarić, M.J., Sukhatme, G.S.: Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem. In: Asama, H., Arai, T., Fukuda, T., Hasegawa, T. (eds.) Distributed Autonomous Robotic Systems 5, pp. 299–308. Springer, Tokyo (2002). https://doi.org/10.1007/978-4-431-65941-9_30

    Chapter  Google Scholar 

  5. Lien, J.M., Bayazit, O.B., Sowell, R.T., Rodriguez, S., Amato, N.M.: Shepherding behaviors. In: 2004 Proceedings of the IEEE International Conference on Robotics and Automation. ICRA 2004, vol. 4, pp. 4159–4164. IEEE (2004)

    Google Scholar 

  6. Nguyen, T.M., Li, X., Xie, L.: Barrier coverage by heterogeneous sensor network with input saturation. In: 11th Asian Control Conference, pp. 1719–1724 (2017)

    Google Scholar 

  7. Strömbom, D., et al.: Solving the shepherding problem: heuristics for herding autonomous, interacting agents. J. R. Soc. Interface 11(100), 20140719 (2014)

    Article  Google Scholar 

  8. Vaughan, R., Sumpter, N., Henderson, J., Frost, A., Cameron, S.: Experiments in automatic flock control. Robot. Auton. Syst. 31(1–2), 109–117 (2000)

    Article  Google Scholar 

  9. Zahugi, E.M.H., Shanta, M.M., Prasad, T.: Design of multi-robot system for cleaning up marine oil spill. Int. J. Adv. Inf. Technol. 2(4), 33–43 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Thomas Green or Roderich Groß .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Green, T. et al. (2021). A Minimalist Solution to the Multi-robot Barrier Coverage Problem. In: Fox, C., Gao, J., Ghalamzan Esfahani, A., Saaj, M., Hanheide, M., Parsons, S. (eds) Towards Autonomous Robotic Systems. TAROS 2021. Lecture Notes in Computer Science(), vol 13054. Springer, Cham. https://doi.org/10.1007/978-3-030-89177-0_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89177-0_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89176-3

  • Online ISBN: 978-3-030-89177-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics