Live Exploration of Dynamic Rings
Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola, Santoro

TL;DR
This paper explores decentralized algorithms for agents to explore dynamic ring graphs under different synchrony models, analyzing how factors like anonymity and knowledge affect feasibility and complexity.
Contribution
It introduces the first study of semi-synchronous exploration of dynamic graphs by mobile agents, providing constructive protocols and feasibility maps.
Findings
Semi-synchronous exploration is possible with fewer agents than fully-synchronous models.
Feasibility depends on knowledge of the ring size and presence of chirality.
Protocols are asymptotically optimal in terms of agent movements.
Abstract
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the main focus has been on graphs that are static; that is, the topology is either invariant in time or subject to localized changes. The few studies on exploration of dynamic graphs have been almost all limited to the centralized case (i.e., assuming complete a priori knowledge of the changes and the times of their occurrence). We investigate the decentralized exploration of dynamic graphs (i.e., when the agents are unaware of the location and timing of the changes) focusing, in this paper, on dynamic systems whose underlying graph is a ring. We first consider the fully-synchronous systems traditionally assumed in the literature; i.e., all agents are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
