Priority evacuation from a disk: the case of \(n \geq 4\)

DOI10.1016/j.tcs.2020.09.023zbMath1464.68401OpenAlexW4255684910MaRDI QIDQ2210503

Yanyan Li

Publication date: 6 November 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.09.023

zbMATH Keywords

mobile robotswireless communicationgroup searchevacuation from a diskpriority evacuation

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (3)

Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Triangle evacuation of 2 agents in the wireless model (extended abstract) ⋮ Algorithms for \(p\)-Faulty Search on a half-line

Cites Work

• Unnamed Item
• Searching in the plane
• An annotated bibliography on guaranteed graph searching
• Search-and-fetch with one robot on a disk (track: wireless and geometry)
• Priority evacuation from a disk using mobile robots (extended abstract)
• Evacuation from a disc in the presence of a faulty robot
• Fast rendezvous on a cycle by agents with different speeds
• Online searching with turn cost
• On the linear search problem
• The Polygon Exploration Problem
• A General Framework for Searching on a Line
• Linear Search by a Pair of Distinct-Speed Robots
• Revisiting the Problem of Searching on a Line
• Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
• God save the queen
• Exploring Unknown Environments
• Group Search on the Line
• Collaboration Without Communication: Evacuating Two Robots from a Disk
• Evacuating Robots via Unknown Exit in a Disk
• Fast two-robot disk evacuation with wireless communication

This page was built for publication: Priority evacuation from a disk: the case of \(n \geq 4\)