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

Forward And Backward algorithmMarkov motion processmean time to detectionmoving targetoptimal search strategyprobability of detection

Mathematics Subject Classification ID

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

Cited in

(14)

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

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)