Generating exponentially smaller POMDP models using conditionally irrelevant variable abstraction

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 304-311

  Smith, Trey ^a   Thompson, David R ^a   Wettergreen, David S ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

EXPLORATION DOMAIN; EXPONENTIALS; FACTORED MODELS; IRRELEVANT VARIABLES; NOVEL METHODS; ROBOTIC EXPLORATIONS; STATE-VARIABLES;

ABSTRACTING;

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

References (17)

1. Baum, J., and Nicholson, A. E. 1998. Dynamic non-uniform abstractions for approximate planning in large structured domains. In Pacific Rim Int. Conf. on Artificial Intelligence.
2. Boutilier, C., and Dearden, R. 1994. Using abstractions for decision-theoretic planning with time constraints. In AAAI.
3. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 2000. Stochastic dynamic programming with factored representations. Artificial Intelligence 121:49-107.
4. Castaño, R.; Anderson, R. C.; Estlin, T.; DeCoste, D.; Fisher, F.; Gaines, D.; Mazzoni, D.; and Judd, M. 2003. Rover traverse science for increased mission science return. In IEEE Aerospace Conf.
5. Dohm, J.; Cabrol, N.; Grin, E.; Moersch, J.; Diaz, G.; Cockell, C.; Coppin, P.; Fisher, G.; Hock, A.; Marinangeli, L.; Minkley, E.; Ori, G.; Piatek, J.; Warren-Rhodes, K.; Weinstein, S.; Wyatt, M.; Smith, T.; Wagner, M.; Stubbs, K.; Thomas, G.; and Glasgow, J. 2005. Life in the Atacama year 2: Geologic reconnaissance through long-range roving and implications on the search for life. In Lunar and Planetary Sci. Conf.
6. Feng, Z., and Hansen, E. 2001. Approximate planning for factored POMDPs. In European Conf. on Planning.
7. Givan, R.; Dean, T.; and Greig, M. 2003. Equivalence notions and model minimization in Markov decision processes. Artificial Intelligence 147:163-223.
8. Guestrin, C.; Roller, D.; and Parr, R. 2001. Multiagent planning with factored MDPs. In NIPS.
9. Hansen, E., and Feng, Z. 2000. Dynamic programming for POMDPs using a factored state representation. In ICAPS.
10. McAllester, D., and Singh, S. 1999. Approximate planning for factored pomdps using belief state simplification. In UAI.
11. Pineau, J., and Gordon, G. 2005. POMDP planning for robust robot control. In Int. Symp. on Robotics Res. (ISRR).
12. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Policycontingent abstraction for robust robot control. In UAI.
13. Poupart, P., and Boutilier, C. 2004. VDCBPI: an approximate scalable algorithm for large scale POMDPs. In NIPS.
14. Smith, T., and Simmons, R. 2005. Point-based POMDP algorithms: Improved analysis and implementation. In UAI.
15. Smith, T. 2007. Probabilistic Planning for Robotic Exploration. Ph.D. Dissertation, Carnegie Mellon University Robotics Institute, Pittsburgh, PA. (To appear, see also http://www.cs.cmu.edu/~trey/zmdp/).
16. Spaan, M. T. J., and Vlassis, N. 2005. Perseus: Randomized point-based value iteration for POMDPs. J. Artificial Intelligence Res. 24:195-220.
17. St. Aubin, R.; Hoey, J.; and Boutilier, C. 2000. APRI-CODD: Approximate policy construction using decision diagrams. In NIPS, 1089-1095.