Learning partially observable deterministic action models

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1433-1439

  Amir, Eyal ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION MODELS; CONDITIONAL EFFECTS; DETERMINISTIC DOMAINS; EXACT SOLUTION; FALSE POSITIVE; THEORETICAL GUARANTEES; VERSION SPACE; VIRTUAL WORLDS;

AUTONOMOUS AGENTS; REINFORCEMENT LEARNING; VIRTUAL REALITY;

ARTIFICIAL INTELLIGENCE;

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

References (22)

1. Eyal Amir and Stuart Russell. Logical filtering. In IJCAI '03, pages 75-82. MK, 2003.
2. Scott Benson. Inductive learning of reactive action models. In Proc. ICML-94, 1995.
3. Xavier Boyen and Daphne Koller. Approximate learning of dynamic models. In Michael S. Kearns, Sara A. Solla, and David A. Kohn, editors, NIPS 1998, pages 396-402. Cambridge: MIT Press, 1999. Available at http://www.cs.stanford. edu/ xb/nips98/.
4. Xavier Boyen, Nir Friedman, and Daphne Koller. Discovering the hidden structure of complex dynamic systems. In Proc. UAI '99, pages 91-100. MK, 1999.
5. Rina Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1-2):41-85, 1999.
6. T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates, and counterfactuals. AIJ, 57(2-3):227-270, 1992. (Pubitemid 23586698)
7. R. Fikes, P. Hart, and N. Nilsson. Learning and executing generalized robot plans. AIJ, 3, 1972.
8. Z. Ghahramani and M. I. Jordan. Factorial Hidden Markov Models. Machine Learning, 29:245-275, 1997.
9. Zoubin Ghahramani. An introduction to Hidden Markov Models and Bayesian networks. Intl J. of Pattern Recog. and AI, 15(1):9-42, 2001.
10. Yolanda Gil. Learning by experimentation: Incremental refinement of incomplete planning domains. In Proc. ICML-94, pages 10-13, 1994.
11. Hannaneh Hajishirzi and Eyal Amir. Tractable exact inference in some dynamic Bayesian networks. In submitted for publication, 2005.
12. Brian Hlubocky and Eyal Amir. Logic-based approach to decision making in expanding worlds. In submitted for publication, 2005.
13. L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. AIJ, 101:99-134, 1998.
14. M. Kearns, Y. Mansour, and A. Y. Ng. Approximate planning in large pomdps via reusable trajectories. In Proc. NIPS'99, pages 1001-1007, 2000.
15. M. L. Littman. Algorithms for sequential decision making. PhD thesis, Brown U., 1996.
16. John McCarthy. Applications of Circumscription to Formalizing Common Sense Knowledge. Artificial Intelligence, 28:89-116, 1986. (Pubitemid 16503926)
17. K. Murphy. Dynamic Bayesian Networks: Representation, Inference and Learning. PhD thesis, UC Berkeley, 2002.
18. T. Oates and P. R. Cohen. Searching for planning operators with context-dependent and probabilistic effects. In Proc. AAAI '96, 1996.
19. H. M. Pasula, L. S. Zettlemoyer, and L. P. Kaelbling. Learning probabilistic relational planning rules. In Proc. ICAPS'04, 2004.
20. M. D. Schmill, T. Oates, and P. R. Cohen. Learning planning operators in real-world, partially observable environments. In Proc. AIPS'00, 2000.
21. Laurent Simon and Alvaro del Val. Efficient consequence-finding. In IJCAI '01, 2001.
22. Xuemei Wang. Learning by observation and practice: an incremental approach for planning operator acquisition. In Proc. ICML-95, pages 549-557. MK, 1995.