Search for a Moving Target: The FAB Algorithm

DOI10.1287/opre.31.4.739zbMath0521.90063OpenAlexW2007216244MaRDI QIDQ3670911

Alan R. Washburn

Publication date: 1983

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.31.4.739

zbMATH Keywords

probability of detectionmoving targetoptimal search strategymean time to detectionForward And Backward algorithmMarkov motion process

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Search theory (90B40)

Related Items (13)

Search allocation game ⋮ Detection of a Markovian target with optimization of the search efforts under generalized linear constraints ⋮ Finite method for a nonlinear allocation problem ⋮ Hierarchical Bayesian models applied to air surveillance radars ⋮ A DC programming approach for planning a multisensor multizone search for a target ⋮ A competitive search game with a moving target ⋮ A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target ⋮ Moving target search optimization -- a literature review ⋮ Path optimization for the resource-constrained searcher ⋮ Optimal ambushing search for a moving target ⋮ Optimal strategy of route and look for the path constrained search problem with reward criterion ⋮ A convex programming with nested constraints on the amount of resources ⋮ On optimal search plans to detect a target moving randomly on the real line

This page was built for publication: Search for a Moving Target: The FAB Algorithm