Gathering despite mischief

DOI10.1145/2629656MaRDI QIDQ4962159zbMATH OpenOpenAlexFDO

Authors Yoann Dieudonné, Andrzej Pelc, David Peleg

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2629656

zbMATH Keywords

Byzantine agentsgraphrendezvous

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)

Recommendations

• Gathering despite mischief
• Byzantine gathering in polynomial time
• Byzantine gathering in polynomial time

Cited in

(29)

• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• Gathering of robots in a ring with mobile faults
• Use of information, memory and randomization in asynchronous gathering
• The topology of look-compute-move robot wait-free algorithms with hard termination
• Search on a line with faulty robots
• Fast Byzantine gathering with visibility in graphs
• Byzantine gathering in polynomial time
• Asynchronous approach in the plane: a deterministic polynomial algorithm
• Deterministic rendezvous with different maps
• Group search of the plane with faulty robots
• Anonymous meeting in networks
• Rendezvous in networks in spite of delay faults
• Byzantine gathering in networks with authenticated whiteboards
• Better upper bounds for searching on a line with Byzantine robots
• Byzantine gathering in polynomial time
• Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
• Optimal rendezvous on a line by location-aware robots in the presence of spies*
• Gathering despite mischief
• Gathering in the plane of location-aware robots in the presence of spies
• Almost universal anonymous rendezvous in the plane
• Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
• Search on a Line by Byzantine Robots
• Evacuation of equilateral triangles by mobile agents of limited communication range
• A further study on weak Byzantine gathering of mobile agents
• Optimal gathering of robots in anonymous butterfly networks via leader election
• Self-stabilizing graph exploration by a single agent
• Synchronous robots vs asynchronous lights-enhanced robots on graphs
• Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots

This page was built for publication: Gathering despite mischief

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962159)