Learning to solve problems by searching for macro-operators
Learning to solve problems by searching for macro-operators
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Sokoban: enhancing general single-agent search methods using domain knowledge
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
A Heuristic Approach to the Discovery of Macro-Operators
Machine Learning
Searching for Macro Operators with Automatically Generated Heuristics
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Utilizing Problem Structure in Planning: A Local Search Approach
Utilizing Problem Structure in Planning: A Local Search Approach
Factored planning: how, when, and when not
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Structure and complexity in planning with unary operators
Journal of Artificial Intelligence Research
Macro-FF: improving AI planning with automatically learned macro-operators
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Marvin: a heuristic search planner with online macro-action learning
Journal of Artificial Intelligence Research
Selectively generalizing plans for problem-solving
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Reducing accidental complexity in planning problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The role of macros in tractable planning over causal graphs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hi-index | 0.00 |
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 .