Context-specific multiagent coordination and planning with factored MDPs

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 253-259

  Guestrin, Carlos ^a   Venkataraman, Shobha ^a   Koller, Daphne ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LINEAR PROGRAMMING; MARKOV PROCESSES; MOTION PLANNING; OPTIMAL SYSTEMS;

MARKOV DECISION PROCESSES (MDP);

MULTI AGENT SYSTEMS;

EID: 0036923118     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Bertele, U., and Brioschi, F. 1972. Nonserial Dynamic Programming. New York: Academic Press.
2. Boutilier, C., and Dearden, R. 1996. Approximating value trees in structured dynamic programming. In Proc. ICML, 54-62.
3. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decision theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research 11:1 - 94.
4. Dean, T., and Kanazawa, K. 1989. A model for reasoning about persistence and causation. Computational Intelligence 5(3).
5. Dechter, R. 1999. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113(1-2):41-85.
6. Guestrin, C.; Koller, D.; and Parr, R. 2001a. Multiagent planning with factored MDPs. In Proc. NIPS-14.
7. Guestrin, C.; Koller, D.; and Parr, R. 2001b. Max-norm projections for factored MDPs. In Proc. IJCAI.
8. Koller, D., and Milch, B. 2001. Multi-agent influence diagrams for representing and solving games. In Proc. IJCAI.
9. Koller, D., and Parr, R. 1999. Computing factored value functions for policies in structured MDPs. In Proc. IJCAI.
10. Schweitzer, P., and Seidmann, A. 1985. Generalized polynomial approximations in Markovian decision processes. Journal of Mathematical Analysis and Applications 110:568 - 582.
11. Zhang, N., and Poole, D. 1999. On the role of context-specific independence in probabilistic reasoning. In Proc. IJCAI.