On fence patrolling by mobile agents

zbMath1307.90149arXiv1401.6070MaRDI QIDQ405281

Csaba D. Tóth, Anirban Ghosh, Adrian Dumitrescu

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.6070

zbMATH Keywords

approximation algorithmidle timemulti-agent patrolling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Agent technology and artificial intelligence (68T42)

Related Items (9)

When patrolmen become corrupted: monitoring a graph using faulty mobile robots ⋮ Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling ⋮ Simple strategies versus optimal schedules in multi-agent patrolling ⋮ Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) ⋮ Unnamed Item ⋮ Computing the \(k\)-resilience of a synchronized multi-robot system ⋮ Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency ⋮ Problems on track runners ⋮ Fence patrolling by mobile agents with distinct speeds

This page was built for publication: On fence patrolling by mobile agents