Fast and the Furious: Hot Starts in Pursuit-Evasion Games

Gabriel Smithline, Scott Nivison
10/12/2025
cs.MAcs.GTcs.LG

No confident code implementation found for this paper.

Abstract

Effectively positioning pursuers in pursuit-evasion games without prior knowledge of evader locations remains a significant challenge. A novel approach that combines game-theoretic control theory with Graph Neural Networks is introduced in this work. By conceptualizing pursuer configurations as strategic arrangements and representing them as graphs, a Graph Characteristic Space is constructed via multi-objective optimization to identify Pareto-optimal configurations. A Graph Convolutional Network (GCN) is trained on these Pareto-optimal graphs to generate strategically effective initial configurations, termed "hot starts". Empirical evaluations demonstrate that the GCN-generated hot starts provide a significant advantage over random configurations. In scenarios considering multiple pursuers and evaders, this method hastens the decline in evader survival rates, reduces pursuer travel distances, and enhances containment, showcasing clear strategic benefits.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{smithline2025fast,
  title  = {Fast and the Furious: Hot Starts in Pursuit-Evasion Games},
  author = {Gabriel Smithline and Scott Nivison},
  year   = {2025},
  eprint = {2510.10830},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.10830v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.10830.svg)](https://codeofpaper.com/paper/2510.10830)

Discussion