Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)

DOI10.1007/978-3-030-89240-1_6OpenAlexW3206503245MaRDI QIDQ2148885

Konstantinos Georgiou, Jesse Lucier, Somnath Kundu, Sean Leizerovich

Publication date: 24 June 2022

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

zbMATH Keywords

computational geometrysearchevacuationconvex geometry\( \ell_p\) metric spacewireless model

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (1)

Triangle evacuation of 2 agents in the wireless model (extended abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Theory of optimal search
• The theory of search games and rendezvous.
• Search-and-fetch with one robot on a disk (track: wireless and geometry)
• Evacuating two robots from multiple unknown exits in a circle
• Priority evacuation from a disk using mobile robots (extended abstract)
• The expanding search ratio of a graph
• Evacuation from a disc in the presence of a faulty robot
• Weighted group search on a line (extended abstract)
• Evacuating equilateral triangles and squares in the face-to-face model
• Priority evacuation from a disk: the case of \(n = 1,2,3\)
• Evacuating two robots from a disk: a second cut
• Generalized spherical and simplicial coordinates
• Online searching with turn cost
• On the linear search problem
• Distributed Evacuation in Graphs with Multiple Exits
• Trade-offs between selection complexity and performance when searching the plane without communication
• Some Cinderella Ruckle Type Games
• Ten Open Problems in Rendezvous Search
• Evacuation of Rectilinear Polygons
• <I>π</I><SUB><I>p</I></SUB>, the Value of <I>π</I> in <I>ℓ</I><SUB><I>p</I></SUB>
• π is the Minimum Value for Pi
• Earliest Arrival Flows with Multiple Sources
• Energy Consumption of Group Search on a Line
• Improved Lower Bounds for Shoreline Search
• Solving the ANTS Problem with Asynchronous Finite State Machines
• Group Search on the Line
• Collaboration Without Communication: Evacuating Two Robots from a Disk
• Linear Search with Terrain-Dependent Speeds
• Evacuating Robots via Unknown Exit in a Disk
• Fast two-robot disk evacuation with wireless communication
• Time-energy tradeoffs for evacuation by two robots in the wireless model
• Wireless evacuation on \(m\) rays with \(k\) searchers
• Exploring unknown environments with obstacles
• Average case -- worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model

This page was built for publication: Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)