Fault detection and identification by swarms of autonomous mobile robots
Open Access
- 30 March 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1074
Abstract
No abstract availableFunding Information
- Università degli Studi di Milano
This publication has 16 references indexed in Scilit:
- Stand-up indulgent gathering on linesTheoretical Computer Science, 2024
- Optimal -algorithms for rendezvous of asynchronous mobile robots with external-lightsTheoretical Computer Science, 2023
- Stand up indulgent gatheringTheoretical Computer Science, 2022
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreementTheoretical Computer Science, 2021
- Self-stabilizing gathering of mobile robots under crash or Byzantine faultsDistributed Computing, 2019
- Gathering of robots in a ring with mobile faultsTheoretical Computer Science, 2019
- On time complexity for connectivity-preserving scattering of mobile robotsTheoretical Computer Science, 2018
- Gathering of robots on anonymous grids and trees without multiplicity detectionTheoretical Computer Science, 2016
- Leader election and gathering for asynchronous fat robots without common chiralityJournal of Discrete Algorithms, 2015
- Fault-tolerant flocking for a group of autonomous mobile robotsJournal of Systems and Software, 2011