Search and Pursuit-Evasion in Mobile Robotics, A survey

This paper surveys recent results in pursuitevasion and autonomous search relevant to applications in mobile robotics. We provide a taxonomy of search problems that highlights the differences resulting from varying assumptions on the searchers, targets, and the environment. We then list a number of fundamental results in the areas of pursuit-evasion and probabilistic search, and we discuss field implementations on mobile robotic systems. In addition, we highlight current open problems in the area and explore avenues for future work

A differential game solution to the Coplanar tail-chase aerial combat problem

Numerical results obtained in a simplified version of the one on one aerial combat problem are presented. The primary aim of the data is to specify the roles of pursuer and evader as functions of the relative geometry and of the significant physical parameters of the problem. Numerical results are given in a case in which the slower aircraft is more maneuverable than the faster aircraft. A third order dynamic model of the relative motion is described, for which the state variables are relative range, bearing, and heading. The ranges at termination are arbitary in the present version of the problem, so the weapon systems of both aircraft can be visualized as forward firing high velocity weapons, which must be aimed at the tail pipe of the evader. It was found that, for the great majority of the ralative geometries, each aircraft can evade the weapon system of the other

Capturing an Evader Using Multiple Pursuers with Sensing Limitations in Convex Environment

A modified continuous-time pursuit-evasion game with multiple pursuers and a single evader is studied. The game has been played in an obstacle-free convex environment which consists an exit gate through which the evader may escape. The geometry of the convex is unknown to all players except pursuers know the location of the exit gate and they can communicate with each other. All players have equal maximum velocities and identical sensing range. An evader is navigating inside the environment and seeking the exit gate to win the game. A novel sweep-pursuit-capture strategy for the pursuers to search and capture the evader under some necessary and sufficient conditions is presented. We also show that three pursuers are sufficient to finish the operation successfully. Non-holonomic wheeled mobile robots of the same configurations have been used as the pursuers and the evader. Simulation studies demonstrate the performance of the proposed strategy in terms of interception time and the distance traveled by the players.