### Abstract

Suppose we want to patrol a fence (line segment) using $$k$$k mobile agents with given speeds $$v _1$$v1,.., $$v _k$$vk so that every point on the fence is visited by an agent at least once in every unit time period. Czyzowicz et al. conjectured that the maximum length of the fence that can be patrolled is $$(v _1 + \cdots + v _k)/2$$(v1+⋯+vk)/2, which is achieved by the simple strategy where each agent $$i$$i moves back and forth in a segment of length $$v _i / 2$$vi/2. We disprove this conjecture by a counterexample involving $$k = 6$$k=6 agents. We also show that the conjecture is true for $$k \le 3$$k≤3.

Original language | English |
---|---|

Pages (from-to) | 147-154 |

Number of pages | 8 |

Journal | Distributed Computing |

Volume | 28 |

Issue number | 2 |

DOIs | |

Publication status | Published - Jan 1 2015 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Fence patrolling by mobile agents with distinct speeds'. Together they form a unique fingerprint.

## Cite this

Kawamura, A., & Kobayashi, Y. (2015). Fence patrolling by mobile agents with distinct speeds.

*Distributed Computing*,*28*(2), 147-154. https://doi.org/10.1007/s00446-014-0226-3