{'fraction_non_alphanumeric': 0.013630731102850062, 'fraction_numerical': 0.004956629491945477, 'mean_word_length': 4.496598639455782, '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}}
Path planning for Unmanned Ground Vehicle

The aim of this paper is to find the path planning of an Unmanned Ground Vehicle (UGV) using shortest path algorithm that is a path of a string sequence of n vertices. Before that, the estimated point which has chosen is thought near real points with two experiences. These estimated points are chosen as the points which its minimum distance equal between 0.4m and 0.5m respectively. The goal is to calculate a path between the vertices of a graph that minimizes the robot path of estimated points. It can explain by finding the shortest path between two points. The main contribution of this work is seeking the shortest path of these points and minimizes the computational time and the energy that the robot will be provided along this path in minimal distance.