{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:05:29Z","timestamp":1760609129842,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF CCF","award":["1139011","1514372","1162076"],"award-info":[{"award-number":["1139011","1514372","1162076"]}]},{"name":"NSF IIS","award":["1317849"],"award-info":[{"award-number":["1317849"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/lra.2019.2898045","type":"journal-article","created":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T20:08:51Z","timestamp":1549570131000},"page":"1860-1867","source":"Crossref","is-referenced-by-count":2,"title":["Point-Based Policy Synthesis for POMDPs With Boolean and Quantitative Objectives"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9416-1336","authenticated-orcid":false,"given":"Yue","family":"Wang","sequence":"first","affiliation":[]},{"given":"Swarat","family":"Chaudhuri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0699-8038","authenticated-orcid":false,"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"337","article-title":"Z3: An efficient SMT solver","author":"moura","year":"2008","journal-title":"TACAS"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0065-2458(03)58003-2","article-title":"Bounded model checking","volume":"58","author":"biere","year":"2003","journal-title":"Adv Comput"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347480"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.02.009"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7354079"},{"key":"ref10","first-page":"175","article-title":"Monte Carlo value iteration for continuous-state POMDPs","author":"bai","year":"0","journal-title":"Proc WAFR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139503"},{"key":"ref12","first-page":"233","article-title":"Temporal logic motion planning using POMDPs with parity objectives: Case study paper","author":"svore?ov\u00e1","year":"0","journal-title":"Proc HSCC"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139019"},{"key":"ref14","first-page":"3225","article-title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","author":"chatterjee","year":"0","journal-title":"Proc AAAI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.01.007"},{"key":"ref16","first-page":"238","article-title":"Bounded policy synthesis for POMDPs with safe-reachability objectives","author":"wang","year":"0","journal-title":"AAMAS"},{"key":"ref17","article-title":"Online partial conditional plan synthesis for POMDPs with safe-reachability objectives","author":"wang","year":"0","journal-title":"Proc WAFR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509743"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"journal-title":"Introduction to Probabilistic Automata","year":"1971","author":"paz","key":"ref28"},{"key":"ref4","first-page":"1243","article-title":"Point-based policy iteration","author":"ji","year":"0","journal-title":"Proc 22nd Nat Conf Artif Intell"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.441"},{"key":"ref3","first-page":"1025","article-title":"Point-based value iteration: An anytime algorithm for POMDPs","author":"pineau","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918780322"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00378-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2008.IV.009"},{"key":"ref8","first-page":"2329","article-title":"Point-based value iteration for continuous POMDPs","volume":"7","author":"porta","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"ref9","first-page":"1332","article-title":"Solving POMDPs with continuous or large discrete observation spaces","author":"hoey","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1071"},{"key":"ref20","first-page":"291","article-title":"Piecewise linear dynamic programming for constrained POMDPs","author":"isom","year":"0","journal-title":"Proc AAAI"},{"key":"ref22","first-page":"3342","article-title":"Approximate linear programming for constrained partially observable Markov decision processes","author":"poupart","year":"0","journal-title":"Proc AAAI"},{"key":"ref21","first-page":"1968","article-title":"Point-based value iteration for constrained POMDPs","author":"kim","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref24","first-page":"1357","article-title":"Risk-sensitive planning in partially observable environments","author":"marecki","year":"0","journal-title":"Proc AAMAS"},{"key":"ref23","first-page":"3308","article-title":"RAO*: An algorithm for chance-constrained POMDP's","author":"santana","year":"0","journal-title":"Proc AAAI"},{"key":"ref26","first-page":"211","article-title":"Solving POMDPs by searching in policy space","author":"hansen","year":"0","journal-title":"Proc UAI"},{"key":"ref25","first-page":"3138","article-title":"Solving risk-sensitive POMDPs with and without cost observations","author":"hou","year":"0","journal-title":"Proc AAAI"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8581687\/08637011.pdf?arnumber=8637011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:08:41Z","timestamp":1657746521000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8637011\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":34,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2898045","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}