{'fraction_non_alphanumeric': 0.010775862068965518, 'fraction_numerical': 0.0, 'mean_word_length': 5.319727891156463, '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}}
A RECURSIVE APPROACH TO ROADMAP-BASED PATH PLANNING

Many techniques have been developed to plan paths for mobile robots. The need to provide reasonable paths for mobile robots is critical in the development of useful robots. Many researchers have dismissed roadmap approaches to path planning because of computational inefficiencies and scalability challenges; it is assumed that crude paths result if the problem must be solved in reasonable time. This paper proposes a new approach to path planning that uses recursion to overcome the limitations of other roadmap methods. The JARB algorithm is highly optimized for speed in sparse environments while also providing smooth paths in densely populated environments. By joining recursive branching with the ability to ignore irre levant obstacles, high quality paths can be produced with reduced computation. We describe the algorithm in detail and present experimental results.