Collective tree exploration
From MaRDI portal
Publication:3423884
DOI10.1002/net.20127zbMath1107.68065OpenAlexW3136290985MaRDI QIDQ3423884
Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc, Leszek Gąsieniec
Publication date: 15 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20127
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items
Online makespan minimization with parallel schedules ⋮ An improved lower bound for competitive graph exploration ⋮ Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots ⋮ Price of asynchrony in mobile agents computing ⋮ Collaborative Exploration by Energy-Constrained Mobile Robots ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN ⋮ The ANTS problem ⋮ Searching without communicating: tradeoffs between performance and selection complexity ⋮ Online graph exploration: New results on old and new algorithms ⋮ Tight bounds for black hole search with scattered agents in synchronous rings ⋮ Strategies for parallel unaware cleaners ⋮ Exploring an unknown dangerous graph with a constant number of tokens ⋮ Unnamed Item ⋮ Ping pong in dangerous graphs: optimal black hole search with pebbles ⋮ Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next ⋮ Deterministic network exploration by a single agent with Byzantine tokens ⋮ Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens ⋮ Computing by Mobile Robotic Sensors ⋮ Collaborative delivery on a fixed path with homogeneous energy-constrained agents ⋮ Communication and location discovery in geometric ring networks ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ Linear search by a pair of distinct-speed robots ⋮ Locating and repairing faults in a network with mobile agents ⋮ 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 ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ Near-gathering of energy-constrained mobile agents ⋮ Black Hole Search with Finite Automata Scattered in a Synchronous Torus ⋮ Linear Search by a Pair of Distinct-Speed Robots ⋮ Black Hole Search in Directed Graphs ⋮ Group search of the plane with faulty robots ⋮ Energy-optimal broadcast and exploration in a tree using mobile agents ⋮ Dispersion of mobile robots on directed anonymous graphs ⋮ Fast collaborative graph exploration ⋮ Graph exploration by energy-sharing mobile agents ⋮ Convergecast and broadcast by power-aware mobile agents ⋮ Anonymous meeting in networks
Cites Work
