Collective tree exploration
From MaRDI portal
Recommendations
- LATIN 2004: Theoretical Informatics
- Smart Robot Teams Exploring Sparse Trees
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Collaborative exploration of trees by energy-constrained mobile robots
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Cites work
Cited in
(67)- Communication and location discovery in geometric ring networks
- Linear search by a pair of distinct-speed robots
- Online graph exploration: New results on old and new algorithms
- Balanced parallel exploration of orthogonal regions
- Dispersion of mobile robots on directed anonymous graphs
- Graph exploration by energy-sharing mobile agents
- On optimal coverage of a tree with multiple robots
- Minimizing the cost of team exploration
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Beachcombing on strips and islands
- Group search of the plane with faulty robots
- Energy-optimal broadcast and exploration in a tree using mobile agents
- Fast collaborative graph exploration
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Collision-free network exploration
- The ANTS problem
- Searching without communicating: tradeoffs between performance and selection complexity
- Ping pong in dangerous graphs: optimal black hole search with pebbles
- Convergecast and broadcast by power-aware mobile agents
- Anonymous meeting in networks
- Price of asynchrony in mobile agents computing
- Linear search by a pair of distinct-speed robots
- Efficient grid exploration with a stationary token
- Online Graph Exploration: New Results on Old and New Algorithms
- Black hole search with finite automata scattered in a synchronous torus
- Black hole search in directed graphs
- Lower and upper competitive bounds for online directed graph exploration
- Collaborative Exploration by Energy-Constrained Mobile Robots
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Tight bounds for black hole search with scattered agents in synchronous rings
- Deterministic network exploration by a single agent with Byzantine tokens
- Brief announcement: Energy constrained depth first search
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Exploring graphs with time constraints by unreliable collections of mobile robots
- Fast collaborative graph exploration
- Computing by mobile robotic sensors
- Collision-free network exploration
- Why Robots Need Maps
- A recursive approach to multi-robot exploration of trees
- Smart Robot Teams Exploring Sparse Trees
- Tree Exploration with an Oracle
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents
- LATIN 2004: Theoretical Informatics
- A general lower bound for collaborative tree exploration
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Near-gathering of energy-constrained mobile agents
- A general lower bound for collaborative tree exploration
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
- Fast dispersion of mobile robots on arbitrary graphs
- An improved upper bound for the online graph exploration problem on unicyclic graphs
- Energy constrained depth first search
- Efficient dispersion in triangular grids without prior knowledge
- Collision-free exploration by mobile agents using pebbles
- Collective tree exploration via potential function method
- Collective graph exploration parameterized by vertex cover
- Path connected dynamic graphs with a study of dispersion and exploration
- 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
- Balanced dispersion on time-varying dynamic graphs
- Team formation and applications
- An improved lower bound for competitive graph exploration
- Strategies for parallel unaware cleaners
- Exploring an unknown dangerous graph with a constant number of tokens
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Locating and repairing faults in a network with mobile agents
This page was built for publication: Collective tree exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423884)
