Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)

DOI10.1007/978-3-319-18173-8_10zbMath1459.68212arXiv1501.04985OpenAlexW2187411536MaRDI QIDQ2947016

No author found.

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.04985

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Artificial intelligence for robotics (68T40)

Related Items (20)

Collaboration Without Communication: Evacuating Two Robots from a Disk ⋮ Linear Search with Terrain-Dependent Speeds ⋮ Searching for a Non-adversarial, Uncooperative Agent on a Cycle ⋮ Evacuating an Equilateral Triangle in the Face-to-Face Model ⋮ God save the queen ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ Evacuating two robots from multiple unknown exits in a circle ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Optimal circle search despite the presence of faulty robots ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Evacuating equilateral triangles and squares in the face-to-face model ⋮ Priority evacuation from a disk: the case of \(n \geq 4\) ⋮ Treasure evacuation with one robot on a disk ⋮ Linear search by a pair of distinct-speed robots ⋮ Fast two-robot disk evacuation with wireless communication ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Searching for a non-adversarial, uncooperative agent on a cycle ⋮ Priority evacuation from a disk: the case of \(n = 1,2,3\) ⋮ Energy Consumption of Group Search on a Line ⋮ Distributed Evacuation in Graphs with Multiple Exits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Searching in the plane
• Theory of optimal search
• The theory of search games and rendezvous.
• On the linear search problem
• Trade-offs between selection complexity and performance when searching the plane without communication
• Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
• Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
• Solving the ANTS Problem with Asynchronous Finite State Machines
• Evacuating Robots via Unknown Exit in a Disk
• A Survey of Search Theory

This page was built for publication: Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)