Optimal Search for a Moving Target in Discrete Time and Space
From MaRDI portal
Publication:3893650
DOI10.1287/opre.28.6.1275zbMath0447.90046OpenAlexW2042189440MaRDI QIDQ3893650
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.6.1275
iterative algorithmdiscrete timediscrete spaceexponential detection functioncomputation of optimal search plansmaximization of detection probabilityoptimal search for a moving target
Related Items (22)
Search allocation game ⋮ Detection of a Markovian target with optimization of the search efforts under generalized linear constraints ⋮ A competitive search game with a moving target ⋮ Optimal Search Model with Compulsory Stop for a Randomly Arriving Target ⋮ Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search ⋮ Counter insurgency operations a mathematical modelling approach. ⋮ Network interdiction to minimize the maximum probability of evasion with synergy between applied resources ⋮ Minimizing the average searching time for an object within a graph ⋮ Optimal ambushing search for a moving target ⋮ Optimal Search for an Object with Unknown type ⋮ Planning a multi-sensors search for a moving target considering traveling costs ⋮ Route optimization for multiple searchers ⋮ Optimal search-relocation trade-off in Markovian-target searching ⋮ Belief functions induced by multimodal probability density functions, an application to the search and rescue problem ⋮ Persistent monitoring by multiple unmanned aerial vehicles using Bernstein polynomials ⋮ Stochastic search in a convex region ⋮ 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 ⋮ Optimal discrete search with technological choice
This page was built for publication: Optimal Search for a Moving Target in Discrete Time and Space
