A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
From MaRDI portal
Publication:5118428
Recommendations
- A stochastic model for optimization of search for moving objects
- Search for a moving target in a graph
- Dynamic graph-based search in unknown environments
- Investigating the benefits of re-optimisation while searching for two immobile entities on a network
- scientific article; zbMATH DE number 1151792
- A combinatorial model of two-sided search
- A Combinatorial Model of Two-Sided Search
- scientific article; zbMATH DE number 999622
- Using multiple searchers in constrained-path, moving-target search problems
Cites work
- scientific article; zbMATH DE number 5010632 (Why is no real title available?)
- A MULTI-STAGE SEARCH ALLOCATION GAME WITH THE PAYOFF OF DETECTION PROBABILITY
- A cooperative game in search theory
- A nonlinear model of a search allocation game with false contacts
- A search game with incomplete information on detective capability of searcher
- Hide-and-seek games on a network, using combinatorial search paths
- Search games on a broken wheel with traveling and search costs
- Search games: literature and survey
Cited in
(3)
This page was built for publication: A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118428)