On fence patrolling by mobile agents

zbMATH Open1307.90149MaRDI QIDQ405281FDOQ405281

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

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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)

Abstract: Suppose that a fence needs to be protected (perpetually) by $k$ mobile agents with maximum speeds $v_1,ldots,v_k$ so that no point on the fence is left unattended for more than a given amount of time. The problem is to determine if this requirement can be met, and if so, to design a suitable patrolling schedule for the agents. Alternatively, one would like to find a schedule that minimizes the emph{idle time}, that is, the longest time interval during which some point is not visited by any agent. We revisit this problem, introduced by Czyzowicz et al.(2011), and discuss several strategies for the cases where the fence is an open and a closed curve, respectively. In particular: (i) we disprove a conjecture by Czyzowicz et al. regarding the optimality of their Algorithm $mathcal{A}_2$ for unidirectional patrolling of a closed fence; (ii) we present an algorithm with a lower idle time for patrolling an open fence, improving an earlier result of Kawamura and Kobayashi.

Recommendations

• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• Simple strategies versus optimal schedules in multi-agent patrolling
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds

Cited in

(11)

• Problems on track runners
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• Simple strategies versus optimal schedules in multi-agent patrolling
• Patrolling a perimeter
• Distributed patrolling with two-speed robots (and an application to transportation)
• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• Computing the \(k\)-resilience of a synchronized multi-robot system
• Rowmotion on fences
• Optimal strategies for patrolling fences
• Patrolling by robots equipped with visibility
• Approximation algorithms for multi-robot patrol-scheduling with min-max latency

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405281)