Capturing Hiders with Moving Obstacles

The classic hide-and-seek game is an abstraction for many realworld scenarios like capturing intruders in a closed space, locating objects, patrolling an area, etc. Since most of the present work is based on static obstacles, we address solutions for the hide-andseek game in an environment where the obstacles are not static. We design strategies that would facilitate seekers to capture hiders in an environment with moving obstacles. We have three strategies: Baseline strategy, Set-cover strategy, and Sweep strategy, which use different surveillance techniques to be followed by the seekers. We simulate the methods and compare their performance in different scenarios. While the baseline strategy demands many seekers in large environments, the other two strategies, set-cover and sweep, are ideal for applying in large environments as they require fewer seekers in the same environment.