State space search nogood learning: online refinement of critical-path dead-end detectors in planning
From MaRDI portal
Publication:514137
DOI10.1016/j.artint.2016.12.002zbMath1402.68165OpenAlexW2567147741MaRDI QIDQ514137
Jörg Hoffmann, Marcel Steinmetz
Publication date: 28 February 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.12.002
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concise finite-domain representations for PDDL planning tasks
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- The computational complexity of propositional STRIPS planning
- Failure driven dynamic search control for partial order planners: an explanation based approach
- Fast planning through planning graph analysis
- An efficient algorithm for searching implicit AND/OR graphs with cycles
- Backjump-based backtracking for constraint satisfaction problems
- Discovering hidden structure in factored MDPs
- Red-black planning: a new systematic approach to partial delete relaxation
- Planning as satisfiability: parallel plans and algorithms for plan search
- Real-time heuristic search
- Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
- Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
- The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
- SAT-Based Model Checking without Unrolling
- Merge-and-Shrink Abstraction
- Graph-Based Algorithms for Boolean Function Manipulation
- GRASP: a search algorithm for propositional satisfiability
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
- Property Directed Reachability for Automated Planning
- Theory and Applications of Satisfiability Testing
- Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions
- Depth-First Search and Linear Graph Algorithms
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
- Model Checking Software
- Planning as heuristic search
