Efficient live exploration of a dynamic ring with mobile robots
From MaRDI portal
Publication:6069843
DOI10.1016/j.tcs.2023.114201MaRDI QIDQ6069843
Anisur Rahaman Molla, William K. jun. Moses, Subhrangsu Mandal
Publication date: 17 November 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
distributed algorithmsmobile robotsmulti-agent systemsexplorationuniform deploymentring graphdynamic graph
Cites Work
- Unnamed Item
- Traveling salesman problems in temporal graphs
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
- Anonymous graph exploration without collision by mobile robots
- Piecemeal graph exploration by a mobile robot.
- On the exploration of time-varying networks
- Live exploration with mobile robots in a dynamic ring (revisited)
- Distributed exploration of dynamic rings
- Fast collaborative graph exploration
- Impossibility of gathering by a set of autonomous mobile robots
- Map construction of unknown graphs by multiple agents
- Graph exploration by a finite automaton
- On temporal graph exploration
- Distributed computation in dynamic networks
- Optimal constrained graph exploration
- UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Exploring an unknown graph
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- Why Robots Need Maps
- Probability and Computing
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- Tight bounds on distributed exploration of temporal graphs
- Gathering in dynamic rings
This page was built for publication: Efficient live exploration of a dynamic ring with mobile robots
