{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:37:10Z","timestamp":1730223430751,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/globalsip.2013.6736845","type":"proceedings-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T22:45:12Z","timestamp":1392331512000},"page":"181-184","source":"Crossref","is-referenced-by-count":1,"title":["The value of sleeping: A rollout algorithm for sensor scheduling in HMMs"],"prefix":"10.1109","author":[{"given":"David","family":"Jun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas L.","family":"Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2013.2243632"},{"key":"18","article-title":"Heuristic search value iteration for POMDPs","author":"smith","year":"2004","journal-title":"Proc Int Conf on Uncertainty in A I"},{"key":"15","article-title":"The hierarchical hidden Markov model: Analysis and applications","author":"fine","year":"1998","journal-title":"Machine Learning"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-76544-0"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1676\/09-195.1"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288210"},{"key":"11","article-title":"Incremental methods for computing bounds in partially observable markov decision processes","author":"hauskrecht","year":"1997","journal-title":"9th Nat Conf AI"},{"journal-title":"Markov Chains","year":"1998","author":"norris","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638453"},{"journal-title":"Closing the gap Improved bounds on optimal POMDP solutions ' in Int Conf Automated Planning and Scheduling 2011","year":"0","author":"poupart","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2011.2167964"},{"journal-title":"Optimal sensor scheduling for hidden Markov model state estimation ' Int Journal of Control","year":"2001","author":"evans","key":"10"},{"key":"7","article-title":"Value-function approximations for partially observable markov decision processes","author":"hauskrecht","year":"2000","journal-title":"J of A I Research"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.2.282"},{"journal-title":"Exact and approximate algorithms for partially observable Markov decision processes","year":"1998","author":"cassandra","key":"5"},{"key":"4","volume":"i","author":"bertsekas","year":"1995","journal-title":"Dynamic Programming and Optimal Control"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49819-5"},{"key":"8","article-title":"Perseus: Randomized point-based value iteration for POMDPs","author":"spaan","year":"2005","journal-title":"J of A I Research"}],"event":{"name":"2013 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","start":{"date-parts":[[2013,12,3]]},"location":"Austin, TX, USA","end":{"date-parts":[[2013,12,5]]}},"container-title":["2013 IEEE Global Conference on Signal and Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6728802\/6736786\/06736845.pdf?arnumber=6736845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T17:15:05Z","timestamp":1490289305000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6736845\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/globalsip.2013.6736845","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}