@inproceedings {icaps16-134,
    track    = {​Main Track},
    title    = {From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends},
    url      = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13188},
    author   = {Alberto Camacho and  Christian Muise and  Sheila McIlraith},
    abstract = {We address the class of probabilistic planning problems where the objective is to maximize the probability of reaching a prescribed goal. The complexity of probabilistic planning problems makes it difficult to compute high quality solutions for large instances, and existing algorithms either do not scale, or do so at the expense of the solution quality. We leverage core similarities between probabilistic and fully observable non-deterministic (FOND) planning to construct a sound, offline probabilistic planner, ProbPRP, that exploits algorithmic advances from state-of-the-art FOND planner, PRP, to compute compact policies that are guaranteed to bypass avoidable deadends. We evaluate ProbPRP on a selection of benchmarks used in past probabilistic planning competitions. The results show that ProbPRP, in many cases, outperforms the state of the art, computing substantially more robust policies and at times doing so orders of magnitude faster.},
    keywords = {Probabilistic planning; MDPs and POMDPs}
}

{"_id":"wyM6Y4jL4YF2GAJaR","bibbaseid":"camacho-muise-mcilraith-fromfondtorobustprobabilisticplanningcomputingcompactpoliciesthatbypassavoidabledeadends","downloads":0,"creationDate":"2016-03-09T03:04:32.810Z","title":"From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends","author_short":["Camacho, A.","Muise, C.","McIlraith, S."],"year":null,"bibtype":"inproceedings","biburl":"icaps16.icaps-conference.org/papers.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","track":"​Main Track","title":"From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends","url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13188","author":[{"firstnames":["Alberto"],"propositions":[],"lastnames":["Camacho"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Muise"],"suffixes":[]},{"firstnames":["Sheila"],"propositions":[],"lastnames":["McIlraith"],"suffixes":[]}],"abstract":"We address the class of probabilistic planning problems where the objective is to maximize the probability of reaching a prescribed goal. The complexity of probabilistic planning problems makes it difficult to compute high quality solutions for large instances, and existing algorithms either do not scale, or do so at the expense of the solution quality. We leverage core similarities between probabilistic and fully observable non-deterministic (FOND) planning to construct a sound, offline probabilistic planner, ProbPRP, that exploits algorithmic advances from state-of-the-art FOND planner, PRP, to compute compact policies that are guaranteed to bypass avoidable deadends. We evaluate ProbPRP on a selection of benchmarks used in past probabilistic planning competitions. The results show that ProbPRP, in many cases, outperforms the state of the art, computing substantially more robust policies and at times doing so orders of magnitude faster.","keywords":"Probabilistic planning; MDPs and POMDPs","bibtex":"@inproceedings {icaps16-134,\r\n track = {​Main Track},\r\n title = {From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends},\r\n url = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13188},\r\n author = {Alberto Camacho and Christian Muise and Sheila McIlraith},\r\n abstract = {We address the class of probabilistic planning problems where the objective is to maximize the probability of reaching a prescribed goal. The complexity of probabilistic planning problems makes it difficult to compute high quality solutions for large instances, and existing algorithms either do not scale, or do so at the expense of the solution quality. We leverage core similarities between probabilistic and fully observable non-deterministic (FOND) planning to construct a sound, offline probabilistic planner, ProbPRP, that exploits algorithmic advances from state-of-the-art FOND planner, PRP, to compute compact policies that are guaranteed to bypass avoidable deadends. We evaluate ProbPRP on a selection of benchmarks used in past probabilistic planning competitions. The results show that ProbPRP, in many cases, outperforms the state of the art, computing substantially more robust policies and at times doing so orders of magnitude faster.},\r\n keywords = {Probabilistic planning; MDPs and POMDPs}\r\n}\r\n\r\n","author_short":["Camacho, A.","Muise, C.","McIlraith, S."],"key":"icaps16-134","id":"icaps16-134","bibbaseid":"camacho-muise-mcilraith-fromfondtorobustprobabilisticplanningcomputingcompactpoliciesthatbypassavoidabledeadends","role":"author","urls":{"Paper":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13188"},"keyword":["Probabilistic planning; MDPs and POMDPs"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["fond","robust","probabilistic","planning","computing","compact","policies","bypass","avoidable","deadends","camacho","muise","mcilraith"],"keywords":["probabilistic planning; mdps and pomdps"],"authorIDs":[],"dataSources":["iMkx859KiXcegwsin","EZtZjCTnxcdTTyeij"]}