RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 83-92

  Brunskill, Emma ^a   Russell, Stuart ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES;

DYNAMICS MODELING; NUMBER OF STATE; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; STATE DYNAMICS; STATE VARIABLES; STRUCTURED MODEL; TOPOLOGICAL STRUCTURE;

TOPOLOGY;

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

References (20)

1. Bertsekas, D., & Tsitsiklis, J. (1996). Neuro-dynamic programming. Athena Scientific.
2. Boger, J., Poupart, P., Hoey, J., Boutilier, C., Fernie, G., & Mihailidis, A. (2005). A decision-theoretic approach to task assistance for persons with dementia. IJCAI.
3. Boutilier, C., Dearden, R., & Goldszmidt, M. (2000). Stochastic dynamic programming with factored representations. Artificial Intelligence Journal.
4. Brafman, R., & Domshlak, C. (2003). Structure and complexity in planning with unary operators. Journal of Artificial Intelligence Research, 18, 315-349. (Pubitemid 41525939)
5. Close, J., & Murtagh, F. (1986). An analysis of the relationships among computation-related skills using a hierarchicalclustering technique. Journal for Research in Mathematics Education, 17, 112-129.
6. Corbett, A., & Anderson, J. (1995). Knowledge tracing: Modeling the acquisition of procedural knowledge. User Modeling and User-Adapted Interaction, 4, 253-278.
7. Cormen, T., Leiserson, C., & Rivest, R. (1999). Introduction to algorithms. McGraw-Hill Book Company.
8. Dai, P., & Goldsmith, J. (2007). Topological value iteration algorithm for Markov decision processes. IJCAI.
9. Dean, T., Kaelbling, L. P., Kirman, J., & Nicholson, A. (1995). Planning under time constraints in stochastic domains. Artificial Intelligence, 76, 35-74.
10. Dibangoye, J., Shani, G., Chaib-draa, B., & Mouaddib, A. (2009). Topological order planner for POMDPs. IJCAI.
11. Gagné, R., & Briggs, L. (1974). Principles of instructional design. Holt, Rinehard, and Winston.
12. Gardiol, N. H., & Kaelbling, L. P. (2004). Envelope-based planning in relational MDPs. NIPS.
13. Koedinger, K. R., Anderson, J., Hadley, W., & Mark, M. (1997). Intelligent tutoring goes to school in the big city. International Journal of Artificial Intelligence in Education, 8, 30-43.
14. Kurniawati, H., Hsu, D., & W.S., L. (2008). SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. RSS.
15. Miller, P., & Phillips, E. R. (1974). Developed of a learning hierarchy for the computational skills of fractional number subtraction. American Educational Research Association Meeting.
16. Papadimitriou, C., & Tsitsiklis, J. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12, 441-450.
17. Paquet, S., Tobin, L., & Chaib-draa, B. (2005). An online POMDP algorithm for complex multiagent environments. AAMAS.
18. Sim, H., Kim, K., Kim, J., Chang, D., & Koo, M. (2008). Symbolic heuristic search value iteration for factored pomdps. AAAI.
19. Smith, T., & Simmons, R. (2005). Point-based POMDP algorithms: Improved analysis and implementation. UAI.
20. Uprichard, A. E., & Phillips, E. (1977). An intraconcept analysis of rational number addition: A validation study. Journal for Research in Mathematics Education, 8, 7-16.