Fast collaborative graph exploration
From MaRDI portal
Publication:2347797
DOI10.1016/j.ic.2014.12.005zbMath1327.68177OpenAlexW2015331738MaRDI QIDQ2347797
Adrian Kosowski, Dariusz Dereniowski, Dominik Pająk, Yann Disser, Przemysław Uznański
Publication date: 9 June 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2014.12.005
Related Items
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots, An improved lower bound for competitive graph exploration, Memory optimal dispersion by anonymous mobile robots, Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots, Off-line exploration of rectangular cellular environments with a rectangular obstacle, Collaborative Exploration by Energy-Constrained Mobile Robots, Multi-round cooperative search games with multiple players, Efficient live exploration of a dynamic ring with mobile robots, The beachcombers' problem: walking and searching with mobile robots, Collaborative dispersion by silent robots, Memory optimal dispersion by anonymous mobile robots, Collaborative delivery on a fixed path with homogeneous energy-constrained agents, Linear search by a pair of distinct-speed robots, Gossiping by energy-constrained mobile agents in tree networks, The simple grid polygon exploration problem, Unnamed Item, Collaborative exploration of trees by energy-constrained mobile robots, A general lower bound for collaborative tree exploration, Beachcombing on strips and islands, Time versus cost tradeoffs for deterministic rendezvous in networks, Collaborative delivery with energy-constrained mobile robots, Near-gathering of energy-constrained mobile agents, Linear Search by a Pair of Distinct-Speed Robots, Dispersion of mobile robots on directed anonymous graphs, Graph exploration by energy-sharing mobile agents
Cites Work
- Worst-case optimal exploration of terrains with obstacles
- Optimal graph exploration without good maps
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- Competitive on-line coverage of grid environments by a mobile robot
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Online Exploration of All Vertices in a Simple Polygon
- Optimal constrained graph exploration
- An Improved Strategy for Exploring a Grid Polygon
- Collective tree exploration
- Exploring Unknown Undirected Graphs
- Fast Collaborative Graph Exploration
- Why Robots Need Maps
- Smart Robot Teams Exploring Sparse Trees
