Fig. 3From: Convergence and covering on graphs for wait-free robotsEdge covering for two robots. Each robot moves to a central vertex that preserves the odd-path path invariantBack to article page