Red-black planning: a new systematic approach to partial delete relaxation
From MaRDI portal
Publication:2344359
DOI10.1016/J.ARTINT.2014.12.008zbMATH Open1328.68194OpenAlexW2057188589MaRDI QIDQ2344359FDOQ2344359
Authors: Yanyan Li 
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
Recommendations
- Improving delete relaxation heuristics through explicitly represented conjunctions
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
- Solving delete free planning with relaxed decision diagram based heuristics
- An LP-Based Heuristic for Optimal Planning
- Cost-optimal planning, delete relaxation, approximability, and heuristics
Cites Work
- Analyzing search topology without running any search: on the connection between causal graphs and \(h^{+}\)
- Title not available (Why is that?)
- Planning as heuristic search
- Parametrized complexity theory.
- The computational complexity of propositional STRIPS planning
- The fast downward planning system
- The FF planning system: Fast plan generation through heuristic search
- Concise finite-domain representations for PDDL planning tasks
- An LP-Based Heuristic for Optimal Planning
- The LAMA planner: guiding cost-based anytime planning with landmarks
- Planning as satisfiability: heuristics
- Automatically generating abstractions for planning
- Title not available (Why is that?)
- Using regression-match graphs to control search in planning
- The complexity of optimal monotonic planning: the bad, the good, and the causal graph
- Causal graphs and structurally restricted planning
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
- Improving delete relaxation heuristics through explicitly represented conjunctions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Model Checking Software
- Title not available (Why is that?)
Cited In (10)
- On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
- Improving delete relaxation heuristics through explicitly represented conjunctions
- Star-topology decoupled state space search
- A framework for analysing state-abstraction methods
- Solving delete free planning with relaxed decision diagram based heuristics
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I
- Maintenance of plan libraries for case-based planning: offline and online policies
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
Uses Software
This page was built for publication: Red-black planning: a new systematic approach to partial delete relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344359)
