论文信息 - Learning Planning Rules in Noisy Stochastic Worlds

Learning Planning Rules in Noisy Stochastic Worlds

We present an algorithm for learning a model of the effects of actions in noisy stochastic worlds. We consider learning in a 3D simulated blocks world with realistic physics. To model this world, we develop a planning representation with explicit mechanisms for expressing object reference and noise. We then present a learning algorithm that can create rules while also learning derived predicates, and evaluate this algorithm in the blocks world simulator, demonstrating that we can learn rules that effectively model the world dynamics.

[1] Scott Sherwood Benson,et al. Learning action models for reactive autonomous agents , 1996 .

[2] Saso Dzeroski,et al. Inductive Logic Programming: Techniques and Applications , 1993 .

[3] Yishay Mansour,et al. A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes , 1999, Machine Learning.

[4] Herbert A. Simon,et al. Rule Creation and Rule Learning Through Environmental Exploration , 1989, IJCAI.

[5] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[6] Xuemei Wang,et al. Learning by Observation and Practice: An Incremental Approach for Planning Operator Acquisition , 1995, ICML.

[7] Leslie Pack Kaelbling,et al. Envelope-based Planning in Relational MDPs , 2003, NIPS.

[8] Yolanda Gil,et al. Learning by Experimentation: Incremental Refinement of Incomplete Planning Domains , 1994, International Conference on Machine Learning.

[9] Leslie Pack Kaelbling,et al. Learning Probabilistic Relational Planning Rules , 2004, ICAPS.

[10] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[11] Eyal Amir,et al. Learning Partially Observable Deterministic Action Models , 2005, IJCAI.

[12] John Langford,et al. Probabilistic Planning in the Graphplan Framework , 1999, ECP.