Markov Chains With Maximum Entropy for Robotic Surveillance
DOI10.1109/TAC.2018.2844120zbMATH Open1482.90149OpenAlexW2807575755WikidataQ129733634 ScholiaQ129733634MaRDI QIDQ5223660FDOQ5223660
Authors: Mishel George, Saber Jafarpour, Francesco Bullo 
Publication date: 18 July 2019
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2018.2844120
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Convex programming (90C25) Applications of mathematical programming (90C90) Markov and semi-Markov decision processes (90C40)
Cited In (3)
- A blockchain prediction model on time, value, and purchase based on Markov chain and queuing theory in stock trade
- Asynchronous resource‐aware control for uncertain semi‐Markov jump systems with application to robot arm
- Finite-time asynchronous state estimation for jump systems with partial transition probabilities via redundant channels: a co-design method
This page was built for publication: Markov Chains With Maximum Entropy for Robotic Surveillance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223660)
