Optimal search for a randomly moving object
From MaRDI portal
Recommendations
Cited in
(27)- On optimal search plans to detect a target moving randomly on the real line
- A conjecture of Ross for a search problem
- Estimating the state of a noisy continuous time Markov chain when dynamic sampling is feasible
- Finding a hider by an unknown deadline
- Search for a moving object in a problem with many searchers
- Minimizing the average searching time for an object within a graph
- When is it best to follow the leader?
- Search for a moving element with the minimum total cardinality of tests
- Optimal searching for a Helix target motion
- Optimal search for a moving target
- A Dichotomous Search for a Geometric Random Variable
- Search problem with two levels of examination costs
- Efficient search by optimized intermittent random walks
- scientific article; zbMATH DE number 3910122 (Why is no real title available?)
- On Discrete Search for a Multiple Number of Objects
- scientific article; zbMATH DE number 3958495 (Why is no real title available?)
- scientific article; zbMATH DE number 3968305 (Why is no real title available?)
- scientific article; zbMATH DE number 4087410 (Why is no real title available?)
- AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
- Dynamic search for a moving target
- scientific article; zbMATH DE number 2078355 (Why is no real title available?)
- scientific article; zbMATH DE number 1908191 (Why is no real title available?)
- Optimum Search for Objects Having Unknown Arrival Times
- Optimal search for a moving target with the option to wait
- Discrete Search for an Intelligent Object: The Leprechaun's Problem
- A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
- Three problems in searching for a moving target between two sites
This page was built for publication: Optimal search for a randomly moving object
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751362)
