Counterexample-guided Cartesian abstraction refinement for classical planning

zbMATH Open1448.68392MaRDI QIDQ4580275FDOQ4580275

Authors: Jendrik Seipp, Malte Helmert 

Publication date: 14 August 2018

Full work available at URL: https://www.jair.org/index.php/jair/article/view/11217

Recommendations

• Abstract Counterexamples for Non-disjunctive Abstractions
• A counterexample-guided abstraction-refinement framework for Markov decision processes
• Implicit abstraction heuristics
• Abstract Counterexample-Based Refinement for Powerset Domains
• Landmark-enhanced abstraction heuristics

zbMATH Keywords

refinementoptimal abstract solutionsaturated cost partitioning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (4)

• Boosting optimal symbolic planning: operator-potential heuristics
• 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

This page was built for publication: Counterexample-guided Cartesian abstraction refinement for classical planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580275)