{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:29:06Z","timestamp":1730341746384,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,31]]},"DOI":"10.23919\/acc55779.2023.10156299","type":"proceedings-article","created":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T17:48:03Z","timestamp":1688406483000},"page":"3332-3337","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity and Approximability of Optimal Sensor Selection for Mixed-Observable Markov Decision Processes"],"prefix":"10.23919","author":[{"given":"Jayanth","family":"Bhargav","sequence":"first","affiliation":[{"name":"Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahsa","family":"Ghasemi","sequence":"additional","affiliation":[{"name":"Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shreyas","family":"Sundaram","sequence":"additional","affiliation":[{"name":"Purdue University,Elmore Family School of Electrical & Computer Engineering,West Lafayette,IN,47907"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3512798.3512815"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INTECH.2016.7845053"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029762"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.441"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2835758"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6906925"},{"article-title":"Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes","year":"2013","author":"cassandra","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.1.1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.893747"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.897908"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2980924"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3195089"},{"year":"0","key":"ref24","article-title":"SolvePOMDP-a java program that solves Partially Observable Markov Decision Processes"},{"key":"ref23","first-page":"1650","article-title":"Near-optimal observation selection using submodular functions","volume":"7","author":"krause","year":"2007","journal-title":"AAAI"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.11032"},{"key":"ref20","first-page":"1560","article-title":"Scalable greedy feature selection via weak submodularity","author":"khanna","year":"2017","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref21","article-title":"A Guide to the Theory of NP-Completeness","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9483071"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3007383"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487646"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2008.IV.009"},{"key":"ref3","article-title":"Point-based value iteration: An anytime algorithm for POMDPs","volume":"3","author":"pineau","year":"2003","journal-title":"IJCAI"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2016.12.025"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2010.101"}],"event":{"name":"2023 American Control Conference (ACC)","start":{"date-parts":[[2023,5,31]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2023,6,2]]}},"container-title":["2023 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10155646\/10155787\/10156299.pdf?arnumber=10156299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T21:10:57Z","timestamp":1688418657000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10156299\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,31]]},"references-count":25,"URL":"https:\/\/doi.org\/10.23919\/acc55779.2023.10156299","relation":{},"subject":[],"published":{"date-parts":[[2023,5,31]]}}}