Approximate inference for planning in stochastic relational worlds

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 585-592

  Lang, Tobias ^a   Toussaint, Marc ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SEQUENCES; APPROXIMATE INFERENCE; DYNAMIC BAYESIAN NETWORK; EFFICIENT PLANNING; EMPIRICAL RESULTS; EXISTING METHOD; ON-LINE PLANNING; PROBABILISTIC RELATIONAL RULES; REALISTIC PHYSICS; STOCHASTIC DOMAINS; WORLD MODEL;

BAYESIAN NETWORKS; INFERENCE ENGINES; ROBOT LEARNING; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; THREE DIMENSIONAL;

ROBOT PROGRAMMING;

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

References (13)

1. Botvinick, M. M., & An, J. (2009). Goal-directed decision making in prefrontal cortex: a computational framework. Advances in Neural Information Processing Systems (NIPS) (pp. 169-176).
2. Croonenborghs, T., Ramon, J., Blockeel, H., & Bruynooghe, M. (2007). Online learning and exploiting relational models in reinforcement learning. Proc. of the Int. Conf. on Artificial Intelligence (IJCAI) (pp. 726-731).
3. Dayan, P., & Hinton, G. E. (1997). Using expectation-maximization for reinforcement learning. Neural Computation, 9, 271-278.
4. Gardiol, N. H., & Kaelbling, L. P. (2007). Action-space partitioning for planning. Proc. of the Nat. Conf. on Artificial Intelligence (AAAI) (pp. 980-986).
5. Getoor, L., & Taskar, B. (Eds.). (2007). Introduction to statistical relational learning. MIT Press.
6. Kearns, M. J., Mansour, Y., & Ng, A. Y. (2002). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Machine Learning, 49, 193-208.
7. Kersting, K., van Otterlo, M., & de Raedt, L. (2004). Bellman goes relational. Proc. of the Int. Conf. on Machine Learning (ICML) (pp. 465-472).
8. Murphy, K. P., & Weiss, Y. (2001). The factored frontier algorithm for approximate inference in DBNs. Proc. of the Conf. on Uncertainty in Artificial Intelligence (UAI) (pp. 378-385).
9. Pasula, H. M., Zettlemoyer, L. S., & Kaelbling, L. P. (2007). Learning symbolic models of stochastic domains. Artificial Intelligence Research, 29, 309-352.
10. Sanghai, S., Domingos, P., & Weld, D. (2005). Relational dynamic Bayesian networks. Artificial Intelligence Research, 24, 759-797.
11. Sanner, S., & Boutilier, C. (2007). Approximate solution techniques for factored first-order MDPs. Proc. of the Int. Conf. on Automated Planning and Scheduling (ICAPS) (pp. 288-295).
12. Toussaint, M., & Storkey, A. (2006). Probabilistic inference for solving discrete and continuous state Markov decision processes. Proc. of the Int. Conf. on Machine Learning (ICML) (pp. 945-952).
13. van Otterlo, M. (2009). The logic of adaptive behavior. IOS Press, Amsterdam.