A survey of multi-robot coverage
From MaRDI portal
Recommendations
- Coverage for robotics -- a survey of recent results
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- A framework for multi-robot node coverage in sensor networks
- Unifying Geometric, Probabilistic, and Potential Field Approaches to Multi-robot Coverage Control
Cited in
(16)- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
- Distributed multirobot exploration, mapping, and task allocation
- A framework for multi-robot node coverage in sensor networks
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- Spatial coverage in routing and path planning problems
- Coverage for robotics -- a survey of recent results
- Multi-robots Gaussian estimation and coverage control: from client-server to peer-to-peer architectures
- An MILP approach for persistent coverage tasks with multiple robots and performance guarantees
- Unifying Geometric, Probabilistic, and Potential Field Approaches to Multi-robot Coverage Control
- scientific article; zbMATH DE number 5371316 (Why is no real title available?)
- A strategy for exploration with a multi-robot system
- Coverage Optimization and Spatial Load Balancing by Robotic Sensor Networks
- Sweep coverage of discrete time multi-robot networks with general topologies
- Near-optimal coverage path planning with turn costs
- Multi-robot area patrol under frequency constraints
This page was built for publication: A survey of multi-robot coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318747)
