Coverage for robotics -- a survey of recent results
From MaRDI portal
Publication:2349786
DOI10.1023/A:1016639210559zbMath1314.68317OpenAlexW1544032329MaRDI QIDQ2349786
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:1016639210559
Related Items
A method of reactive 3D navigation for a tight surface scan by a nonholonomic mobile robot ⋮ A COOPERATIVE MOBILE ROBOT TASK ASSIGNMENT AND COVERAGE PLANNING BASED ON CHAOS SYNCHRONIZATION ⋮ On the robustness of a synchronized multi-robot system ⋮ An MILP approach for persistent coverage tasks with multiple robots and performance guarantees ⋮ On optimal coverage of a tree with multiple robots ⋮ An information roadmap method for robotic sensor path planning ⋮ A local strategy for cleaning expanding cellular domains by simple robots ⋮ Clustered coverage orienteering problem of unmanned surface vehicles for water sampling ⋮ Stochastic sensor scheduling via distributed convex optimization ⋮ Boundary sketching with asymptotically optimal distance and rotation ⋮ Equal-Area Locus-Based Convex Polygon Decomposition ⋮ Self-triggered coordination of robotic networks for optimal deployment ⋮ Kinematic Control of a Robot by Using a Non-autonomous Chaotic System ⋮ Guard games on graphs: keep the intruder out! ⋮ Distributed sweep coverage algorithm of multi-agent systems using workload memory ⋮ A Strategy for Exploration with a Multi-robot System ⋮ Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles ⋮ Coordinated road-network search route planning by a team of UAVs ⋮ Consistent numerical methods for state and control constrained trajectory optimisation with parameter dependency ⋮ Multi-robot area patrol under frequency constraints ⋮ Capacitated arc routing problem with deadheading demands ⋮ Persistent coverage control for a team of agents with collision avoidance ⋮ Decentralized control of multi-agent systems for swarming with a given geometric pattern ⋮ Minimum Time Multi-UGV Surveillance ⋮ Approximation Algorithms for the Single Robot Line Coverage Problem ⋮ 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 ⋮ Coverage path planning algorithms for agricultural field machines ⋮ Navigation of autonomous vehicles for oil spill cleaning in dynamic and uncertain environments ⋮ Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics ⋮ Searching for targets of nonuniform size using mixing transformations: constructive upper bounds and limit laws ⋮ A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning ⋮ Decentralized sweep coverage algorithm for multi-agent systems with workload uncertainties
