{"external_id":{"isi":["000492986200006"],"arxiv":["1710.00675"]},"page":"47 - 55","status":"public","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T11:44:16Z","month":"06","citation":{"short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.","mla":"Chatterjee, Krishnendu, et al. <i>Sensor Synthesis for POMDPs with Reachability Objectives</i>. Vol. 2018, AAAI Press, 2018, pp. 47–55.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55.","ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.","chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.","apa":"Chatterjee, K., Chemlík, M., &#38; Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press."},"alternative_title":["ICAPS"],"conference":{"end_date":"2018-06-29","start_date":"2018-06-24","name":"ICAPS: International Conference on Automated Planning and Scheduling","location":"Delft, Netherlands"},"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","full_name":"Chemlík, Martin","last_name":"Chemlík"},{"first_name":"Ufuk","full_name":"Topcu, Ufuk","last_name":"Topcu"}],"_id":"34","abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies."}],"publication_status":"published","type":"conference","volume":2018,"date_updated":"2023-09-19T14:44:14Z","isi":1,"day":"01","ec_funded":1,"year":"2018","publisher":"AAAI Press","date_published":"2018-06-01T00:00:00Z","title":"Sensor synthesis for POMDPs with reachability objectives","scopus_import":"1","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1710.00675","open_access":"1"}],"oa_version":"Preprint","publist_id":"8021","language":[{"iso":"eng"}],"intvolume":"      2018"}