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

DOI10.1109/TAC.2003.809165MaRDI QIDQ5266921zbMATH OpenOpenAlexFDO

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)

• Optimal search-relocation trade-off in Markovian-target searching
• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
• 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)