Group search of the plane with faulty robots
From MaRDI portal
Publication:2326387
DOI10.1016/j.tcs.2018.09.029zbMath1430.68343OpenAlexW2895675888MaRDI QIDQ2326387
Arnaud Labourel, Maxime Godon, Evangelos Kranakis, Jurek Czyzowicz
Publication date: 7 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.09.029
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching in the plane
- How many ants does it take to find the food?
- Parallel searching in the plane
- Spanning-tree based coverage of continuous areas by a mobile robot
- Fence patrolling by mobile agents with distinct speeds
- The Polygon Exploration Problem
- Distributed computation in dynamic networks
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Collaborative search on the plane without communication
- Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Collective tree exploration
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- The Byzantine Generals Problem
- Exploring Unknown Environments
- Gathering Despite Mischief
- Solving the ANTS Problem with Asynchronous Finite State Machines
- Group Search on the Line
- On utilizing speed in networks of mobile agents
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Search on a Line with Faulty Robots
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
This page was built for publication: Group search of the plane with faulty robots
