Optimal ambushing search for a moving target
From MaRDI portal
Publication:5943562
DOI10.1016/S0377-2217(00)00187-9zbMath0989.90073MaRDI QIDQ5943562
Publication date: 27 September 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Optimal search and ambush for a hider who can escape the search region, A competitive search game with a moving target
Cites Work
- Search for a Moving Target: The FAB Algorithm
- THE OPTIMAL SEARCH PLAN FOR A MOVING TARGET MINIMIZING THE EXPECTED RISK
- Optimal Search for a Moving Target in Discrete Time and Space
- Ambushing Random Walks II: Continuous Models
- Ambushing Random Walks III: More Continuous Models
- Ambushing Random Walks I: Finite Models
- A SEARCH GAME FOR A MOBILE TARGET WITH THE CONDITIONALLY DETERMINISTIC MOTION DEFINED BY PATHS
- A SEARCH GAME WITH REWARD CRITERION
- Constrained Optimization of Functionals with Search Theory Applications
- Two-Person Zero-Sum Games for Network Interdiction
- The Theory of Search