Optimal Sokoban solving using pattern databases with specific domain knowledge

DOI10.1016/J.ARTINT.2015.05.011MaRDI QIDQ899157zbMATH OpenOpenAlexFDO

Authors Marcus Ritt, Luciana Buriol, André G. Pereira

Publication date 21 December 2015

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2015.05.011

zbMATH Keywords

heuristic searchSokoban\(\operatorname{A}^\ast\)domain-dependent knowledgepattern databasesingle-agent search

Mathematics Subject Classification ID

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

Recommendations

• Compressed pattern databases
• Disjoint pattern database heuristics
• scientific article; zbMATH DE number 1784976
• scientific article; zbMATH DE number 1784975
• Automated Creation of Pattern Database Search Heuristics

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 2243372 (Why is no real title available?)
• scientific article; zbMATH DE number 2243373 (Why is no real title available?)
• A general theory of additive state space abstractions
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Compressed pattern databases
• Depth-first iterative-deepening: An optimal admissible tree search
• Disjoint pattern database heuristics
• Heuristic search. Theory and applications
• Implicit abstraction heuristics
• Landmark-enhanced abstraction heuristics
• Maximizing over multiple pattern databases speeds up heuristic search
• Sokoban: Enhancing general single-agent search methods using domain knowledge
• The fast downward planning system

Cited in

(5)

• Sokoban: Enhancing general single-agent search methods using domain knowledge
• Landmark-based approaches for goal recognition as planning
• scientific article; zbMATH DE number 1784976 (Why is no real title available?)
• Compressed pattern databases
• \textsc{Pull} and \textsc{PushPull} are PSPACE-complete

Describes a project that uses

Uses Software

• Blossom V

This page was built for publication: Optimal Sokoban solving using pattern databases with specific domain knowledge

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