{'fraction_non_alphanumeric': 0.01400329489291598, 'fraction_numerical': 0.0, 'mean_word_length': 5.198979591836735, '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}}
Autonomous navigation of a nonholonomic mobile robot in a complex environment

This paper presents a new path planning algorithm for the autonomous navigation of a nonholonomic mobile robot. The environment in which the robot evolves is unknown and encumbered by obstacles. The goal of the robot is to move towards the arrival point (which is known) by avoiding the obstacles. The path planning algorithm recomputes a new trajectory whenever a new obstacle is detected. The planned trajectory takes account of the physical constraints of the robot (speed saturation, kinematic robot model, nonholonomic constraint). The trajectory of the robot is obtained by optimizing a problem of optimal control under constraints. The resolution of this problem is done by using the flatness property of the system, which transforms the initial optimization problem into a nonlinear dynamic programming problem. The problems of the local minima are solved by using a supervisor. Our algorithm will be compared with another algorithm of the literature in order to highlight its effectiveness. Simulation results will be presented to illustrate the good performance of the algorithm for robot navigation in a complex environment.