  Assume that inside an initial planar area there are smart mobile evaders
attempting to avoid detection by a team of sweeping searching agents. All
sweepers detect evaders with fan-shaped sensors, modeling the field of view of
real cameras. Detection of all evaders is guaranteed with cooperative sweeping
strategies, by setting requirements on sweepers' speed, and by carefully
designing their trajectories. Assume the smart evaders have an upper limit on
their speed which is a-priori known to the sweeping team. An easier task for
the team of sweepers is to confine evaders to the domain in which they are
initially located. The sweepers accomplish the confinement task if they move
sufficiently fast and detect evaders by applying an appropriate search
strategy. Any given search strategy results in a minimal sweeper's speed in
order to be able to detect all evaders. The minimal speed guarantees the
ability of the sweeping team to confine evaders to their original domain, and
if the sweepers move faster they are able to detect all evaders that are
present in the region. We present results on the total search time for a novel
pincer-movement based search protocol that utilizes complementary trajectories
along with adaptive sensor geometries for any even number of pursuers.
