{'fraction_non_alphanumeric': 0.019165727170236752, 'fraction_numerical': 0.0, 'mean_word_length': 5.529411764705882, '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}}
Distributed receding horizon coverage control for multiple non-holonomic mobile robots

This paper presents a distributed receding horizon coverage control algorithm for controlling a group of non-holonomic mobile robots with the assumption that the robots dynamics are decoupled from each other. The objective of the coverage algorithm considered here is to maximize the detection of the occurrence of the events. In order to solve each receding horizon coverage control problem, each robot needs to know the trajectories of its neighbors during the optimization time interval. Since this information is not available, an algorithm is presented to assume the trajectory of the neighboring robots. By using the proposed algorithm, the resulting closed-loop behavior is near optimal, adaptive, distributed, scalable, robust, and stable. Simulation results validate the proposed algorithm.