Red-black planning: a new systematic approach to partial delete relaxation

DOI10.1016/J.ARTINT.2014.12.008MaRDI QIDQ2344359zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

planningheuristic searchdelete relaxation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

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

• scientific article; zbMATH DE number 1249653 (Why is no real title available?)
• scientific article; zbMATH DE number 1946870 (Why is no real title available?)
• scientific article; zbMATH DE number 2038901 (Why is no real title available?)
• scientific article; zbMATH DE number 1509472 (Why is no real title available?)
• scientific article; zbMATH DE number 2243372 (Why is no real title available?)
• scientific article; zbMATH DE number 2243410 (Why is no real title available?)
• A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
• An LP-Based Heuristic for Optimal Planning
• Analyzing search topology without running any search: on the connection between causal graphs and \(h^{+}\)
• Automatically generating abstractions for planning
• Causal graphs and structurally restricted planning
• Concise finite-domain representations for PDDL planning tasks
• Improving delete relaxation heuristics through explicitly represented conjunctions
• Model Checking Software
• Parametrized complexity theory.
• Planning as heuristic search
• Planning as satisfiability: heuristics
• The FF planning system: Fast plan generation through heuristic search
• The LAMA planner: guiding cost-based anytime planning with landmarks
• The complexity of optimal monotonic planning: the bad, the good, and the causal graph
• The computational complexity of propositional STRIPS planning
• The fast downward planning system
• Using regression-match graphs to control search in planning

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

Describes a project that uses

Uses Software

• UCPOP
• SAPA
• TorchLight

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)