Merge-and-Shrink Abstraction

DOI10.1145/2559951zbMath1295.68189OpenAlexW2143303446MaRDI QIDQ3189651

Jörg Hoffmann, Malte Helmert, Patrik Haslum, Raz Nissim

Publication date: 12 September 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2559951

zbMATH Keywords

heuristic searchAI planningabstraction heuristics

Mathematics Subject Classification ID

Applications of graph theory (05C90) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Star-Topology Decoupling in SPIN ⋮ Symbolic perimeter abstraction heuristics for cost-optimal planning ⋮ Efficient symbolic search for cost-optimal planning ⋮ Selecting goals in oversubscription planning using relaxed plans ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Star-topology decoupled state space search ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ 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

• SPIN
• PDDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• The computational complexity of propositional STRIPS planning
• Complexity of generalized satisfiability counting problems
• Maximizing over multiple pattern databases speeds up heuristic search
• STRIPS: A new approach to the application of theorem proving to problem solving
• EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION
• Grammar Analysis and Parsing by Abstract Interpretation
• Generalized best-first search strategies and the optimality of A*
• Model Checking Software