摘要: The game of degree is analyzed in a surveillance-evasion problem: the evader strives to escape as soon possible from pursuer's detection circle, while desire opposite. moves with constant speed and capable instantaneous direction changes. pursuer has minimum turn-radius, independent speed, can move forward any not exceeding maximum greater than evader's speed. solution surprisingly complex, including regions where optional,switch envelopes, focal lines, well aschattering by prevent crossing certainbarriers.