Planning with noisy probabilistic relational rules

Journal of Artificial Intelligence Research

Volumn 39, Issue , 2010, Pages 1-49

  Lang, Tobias ^a   Toussaint, Marc ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SEQUENCES; APPROXIMATE INFERENCE; DECISION-THEORETIC; DYNAMIC BAYESIAN NETWORK; EMPIRICAL RESULTS; EXISTING METHOD; LOOK-AHEAD; PROBABILISTIC PLANNING; PROBABILISTIC RELATIONAL RULES; REALISTIC PHYSICS; ROBOT MANIPULATION; UPPER CONFIDENCE BOUND; WORLD MODEL;

ALGORITHMS; BAYESIAN NETWORKS; INFERENCE ENGINES; TREES (MATHEMATICS);

ROBOT PROGRAMMING;

EID: 78651517373     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3093     Document Type: Article

References (54)

1. Blum, A., & Langford, J. (1999). Probabilistic planning in the graphplan framework. In Proc. of the Fifth European Conference on Planning (ECP), pp. 319-332.
2. Botvinick, M. M., & An, J. (2009). Goal-directed decision making in prefrontal cortex: a computational framework. In Advances in Neural Information Processing Systems (NIPS), pp. 169-176.
3. Boutilier, C., Dean, T., & Hanks, S. (1999). Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11, 1-94.
4. Boutilier, C., Reiter, R., & Price, B. (2001). Symbolic dynamic programming for first-order MDPs. In Proc. of the Int. Conf. on Artificial Intelligence (IJCAI), pp. 690-700.
5. Buffet, O., & Aberdeen, D. (2009). The factored policy-gradient planner. Artificial Intelligence Journal, 173(5-6), 722-747.
6. Cooper, G. (1988). A method for using belief networks as influence diagrams. In Proc. of the Fourth Workshop on Uncertainty in Artificial Intelligence, pp. 55-63.
7. Croonenborghs, T., Ramon, J., Blockeel, H., & Bruynooghe, M. (2007). Online learning and exploiting relational models in reinforcement learning. In Proc. of the Int. Conf. on Artificial Intelligence (IJCAI), pp. 726-731.
8. Domshlak, C., & Hoffmann, J. (2007). Probabilistic planning via heuristic forward search and weighted model counting. Journal of Artificial Intelligence Research, 30, 565-620.
9. Driessens, K., Ramon, J., & G̈artner, T. (2006). Graph kernels and Gaussian processes for relational reinforcement learning. Machine Learning, 64(1-3), 91-119.
10. Ďzeroski, S., de Raedt, L., & Driessens, K. (2001). Relational reinforcement learning. Machine Learning, 43, 7-52. (Pubitemid 32286614)
11. Fern, A., Yoon, S., & Givan, R. (2006). Approximate policy iteration with a policy language bias: solving relational markov decision processes. Journal of Artificial Intelligence Research, 25(1), 75-118.
12. Gardiol, N. H., & Kaelbling, L. P. (2003). Envelope-based planning in relational MDPs. In Proc. of the Conf. on Neural Information Processing Systems (NIPS).
13. Gardiol, N. H., & Kaelbling, L. P. (2007). Action-space partitioning for planning. In Proc. of the AAAI Conf. on Artificial Intelligence (AAAI), pp. 980-986.
14. Gardiol, N. H., & Kaelbling, L. P. (2008). Adaptive envelope MDPs for relational equivalence-based planning. Tech. rep. MIT-CSAIL-TR-2008-050, MIT CS & AI Lab, Cambridge, MA.
15. Gelly, S., & Silver, D. (2007). Combining online and offline knowledge in UCT. In Proc. of the Int. Conf. on Machine Learning (ICML), pp. 273-280.
16. Gretton, C., & Thíebaux, S. (2004). Exploiting first-order rgeression in inductive policy selection. In Proc. of the Conf. on Uncertainty in Artificial Intelligence (UAI), pp. 217-225.
17. Grush, R. (2004). Conscious thought as simulation of behaviour and perception. Behaviorial and brain sciences, 27, 377-442.
18. Halbritter, F., & Geibel, P. (2007). Learning models of relational MDPs using graph kernels. In Proc. of the Mexican Conference on Artificial Intelligence (MICAI), pp. 409-419.
19. Hesslow, G. (2002). Conscious thought as simulation of behaviour and perception. Trends in Cognitive Science, 6(6), 242-247.
20. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
21. Ḧolldobler, S., & Skvortsova, O. (2004). A logic-based approach to dynamic programming. In AAAI-Workshop: Learning and planning in MDPs, pp. 31-36.
22. IPPC (2008). Sixth International Planning Competition, Uncertainty Part..http://ippc-2008.loria.fr/wiki/index.php/Main Page.
23. Jensen, F. (1996). An introduction to Bayesian networks. Springer Verlag, New York.
24. Joshi, S., Kersting, K., & Khardon, R. (2009). Generalized first-order decision diagrams for first-order MDPs. In Proc. of the Int. Conf. on Artificial Intelligence (IJCAI), pp. 1916-1921.
25. Karabaev, E., & Skvortsova, O. (2005). A heuristic search algorithm for solving first-order MDPs. In Proc. of the Conf. on Uncertainty in Artificial Intelligence (UAI), pp. 292-299.
26. 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(2-3), 193-208.
27. Kersting, K., & Driessens, K. (2008). Non-parametric policy gradients: A unified treatment of propositional and relational domains. In Proc. of the Int. Conf. on Machine Learning (ICML), pp. 456-463.
28. Kersting, K., van Otterlo, M., & de Raedt, L. (2004). Bellman goes relational. In Proc. of the Int. Conf. on Machine Learning (ICML), pp. 465-472.
29. Kocsis, L., & Szepesvari, C. (2006). Bandit based monte-carlo planning. In Proc. of the European Conf. on Machine Learning (ECML), pp. 837-844.
30. Kushmerick, N., Hanks, S., & Weld, D. (1995). An algorithm for probabilistic planning. Artificial Intelligence, 78(1-2), 239-286.
31. Kuter, U., Nau, D. S., Reisner, E., & Goldman, R. P. (2008). Using classical planners to solve nondeterministic planning problems. In Proc. of the Int. Conf. on Automated Planning and Scheduling (ICAPS), pp. 190-197.
32. Lang, T., & Toussaint, M. (2009a). Approximate inference for planning in stochastic relational worlds. In Proc. of the Int. Conf. on Machine Learning (ICML), pp. 585-592.
33. Lang, T., & Toussaint, M. (2009b). Relevance grounding for planning in relational domains. In Proc. of the European Conf. on Machine Learning (ECML), pp. 736-751.
34. Little, I., & Thíebaux, S. (2007). Probabilistic planning vs replanning. In ICAPS-Workshop International Planning Competition: Past, Present and Future.
35. Littman, M. L., Goldsmith, J., & Mundhenk, M. (1997). The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9, 1-36.
36. Murphy, K. P. (2002). Dynamic Bayesian Networks: Representation, Inference and Learning. Ph.D. thesis, UC Berkeley.
37. Murphy, K. P., & Weiss, Y. (2001). The factored frontier algorithm for approximate inference in DBNs. In Proc. of the Conf. on Uncertainty in Artificial Intelligence (UAI), pp. 378-385.
38. Pasula, H. M., Zettlemoyer, L. S., & Kaelbling, L. P. (2007). Learning symbolic models of stochastic domains. Journal of Artificial Intelligence Research, 29, 309-352.
39. Poon, H., & Domingos, P. (2007). Sound and efficient inference with probabilistic and deterministic dependencies. In Proc. of the AAAI Conf. on Artificial Intelligence (AAAI).
40. Sanner, S., & Boutilier, C. (2007). Approximate solution techniques for factored first-order MDPs. In Proc. of the Int. Conf. on Automated Planning and Scheduling (ICAPS), pp. 288-295.
41. Sanner, S., & Boutilier, C. (2009). Practical solution techniques for first-order MDPs. Artificial Intelligence, 173(5-6), 748-788.
42. Shachter, R. (1988). Probabilistic inference and influence diagrams. Operations Research, 36, 589-605.
43. Sutton, R. S., & Barto, A. G. (1998). Reinforcement Learning: An Introduction. The MIT Press.
44. Teichteil-Konigsbuch, F., Kuter, U., & Infantes, G. (2010). Aggregation for generating policies in MDPs. In To appear in Proc. of Int. Conf. on Autonomous Agents and Multiagent Systems.
45. Toussaint, M., & Storkey, A. (2006). Probabilistic inference for solving discrete and continuous state Markov decision processes. In Proc. of the Int. Conf. on Machine Learning (ICML), pp. 945-952.
46. Toussaint, M., Storkey, A., & Harmeling, S. (2010). Expectation-maximization methods for solving (PO)MDPs and optimal control problems. In Chiappa, S., & Barber, D. (Eds.), Inference and Learning in Dynamic Models. Cambridge University Press.
47. van Otterlo, M. (2009). The Logic of Adaptive Behavior. IOS Press, Amsterdam.
48. Walsh, T. J. (2010). Efficient learning of relational models for sequential decision making. Ph.D. thesis, Rutgers, The State University of New Jersey, New Brunswick, NJ.
49. Wang, C., Joshi, S., & Khardon, R. (2008). First order decision diagrams for relational MDPs. Journal of Artificial Intelligence Research, 31, 431-472.
50. Weld, D. S. (1999). Recent advances in AI planning. AI Magazine, 20(2), 93-123.
51. Wu, J.-H., Kalyanam, R., & Givan, R. (2008). Stochastic enforced hill-climbing. In Proc. of the Int. Conf. on Automated Planning and Scheduling (ICAPS), pp. 396-403.
52. Yoon, S. W., Fern, A., & Givan, R. (2007). FF-Replan: A baseline for probabilistic planning. In Proc. of the Int. Conf. on Automated Planning and Scheduling (ICAPS), pp. 352- 359.
53. Yoon, S. W., Fern, A., Givan, R., & Kambhampati, S. (2008). Probabilistic planning via determinization in hindsight. In Proc. of the AAAI Conf. on Artificial Intelligence (AAAI), pp. 1010-1016.
54. Younes, H. L., & Littman, M. L. (2004). PPDDL1.0: An extension to PDDL for expressing planning domains with probabilistic effects. Tech. rep., Carnegie Mellon University.