Learning a Policy for Pursuit-Evasion Games Using Spiking Neural Networks and the STDP Algorithm
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Pursuit-Evasion (PE) games are regarded as a major platform for game theory. In this kind of game, an agent called an evader tries to escape from another agent called a pursuer. Active Target Defense (ATD) is a derivative of PE games, attracting attention recently. In an ATD game, the evader, often called an invader, strives to capture a moving target. The pursuer, called a defender, tries to intercept the invader. This paper implements the Spike-Timing-Dependent Plasticity (STDP) algorithm to train two Spiking Neural Networks (SNNs) to find a suitable solution for the ATD problem in decentralized situations. One of the SNNs is used to control the invader, while the other controls the defender. The performance is compared with the analytical solution for the pedestrian model. The results showed that an SNN can learn the optimal capture point only using relative velocities and line of sight.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it