{'fraction_non_alphanumeric': 0.018217306441119064, 'fraction_numerical': 0.0, 'mean_word_length': 4.938223938223938, '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 path planning of a multi-robot system based on the neighborhood artificial potential field approach

The current study is set up to investigate the problem of planning the trajectories of a multi-robot system. It puts emphasis on the idea of using distributed architecture to plan the trajectories of a group of wheeled mobile robots. Each robot must be able to detect and avoid collision with both static and dynamic obstacles present in its environment/neighborhood. This study seeks to improve the artificial potential field (APF) method in order to have good trajectory planning of a multi-robot system. In order to address the purpose of this work, we employed the hybrid approach, which is a combination of three techniques: the APF method; the neighborhood system; and the notion of priority between the robots. Moreover, the minimum local problem is handled in this paper using the non-minimum speed algorithm. The implemented approach is adapted to solve the trajectory planning problem for a multi-robot system. So, the problem of intersection of robots at the same passage point is solved through using the method of assignment of priority between robots. We also used the neighborhood detection technique to reduce the influence area of each robot and to optimize the time of calculation. The overall system equations associated to the robots are updated at each time of simulation to react at any condition that might suddenly emerge. The approach is implemented with MATLAB/Simulink and Solidworks/Simmechanics.