{"type":"ScholarlyArticle","title":"ReTrASE: Integrating Paradigms for Approximate Probabilistic Planning","authors":[{"name":"Andrey Kolobov","slug":"andrey-kolobov","given":"Andrey","family":"Kolobov","affiliation":""},{"name":"Mausam","slug":"mausam","given":"","family":"Mausam","affiliation":""},{"name":"Daniel S. Weld","slug":"daniel-s-weld","given":"Daniel S.","family":"Weld","affiliation":""}],"abstract":"The Web Service Composition (WSC) problem with respect to behavioral descriptions deals with the automatic synthesis of a coordinator web service, c, that controls a set of web services to reach a goal state. Despite its importance, however, solving the WSC problem for a general case (when c has only partial observations) remains to be doubly exponential in the number of variables in web service descriptions, rendering any attempts to compute an exact solution for modest size impractical. Toward this challenge, in this paper, we propose two novel (signature preserving and subsuming) approximation-based approaches using abstraction and refinement. We empirically validate that our proposals can solve realistic problems efficientlyHyunyoung Kil, Wonhong Nam, Dongwon LeePast approaches for solving MDPs have several weaknesses: 1) Decision-theoretic computation over the state space can yield optimal results but scales poorly. 2) Value-function approximation typically requires human-specified basis functions and has not been shown successful on nominal (discrete) domains such as those in the ICAPS planning competitions. 3) Replanning by applying a classical planner to a determinized domain model can generate approximate policies for very large problems but has trouble handling probabilistic subtlety. This paper presents ReTrASE, a novel MDP solver, which combines decision theory, function approximation and classical planning in a new way. ReTrASE uses classical planning to create basis functions for value-function approximation and applies expected-utility analysis to this compact space. Our algorithm is memory-efficient and fast (due to its compact, approximate representation), returns high-quality solutions (due to the decision-theoretic framework) and does not require additional knowledge from domain engineers (since we apply classical planning to automatically construct the basis functions). Experiments demonstrate that ReTrASE outperforms winners from the past three probabilistic-planning competitions on many hard problems.Andrey Kolobov, Mausam, Daniel S. Weld","doi":null,"url":"https://ijcai.org/proceedings/2009/291","pdf":"https://ijcai.org/proceedings/2009/0291.pdf","markdown":"https://ijcai.org/proceedings/2009/291.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/291","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":291,"pages":{"first":1746,"last":1752},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}