Pursuit-Evasion in an Unknown Enviroment Using Gap Navigation Trees

In this paper we present an online algorithm for pursuit-evasion in an unknown simply connected enviroment, for one pursuer that has minimal sensing and carries a set of stationary sentries that it can drop off and pick up during the pursuit. In our sensing model, the pursuer is only able to detect discontinuities in depth information (gaps), and it is able to find all of the evaders without any explicit localization or geometric information, by using a Gap Navigation Tree. The strategy is based on growing an evader-free region, by reading "exploration" schedules from the Gap Navigation Tree, that is constructed online. We prove that a pursuer with k+1 sentries can clear any environment that could be cleared by k pursuers using the algorithm in \cite{GuiLatLavLinMot99}, which required a complete map and perfect sensing