Pages that link to "Item:Q2349786"

The following pages link to Coverage for robotics -- a survey of recent results (Q2349786):

Displaying 37 items.

• Self-triggered coordination of robotic networks for optimal deployment (Q445126) (← links)
• Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles (Q513626) (← links)
• Decentralized control of multi-agent systems for swarming with a given geometric pattern (Q552208) (← links)
• An information roadmap method for robotic sensor path planning (Q614694) (← links)
• Guard games on graphs: keep the intruder out! (Q650877) (← links)
• Multi-robot area patrol under frequency constraints (Q693285) (← links)
• A local strategy for cleaning expanding cellular domains by simple robots (Q888433) (← links)
• Stochastic sensor scheduling via distributed convex optimization (Q895287) (← links)
• Efficient Boustrophedon multi-robot coverage: An algorithmic approach (Q1022450) (← links)
• The giving tree: Constructing trees for efficient offline and online multi-robot coverage (Q1022451) (← links)
• A geometric approach to deploying robot swarms (Q1022469) (← links)
• A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
• Multiple UAV exploration of an unknown region (Q1022476) (← links)
• Distributed sweep coverage algorithm of multi-agent systems using workload memory (Q1729134) (← links)
• Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
• Persistent coverage control for a team of agents with collision avoidance (Q2012005) (← links)
• A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
• On the robustness of a synchronized multi-robot system (Q2175045) (← links)
• On optimal coverage of a tree with multiple robots (Q2184041) (← links)
• Searching for targets of nonuniform size using mixing transformations: constructive upper bounds and limit laws (Q2348243) (← links)
• Decentralized sweep coverage algorithm for multi-agent systems with workload uncertainties (Q2356672) (← links)
• A method of reactive 3D navigation for a tight surface scan by a nonholonomic mobile robot (Q2374475) (← links)
• An MILP approach for persistent coverage tasks with multiple robots and performance guarantees (Q2667534) (← links)
• Kinematic Control of a Robot by Using a Non-autonomous Chaotic System (Q2977658) (← links)
• Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics (Q3132937) (← links)
• Approximation Algorithms for the Single Robot Line Coverage Problem (Q3382005) (← links)
• Coverage path planning algorithms for agricultural field machines (Q3394266) (← links)
• Equal-Area Locus-Based Convex Polygon Decomposition (Q3511394) (← links)
• A Strategy for Exploration with a Multi-robot System (Q3564547) (← links)
• Minimum Time Multi-UGV Surveillance (Q3589730) (← links)
• Consistent numerical methods for state and control constrained trajectory optimisation with parameter dependency (Q5165337) (← links)
• A COOPERATIVE MOBILE ROBOT TASK ASSIGNMENT AND COVERAGE PLANNING BASED ON CHAOS SYNCHRONIZATION (Q5306422) (← links)
• Coordinated road-network search route planning by a team of UAVs (Q5410832) (← links)
• Navigation of autonomous vehicles for oil spill cleaning in dynamic and uncertain environments (Q5494496) (← links)
• Clustered coverage orienteering problem of unmanned surface vehicles for water sampling (Q6072147) (← links)
• Boundary sketching with asymptotically optimal distance and rotation (Q6589855) (← links)
• Largest unit rectangles inscribed in a convex polygon (Q6639378) (← links)