Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
Authors:
- Pavan PoudelPavan Poudel
- Aisha AljohaniAAAisha Aljohani
- Gokarna SharmaGSGokarna Sharma
- 1 January 2021
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 850, 116-134
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Mutual visibility by luminous robots without collisionsInformation and Computation, 2017
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreementJournal of Discrete Algorithms, 2016
- Autonomous mobile robots with lightsTheoretical Computer Science, 2016
- Getting close without touching: near-gathering for autonomous mobile robotsDistributed Computing, 2015
- Distributed Computing by Oblivious Mobile Robots2012
- Gathering few fat mobile robots in the planeTheoretical Computer Science, 2009
- Local spreading algorithms for autonomous robot systemsTheoretical Computer Science, 2008
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile RobotsSIAM Journal on Computing, 2006