{"date_published":"2015-02-19T00:00:00Z","citation":{"apa":"Anonymous, 1, &#38; Anonymous, 2. (2015). <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p.","ama":"Anonymous 1, Anonymous 2. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria; 2015.","mla":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","ieee":"1 Anonymous and 2 Anonymous, <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria, 2015.","chicago":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015."},"type":"technical_report","ddc":["000"],"year":"2015","pubrep_id":"326","has_accepted_license":"1","status":"public","publication_status":"published","date_updated":"2020-07-14T23:04:59Z","oa_version":"Published Version","language":[{"iso":"eng"}],"title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","file":[{"file_size":378162,"creator":"system","content_type":"application/pdf","file_name":"IST-2015-326-v1+1_main.pdf","date_updated":"2020-07-14T12:46:53Z","checksum":"8542fd0b10aed7811cd41077b8ccb632","date_created":"2018-12-12T11:53:14Z","relation":"main_file","file_id":"5475","access_level":"open_access"},{"file_name":"IST-2015-326-v1+2_authors.txt","content_type":"text/plain","creator":"dernst","file_size":64,"access_level":"closed","relation":"main_file","file_id":"6317","checksum":"84c31c537bdaf7a91909f18d25d640ab","date_created":"2019-04-16T13:00:33Z","date_updated":"2020-07-14T12:46:53Z"}],"file_date_updated":"2020-07-14T12:46:53Z","day":"19","author":[{"full_name":"Anonymous, 1","last_name":"Anonymous","first_name":"1"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","month":"02","alternative_title":["IST Austria Technical Report"],"page":"16","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:18Z","_id":"5434","oa":1,"abstract":[{"lang":"eng","text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new method to solve the problem that extends methods for finite-horizon DEC- POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show our approach presents promising results."}]}