Access the full text.
Sign up today, get DeepDyve free for 14 days.
V Yanovski, IA Wagner, AM Bruckstein (2003)
A distributed ant algorithm for efficiently patrolling a networkAlgorithmica, 37
Suppose we want to patrol a fence (line segment) using $$k$$ k mobile agents with given speeds $$v _1$$ v 1 , ..., $$v _k$$ v k 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$$ ( v 1 + ⋯ + v k ) / 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$$ v i / 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 .
Distributed Computing – Springer Journals
Published: Aug 20, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.