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

DOI10.1007/s10472-009-9121-1zbMath1185.68726OpenAlexW1990184358MaRDI QIDQ1022451

Noa Agmon, Gal A. Kaminka, Noam Hazon

Publication date: 22 June 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9121-1

zbMATH Keywords

multi-robot coverage algorithmteam of robots

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (11)

An information theoretic based integer linear programming approach for the discrete search path planning problem ⋮ Distributed reactive motion control for dense cooperative sweep coverage of corridor environments by swarms of non-holonomic robots ⋮ Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) ⋮ Multi-robot area patrol under frequency constraints ⋮ Intelligent control of unmanned aerial vehicles for improved autonomy ⋮ Efficient Boustrophedon multi-robot coverage: An algorithmic approach ⋮ The giving tree: Constructing trees for efficient offline and online multi-robot coverage ⋮ A framework for multi-robot node coverage in sensor networks ⋮ Multiple UAV exploration of an unknown region ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ An evolutionary approach for the target search problem in uncertain environment

Cites Work

• The giving tree: Constructing trees for efficient offline and online multi-robot coverage
• Competitive on-line coverage of grid environments by a mobile robot
• Spanning-tree based coverage of continuous areas by a mobile robot
• Coverage for robotics -- a survey of recent results
• Unnamed Item
• Unnamed Item

This page was built for publication: The giving tree: Constructing trees for efficient offline and online multi-robot coverage