{'fraction_non_alphanumeric': 0.019428571428571427, 'fraction_numerical': 0.0, 'mean_word_length': 5.302158273381295, '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 Reconnaissance Penetration Game With Territorial-Constrained Defender

A reconnaissance penetration game is a classic target-attacker-defender game. In this game, a reconnaissance UAV (namely attacker) tries to avoid the defender and reconnoiter a target as close as possible, whereas a target tries to escape the attacker with the help of defender. Practically, the defender is considered constrained in a certain territory to capture the attacker and help the target. This article is primarily concerned with the winning region for three players. An explicit policy method is proposed to construct the barrier analytically. In addition, taking practical payoff functions into account, a complete solution to the reconnaissance game is provided by fusing the games of kind and degree. Simulation results are elaborated to showcase the effectiveness of the proposed policy.