Fault-tolerant Gathering of Semi-synchronous Robots

Randomized gathering of asynchronous mobile robots

“…Okumura et al [23] further categorized the scheduler into multiple types including rigid and non-rigid motion of robots. The fault-tolerant gathering of robots has been solved in the presence of one fault [1] to multiple faults [5,24]. Pattanayak et al [24] also introduced the ASYNC IC model -also known as LC-atomic ASYNC by Okumura et al [23].…”

“…These tiny robots, otherwise known as swarm robots, have various advantages, namely, robustness and scalability. Some common problems which has been addressed in the literature include gathering [1,5,6,7,12,13,20], pattern formation [15,17,18,25], scattering [9,21] and flocking [10,11]. The problem of gathering had been investigated in the presence of byzantine faults [2,16] and crash faults [4,5,24].…”