{'fraction_non_alphanumeric': 0.011097410604192354, 'fraction_numerical': 0.0, 'mean_word_length': 5.444444444444445, '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}}
Oriented exploration in non-oriented sparse environments

The use of relaxation methods for calculation of harmonic potentials has proved to be a powerful technique for path planning in a known environment and recently for exploration of unknown environments. In the latter case, the potential is calculated on partial versions of the map represented on an occupancy grid, and it indicates safe paths towards the unexplored regions. Here, we show that exploration based on potentials functions calculated from boundary value problems works fairly well in sparse environments provided that we no longer use harmonic potentials. We propose different families of potentials that improve the exploration process in this kind of environment, while keeping the important property of not having dynamical local minima.