{'fraction_non_alphanumeric': 0.014994232987312572, 'fraction_numerical': 0.0, 'mean_word_length': 5.728682170542636, '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}}
Simultaneous Search and Monitoring of Evasive Targets by an Unmanned Aerial Vehicle

This paper studies a Simultaneous Search and Monitoring (SSM) problem between an aerial pursuer and multiple evasive ground targets. The adversarial target behaviours and the partial observation by the pursuer make this problem a Partially Observable Stochastic Game (POSG). Because of the intractability of obtaining an exact solution, we applied some assumptions on the information available to the targets. These assumptions simplify the game playing into a dynamic Guaranteed Search problem. A policy planning algorithm was designed for the pursuer, which achieved efficient Simultaneous Search and Monitoring and reduced the total uncertainty level. The comparative study validated the advantages of our policy planning over conventional fixed-pattern Guaranteed Search method.