{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:26:21Z","timestamp":1780370781540,"version":"3.54.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1139011"],"award-info":[{"award-number":["1139011"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1162076"],"award-info":[{"award-number":["1162076"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1317849"],"award-info":[{"award-number":["1317849"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1514372"],"award-info":[{"award-number":["1514372"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/tase.2021.3057111","type":"journal-article","created":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T21:15:47Z","timestamp":1614114947000},"page":"932-945","source":"Crossref","is-referenced-by-count":10,"title":["Online Partial Conditional Plan Synthesis for POMDPs With Safe-Reachability Objectives: Methods and Experiments"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9416-1336","authenticated-orcid":false,"given":"Yue","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdullah Al Redwan","family":"Newaz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan David","family":"Hernandez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Swarat","family":"Chaudhuri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0699-8038","authenticated-orcid":false,"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347480"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.02.009"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2978451"},{"key":"ref32","article-title":"Belief-dependent macro-action discovery in POMDPs using the value of information","volume":"33","author":"flaspohler","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2899918"},{"key":"ref30","first-page":"8092","article-title":"A Lyapunov-based approach to safe reinforcement learning","volume":"31","author":"chow","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00378-8"},{"key":"ref36","author":"paz","year":"1971","journal-title":"Introduction to Probabilistic Automata"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.441"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793818"},{"key":"ref28","first-page":"3138","article-title":"Solving risk-sensitive POMDPs with and without cost observations","author":"hou","year":"2016","journal-title":"Proc AAAI"},{"key":"ref27","first-page":"1357","article-title":"Risk-sensitive planning in partially observable environments","author":"marecki","year":"2010","journal-title":"Proc AAMAS"},{"key":"ref29","first-page":"6765","article-title":"Inverse reward design","volume":"30","author":"hadfield-menell","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1071"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139503"},{"key":"ref22","first-page":"127","article-title":"Online partial conditional plan synthesis for POMDPs with safe-reachability objectives","author":"wang","year":"2018","journal-title":"Proc WAFR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487758"},{"key":"ref24","first-page":"1968","article-title":"Point-based value iteration for constrained POMDPs","author":"kim","year":"2011","journal-title":"Proc IJCAI"},{"key":"ref23","first-page":"291","article-title":"Piecewise linear dynamic programming for constrained POMDPs","author":"isom","year":"2008","journal-title":"Proc AAAI"},{"key":"ref26","first-page":"3308","article-title":"RAO*: An algorithm for chance-constrained POMDP’s","author":"santana","year":"2016","journal-title":"Proc AAAI"},{"key":"ref25","first-page":"3342","article-title":"Approximate linear programming for constrained partially observable Markov decision processes","author":"poupart","year":"2015","journal-title":"Proc AAAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2008.IV.009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914528255"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2567"},{"key":"ref12","first-page":"1772","article-title":"DESPOT: Online POMDP planning with regularization","author":"somani","year":"2013","journal-title":"Proc NIPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918780322"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509743"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/2728606.2728617","article-title":"Temporal logic motion planning using POMDPs with parity objectives: Case study paper","author":"svore?ov\u00e1","year":"2015","journal-title":"Proc HSCC"},{"key":"ref16","first-page":"3225","article-title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","author":"chatterjee","year":"2016","journal-title":"Proc AAAI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.01.007"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913484072"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7354079"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139019"},{"key":"ref3","first-page":"1025","article-title":"Point-based value iteration: An anytime algorithm for POMDPs","author":"pineau","year":"2003","journal-title":"Proc IJCAI"},{"key":"ref6","first-page":"238","article-title":"Bounded policy synthesis for POMDPs with safe-reachability objectives","author":"wang","year":"2018","journal-title":"Proc AAMAS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364920937074"},{"key":"ref8","first-page":"1332","article-title":"Solving POMDPs with continuous or large discrete observation spaces","author":"hoey","year":"2005","journal-title":"Proc IJCAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2903259"},{"key":"ref49","year":"2019","journal-title":"Vicon"},{"key":"ref9","first-page":"2329","article-title":"Point-based value iteration for continuous POMDPs","volume":"7","author":"porta","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref46","article-title":"ROS: An open-source robot operating system","author":"quigley","year":"2009","journal-title":"Proc ICRA Workshop Open Source Softw"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2004.1389727"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.889486"},{"key":"ref47","author":"thrun","year":"2005","journal-title":"Probabilistic Robotics"},{"key":"ref42","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":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref44","article-title":"Fetch and freight: Standard platforms for service robot applications","author":"wise","year":"2016","journal-title":"Proc Workshop Auton Mobile Service Robots Held Int Joint Conf Artif Intell"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918761570"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8856\/9470960\/9361180-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/9470960\/09361180.pdf?arnumber=9361180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:31Z","timestamp":1652194351000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9361180\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":49,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tase.2021.3057111","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}