{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:45:35Z","timestamp":1774946735501,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/tac.2019.2942528","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T19:44:52Z","timestamp":1569008692000},"page":"3256-3271","source":"Crossref","is-referenced-by-count":6,"title":["Information Relaxation Bounds for Partially Observed Markov Decision Processes"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0823-1044","authenticated-orcid":false,"given":"Martin B.","family":"Haugh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6705-8336","authenticated-orcid":false,"given":"Octavio Ruiz","family":"Lacedelli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","article-title":"Exact and approximate algorithms for partially observed Markov decision processes","author":"cassandra","year":"1998"},{"key":"ref30","volume":"1","author":"bertsekas","year":"2017","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/j.0960-1627.2004.00205.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/09077076X"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2012.03.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1110.1377"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1322"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2731817"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2418672"},{"key":"ref17","article-title":"Information relaxations and dynamic zero-sum games","author":"haugh","year":"0"},{"key":"ref18","first-page":"693","article-title":"Pathwise dynamic programming","volume":"43","author":"bender","year":"2016","journal-title":"Math Oper Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1782"},{"key":"ref28","first-page":"246","article-title":"An anytime algorithm for decision making under uncertainty","author":"horsch","year":"0","journal-title":"Proc 11th Annu Conf Uncertainty Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/9781118453988.ch20"},{"key":"ref27","first-page":"362","article-title":"Learning policies for partially observable environments","author":"littman","year":"0","journal-title":"Proc 12th Int Conf Mach Learn"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1631"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0070"},{"key":"ref29","article-title":"Computing bounds on expected utilities for optimal policies based on limited information","author":"nilsson","year":"0","journal-title":"Dept Math Sci Aalborg Univ"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1613\/jair.678"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00780-006-0031-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9965.02010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/050642885"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0258"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0796"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1749"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/120896761"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1517"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316471104"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2747405"},{"key":"ref26","author":"koller","year":"2009","journal-title":"Probabilistic Graphical Models Principles and Techniques"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68282-2"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9149956\/08845618.pdf?arnumber=8845618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T16:42:47Z","timestamp":1651077767000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8845618\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":31,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tac.2019.2942528","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}