A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs
Springer Tracts in Advanced Robotics
In this paper, we consider the problem of planning a path for a robot to monitor a known set of features of interest in an environment. We represent the environment as a vertex-and edge-weighted graph, where vertices represent features or regions of interest. The edge weights give travel times between regions, and the vertex weights give the importance of each region. If the robot repeatedly performs a closed walk on the graph, then we can define the latency of a vertex to be the maximum timedoi:10.1007/978-3-642-36279-8_9 fatcat:3abegujxk5cvrjx3ovosp7oopa