{'fraction_non_alphanumeric': 0.029605263157894735, 'fraction_numerical': 0.0, 'mean_word_length': 4.890322580645162, '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}}
k-Circle Formation by Oblivious Mobile Robots

A solution to the k-circle formation problem requires the formation of disjoint circles by a swarm of mobile robots. The circles are restricted to be centered at one of the pre-fixed points. Each circle must contain exactly k robots at distinct positions. The robots are oblivious, autonomous, anonymous, homogeneous, and silent. They operate in Look-Compute-Move cycles under a fair asynchronous scheduler. This study addresses the solvability of the k-circle formation in the Euclidean plane. The k-circle formation is studied for point robots under one axis agreement. The relationship between the k-circle formation and the k-EPF (A generalized embedded pattern formation) problem is also studied. The solvability of the k-circle formation is investigated for disoriented point robots. Finally, the problem is considered for fat robots under one axis agreement.