We investigate the problem of coordinatingkrobots to patrolnsites arranged in a tree structure. The objective is to minimise the maximum latency of any site, defined as the longest time between two consecutive visits. Assuming a uniform robot speed, we propose an O(n log n) algorithm that efficiently computes an optimal patrol schedule for star-shaped trees.
Chen et al. (Mon,) studied this question.