Self-stabilizing robots in highly dynamic environments
From MaRDI portal
Publication:5918187
DOI10.1007/978-3-319-49259-9_5zbMath1425.68411arXiv1609.06161OpenAlexW4391919621WikidataQ128842288 ScholiaQ128842288MaRDI QIDQ5918187
Marjorie Bournat, Swan Dubois, Ajoy K. Datta
Publication date: 22 November 2019
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.06161
self-stabilizing algorithmevolving graphsfully synchronous robotshighly dynamic graphsperpetual exploration
Related Items
Self-stabilizing systems in spite of high dynamics, Exploration of dynamic tori by multiple agents, Exploration of dynamic networks: tight bounds on the number of agents, Computing parameters of sequence-based dynamic graphs, Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring, Gathering in dynamic rings, Self-stabilizing robots in highly dynamic environments
Cites Work
- Unnamed Item
- Remembering without memory: tree exploration by asynchronous oblivious robots
- How many oblivious robots can explore a line
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
- Distributed computation in dynamic networks
- Network Exploration by Silent and Oblivious Robots
- Exclusive Perpetual Ring Exploration without Chirality
- Exploration of Periodically Varying Graphs
- Self-stabilizing systems in spite of distributed control
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Tree exploration with little memory
- Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Gathering in dynamic rings
- Self-stabilizing robots in highly dynamic environments
