The fugitive is at the origin. They move at a speed of 1. There's a guard at every integer coordinate except the origin. A guard's speed is 1/100. The fugitive and the guards move simultaneously and continuously. **At any moment, the guards only move towards the current position of the fugitive**, i.e. a guard's trajectory is a pursuit curve. If they're within 1/100 distance from a guard, the fugitive is caught. The game is played on $\mathbb{R}^2$.

Can the fugitive avoid capture forever?

What I know:

The distance between two guards is always non-increasing, but the farther away from the fugitive, the slower that distance decreases.

If the fugitive runs along a straight line, they will always be caught by some far away guard. For example, if the fugitive starts at $(0.5, 0)$ and runs due north, they will be caught by a guard at about $(0, \frac{50^{100}}{4})$. Consult radiodrome for calculation.

If there're just 2 guards at distance 1 from each other, then the fugitive can always find a path to safely pass

**between**them. This is true regardless of the pair's distance and relative positions to the fugitive.The fugitive can escape if they're just "enclosed" by guards who're at distance 1 from each other:

The shape of the fence doesn't have to be rectangular. Circles or other shapes don't prevent escape either, regardless of the size.

3 and 4 are nontrivial, but can be proved by geometry argument alone without calculus. To avoid unnecessarily clustering the question, further details are given as an answer below for those who're interested, hopefully instrumental in solving the original problem.