Efficient Boustrophedon multi-robot coverage: An algorithmic approach
From MaRDI portal
Recommendations
- Approximation algorithms for distributed multi-robot coverage in non-convex environments
- A survey of multi-robot coverage
- Unifying Geometric, Probabilistic, and Potential Field Approaches to Multi-robot Coverage Control
- A robot coverage algorithm under rectangular decomposition environments
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- A framework for multi-robot node coverage in sensor networks
- On optimal coverage of a tree with multiple robots
Cites work
- scientific article; zbMATH DE number 1055930 (Why is no real title available?)
- scientific article; zbMATH DE number 1974123 (Why is no real title available?)
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- An opportunistic global path planner
- Complete distributed coverage of rectilinear environments
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Coverage for robotics -- a survey of recent results
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
Cited in
(18)- An MILP approach for persistent coverage tasks with multiple robots and performance guarantees
- Distributed reactive motion control for dense cooperative sweep coverage of corridor environments by swarms of non-holonomic robots
- A robot coverage algorithm under rectangular decomposition environments
- Near-optimal coverage path planning with turn costs
- Coverage path planning algorithms for agricultural field machines
- An evolutionary approach for the target search problem in uncertain environment
- An information theoretic based integer linear programming approach for the discrete search path planning problem
- Efficient exploration of unknown indoor environments using a team of mobile robots
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
- A survey of multi-robot coverage
- Approximation algorithms for distributed multi-robot coverage in non-convex environments
- An innovative multi-agent search-and-rescue path planning approach
- Complete distributed coverage of rectilinear environments
- Coverage for robotics -- a survey of recent results
- Static target search path planning optimization with heterogeneous agents
- Unifying Geometric, Probabilistic, and Potential Field Approaches to Multi-robot Coverage Control
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
This page was built for publication: Efficient Boustrophedon multi-robot coverage: An algorithmic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1022450)
