{'fraction_non_alphanumeric': 0.010238907849829351, 'fraction_numerical': 0.0008532423208191126, 'mean_word_length': 5.23936170212766, '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}}
Global mobile robot path planning using laser simulator

This paper presents the utilization of novel laser simulator search graph approach for global path determination in unknown environment using MATLAB. The environment of the robot is represented in 2D map and the laser simulator is used to find the collision free path within this environment without prior knowledge about the visiting cells. By using the laser simulator row points procedures, the point that determine the planned path in front of robot can be generated continuously and this process is repeated until the robot reaches the goal position. Two kinds of environments are used to test laser simulator; the first one is represented with cleared borders and polygons whereas the other includes some noises and uncertainties. The developed laser simulator is implemented successfully in these environments and the simulation results are compared with the classical A* algorithm. From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.