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
Authors: Iman Bagheri, Lata Narayanan, Jaroslav Opatrny
Publication date: 5 April 2024
Recommendations
Cites Work
- Searching in the plane
- The game of cops and robbers on graphs
- 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)