{'fraction_non_alphanumeric': 0.032502708559046585, 'fraction_numerical': 0.005417118093174431, 'mean_word_length': 4.4674556213017755, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Fault-tolerant Gathering of Semi-synchronous Robots

This paper addresses the Gathering problem which asks robots to gather at a single point which is not fixed in advance, for a set of small, autonomous, mobile robots. The problem is studied for a set of semi-synchronous robots under SSY NC model when the robots may become faulty (crash fault). Depending upon the capabilities of the robots, the algorithms are designed to tolerate maximum number of faults. This work assumes weak multiplicity detection capability of the robots. The contribution of this work is in two folds. First, a distributed algorithm is presented which can tolerate at most (⌊n/2 - 1⌋) crash faults for n ≥ 7 robots with weak multiplicity detection only. For the second algorithm, it is also assumed that robots know the mobility capacity of all the robots. The algorithm presented here can tolerate at most (n - 6) crash faults for n ≥ 7 robots.