Criteria and approximate methods for path-constrained moving-target search problems
From MaRDI portal
Publication:4698128
DOI10.1002/1520-6750(199502)42:1%3C27::AID-NAV3220420105%3E3.0.CO;2-HzbMATH Open0822.90149OpenAlexW2036803278MaRDI QIDQ4698128FDOQ4698128
Authors: James N. Eagle, Lyn C. Thomas 
Publication date: 26 October 1995
Full work available at URL: https://doi.org/10.1002/1520-6750(199502)42:1%3C27::aid-nav3220420105%3E3.0.co;2-h
Recommendations
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Using multiple searchers in constrained-path, moving-target search problems
- Trajectory optimization under kinematical constraints for moving target search
- scientific article; zbMATH DE number 1894661
- scientific article; zbMATH DE number 739166
- scientific article; zbMATH DE number 2011615
- scientific article; zbMATH DE number 3912085
- Publication:4203992
Markov processpartially observable Markov decision processsearch pathapproximate solutions proceduresmoving-target search problems
Cited In (19)
- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
- Bilinear Markovian processes of search for stationary and moving objects
- Detection of movement target which is present in the search region for a random amount of time
- Moving target search optimization -- a literature review
- On probabilistic search decisions under searcher motion constraints
- Title not available (Why is that?)
- Optimal search for a moving target with the option to wait
- A Markov analysis of the cueing capability/detection rate trade-space in search and rescue
- Technical note: Trading off quick versus slow actions in optimal search
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
- Trajectory optimization under kinematical constraints for moving target search
- Multi-Agent Search for a Moving and Camouflaging Target
- Study of engagement with mobile targets
- Three problems in searching for a moving target between two sites
- Path optimization for a moving object in an anisotropic environment using the probabilistic criterion in the passive sonar mode
- Solving the moving target search problem using indistinguishable searchers
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
This page was built for publication: Criteria and approximate methods for path-constrained moving-target search problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698128)
