The optimal search for a Markovian target when the search path is constrained: the infinite-horizon case

DOI10.1109/TAC.2003.809165zbMATH Open1364.90351OpenAlexW2105901164MaRDI QIDQ5266921FDOQ5266921

Authors: Sumeetpal S. Singh, Vikram Krishnamurthy 

Publication date: 20 June 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2003.809165

Mathematics Subject Classification ID

Search theory (90B40) Markov and semi-Markov decision processes (90C40)

Cited In (3)

• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
• Optimal search-relocation trade-off in Markovian-target searching
• Cops and invisible robbers: the cost of drunkenness

This page was built for publication: The optimal search for a Markovian target when the search path is constrained: the infinite-horizon case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266921)