{'fraction_non_alphanumeric': 0.01744186046511628, 'fraction_numerical': 0.0, 'mean_word_length': 5.5, '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}}
The mathematics of motion camouflage

Motion camouflage is a strategy whereby an aggressor moves towards a target while appearing stationary to the target except for the inevitable change in perceived size of the aggressor as it approaches. The strategy has been observed in insects, and mathematical models using discrete time or neural–network control have been used to simulate the behaviour. Here, the differential equations for motion camouflage are derived and some simple cases are analysed. These equations are easy to simulate numerically, and simulations indicate that motion camouflage is more efficient than the classical pursuit strategy (‘move directly towards the target’).