Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)
From MaRDI portal
Publication:2980175
DOI10.1007/978-3-319-53982-9_5zbMath1360.90125OpenAlexW2589038299MaRDI QIDQ2980175
Fraser MacQuarrie, Dominik Pająk, Konstantinos Georgiou, Jurek Czyzowicz, Evangelos Kranakis
Publication date: 28 April 2017
Published in: Operations Research and Enterprise Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53982-9_5
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Automated systems (robots, etc.) in control theory (93C85)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On fence patrolling by mobile agents
- Multi-robot area patrol under frequency constraints
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
- Limit behavior of the multi-agent rotor-router system
- A distributed ant algorithm for efficiently patrolling a network
- The computational power of population protocols
- Spanning-tree based coverage of continuous areas by a mobile robot
- Fence patrolling by mobile agents with distinct speeds
- Computation in networks of passively mobile finite-state sensors
- Patrolling Games
- Bounds on the Cover Time of Parallel Rotor Walks
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Distributed Computing by Mobile Robots: Gathering
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
- On utilizing speed in networks of mobile agents
- Localization for a System of Colliding Robots
This page was built for publication: Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)