Probabilistic inference for structured planning in robotics

IEEE International Conference on Intelligent Robots and Systems

Volumn , Issue , 2007, Pages 3068-3073

  Toussaint, Marc ^a   Goerick, Christian ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b HONDA RESEARCH INSTITUTE EUROPE GMBH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; COMPUTER NETWORKS; INFERENCE ENGINES; INTELLIGENT ROBOTS; INTELLIGENT SYSTEMS; PROBABILITY;

INTERNATIONAL CONFERENCES; PROBABILISTIC INFERENCES; REASONING METHODS;

ROBOTICS;

EID: 51349151157     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2007.4399296     Document Type: Conference Paper

References (17)

1. L. Kavraki, P. Svestka, J. Latombe, and M, Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Transactions on Robotics and Automation, vol. 12. pp. 566-580. 1996.
2. J. J. Kuffner and S. M. LaValle, "RRT-connect: An efficient approach to single-query path planning," in Proc. of IEEE Int'l. Conf. on Robotics and Automation, 2000.
3. D. Koller and R. Parr, "Computing factored value functions for policies in structured MDPs," in Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI 1999). 1999, pp. 1332-1339.
4. Schuurmans and Patrascu, "Direct value-approximation for factored MDPs," in Advances in Neural Information Processing (NIPS 2001), 2001, pp. 1579-1586.
5. C. Guestrin, D. Koller, R. Parr, and S. Venkataraman, "Efficient solution algorithms for factored MDPs," Journal of Artificial Intelligence Research (JAIR), vol. 19, pp. 399-468, 2003.
6. B. Kveton and M. Hauskrecht, "Solving factored MDPs with exponential-family transition models," in Proc. of the 16th Int. Conf. on Planning and Scheduling, 2006.
7. M. Toussaint and A. Storkey, "Probabilistic inference for solving discrete and continuous state Markov Decision Processes," in 23nd Int. Conf. on Machine Learning (ICML 2006), 2006.
8. S. Fine, Y. Singer, and N. Tishby, "The hierarchical hidden markov model: Analysis and applications," Machine Learning, vol. 32, pp. 41-62, 1998.
9. Z. Ghahramani and M. I. Jordan, "Factorial hidden Markov models," in Advances in Neural Information Processing Systems, NIPS, vol. 8. MIT Press, 1995, pp. 472-478.
10. C. Boutilier, R. Dearden, and M. Goldszmidt, "Exploiting structure in policy construction," in Proc. of the 14th Int. Joint Conf. on Artificial Intelligence (IJCAI 1995), 1995, pp. 1104-1111.
11. G. Theocharous, K. Murphy, and L. Kaelbling, "Representing hierarchical POMDPs as DBNs for multi-scale robot localization," in Intl. Conf on Robotics and Automation (ICRA 2004), 2004.
12. K. Murphy, "Dynamic bayesian networks: Representation, inference and learning," PhD Thesis, UC Berkeley, Computer Science Division, 2002.
13. M. Toussaint, S. Harmeling, and A. Storkey, "Probabilistic inference for solving (PO)MDPs," Research Report EDI-INF-RR-0934, University of Edinburgh, School of Informatics, 2006.
14. Kschischang, Frey, and Loeliger, "Factor graphs and the sum-product algorithm," IEEE Transactions on Information Theory, vol. 47, 2001.
15. T. Minka, "A family of algorithms for approximate bayesian inference," PhD thesis, MIT, 2001.
16. J. Peters, M. Mistry, F E. Udwadia, R. Cory, J. Nakanishi, and S. Schaal, "A unifying framework for the control of robotics systems," in IEEE Int. Conf. on Intelligent Robots and Systems (IROS 2005), 2005, pp. 1824-1831.
17. W. Li, E. Todorov, and X. Pan, "Hierarchical optimal control of redundant biomechanical systems," in 26th Annual Int. Conf. of the IEEE Engineering in Medicine and Biology Society, 2004.