Integrating planning and learning: The prodigy architecture

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 7, Issue 1, 1995, Pages 81-120

  Veloso, Manuela ^a   Carbonell, Jaime ^a   Perez, Alicia ^a   Borrajo, Daniel ^a   Fink, Eugene ^a   Blythe, Jim ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 32144443210     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/09528139508953801     Document Type: Article

References (62)

1. Bhatnagar, N. (1992) Learning by incomplete explanations of failures in recursive domains. In D. Sleeman and P. Edwards (eds) Proceedings of the Machine Learning Conference 1992 (San Mateo, CA: Morgan Kaufmann), pp. 30-36
2. Blythe, J. and Veloso, M. M. (1992) An analysis of search techniques for a totally-ordered nonlinear planner. In Proceedings of the First International Conference on Al Planning Systems, College Park, MD. pp, 13-19.
3. Borrajo, D., Caraa-Valente, J. P., and Pazos, J. (1992) A knowledge compilation model for learning heuristics. In Proceedings of the Workshop on Knowledge Compilation of the 9th International Conference on Machine Learning, Scotland.
4. Borrajo, D. and Veloso, M. (1993). Bounded explanation and inductive refinement for acquiring control knowledge. In Proceedings of the Third Internationa! Workshop on Knowledge Compilation and Speedup Learning, Amherst, MA, pp. 21-27.
5. Borrajo, D, and Veloso, M. (1994a) Hamlet: Incremental deductive and inductive learning of local control knowledge for nonlinear problem solving. Technical Report CMU-CS-94-111, School of Computer Science, Carnegie Mellon University.
6. Borrajo, D. and Veloso, M. (1994b) Incremental learning of control knowledge for nonlinear problem solving. In Proceedings of the European Conference on Machine Learning, ECML-94 (Berlin, Springer Verlag) pp. 64-82.
7. Carbonell, J. G., Blythe, J., Etzioni, O., Gil, Y., Joseph, R., Kahn, D., Knoblock, C., Minton, S., Pertz, A., Reilly, S., Veloso, M. and Wang, X. (1992) Prodigy4,0: The manual and tutorial. Technical Repon CMU-CS-92-150, SCS, Carnegie Mellon University.
8. Carbonell, J. G. and Gil, Y. (1990) Learning by experimentation: The operator refinement method. In R. S. Michalski and Y. Kodratoff (eds) Machine Learning: An Artificial Intelligence Approach, Vol. Ill (Palo Alto, CA: Morgan Kaufmann) pp. 191-213.
9. Chapman, D. (1987) Planning for conjunctive goals. Artificial Intelligence, 32: 333-378.
10. Descotte, Y. and Latombe, J.-C. (1985) Making compromises among antagonist constraints in a planner. Artificial Intelligence, 27: 183-217.
11. Doorenbos, R. B, and Veloso, M. M. (1993) Knowledge organization and the utility problem. In Proceedings of the Third International Workshop on Knowledge Compilation and Speedup Learnings, Amherst, MA, pp. 28-34.
12. Doyle, L. E. (1969) Manufacturing Processes and Materials for Engineers, 2nd edn (Englewood Cliffs, NJ: Prenlice-Hall).
13. Etzioni, O. (1990) A Structural Theory of Explanation-Based Learning. PhD thesis, School of Computer Science, Carnegie Mellon University. Available as technical report CMU-CS-90-185.
14. Etzioni, O. (1993) Acquiring search-control knowledge via static analysis. Artificial Intelligence, 62: 255-301.
15. Etzioni, O. and Minton, S. (1992) Why EBL produces overly-specific knowledge: A critique of the prodigy approaches. In Proceedings of the Ninth International Conference on Machine Learning, pp. 137-143.
16. Fikes, R. E. and Nilsson, N. J. (1971) Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2: 189-208.
17. Fink, E. and Veloso, M. (1994) Formalizing the Prodigy planning algorithm. Technical Report CMU-CS-94-123, School of Computer Science, Carnegie Mellon University.
18. Foulser, D. E., Li, M. and Yang, Q. (1992) Theory and algorithms for plan merging. Artificial Intelligence, 57: 143-181.
19. Gil, Y, (1991) A specification of process planning for Prodigy. Technical Report CMU-CS-91-179, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
20. Gil, Y. (1992) Acquiring Domain Knowledge for Planning by Experimentation. PhD thesis, School of Computer Science, Carnegie Mellon University. Available as technical report CMU-CS-92-175.
21. Gil, Y. and Perez, M. A. (1994) Applying a general-purpose planning and learning architecture to process planning. In Working notes of the AAAI 1994 Fall Symposium Series, Symposium on Planning and Learning: On to Real Applications.
22. Golding, A., Rosenbloom, P. S. and Laird, J. E. (1987) Learning general search control from outside guidance. In Proceedings of the Tenth International Conference on Artificial Intelligence, Milan, Italy, pp. 334-337.
23. Hayes, C. (1990) Machining Planning: A Model of an Expert Level Planning Process. PhD thesis, The Robotics Institute, Carnegie Mellon University.
24. Iwamoto, M. (1994) A planner with quality goal and its speedup learning for optimization problem. In Proceedings of the Second International Conference on AI Planning Systems, Chicago, IL, pp. 281-286.
25. Joseph, R. (1989) Graphical knowledge acquisition. In Proceedings of the 4th Knowledge Acquisition For Knowledge-Based Systems Workshop, Banff, Canada.
26. Joseph, R. L. (1992) Graphical Knowledge Acquisition for Visually-Oriented Planning Domains. PhD thesis, School of Computer Science, Carnegie Mellon University. Available as technical report CMU-CS-92-188.
27. Kambhampati, S. and Kedar, S. (1991) Explanation based generalization of partially ordered plans. In Proceedings of the Ninth National Conference on Artificial Intelligence (Menlo Park, CA: AAAI Press/The MIT Press), pp. 679-685.
28. Karinthi, R., Nau, D. S. and Yang, Q. (1992) Handling feature interactions in process planning. Applied Artificial Intelligence, 6: 389-415. Special issue on AI for manufacturing.
29. Knoblock, C. A. (1994) Automatically generating abstractions for planning. Artificial Intelligence, 68: 243-302.
30. Knoblock, C. A., Minton, S. and Etzioni, O. (1991) Integrating abstraction and explanation based learning in Prodigy. In Proceedings of the Ninth National Conference on Artificial Intelligence (Menlo Park, CA: AAAI Press/The MIT Press), pp. 541-546.
31. Laird, J. E., Rosenbloom, P. S. and Newell, A. (1986) Chunking in SOAR: The anatomy of a general learning mechanism. Machine Learning, 1: 11-46.
32. Langley, P. (1983) Learning effective search heuristics. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, Germany, pp. 419-421.
33. Leckie, C. and Zukerman, I. (1991) Learning search control rules for planning: An inductive approach. In L. Bimbaum and G. Collins (eds) Proceedings of Machine Learning Workshop (San Mateo, CA: Morgan Kaufmann), pp. 422-426.
34. McAllester, D. and Rosenblitt, D. (1991) Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence (Menlo Park, CA: AAAI Press/The MIT Press), pp. 634-639.
35. Minton, S. (1988a) Learning Effective Search Control Knowledge: An Explanation-Based Approach (Boston, MA: Kluwer Academic Publishers).
36. Minton, S. (1988b) Learning Effective Search Control Knowledge: An Explanation-Based Approach. PhD thesis, Computer Science Department, Carnegie Mellon University. Available as technical report CMU-CS-88-133.
37. Minton, S., Knoblock, C. A., Kuokka, D. R., Gil, Y., Joseph, R. L. and Carbonell, J. G. (1989) PRODIGY 2.0: The manual and tutorial. Technical Report CMU-CS-89-146, School of Computer Science, Carnegie Mellon University.
38. Mitchell, T. M., Utgoff, P. E. and Banerji, R. B. (1983) Learning by experimentation: Acquiring and refining problem-solving heuristics. In R. S. Michalski, J. G. Carbonell and T. M. Mitchell (eds) Machine Learning, An Artificial Intelligence Approach (Palo Alto, CA. Tioga Press) pp. 163-190.
39. Nau, D. S. and Chang, T.-C. (1985) Hierarchical representation of problem-solving knowledge in a frame-based process planning system. Technical Report TR-1592, Computer Science Department, University of Maryland.
40. Peot, M. A. and Smith, D. E. (1993) Threat-removal strategies for partial-order planning. In Proceedings of the Eleventh National Conference on Artificial Intelligence, Washington, DC, pp. 492-499.
41. Perez, M. A. and Carbonell, J.G. (1993) Automated acquisition of control knowledge to improve the quality of plans. Technical Report CMU-CS-93-142, School of Computer Science, Carnegie Mellon University.
42. Pdrez, M. A. and Etzioni, O. (1992) DYNAMIC: A new role for training problems in EBL. In D. Sleeman, and P. Edwards (eds) Proceedings of the Ninth International Conference on Machine Learning (San Mateo, CA: Morgan Kaufmann) pp. 367-372.
43. Perez, M. A. and Veloso, M. M. (1993) Goal interactions and plan quality. In Preprints of the AAAI 1993 Spring Symposium Series, Symposium on Foundations of Automatic Planning: The Classical Approach and Beyond, Stanford University, CA, pp. 117-121.
44. Polya, G. (1945) How to Solve It (Princeton, NJ: Princeton University Press).
45. Quinlan, J. R. (1983) Learning efficient classification procedures and their application lo chess end games. In R. S. Michalski, J. G. Carbonell and T. M. Mitchell (eds) Machine Learning, An Artificial Intelligence Approach, Vol. I (San Mateo, CA: Morgan Kaufmann).
46. Quinlan, J. R. (1990) Learning logical definitions from relations. Machine Learning, 5: 239-266.
47. Rich, E. (1983) Artificial Intelligence (New York: McGraw-Hill).
48. Rosenbloom, P. S., Laird, J. E., McDermott, J., Newell, A, and Orciuch, E. (1985) Rl-Soar. An experiment in knowledge-intensive programming in a problem-solving architecture. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-7: 561-569.
49. Ruby, D. and Kibler, D. (1992) Learning episodes for optimization. In Proceedings of the Machine Learning Conference 1992 (San Mateo, CA: Morgan Kaufmann) pp. 379-384.
50. Stone, P., Veloso, M, and Blythe, J. (1994) The need for different domain-independent heuristics. In Proceedings of the Second International Conference on AI Planning Systems, Chicago, IL, pp. 164-169.
51. Tadepalli, P. (1989) Lazy explanation-based learning: A solution to the intractable theory problem. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (San Mateo, CA: Morgan Kaufmann) pp. 694-700.
52. Tate, A. (1977) Generating project networks. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, Cambridge, MA, pp. 888-900.
53. Veloso, M, M. (1989) Nonlinear problem solving using intelligent casual-commitment. Technical Report CMU-CS-89-210, School of Computer Science, Carnegie Mellon University.
54. Veloso, M. M. (1992) Learning by Analogical Reasoning in General Problem Solving. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. Available as technical report CMU-CS-92-174. A revised version of this manuscript will be published by Springer-Verlag, 1994
55. Veloso, M. and Blythe, J. (1994) Linkability: Examining causal link commitments in partial-order planning. In Proceedings of the Second International Conference on AI Planning Systems, Chicago, IL, pp. 170-175.
56. Veloso, M. M. and Carbonell, J. G. (1990) Integrating analogy into a general problem-solving architecture. In M. Zemankova and Z, Ras (eds) Intelligent Systems (Chichester: Ellis Horwood) pp. 29-51.
57. Veloso, M. M. and Carbonell, J. G. (1993) Derivational analogy in Prodigy: Automating case acquisition, storage, and utilization. Machine Learning, 10: 249-278.
58. Wang, X. (1992) Constraint-based efficient matching in Prodigy. Technical Report CMU-CS-92-128, School of Computer Science, Carnegie Mellon University.
59. Wang, X. (1994) Learning planning operators by observation and practice. In Proceedings of the Second International Conference on AI Planning Systems, AIPS-94, Chicago, IL, pp. 335-340.
60. Warren, D, (1974) warplan: A system for generating plans. Technical report, Department of Computational Logic, University of Edinburgh. Memo No. 76.
61. Wilensky, R. (1983) Planning and Understanding (Reading, MA: Addison-Wesley).
62. Zelle, J. and Mooney, R. (1993) Combining FOIL and EBG to speed-up logic programs. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence.