Planning Experiments: Resolving Interactions between Two Planning Spaces
暂无分享,去创建一个
[1] Sridhar Mahadevan,et al. Automatic Programming of Behavior-Based Robots Using Reinforcement Learning , 1991, Artif. Intell..
[2] Yolanda Gil,et al. Learning by Experimentation: Incremental Refinement of Incomplete Planning Domains , 1994, International Conference on Machine Learning.
[3] Peter C-H. Cheng. Modelling scientific discovery (experiment theory, research program) , 1990 .
[4] Yolanda Gil,et al. Acquiring domain knowledge for planning by experimentation , 1992 .
[5] Smadar Kedar,et al. The Blind Leading the Blind: Mutual Refinement of Approximate Theories , 1991, ML.
[6] Rodney A. Brooks,et al. Learning to Coordinate Behaviors , 1990, AAAI.
[7] Yolanda Gil,et al. Efficient Domain-Independent Experimentation , 1993, ICML.
[8] Oren Etzioni,et al. PRODIGY4.0: The Manual and Tutorial , 1992 .
[9] John E. Laird,et al. Correcting Imperfect Domain Theories: A Knowledge-Level Analysis , 1993 .
[10] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[11] Oren Etzioni,et al. PRODIGY: an integrated architecture for planning and learning , 1991, SGAR.
[12] Kristian J. Hammond,et al. Case-based planning: an integrated theory of planning, learning and memory , 1986 .
[13] Peter C.-H. Cheng,et al. Modelling scientific discovery , 1990 .
[14] Patricia C. Goldberg,et al. Automatic Programming , 1974, Programming Methodology.