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

DOI10.1016/S0453-4514(99)80013-1MaRDI QIDQ4538142zbMATH OpenOpenAlexFDO

Authors Ryusuke Hohzaki, Koji Iida, Masayoshi Teramoto

Publication date 11 July 2002

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

zbMATH Keywords

sensitivity analysisconvex programminggradient projection methodmultiplier methodexpected reward criterionsearch-efforts-optimizing problem

Mathematics Subject Classification ID

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

Recommendations

• Optimal search for a moving target with the option to wait
• scientific article; zbMATH DE number 3968305
• Optimal search for a moving target
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• THE OPTIMAL SEARCH PLAN FOR A MOVING TARGET MINIMIZING THE EXPECTED RISK
• Optimal search for moving targets
• OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
• scientific article; zbMATH DE number 4214806

Cited in

(5)

• OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
• scientific article; zbMATH DE number 4104705 (Why is no real title available?)
• Investigating the benefits of re-optimisation while searching for two immobile entities on a network
• Optimal ambushing search for a moving target
• scientific article; zbMATH DE number 739166 (Why is no real title available?)

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

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