Evacuation of equilateral triangles by mobile agents of limited communication range
From MaRDI portal
Publication:6536151
DOI10.1007/978-3-030-34405-4_1zbMATH Open1540.68246MaRDI QIDQ6536151FDOQ6536151
Lata Narayanan, Iman Bagheri, Jaroslav Opatrny
Publication date: 5 April 2024
Cites Work
- Searching in the plane
- Title not available (Why is that?)
- Gathering Despite Mischief
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Graph exploration by a finite automaton
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Title not available (Why is that?)
- Online searching with turn cost
- On the linear search problem
- Yet more on the linear search problem
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Group Search on the Line
- Search on a Line with Faulty Robots
- Evacuating Robots via Unknown Exit in a Disk
- How many ants does it take to find the food?
- Evacuating two robots from multiple unknown exits in a circle
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Evacuation of Rectilinear Polygons
- Collaboration Without Communication: Evacuating Two Robots from a Disk
- Evacuating an Equilateral Triangle in the Face-to-Face Model
This page was built for publication: Evacuation of equilateral triangles by mobile agents of limited communication range
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536151)
