Abstract
We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and does not require previously learned or inferred information, nor prior domain knowledge. The algorithm is used to define new domain-independent tractable classes of classical planning that are proved to include Blocksworld-arm and Towers of Hanoi.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fikes, R.E., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 5(2), 189–208 (1971)
Korf, R.E.: Learning to solve problems by solving for macro-operators. In: Research notes in artificial intelligence. Pitman (1985)
Iba, G.A.: A heuristic approach to the discovery of macro-operators. Machine Learning 3(4), 285–317 (1989)
Junghanns, A., Schaeffer, J.: Sokoban: enhancing single-agent search using domain knowledge. Artificial Intelligence 129, 219–251 (2001)
Hernádvölgyi, I.: Searching for macro-operators with automatically generated heuristics. In: 14th Canadian Conference on AI, pp. 194–203 (2001)
Botea, A., Enzenberger, M., Müller, M., Schaeffer, J.: Macro-FF: Improving ai planning with automatically learned macro-operators. JAIR 24, 581–621 (2005)
Coles, A., Smith, A.: Marvin: A heuristic search planner with online macro-action learning. JAIR 28, 119–156 (2007)
Newton, M.A.H., Levine, J., Fox, M., Long, D.: Learning macro-actions for arbitrary planners and domains. In: ICAPS (2007)
Chen, H., Gimenez, O.: Act local, think global: Width notions for tractable planning. In: ICAPS (2007)
Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence 69, 165–204 (1994)
Jonsson, A.: The role of macros in tractable planning over causal graphs. In: ICAPS, pp. 1936–1941 (2007)
Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. JAIR 14, 253–302 (2001)
Bäckström, C., Nebel, B.: Complexity results for SAS+ planning. Computational Intelligence 11(4), 625–655 (1995)
Erol, K., Nau, D.S., Subrahmanian, V.S.: Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76, 625–655 (1995)
Brafman, R., Domshlak, C.: Structure and complexity of planning with unary operators. JAIR 18, 315–349 (2003)
Brafman, R., Domshlak, C.: Factored planning: How, when, and when not. In: AAAI (2006)
Helmert, M.: The fast downward planning system. JAIR 26, 191–246 (2006)
Haslum, P.: Reducing accidental complexity in planning problems. In: IJCAI (2007)
Hoffmann, J.: Utilizing Problem Structure in Planning. LNCS, vol. 2854. Springer, Heidelberg (2003)
Minton, S.: Selectively generalizing plans for problem-solving. In: IJCAI, pp. 596–599 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, H., Giménez, O. (2009). On-the-Fly Macros. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-02261-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02260-9
Online ISBN: 978-3-642-02261-6
eBook Packages: Computer ScienceComputer Science (R0)