{"citation":{"apa":"Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. <i>Artificial Intelligence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">https://doi.org/10.1016/j.artint.2016.01.007</a>","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.","mla":"Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” <i>Artificial Intelligence</i>, vol. 234, Elsevier, 2016, pp. 26–48, doi:<a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">10.1016/j.artint.2016.01.007</a>.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. <i>Artificial Intelligence</i>. 2016;234:26-48. doi:<a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">10.1016/j.artint.2016.01.007</a>","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” <i>Artificial Intelligence</i>, vol. 234. Elsevier, pp. 26–48, 2016.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” <i>Artificial Intelligence</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">https://doi.org/10.1016/j.artint.2016.01.007</a>."},"scopus_import":1,"doi":"10.1016/j.artint.2016.01.007","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5642","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest."}],"publisher":"Elsevier","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1820"},{"relation":"earlier_version","id":"5425","status":"public"}]},"article_processing_charge":"No","publication":"Artificial Intelligence","quality_controlled":"1","external_id":{"arxiv":["1411.3880"]},"date_published":"2016-05-01T00:00:00Z","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1411.3880"}],"ec_funded":1,"status":"public","day":"01","oa":1,"oa_version":"Preprint","publication_status":"published","acknowledgement":"We thank Blai Bonet for helping us with RTDP-Bel. The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","intvolume":"       234","date_created":"2018-12-11T11:52:33Z","volume":234,"date_updated":"2023-02-23T12:25:49Z","page":"26 - 48","month":"05","title":"Optimal cost almost-sure reachability in POMDPs","_id":"1529","department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"first_name":"Raghav","full_name":"Gupta, Raghav","last_name":"Gupta"},{"first_name":"Ayush","full_name":"Kanodia, Ayush","last_name":"Kanodia"}],"type":"journal_article","year":"2016"}