Search for a Moving Target: The FAB Algorithm

DOI10.1287/OPRE.31.4.739MaRDI QIDQ3670911zbMATH OpenOpenAlexFDO

Authors Alan 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)

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670911)