As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In this article, we consider a form of compact representation of MDP based on graphs, and we propose an approximate solution algorithm derived from this representation. The approach we propose belongs to the family of Approximate Linear Programming methods, but the graph-structure we assume allows it to become particularly efficient. The proposed method complexity is linear in the number of variables in the graph and only exponential in the width of a dependency graph among variables.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.