Red-black planning: a new systematic approach to partial delete relaxation
From MaRDI portal
Publication:2344359
DOI10.1016/j.artint.2014.12.008zbMath1328.68194OpenAlexW2057188589MaRDI QIDQ2344359
Publication date: 15 May 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.12.008
Related Items (6)
Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Star-topology decoupled state space search ⋮ A framework for analysing state-abstraction methods ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planning as satisfiability: heuristics
- Concise finite-domain representations for PDDL planning tasks
- Causal graphs and structurally restricted planning
- Using regression-match graphs to control search in planning
- Automatically generating abstractions for planning
- The computational complexity of propositional STRIPS planning
- Parametrized complexity theory.
- The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph
- 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
- An LP-Based Heuristic for Optimal Planning
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
- Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions
- Model Checking Software
- Planning as heuristic search
This page was built for publication: Red-black planning: a new systematic approach to partial delete relaxation
