Criteria and approximate methods for path-constrained moving-target search problems

DOI10.1002/1520-6750(199502)42:1%3C27::AID-NAV3220420105%3E3.0.CO;2-HMaRDI QIDQ4698128zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximate solutions proceduresMarkov processmoving-target search problemspartially observable Markov decision processsearch path

Mathematics Subject Classification ID

Search theory (90B40) Markov and semi-Markov decision processes (90C40) Discrete-time games (91A50)

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

Cited in

(23)

• Sensor planning for elusive targets
• Trajectory optimization under kinematical constraints for moving target search
• Solving the moving target search problem using indistinguishable searchers
• Moving target search optimization -- a literature review
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• On probabilistic search decisions under searcher motion constraints
• Technical note: Trading off quick versus slow actions in optimal search
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• scientific article; zbMATH DE number 3900555 (Why is no real title available?)
• Branch and bound methods for a search problem
• scientific article; zbMATH DE number 1368831 (Why is no real title available?)
• PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
• Using multiple searchers in constrained-path, moving-target search problems
• Path optimization for a moving object in an anisotropic environment using the probabilistic criterion in the passive sonar mode
• 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
• Study of engagement with mobile targets
• 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
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• Multi-Agent Search for a Moving and Camouflaging Target
• Three problems in searching for a moving target between two sites
• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search

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)