Exploration of dynamic tori by multiple agents

DOI10.1016/J.TCS.2020.11.004MaRDI QIDQ2216438zbMATH OpenOpenAlexFDO

Authors Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa

Publication date 16 December 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.11.004

zbMATH Keywords

dynamic networksdistributed algorithmsexplorationmobile agentslink presence detection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Distributed exploration of dynamic rings
• Exploring a Dynamic Ring Without Landmark
• Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
• Deterministic network exploration by anonymous silent agents with local traffic reports
• Live exploration with mobile robots in a dynamic ring (revisited)

Cites work

• Exploration of constantly connected dynamic graphs based on cactuses
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• Exploring an unknown dangerous graph with a constant number of tokens
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Mobile agents in distributed computing: network exploration
• On the exploration of time-varying networks
• The complexity of data aggregation in directed networks

Cited in

(9)

• Black hole search in dynamic cactus graph
• Cops \& robber on periodic temporal graphs: characterization and improved bounds
• Beyond rings: gathering in 1-interval connected graphs
• Optimal torus exploration by oblivious robots
• Exploration of dynamic cactuses with sub-logarithmic overhead
• Exploration of \(k\)-edge-deficient temporal graphs
• Exploring a dynamic ring without landmark
• Exploration of \(k\)-edge-deficient temporal graphs
• Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view

This page was built for publication: Exploration of dynamic tori by multiple agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216438)