At the dated check, the references listed below either did not resolve in
Crossref or DataCite, or carried a retraction notice. Each one is shown with the
registry record that put it there.
The 61 checked references that resolve
resolves10.1177/0278364909354628On the Existence of Nash Equilibrium for a Two-player Pursuit—Evasion Game with Visibility Constraints
resolves10.1287/opre.38.1.110An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
resolves10.1115/1.3657260Optimal Pursuit Strategies in Discrete-State Probabilistic Systems
resolves10.1002/rob.20226Supporting wilderness search and rescue using a camera‐equipped mini UAV
resolves10.1109/TRA.2002.804040Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation
The 22 references without a DOI — listed, not checked
no DOI — not checkedAlexander, S., Bishop, R., & Ghrist, R. (2006). Pursuit and evasion in non-convex domains of arbitrary dimensions. In Proc. robotics: science and systems conference.
no DOI — not checkedAlspach, B. (2004). Searching and sweeping graphs: a brief survey. Matematiche, 59, 5–37.
no DOI — not checkedBarrière, L., Fraigniaud, P., Santoro, N., & Thilikos, D. (2003). Searching is not jumping, graph-theoretic concepts in computer. Science, 2880, 34–45.
no DOI — not checkedBaşar, T., & Olsder, G. J. (1999). Dynamic noncooperative game theory. Philadelphia: Society for Industrial Mathematics.
no DOI — not checkedBhadauria, D., & Isler, V. (2011). Capturing an evader in a polygonal environment with obstacles. In Proc. international joint conference on artificial intelligence.
no DOI — not checkedBorie, R., Tovey, C., & Koenig, S. (2009). Algorithms and complexity results for pursuit-evasion problems. In Proc. international joint conference on artificial intelligence (pp. 59–66).
no DOI — not checkedBourgault, F., Furukawa, T., & Durrant-Whyte, H. F. (2003). Coordinated decentralized search for a lost target in a Bayesian world. In Proc. IEEE/RSJ international conference on intelligent robots and systems (pp. 48–53).
no DOI — not checkedDambreville, F., & Cadre, J. P. L. (2002). Search game for a moving target with dynamically generated informations. In Proc. international conference on information fusion (pp. 243–250).
no DOI — not checkedGerkey, B., Thrun, S., & Gordon, G. (2005). Parallel stochastic hill-climbing with small teams. In Proc. international NRL workshop on multi-robot systems.
no DOI — not checkedHespanha, J., Prandini, M., & Sastry, S. (2000). Probabilistic pursuit-evasion games: a one-step Nash approach. In Proc. IEEE conference on decision and control (pp. 2272–2277).
no DOI — not checkedJankovic, V. (1978). About a man and lions. Matematički Vesnik, 2, 359–361.
no DOI — not checkedKarnad, N., & Isler, V. (2008). Bearing-only pursuit. In Proc. IEEE international conference on robotics and automation (pp. 2665–2670).
no DOI — not checkedKatsilieris, F., Lindhé, M., Dimarogonas, D., Ögren, P., & Johansson, K. (2010). Demonstration of multi-robot search and secure. In Proc. ICRA workshop on search and pursuit/evasion.
no DOI — not checkedKolling, A., Kleiner, A., Lewis, M., & Sycara, K. (2010). Pursuit-evasion in 2.5D based on team-visibility. In Proc. IEEE/RSJ international conference on intelligent robots and systems (pp. 4610–4616).
no DOI — not checkedKolling, A., Kleiner, A., Lewis, M., & Sycara, K. (2011). Computing and executing strategies for moving target search. In Proc. IEEE international conference on robotics and automation (pp. 4246–423).
no DOI — not checkedLazebnik, S. (2001). Visibility-based pursuit-evasion in three-dimensional environments. Technical report, CVR-TR-2001-01, Beckman Institute, University of Illinois at Urbana-Champaign.
no DOI — not checkedLittlewood, J. E. (1953). A mathematician’s miscellany. London: Methuen & Co.
no DOI — not checkedMcCue, B. (1990). U-boats in the bay of Biscay: an essay in operations analysis. National Defense University Press.
no DOI — not checkedParsons, T. (1976). Pursuit-evasion in a graph. In Y. Alavi & D. Lick (Eds.), Theory and applications of graphs (pp. 426–441). Berlin: Springer.
no DOI — not checkedStone, L. D. (1989a). Theory of optimal search (2nd edn.). San Diego: Academic Press.
no DOI — not checkedWagner, D. H. (1999). Naval operations analysis. Annapolis: United States Naval Institute.
no DOI — not checkedWashburn, A. R. (2002). Search and detection. Topics in operations research series (4th edn.) INFORMS.
checked 2026-07-26 — re-checked daily as this page is visited;
titles and statuses come from Crossref and DataCite and are not part of the signed record
Both snippets point at the live badge image and link back to this page. The
badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.