How to Win a Game of Tag: A Multidimensional Analysis of Pursuit, Evasion, and Interception

This paper investigates pursuit–evasion games in multidimensional Euclidean space, examining how relative movement speed, decision frequency, and pursuit strategy determine whether a chaser can guarantee interception of an evader. Both agents operate under bounded speeds and potentially asynchronous control-update schedules, maintaining constant velocities between decisions.We establish capture guarantees for sampled pure pursuit, construct recurrent trajectories supporting indefinite evasion, and characterize capture–evasion thresholds for different runner decision schedules. Exact thresholds are derived for one aligned runner decision per chaser period, while two-decision results at selected speed ratios are established using geometric optimization and exact-rational computational certificates.We further analyze braking and hybrid-pursuit strategies, demonstrating that the choice of control policy can fundamentally alter capture guarantees under identical movement constraints. Dimension-independent estimates and planar-reduction results connect the analysis across higher-dimensional settings. The findings contribute to the mathematical study of differential games, sampled-data control, and interception under discrete decision constraints.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24295627
Primary Topic
Guidance and Control Systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

How to Win a Game of Tag: A Multidimensional Analysis of Pursuit, Evasion, and Interception

Aadi Biswas
2 links
Zenodo (CERN European Organization for Nuclear Research)
Guidance and Control Systems
preprint

How to Win a Game of Tag: A Multidimensional Analysis of Pursuit, Evasion, and Interception

Aadi Biswas
preprint en

Abstract

This paper investigates pursuit–evasion games in multidimensional Euclidean space, examining how relative movement speed, decision frequency, and pursuit strategy determine whether a chaser can guarantee interception of an evader. Both agents operate under bounded speeds and potentially asynchronous control-update schedules, maintaining constant velocities between decisions.We establish capture guarantees for sampled pure pursuit, construct recurrent trajectories supporting indefinite evasion, and characterize capture–evasion thresholds for different runner decision schedules. Exact thresholds are derived for one aligned runner decision per chaser period, while two-decision results at selected speed ratios are established using geometric optimization and exact-rational computational certificates.We further analyze braking and hybrid-pursuit strategies, demonstrating that the choice of control policy can fundamentally alter capture guarantees under identical movement constraints. Dimension-independent estimates and planar-reduction results connect the analysis across higher-dimensional settings. The findings contribute to the mathematical study of differential games, sampled-data control, and interception under discrete decision constraints.

Zenodo (CERN European Organization for Nuclear Research)
Harvey Mudd College (US)
Guidance and Control Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon