{'fraction_non_alphanumeric': 0.018276762402088774, 'fraction_numerical': 0.0, 'mean_word_length': 4.9921875, '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 probe allocation problem

Surveillance problem in a variety of scenarios such as hostile environments, environmental monitoring and law enforcement missions (i.e. border patrol) etc have been widely studied. However, monitoring of traffic conditions in urban environments by deploying a team of agents is a novel problem not found in any existing literature. This problem is termed as the probe allocation problem. In light of the recent developments of automated cars, studies of such surveillance problems in urban environments will prove to be useful. The main purpose of this paper is to make a formal introduction to the probe allocation problem and propose an algorithm that solves it. A Singapore-scale simulation was carried out to study its performance.