 Home
 Search Results
 Page 1 of 1
Search for: All records

Total Resources2
 Resource Type

20
 Availability

20
 Author / Contributor
 Filter by Author / Creator


Afshani, Peyman (2)

Buchin, Kevin (2)

Gao, Jie (2)

Nayyeri, Amir (2)

Sarkar, Rik (2)

Wang, Haotian (2)

Yang, HaoTsung (2)

de Berg, Mark (2)

L{\"{o}}ffler, Maarten (1)

Löffler, Maarten (1)

Raichel, Benjamin (1)

Raichel, Benjamn (1)

#Tyler Phillips, Kenneth E. (0)

& Ahmed, Khadija. (0)

& AkcilOkan, O. (0)

& Akuom, D. (0)

& Aleven, V. (0)

& AndrewsLarson, C. (0)

& Archibald, J. (0)

& Attari, S. Z. (0)

 Filter by Editor


Goaoc, Xavier (1)

Kerber, Michael (1)

& Spizer, S. M. (0)

& . Spizer, S. (0)

& Ahn, J. (0)

& Bateiha, S. (0)

& Bosch, N. (0)

& Chen, B. (0)

& Chen, Bodong (0)

& Drown, S. (0)

& Higgins, A. (0)

& Kali, Y. (0)

& RuizArias, P.M. (0)

& S. Spitzer (0)

& Spitzer, S. (0)

& Spitzer, S.M. (0)

:Chaosong Huang, Gang Lu (0)

A. Beygelzimer (0)

A. E. Lischka, E.B. Dyer (0)

A. Ghate, K. Krishnaiyer (0)


Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to nonfederal websites. Their policies may differ from this site.

Goaoc, Xavier ; Kerber, Michael (Ed.)We consider the following surveillance problem: Given a set P of n sites in a metric space and a set R of k robots with the same maximum speed, compute a patrol schedule of minimum latency for the robots. Here a patrol schedule specifies for each robot an infinite sequence of sites to visit (in the given order) and the latency L of a schedule is the maximum latency of any site, where the latency of a site s is the supremum of the lengths of the time intervals between consecutive visits to s. When k = 1 the problem is equivalent to the travelling salesman problem (TSP) and thus it is NPhard. For k ≥ 2 (which is the version we are interested in) the problem becomes even more challenging; for example, it is not even clear if the decision version of the problem is decidable, in particular in the Euclidean case. We have two main results. We consider cyclic solutions in which the set of sites must be partitioned into 𝓁 groups, for some 𝓁 ≤ k, and each group is assigned a subset of the robots that move along the travelling salesman tour of the group atmore »

Afshani, Peyman ; de Berg, Mark ; Buchin, Kevin ; Gao, Jie ; Löffler, Maarten ; Nayyeri, Amir ; Raichel, Benjamn ; Sarkar, Rik ; Wang, Haotian ; Yang, HaoTsung ( , International Workshop on the Algorithmic Foundations of Robotics)