Macro-operators: A weak method for learning
From MaRDI portal
Publication:1057073
DOI10.7916/D8C82J9M 10.1016/0004-3702(85)90012-8; 10.7916/D8C82J9MzbMath0562.68071OpenAlexW2110415190MaRDI QIDQ1057073
Publication date: 1985
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(85)90012-8
learning programmacro-operatorsproblem-solving programserial decomposability of primitive operatorsweak method for learning
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Automatically generating abstractions for planning, The computational complexity of propositional STRIPS planning, Intelligent transportation systems -- Enabling technologies, Heuristic improvement through triangulation, Model-lite planning: case-based vs. model-based approaches, On the importance of domain model configuration for automated planning engines, Planning with Critical Section Macros: Theory and Practice, Engineering and compiling planning domain models to promote validity and efficiency, Task modeling with reusable problem-solving methods, Learning hierarchical task network domains from partially observed plan traces, Sokoban: Enhancing general single-agent search methods using domain knowledge, Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming, On the connection between the phase transition of the covering test and the learning success rate in ILP, The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms, Transfer of learning by composing solutions of elemental sequential tasks, A framework for analysing state-abstraction methods, CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement, Sokoban: Improving the search with relevance cuts, Using genetic programming to learn and improve control knowledge., Learning in order to avoid search in logic programming, Automated planning as an early verification tool for distributed control
Cites Work
