Skip to main content
Log in

The giving tree: constructing trees for efficient offline and online multi-robot coverage

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every robot, such that the union of all paths generates a full coverage of the terrain and the total coverage time is minimized. A method underlying several coverage algorithms, suggests the use of spanning trees as base for creating coverage paths. However, overall performance of the coverage is heavily dependent on the given spanning tree. This paper focuses on the challenge of constructing a coverage spanning tree for both online and offline coverage that minimizes the time to complete coverage. Our general approach involves building a spanning tree by growing sub-trees from the initial location of the robots. This paper first describes a polynomial time tree-construction algorithm for offline coverage. The use of this algorithm is shown by extensive simulations to significantly improve the coverage time of the terrain even when used as a basis for a simple, inefficient, coverage algorithm. Second, this paper provides an algorithm for online coverage of a finite terrain based on spanning-trees, that is complete and guarantees linear time coverage with no redundancy in the coverage. In addition, the solutions proposed by this paper guarantee robustness to failing robots: the offline trees are used as base for robust multi-robot coverage algorithms, and the online algorithm is proven to be robust.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Acar, E.U., Choset, H.: Robust sensor-based coverage of unstructured environments. In: International Conference on Intelligent Robots and Systems, pp. 61–68, Maui, 29 October–3 November 2001

  2. Agmon, N., Hazon, N., Kaminka, G.A.: Constructing spanning trees for efficient multi-robot coverage. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Orlando, 15–19 May 2006

  3. Batalin, M.A., Sukhatme, G.S.: Spreading out: a local approach to multirobot coverage. In: Proc. of the 6th Internat. Symposium on Distributed Autonomous Robotic Systems, pp. 373–382, Fukuoka, 25–27 June 2002

  4. Butler, Z.J., Rizzi, A., Hollis, R.L.: Complete distributed coverage of rectilinear environments. In: Workshop on the Algorithmic Foundations of Robotics, Hanover, March 2000

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

    Article  Google Scholar 

  6. Colegrave, J., Branch, A.: A case study of autonomous household vacuum cleaner. In: AIAA/NASA CIRFFSS Conference on Intelligent Robots for Factory Field, Service, and Space, Houston, 20–24 March 1994

  7. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT, Cambridge (1990)

    Google Scholar 

  8. Ferranti, E., Trigoni, N., Levene, M.: Brick & mortar: an on-line multiagent exploration algorithm. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Rome, 10–14 April 2007

  9. Friendly Robotics®, Ltd.: Friendly robotics vacuum cleaner. http://www.friendlyrobotics.com/friendly vac/ (2009)

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

    Article  Google Scholar 

  11. Gabriely, Y., Rimon, E.: Competitive on-line coverage of grid environments by a mobile robot. Comput. Geom. 24, 197–224 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gerkey, B.P., Vaughan, R.T., Howard, A.: The player/stage project: Tools for multi-robot and distributed sensor systems. In: Proceedings of the International Conference on Advanced Robotics, pp. 317–323, Coimbra, July 2003

  13. Hazon, N., Kaminka, G.A.: Redundancy, efficiency and robustness in multi-robot coverage. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Barcelona, 18–22 April 2005

  14. Hazon, N., Kaminka, G.A.: On redundancy, efficiency, and robustness in coverage for multiple robots. Robot. Autonom. Syst. 56(12), 1102–1114 (2008)

    Article  Google Scholar 

  15. Hedberg, S.: Robots cleaning up hazardous waste. AI Expert 5, 20–24 (1995)

    Google Scholar 

  16. Huang, Y.Y., Cao, Z.L., Hall, E.L.: Region filling operations for mobile robot using computer graphics. In: Proceedings of the IEEE Conference on Robotics and Automation, pp. 1607–1614, San Francisco, April 1986

  17. Kong, C.S., New, A.P., Rekleitis, I.: Distributed coverage with multi-robot system. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Orlando, 15–19 May 2006

  18. Osherovich, E., Yanovski, V., Wagner I.A., Bruckstein, A.M.: Robust and efficient covering of unknown continuous domains with simple, ant-like a(ge)nts. Technical report, Technion, Israel (2007)

  19. Rekleitis, I., Dudek, G., Milios, E.: Multi-robot exploration of an unknown environment, efficiently reducing the odometry error. In: International Joint Conference in Artificial Intelligence (IJCAI), vol 2, pp. 1340–1345. Morgan Kaufmann, Nagoya (1997)

  20. Rekleitis, I., Dudek, G., Milios, E.: Multi-robot collaboration for robust exploration. Ann. Math. Artif. Intell. 31, 7–40 (2001)

    Article  Google Scholar 

  21. Rekleitis, I., Lee-Shue V., Peng New, A., Choset, H.: Limited communication, multi-robot team based coverage. InL IEEE International Conference on Robotics and Automation, pp. 3462–3468. IEEE, Piscataway (2004)

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

    Article  Google Scholar 

  23. Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Mac vs. pc determinism and randomness as complementary approaches to robotic exploration of continuous unknown domains. Int. J. Rob. Res. 19(1), 12–31 (2000)

    Article  Google Scholar 

  24. Zheng, X., Jain, S., Koenig, S., Kempe, D.: Multi-robot forest coverage. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Edmonton, 2–6 August 2005

Download references

Author information

Authors and Affiliations

Authors

Consortia

Corresponding author

Correspondence to Noa Agmon.

Additional information

This work was funded in part by Israel’s Ministry of Science and Technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agmon, N., Hazon, N., Kaminka, G.A. et al. The giving tree: constructing trees for efficient offline and online multi-robot coverage. Ann Math Artif Intell 52, 143–168 (2008). https://doi.org/10.1007/s10472-009-9121-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-009-9121-1

Keywords

Mathematics Subject Classification (2000)

Navigation