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-HzbMATH Open0822.90149OpenAlexW2036803278MaRDI QIDQ4698128FDOQ4698128

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

zbMATH Keywords

Markov processpartially observable Markov decision processsearch pathapproximate solutions proceduresmoving-target search problems

Mathematics Subject Classification ID

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

Cited In (10)

• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
• Moving target search optimization -- a literature review
• Title not available (Why is that?)
• Optimal search for a moving target with the option to wait
• 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
• Path optimization for a moving object in an anisotropic environment using the probabilistic criterion in the passive sonar mode
• 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)