Optimal search for a moving target with no time information maximizing the expected reward

DOI10.1016/S0453-4514(99)80013-1zbMath0998.90515OpenAlexW2166845111MaRDI QIDQ4538142

Masayoshi Teramoto, Ryusuke Hohzaki, Koji Iida

Publication date: 11 July 2002

Full work available at URL: https://doi.org/10.1016/s0453-4514(99)80013-1

zbMATH Keywords

sensitivity analysisconvex programmingmultiplier methodgradient projection methodexpected reward criterionsearch-efforts-optimizing problem

Mathematics Subject Classification ID

Convex programming (90C25) Search theory (90B40) Positional games (pursuit and evasion, etc.) (91A24)

This page was built for publication: Optimal search for a moving target with no time information maximizing the expected reward