{'fraction_non_alphanumeric': 0.01195219123505976, 'fraction_numerical': 0.0, 'mean_word_length': 5.1656441717791415, '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}}
Immune-inspired search strategies for robot swarms

SUMMARY Detection of targets distributed randomly in space is a task common to both robotic and biological systems. Lévy search has previously been used to characterize T cell search in the immune system. We use a robot swarm to evaluate the effectiveness of a Lévy search strategy and map the relationship between search parameters and target configurations. We show that the fractal dimension of the Lévy search which optimizes search efficiency depends strongly on the distribution of targets but only weakly on the number of agents involved in search. Lévy search can therefore be tuned to the target configuration while also being scalable. Implementing search behaviors observed in T cells in a robot swarm provides an effective, adaptable, and scalable swarm robotic search strategy. Additionally, the adaptability and scalability of Lévy search may explain why Lévy-like movement has been observed in T cells in multiple immunological contexts.