{'fraction_non_alphanumeric': 0.019963702359346643, 'fraction_numerical': 0.0, 'mean_word_length': 5.766871165644171, '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}}
Threat netting for real-time, intelligent route planners

Route planning algorithms are an important component of many diverse applications, including military operations. Standard route planning algorithms usually generate a minimum cost route based on a predetermined cost function. Unfortunately, such a route may not represent a desirable solution for different military scenarios. In this paper, we present a mission adaptable route planner which accurately and efficiently generates routes through a battlefield environment. The approach can handle various constraints on the resultant route, such as maximum route length, minimum distance between turns, maximum turning angle, fixed goal approach vector, etc. Furthermore, the approach takes into account the concept of threat netting, in which the lethality of traversing an enemy threat location varies based on which threat regions were previously traversed (since threats may communicate battlefield information to each other). Routes generated by this approach can be replanned in real-time as new battlefield information becomes available.