{'fraction_non_alphanumeric': 0.019736842105263157, 'fraction_numerical': 0.0, 'mean_word_length': 4.7421383647798745, '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}}
Motion planning for a mobile robot

The mobile robots have received considerable attention in the scientific literature. One of the fundamental problems in mobile robotics is motion planning. Motion planning has several constraints, such as: knowledge of the scene, the existence of obstacles, their dimensions, the types of obstacles (static or dynamic), and the metric under consideration. Many existent solutions are based on cell decomposition of the scene. The cells are either free either occupied with an obstacle. The solutions are obtained based on graphs or exploration matrices. This paper presents an application for planning the motion of a wheeled robot in a delimited space. The robot has also the role to acquire information from the scene and send them to the user. The plane of the scene is specified by the user in a file with a certain format and the robot motion is represented in real-time.