Efficient ADD operations for point-based algorithms

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 330-337

  Shani, Guy ^a   Poupart, Pascal ^b   Brafman, Ronen I ^a   Shimony, Solomon E ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EXPLICIT REPRESENTATIONS; ORDERS OF MAGNITUDES; POINT-BASED; POINT-BASED ALGORITHMS; POINT-BASED METHODS; STATE SPACES;

SCHEDULING;

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

References (15)

1. Boutilier, C., and Poole, D. 1996. Computing optimal policies for partially observable decision processes using compact representations. In AAAI-96, 1168-1175.
2. Boyen, X., and Koller, D. 1998. Tractable inference for complex stochastic processes. In UAI '98, 33-42.
3. Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35(8):677-691.
4. Guestrin, C.; Koller, D.; and Parr, R. 2001. Solving factored pomdps with linear value functions. In IJCAI workshop on Planning under Uncertainty and Incomplete Information.
5. Hansen, E. A., and Feng, Z. 2000. Dynamic programming for POMDPs using a factored state representation. In Artificial Intelligence Planning Systems, 130-139.
6. Hoey, J.; von Bertoldi, A.; Poupart, P.; and Mihailidis, A. 2007. Assisting persons with dementia during handwashing using a partially observable markov decision process. In International Conference on Vision Systems (ICVS).
7. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In IJCAI.
8. Poupart, P. 2005. Exploiting Structure to Efficiently Solve Large Scale POMDPs. Ph.D. Dissertation, University of Toronto.
9. R.I. Bahar; E.A. Frohm; C.M. Gaona; G.D. Hachtel; E. Macii; and A. Pardo. 1993. Algebraic Decision Diagrams and Their Applications. In International Conference on CAD, 188-191.
10. Shani, G.; Brafman, R.; and Shimony, S. 2007. Forward search value iteration for pomdps. In IJCAI-07.
11. Smallwood, R., and Sondik, E. 1973. The optimal control of partially observable processes over a finite horizon. OR 21.
12. Smith, T., and Simmons, R. 2005. Point-based pomdp algorithms: Improved analysis and implementation. In UAI 2005.
13. Spaan, M. T. J., and Vlassis, N. 2005. Perseus: Randomized point-based value iteration for POMDPs. JAIR 24:195-220.
14. St-Aubin, R.; Hoey, J.; and Boutilier, C. 2000. APRICODD: Approximate policy construction using decision diagrams. In NIPS.
15. Zhang, N. L., and Poole, D. 1994. A simple approach to bayesian network computations. In Candian AI, 171-178.