Multi-robot area patrol under frequency constraints
From MaRDI portal
Publication:693285
DOI10.1007/S10472-010-9193-YzbMATH Open1253.68317OpenAlexW3158940377MaRDI QIDQ693285FDOQ693285
Authors: Yehuda Elmaliach, Noa Agmon, Gal A. Kaminka 
Publication date: 7 December 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-010-9193-y
Recommendations
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- Distributed patrolling with two-speed robots (and an application to transportation)
- Approximation algorithms for multi-robot patrol-scheduling with min-max latency
- A survey of multi-robot coverage
- scientific article; zbMATH DE number 1954195
- Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
Cites Work
- A distributed ant algorithm for efficiently patrolling a network
- Competitive on-line coverage of grid environments by a mobile robot
- Spanning-tree based coverage of continuous areas by a mobile robot
- Coverage for robotics -- a survey of recent results
- Title not available (Why is that?)
- Efficiently searching a graph by a smell-oriented vertex process
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
- Title not available (Why is that?)
Cited In (16)
- Guard games on graphs: keep the intruder out!
- Monitoring the plane with rotating radars
- Of robot ants and elephants: a computational comparison
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- Optimal control for multi-agent persistent monitoring
- Persistent awareness coverage control for mobile sensor networks
- Joint search with self-interested agents and the failure of cooperation enhancers
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
- Multi-robot adversarial patrolling strategies via lattice paths
- Evasive Navigation of an Autonomous Mobile Robot in Hostile Unknown Environments
- Multi-robot adversarial patrolling: handling sequential attacks
- CONTINUOUS SURVEILLANCE OF POINTS BY ROTATING FLOODLIGHTS
This page was built for publication: Multi-robot area patrol under frequency constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693285)
