{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:12:46Z","timestamp":1755792766599,"version":"3.44.0"},"reference-count":8,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"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":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/ssci.2016.7849372","type":"proceedings-article","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T17:24:33Z","timestamp":1487265873000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["A multi-criteria value iteration algorithm for POMDP problems"],"prefix":"10.1109","author":[{"family":"Feng Liu","sequence":"first","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Software institute, Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Tao Zheng","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Software institute, Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xia Hua","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Software institute, Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"1025","article-title":"Point-based value iteration: An anytime algorithm for POMDPs","author":"gordon","year":"2003","journal-title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2006.06.008"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1609\/icaps.v21i1.13467","article-title":"Closing the Gap: Improved Bounds on Optimal POMDP Solutions","author":"poupart","year":"2011","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling"},{"key":"ref5","first-page":"542","article-title":"Point-based POMDP algorithms: Improved analysis and implementation","author":"smith","year":"2005","journal-title":"Proceedings of 21th Conference on Uncertainty in Artificial Intelligence"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-012-9200-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1071"},{"key":"ref2","first-page":"1293","article-title":"A decision-theoretic approach to task assistance for persons with dementia","author":"boger","year":"2005","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence"},{"journal-title":"Probabilistic planning for robotic exploration","year":"2007","author":"smith","key":"ref1"}],"event":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2016,12,6]]},"location":"Athens, Greece","end":{"date-parts":[[2016,12,9]]}},"container-title":["2016 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7840087\/7849361\/07849372.pdf?arnumber=7849372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T18:44:03Z","timestamp":1755197043000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7849372\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/ssci.2016.7849372","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}