Spanning-tree based coverage of continuous areas by a mobile robot
From MaRDI portal
Publication:2349784
DOI10.1023/A:1016610507833zbMath1314.68318OpenAlexW1873425142MaRDI QIDQ2349784
Publication date: 17 June 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1016610507833
Related Items (15)
Worst-case optimal exploration of terrains with obstacles ⋮ Optimality and competitiveness of exploring polygons by mobile robots ⋮ Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) ⋮ Optimal multirobot coverage path planning: ideal-shaped spanning tree ⋮ Multi-robot area patrol under frequency constraints ⋮ Intelligent control of unmanned aerial vehicles for improved autonomy ⋮ The giving tree: Constructing trees for efficient offline and online multi-robot coverage ⋮ Classifying the multi robot path finding problem into a quadratic competitive complexity class ⋮ A framework for multi-robot node coverage in sensor networks ⋮ Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm ⋮ Multiple UAV exploration of an unknown region ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Group search of the plane with faulty robots ⋮ The Application of Multi-agent Robotic Systems for Earthquake Rescue ⋮ Competitive on-line coverage of grid environments by a mobile robot
This page was built for publication: Spanning-tree based coverage of continuous areas by a mobile robot
