VDCBPI: An approximate scalable algorithm for large POMDPs

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages

  Poupart, Pascal ^a   Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NETWORK MANAGEMENT;

CURSE OF DIMENSIONALITY; MANAGEMENT PROBLEMS; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; POLICY ITERATION; SCALABLE ALGORITHMS; SPACE COMPLEXITY; SYNTHETIC NETWORKS;

ITERATIVE METHODS;

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

References (16)

1. D. Aberdeen and J. Baxter. Scaling internal-state policy-gradient methods for POMDPs. Proc. of the Nineteenth Intl. Conf. on Machine Learning, pp.3-10, Sydney, Australia, 2002.
2. C. Boutilier and D. Poole. Computing optimal policies for partially observable decision processes using compact representations. Proc. AAAI-96, pp.1168-1175, Portland, OR, 1996.
3. D. Braziunas and C. Boutilier. Stochastic local search for POMDP controllers. Proc. AAAI-04, to appear, San Jose, CA, 2004.
4. A. R. Cassandra, M. L. Littman, and N. L. Zhang. Incremental pruning: A simple, fast, exact method for POMDPs. Proc. UAI-97, pp.54-61, Providence, RI, 1997.
5. C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. Proc. IJCAI-01, pp.673-680, Seattle, WA, 2001.
6. 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.
7. E. A. Hansen. Solving POMDPs by searching in policy space. Proc. UAI-98, pp.211-219, Madison, Wisconsin, 1998.
8. E. A. Hansen and Z. Feng. Dynamic programming for POMDPs using a factored state representation. Proc. AIPS-2000, pp.130-139, Breckenridge, CO, 2000.
9. E. A. Hansen and Z. Feng. Approximate planning for factored POMDPs. Proc. ECP-2001, Toledo, Spain, 2000.
10. L. P. Kaelbling, M. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artif. Intel., 101:99-134, 1998.
11. N. Meuleau, L. Peshkin, K. Kim, and L. P. Kaelbling. Learning finite-state controllers for partially observable environments. Proc. UAI-99, pp.427-436, Stockholm, 1999.
12. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. IJCAI-03, Acapulco, Mexico, 2003.
13. P. Poupart and C. Boutilier. Value-directed compressions of POMDPs. Advances in Neural Information Processing Systems, pp.1547-1554, Vancouver, Canada, 2002.
14. P. Poupart and C. Boutilier. Bounded finite state controllers. Advances in Neural Information Processing Systems, Vancouver, Canada, 2003.
15. N. Roy and G. Gordon. Exponential family PCA for belief compression in pomdps. Advances in Neural Information Processing Systems, pp.1635-1642, Vancouver, BC, 2002.
16. M. T. J. Spaan and N. Vlassis. A point-based pomdp algorithm for robot planning. IEEE Intl. Conf. on Robotics and Automation, to appear, New Orleans, 2004.