Comparative Evaluation of Bandit-Style Heuristic Policies for Moving Target Detection in a Linear Grid Environment
Hyunmin Kang, Minho Ahn, Yongduek Seo · 2025
Read Comparative Evaluation of Bandit-Style Heuristic Policies for Moving Target Detection in a Linear Grid Environment by Hyunmin Kang, Minho Ahn, Yongduek Seo (2025) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-12788252.txt.
Description
Hyunmin Kang, Minho Ahn, and Yongduek Seo stage a fair fight between two simple rules for finding a moving target. A sensor may probe just one cell of a one-dimensional grid per step, seeing only yes or no, while the target wanders as a bouncing random walk. Their 2025 paper compares ways to spend those probes wisely, without any training or heavy machinery.
The greedy rule always probes the single most likely cell. Its rival samples cells in proportion to their probability, exploring more. Across grid sizes in repeated simulations, greedy found the target fastest, beating the sampler and random probing by roughly seventeen to twenty percent in typical settings. The sampler's wandering, though, buys insurance when the model of the target is wrong. The authors offer the pair as a clear baseline for harder searches with noise and more dimensions.
Catalog record
| CREATOR | Hyunmin Kang, Minho Ahn, Yongduek Seo |
|---|---|
| YEAR | 2025 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 73 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |