{'fraction_non_alphanumeric': 0.009592326139088728, 'fraction_numerical': 0.0, 'mean_word_length': 5.430769230769231, '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}}
Disjoint path algorithms for planar reconfiguration of identical vehicles

This paper is proposed for an approach in the reconfiguration problem using a matching algorithm for vehicles moving on planar rectilinear and diagonal grid graphs. These graphs are useful when considering vehicles with non-zero width. We also obtain algorithms with the running time based on a suitable weighted bipartite matching algorithm.