Learning from planner performance
From MaRDI portal
Publication:835821
DOI10.1016/j.artint.2008.11.009zbMath1191.68640OpenAlexW2066387041MaRDI QIDQ835821
Publication date: 31 August 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2008.11.009
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
ASlib: a benchmark library for algorithm selection ⋮ Portfolio theorem proving and prover runtime prediction for geometry ⋮ Selecting goals in oversubscription planning using relaxed plans ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces
Uses Software
Cites Work
- Complexity results for standard benchmark domains in planning
- Using regression-match graphs to control search in planning
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- Benchmarks for basic scheduling problems
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- STRIPS: A new approach to the application of theorem proving to problem solving
- Integrating planning and learning: the PRODIGY architecture
- Methods and Applications of Artificial Intelligence
- Planning as heuristic search
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning from planner performance
