Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters

Nathan R. Sturtevant; Ariel Felner; Malte Helmert

Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters

Nathan R. Sturtevant, Ariel Felner, Malte Helmert

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

Pattern Databases (PDBs) are a common form of abstraction-based heuristic which are often compressed so that a large PDB can fit in memory. Partial Pattern Databases (PPDBs) achieve this by storing only layers of the PDB which are close to the goal. This paper studies the problem of how to best compress and use the 457 GB 12-edge Rubik’s cube PDB, suggesting a number of ways that Bloom filters can be used to effectively compress PPDBs. We then develop a theoretical model of the common min compression approach and our Bloom filters, showing that the original method of compressed PPDBs can never be better than min compression. We conclude with experimental results showing that Bloom filter compression of PPDBs provides superior performance to min compression in Rubik’s cube.

Original language	English
Title of host publication	Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014
Editors	Stefan Edelkamp, Roman Bartak
Publisher	AAAI press
Pages	175-183
Number of pages	9
ISBN (Electronic)	9781577356769
State	Published - 2014
Externally published	Yes
Event	7th Annual Symposium on Combinatorial Search, SoCS 2014 - Prague, Czech Republic Duration: 15 Aug 2014 → 17 Aug 2014

Publication series

Name	Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014
Volume	2014-January

Conference

Conference	7th Annual Symposium on Combinatorial Search, SoCS 2014
Country/Territory	Czech Republic
City	Prague
Period	15/08/14 → 17/08/14

Bibliographical note

Publisher Copyright:
© 2015 AAAI press. All Rights Reserved.

Cite this

Sturtevant, N. R., Felner, A., & Helmert, M. (2014). Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters. In S. Edelkamp, & R. Bartak (Eds.), Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 (pp. 175-183). (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014; Vol. 2014-January). AAAI press.

Sturtevant, Nathan R. ; Felner, Ariel ; Helmert, Malte. / Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters. Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. editor / Stefan Edelkamp ; Roman Bartak. AAAI press, 2014. pp. 175-183 (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014).

@inproceedings{24865e4bd6d249fe9dd948767b858ed4,

title = "Exploiting the rubik{\textquoteright}s cube 12-edge pdb by combining partial pattern databases and bloom filters",

abstract = "Pattern Databases (PDBs) are a common form of abstraction-based heuristic which are often compressed so that a large PDB can fit in memory. Partial Pattern Databases (PPDBs) achieve this by storing only layers of the PDB which are close to the goal. This paper studies the problem of how to best compress and use the 457 GB 12-edge Rubik{\textquoteright}s cube PDB, suggesting a number of ways that Bloom filters can be used to effectively compress PPDBs. We then develop a theoretical model of the common min compression approach and our Bloom filters, showing that the original method of compressed PPDBs can never be better than min compression. We conclude with experimental results showing that Bloom filter compression of PPDBs provides superior performance to min compression in Rubik{\textquoteright}s cube.",

author = "Sturtevant, {Nathan R.} and Ariel Felner and Malte Helmert",

year = "2014",

language = "אנגלית",

series = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",

publisher = "AAAI press",

pages = "175--183",

editor = "Stefan Edelkamp and Roman Bartak",

booktitle = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",

}

Sturtevant, NR, Felner, A & Helmert, M 2014, Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters. in S Edelkamp & R Bartak (eds), Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014, vol. 2014-January, AAAI press, pp. 175-183, 7th Annual Symposium on Combinatorial Search, SoCS 2014, Prague, Czech Republic, 15/08/14.

Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters. / Sturtevant, Nathan R.; Felner, Ariel; Helmert, Malte.
Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. ed. / Stefan Edelkamp; Roman Bartak. AAAI press, 2014. p. 175-183 (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014; Vol. 2014-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters

AU - Sturtevant, Nathan R.

AU - Felner, Ariel

AU - Helmert, Malte

PY - 2014

Y1 - 2014

N2 - Pattern Databases (PDBs) are a common form of abstraction-based heuristic which are often compressed so that a large PDB can fit in memory. Partial Pattern Databases (PPDBs) achieve this by storing only layers of the PDB which are close to the goal. This paper studies the problem of how to best compress and use the 457 GB 12-edge Rubik’s cube PDB, suggesting a number of ways that Bloom filters can be used to effectively compress PPDBs. We then develop a theoretical model of the common min compression approach and our Bloom filters, showing that the original method of compressed PPDBs can never be better than min compression. We conclude with experimental results showing that Bloom filter compression of PPDBs provides superior performance to min compression in Rubik’s cube.

AB - Pattern Databases (PDBs) are a common form of abstraction-based heuristic which are often compressed so that a large PDB can fit in memory. Partial Pattern Databases (PPDBs) achieve this by storing only layers of the PDB which are close to the goal. This paper studies the problem of how to best compress and use the 457 GB 12-edge Rubik’s cube PDB, suggesting a number of ways that Bloom filters can be used to effectively compress PPDBs. We then develop a theoretical model of the common min compression approach and our Bloom filters, showing that the original method of compressed PPDBs can never be better than min compression. We conclude with experimental results showing that Bloom filter compression of PPDBs provides superior performance to min compression in Rubik’s cube.

UR - http://www.scopus.com/inward/record.url?scp=85031938683&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85031938683

T3 - Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014

SP - 175

EP - 183

BT - Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014

A2 - Edelkamp, Stefan

A2 - Bartak, Roman

PB - AAAI press

T2 - 7th Annual Symposium on Combinatorial Search, SoCS 2014

Y2 - 15 August 2014 through 17 August 2014

ER -

Exploiting the rubik’s cube 12-edge pdb by combining partial pattern databases and bloom filters

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this