Complete distributed coverage of rectilinear environments
From MaRDI portal
Recommendations
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- A robot coverage algorithm under rectangular decomposition environments
- Approximation algorithms for distributed multi-robot coverage in non-convex environments
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
- Distributed coverage of nonconvex environments
Cited in
(13)- 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
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
- Decentralized sweep coverage algorithm for multi-agent systems with workload uncertainties
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
- Multi-agent deployment for visibility coverage in polygonal environments with holes
- Distributed coverage of nonconvex environments
- Approximation algorithms for distributed multi-robot coverage in non-convex environments
- A robot coverage algorithm under rectangular decomposition environments
- Ant-sweep, a decentral strategy for cooperative cleaning in expanding domains
- Distributed reactive motion control for dense cooperative sweep coverage of corridor environments by swarms of non-holonomic robots
- Static and expanding grid coverage with ant robots: complexity results
This page was built for publication: Complete distributed coverage of rectilinear environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2749769)
