{'fraction_non_alphanumeric': 0.019024970273483946, 'fraction_numerical': 0.0, 'mean_word_length': 5.2835820895522385, '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}}
Using modification of visibility-graph in solving the problem of finding shortest path for robot

This paper presents a solution for global optimized path planning with respect to finding the shortest distance for autonomous robotic system, particularly in two-dimensional space with a set of obstacles. The proposed approach is based on visibility-graph and the literature review of path planning is presented in details to explain why this approach is used. Through pros, cons, and complexity in the construction of a visibility-graph, the paper proposed two simple and efficient techniques to significantly reduce computation time in building a visibility-graph in the case of numerous obstacles. The experimental results, with a real robot, show that the proposed approach is efficient, feasible and straightforward to apply in practice.