Blocking an Evader in a Polygon by a 2-Modem Searcher

Abstract

In this paper, we introduce a version of Pursuit-Evasion problem in which the pursuer is a 2-modem which pursues an unpredictable evader in a polygonal environment. A 2-modem searcher is a wireless device whose radio signal can penetrate two walls. Furthermore, a query path inside the polygon is given so that the 2-modem moves on it. We want to find out that when the 2- modem moves on this path if evaders can move from an invisible region to another one without detecting by the pursuer or not. In the other word, we want to find out if the invisible regions merge together or not.