Transient stochastic models for search patterns

zbMATH Open0984.90030MaRDI QIDQ2752038FDOQ2752038

Authors: Eduardo L. Pasiliao 

Publication date: 7 May 2002

Recommendations

• scientific article; zbMATH DE number 3968305
• THE OPTIMAL SEARCH PLAN FOR A MOVING TARGET MINIMIZING THE EXPECTED RISK
• Optimal ambushing search for a moving target
• Studies on the optimal search plan
• Optimal Search Density for a Stationary Target Among Stationary False Targets

zbMATH Keywords

stochastic programmingpath planningoptimal search patterns

Mathematics Subject Classification ID

Search theory (90B40) Stochastic programming (90C15) Paths and cycles (05C38)

Cited In (3)

• A simple search model with procyclical quits
• Continuous-time modeling of random searches: statistical properties and inference
• Variability and the Duration of Search

This page was built for publication: Transient stochastic models for search patterns

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