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

DOI10.1109/TAC.2003.809165zbMath1364.90351OpenAlexW2105901164MaRDI QIDQ5266921

Vikram Krishnamurthy, Sumeetpal S. Singh

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)

Related Items (2)

Cops and invisible robbers: the cost of drunkenness ⋮ A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search

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