Many objects in the Netherlands (such as embassies and religious buildings) require surveillance to monitor for suspicious activity and identify (early signs of) potential threats. In many cases, this is performed by patrols of vehicles that drive from object to object. If such a patrol follows the same route every day, it is possible that an adversary notices and exploits this to improve their chance of success. In extreme cases this can lead to patrols having no benefit. The aim of this project is to investigate how these patrol routes should be planned to prevent an adversary learning using concepts from game theory and combinatorial optimization.
