Carlos Guestrin, Daphne Koller, and Ronald Parr. Solving factored POMDPs with linear value functions. In Seventeenth International Joint Conference on Arti cial Intelligence (IJCAI-01) workshop on Planning under Uncertainty and Incomplete Information, pages 67 75, Seattle, Washington, August 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Value-directed Compression of POMDPs - Poupart, Boutilier (2002) (8 citations) (Correct)
....compression lies in distinguishing relevant information from that which can be safely discarded. A number of schemes have been proposed for either directly or indirectly compressing POMDPs. For example, approaches using bounded memory [8, 10] and state aggregation either dynamic [2] or static [5, 9] can be viewed in this light. In this paper, we study the effect of static state space compression on decision quality. We first characterize lossless compressions those that do not lead to any error in expected value by deriving a set of conditions that guarantee decision quality will not ....
C. Guestrin, D. Koller, and R. Parr. Solving factored POMDPs with linear value functions. IJCAI-01 Worksh. on Planning under Uncertainty and Inc. Info., Seattle, WA, 2001.
Learning in Zero-Sum Team Markov Games - Using Factored Value Self-citation (Parr) (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Solving factored POMDPs with linear value functions. In IJCAI-01 workshop on Planning under Uncertainty and Incomplete Information, 2001.
Learning in Zero-Sum Team Markov Games using Factored Value.. - Lagoudakis, Parr (2002) (1 citation) Self-citation (Parr) (Correct)
....ones for any probability distribution: 0 . For consistency, we must ensure that all marginals over common variables are identical: h , a # j a # h Ah # h (s, a h ) These constraints are sufficient if the running intersection property is satisfied by the # j (s) s [3]. If not, it is possible that the resulting # j (s) s will not be consistent with any global distribution even though they are locally consistent. However, the running intersection property can be enforced by introducing certain additional local distributions in the set of # j (s) s. This can be ....
Carlos Guestrin, Daphne Koller, and Ronald Parr. Solving factored POMDPs with linear value functions. In IJCAI-01 workshop on Planning under Uncertainty and Incomplete Information, 2001.
Game theory and AI: a unified approach to poker games - Oliehoek (2005) (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Solving factored POMDPs with linear value functions. In Seventeenth International Joint Conference on Arti cial Intelligence (IJCAI-01) workshop on Planning under Uncertainty and Incomplete Information, pages 67 75, Seattle, Washington, August 2001.
VDCBPI: an Approximate Scalable Algorithm - For Large Pomdps (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Solving factored POMDPs with linear value functions. IJCAI-01 Wkshp. on Planning under Uncertainty and Incomplete Information, Seattle, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC