Abstract
This paper describes a heuristic approach to the discovery of useful macro-operators (macros) in problem solving. The approach has been implemented in a program,Maclearn, that has three parts: macro-proposer, static filter, and dynamic filter. Learning occurs during problem solving, so that performance unproves in the course of a single problem trial. Primitive operators and macros are both represented within a uniform representational framework that is closed under composition. This means that new macros can be defined in terms of others, which leads to a definitional hierarchy. The representation also supports the transfer of macros to related problems.Maclearn is embedded in a supporting system that carries out best-first search. Experiments in macro learning were conducted for two classes of problems: peg solitaire (generalized “Hi-Q puzzle”), and tile sliding (generalized “Fiteen puzzle”). The results indicate thatMaclearn's filtering heuristics all improve search performance, sometimes dramatically. When the system was given practice on simpler training problems, it learned a set of macros that led to successful solutions of several much harder problems.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Cheng, P., & Carbonell, J. G. (1986). TheFermi system: Inducing iterative macro-operators from experience.Proceedings of the Fifth National Conference on Artificial Intelligence (pp. 490–495). Philadelphia, PA: Morgan Kaufmann.
Dawson, C., & Siklóssy, L. (1977). The role of preprocessing in problem solving systems.Proceedings of the Fifth International Joint Conference on Artificial Intelligence (pp. 465–471). Cambridge, MA: Morgan Kaufmann.
Fikes, R., Hart, P., & Nilsson, N. (1972). Learning and executing generalized robot plans.Artificial Intelligence,3, 251–288.
Iba, G. A. (1985). Learning by discovering macros in puzzle solving.Proceedings of the Ninth International Joint Conference on Artificial Intelligence (pp. 640–642). Los Angeles, CA: Morgan Kaufmann.
Iba, G. A. (1986). Learning by composition. In T. M., Mitchell, J. G., Carbonell, & R. S., Michalski (Eds.),Machine learning: A guide to current research Boston, MA: Kluwer.
Korf, R. E. (1982). A program that learns to solve Rubik's Cube.Proceedings of the National Conference on Artificial Intelligence (pp. 164–167). Pittsburgh, PA: Morgan Kaufmann.
Korf, R. E. (1983). Operator decomposability: A new type of problem structure.Proceedings of the National Conference on Artificial Intelligence (pp. 206–209). Washington, DC: Morgan Kaufmann.
Korf, R. E. (1985a). Macro-operators: A weak method for learning.Artificial Intelligence,26, 35–77.
Korf, R. E. (1985b).Learning to solve problems by searching for macro-operators. Boston, MA: Pitman.
Laird, J. E., Rosenbloom, P. S., & Newell, A. (1986). Chunking inSoar: The anatomy of a general learning mechanism.Machine Learning,1, 11–46.
Lewis, C. (1987). Composition of productions. In D., Klahr, P., Langley, & R., Neches (Eds.),Production system models of learning and development. Cambridge, MA: MIT Press.
Minton, S. (1985). Selectively generalizing plans for problem-solving.Proceedings of the Ninth International Joint Conference on Artificial Intelligence (pp. 596–599). Los Angeles, CA: Morgan Kaufmann.
Minton, S. (1988). Quantitative results concerning the utility of explanation-based learning.Proceedings of the Seventh National Conference on Artificial Intelligence (pp. 564–569). St. Paul, MN: Morgan Kaufmann.
Mitchell, T. M., Keller, R. M., & Kedar-Cabelli, S. T. (1986). Explanation-based generalization: A unifying view.Machine Learning,1, 47–80.
Neves, D. M., & Anderson, J. R. (1981). Knowledge compilation: Mechanisms for the automatization of cognitive skills. In J. R., Anderson (Ed.).Cognitive skills and their acquisition. Hillsdale, NJ: Lawrence Erlbaum.
Newell, A., & Simon, H. A. (1963). GPS. A program that simulates human thought. In E. A., Feigenbaum & J., Feldman (Eds.),Computers and thought. New York: McGraw-Hill.
O'Rorke, P. (1987). LT revisited: Experimental results of applying explanation-based learning to the logic of Principia Mathematica.Proceedings of the Fourth International Workshop on Machine Learning (pp. 148–159) Irvine, CA: Morgan Kaufmann.
Vere, S. A. (1978). Inductive learning of relational productions. In D., Waterman & F., Hayes-Roth (Eds.),Pattern-directed inference systems. New York: Academic Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Iba, G.A. A heuristic approach to the discovery of macro-operators. Mach Learn 3, 285–317 (1989). https://doi.org/10.1007/BF00116836
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00116836