Coverage for robotics -- a survey of recent results
From MaRDI portal
Publication:2349786
Recommendations
- A survey of multi-robot coverage
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- Spanning-tree based coverage of continuous areas by a mobile robot
- Competitive on-line coverage of grid environments by a mobile robot
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
Cited in
(54)- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
- A geometric approach to deploying robot swarms
- A framework for multi-robot node coverage in sensor networks
- Multiple UAV exploration of an unknown region
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- Distributed sweep coverage algorithm of multi-agent systems using workload memory
- Capacitated arc routing problem with deadheading demands
- Competitive on-line coverage of grid environments by a mobile robot
- Persistent coverage control for a team of agents with collision avoidance
- Spatial coverage in routing and path planning problems
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
- On the robustness of a synchronized multi-robot system
- On optimal coverage of a tree with multiple robots
- Searching for targets of nonuniform size using mixing transformations: constructive upper bounds and limit laws
- Spanning-tree based coverage of continuous areas by a mobile robot
- Decentralized sweep coverage algorithm for multi-agent systems with workload uncertainties
- A method of reactive 3D navigation for a tight surface scan by a nonholonomic mobile robot
- An MILP approach for persistent coverage tasks with multiple robots and performance guarantees
- Kinematic Control of a Robot by Using a Non-autonomous Chaotic System
- Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics
- Approximation algorithms for the single robot line coverage problem
- Coverage path planning algorithms for agricultural field machines
- Equal-Area Locus-Based Convex Polygon Decomposition
- A strategy for exploration with a multi-robot system
- Minimum Time Multi-UGV Surveillance
- Self-triggered coordination of robotic networks for optimal deployment
- scientific article; zbMATH DE number 2096808 (Why is no real title available?)
- Coverage path planning for 3D terrain with constraints on trajectory curvature based on second-order cone programming
- Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles
- Consistent numerical methods for state and control constrained trajectory optimisation with parameter dependency
- A cooperative mobile robot task assignment and coverage planning based on chaos synchronization
- A survey of multi-robot coverage
- A robot coverage algorithm under rectangular decomposition environments
- Coordinated road-network search route planning by a team of UAVs
- Navigation of autonomous vehicles for oil spill cleaning in dynamic and uncertain environments
- Decentralized control of multi-agent systems for swarming with a given geometric pattern
- Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
- An information roadmap method for robotic sensor path planning
- Boundary sketching with asymptotically optimal distance and rotation
- The single robot line coverage problem: Theory, algorithms, and experiments
- Guard games on graphs: keep the intruder out!
- Near-optimal coverage path planning with turn costs
- Estimating the coverage measure and the area explored by a line-sweep sensor on the plane
- Boundary sketching with asymptotically optimal distance and rotation
- Largest unit rectangles inscribed in a convex polygon
- Geometric covering via extraction theorem
- Multi-robot area patrol under frequency constraints
- An algorithm with exact bounds for coverage path planning in UAV-based search and rescue under windy conditions
- Globally convergent path-aware optimization with mobile robots
- Coverage games
- Computing interval-valued coverage probability maps via Monte Carlo method and set-based evaluation
- A local strategy for cleaning expanding cellular domains by simple robots
- Stochastic sensor scheduling via distributed convex optimization
This page was built for publication: Coverage for robotics -- a survey of recent results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349786)
