Criteria and approximate methods for path-constrained moving-target search problems
From MaRDI portal
Publication:4698128
DOI<27::AID-NAV3220420105>3.0.CO;2-H 10.1002/1520-6750(199502)42:1<27::AID-NAV3220420105>3.0.CO;2-HzbMath0822.90149OpenAlexW2036803278MaRDI QIDQ4698128
Publication date: 26 October 1995
Full work available at URL: https://doi.org/10.1002/1520-6750(199502)42:1<27::aid-nav3220420105>3.0.co;2-h
Markov processpartially observable Markov decision processsearch pathapproximate solutions proceduresmoving-target search problems
Related Items
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times, Moving target search optimization -- a literature review, A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search, Optimal search for a moving target with the option to wait