Fast collaborative graph exploration
From MaRDI portal
Publication:2347797
Recommendations
Cites work
- An improved strategy for exploring a grid polygon
- Collective tree exploration
- Competitive on-line coverage of grid environments by a mobile robot
- Exploring Unknown Undirected Graphs
- Fast collaborative graph exploration
- Online exploration of all vertices in a simple polygon
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Optimal constrained graph exploration
- Optimal graph exploration without good maps
- Piecemeal graph exploration by a mobile robot.
- Smart Robot Teams Exploring Sparse Trees
- The power of a pebble: Exploring and mapping directed graphs
- Why Robots Need Maps
- Worst-case optimal exploration of terrains with obstacles
Cited in
(45)- Linear search by a pair of distinct-speed robots
- Gossiping by energy-constrained mobile agents in tree networks
- Balanced parallel exploration of orthogonal regions
- The simple grid polygon exploration problem
- Dispersion of mobile robots on directed anonymous graphs
- Graph exploration by energy-sharing mobile agents
- Multi-round cooperative search games with multiple players
- Minimizing the cost of team exploration
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Beachcombing on strips and islands
- Collision-free network exploration
- Using a collective of agents for exploration of undirected graphs
- Linear search by a pair of distinct-speed robots
- Collaborative Exploration by Energy-Constrained Mobile Robots
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Off-line exploration of rectangular cellular environments with a rectangular obstacle
- Multi-round cooperative search games with multiple players
- Exploration of Time-Varying Connected Graphs with Silent Agents
- Tight bounds for undirected graph exploration with pebbles and multiple agents
- Fast collaborative graph exploration
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents
- A general lower bound for collaborative tree exploration
- Near-gathering of energy-constrained mobile agents
- A general lower bound for collaborative tree exploration
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Efficient live exploration of a dynamic ring with mobile robots
- Memory optimal dispersion by anonymous mobile robots
- Collaborative dispersion by silent robots
- Fast dispersion of mobile robots on arbitrary graphs
- Efficient graph exploration
- Energy constrained depth first search
- Collision-free exploration by mobile agents using pebbles
- Exploration of graphs with excluded minors
- On time-travel planning in dynamic graphs
- Collective graph exploration parameterized by vertex cover
- Fault-tolerant dispersion of mobile robots
- Dispersion of mobile robots on graphs in the asynchronous model
- Near-optimal dispersion on arbitrary anonymous graphs
- Collaborative exploration of trees by energy-constrained mobile robots
- Optimal dispersion of silent robots in a ring
- 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
- The beachcombers' problem: walking and searching with mobile robots
- Setting port numbers for fast graph exploration
This page was built for publication: Fast collaborative graph exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347797)
