Grid exploration by a swarm of autonomous robots with minimum repetitions
From MaRDI portal
Publication:2676467
DOI10.1016/j.tcs.2022.08.029OpenAlexW4294191027WikidataQ114129023 ScholiaQ114129023MaRDI QIDQ2676467
Srabani Mukhopadhyaya, Deepanwita Das, Madhumita Sardar
Publication date: 27 September 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.029
Related Items (1)
Cites Work
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Optimal graph exploration without good maps
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Anonymous graph exploration without collision by mobile robots
- The power of a pebble: Exploring and mapping directed graphs
- Ring exploration with myopic luminous robots
- Infinite grid exploration by disoriented robots
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Optimal constrained graph exploration
- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
- Exclusive Perpetual Ring Exploration without Chirality
- Hamilton Paths in Grid Graphs
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
This page was built for publication: Grid exploration by a swarm of autonomous robots with minimum repetitions
