{"type":"ScholarlyArticle","title":"Lossy Compression of Pattern Databases Using Acyclic Random Hypergraphs","authors":[{"name":"Mehdi Sadeqi","slug":"mehdi-sadeqi","given":"Mehdi","family":"Sadeqi","affiliation":"Department of Computer Science , University of Regina , Canada"},{"name":"Howard J. Hamilton","slug":"howard-j-hamilton","given":"Howard J.","family":"Hamilton","affiliation":"Department of Computer Science , University of Regina , Canada"}],"abstract":"A domain-independent heuristic function created by an abstraction is usually implemented using a Pattern Database (PDB), which is a lookup table of (abstract state, heuristic value) pairs. PDBs containing high quality heuristic values generally require substantial memory space and therefore need to be compressed. In this paper, we introduce Acyclic Random Hypergraph Compression (ARHC), a domain-independent approach to compressing PDBs using acyclic random r-partite r-uniform hypergraphs. The ARHC algorithm, which comes in Base and Extended versions, provides fast lookup and a high compression rate. ARHC-Extended achieves higher quality heuristics than ARHC-Base by decreasing the heuristic information loss at the cost of some decrease in the compression rate. ARHC shows higher performance than level-by-level Bloom filter PDB compression in all experiments conducted so far.","doi":"10.24963/ijcai.2017/611","url":"https://ijcai.org/proceedings/2017/611","pdf":"https://ijcai.org/proceedings/2017/0611.pdf","markdown":"https://ijcai.org/proceedings/2017/611.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/611","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Planning and Scheduling","track":"Main track","number":611,"pages":{"first":4376,"last":4383},"keywords":["Combinatorial & Heuristic Search: Heuristic Search","Planning and Scheduling: Search in Planning and Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Anderson et al., 2007] Kenneth Anderson, Robert Holte, and Jonathan Schaeffer. Partial pattern databases. In Pro- ceedings of the Seventh International Symposium on Ab- straction, Reformulation, and Approximation, pages 20- 34, 2007.","title":"Partial pattern databases","authors":"Kenneth Anderson, Robert Holte, Jonathan Schaeffer","year":"2007","venue":"Proceedings of the Seventh International Symposium on Abstraction, Reformulation, and Approximation","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bloom, 1970] Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.","title":"Space/time trade-offs in hash coding with allowable errors","authors":"H Burton, Bloom","year":"1970","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Botelho et al., 2007] Fabiano C. Botelho, Rasmus Pagh, and Nivio Ziviani. Simple and space-efficient minimal perfect hash functions. In Proceedings of the Tenth In- ternational Workshop on Data Structures and Algorithms, volume 4619 of Lecture Notes in Computer Science, pages 139-150. Springer, 2007.","title":"Simple and space-efficient minimal perfect hash functions","authors":"C Fabiano, Rasmus Botelho, Nivio Pagh, Ziviani","year":"2007","venue":"Proceedings of the Tenth International Workshop on Data Structures and Algorithms","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Breyer and Korf, 2010] Teresa Maria Breyer and Richard E. Korf. 1.6-bit pattern databases. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Atlanta, Georgia, USA, July 11-15, 2010.","title":"1.6-bit pattern databases","authors":"Teresa, Maria Breyer, Richard E Korf","year":"2010","venue":"Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Culberson and Schaeffer, 1998] Joseph Culberson and Jonathan Schaeffer. Pattern databases. Computational Intelligence, 14(3):318-334, 1998.","title":"Joseph Culberson and Jonathan Schaeffer","authors":"Schaeffer Culberson","year":"1998","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Czech et al., 1997] Zbigniew J. Czech, George Havas, and Bohdan S. Majewski. Perfect hashing. Theoretical Com- puter Science, 182(1-2):1 -143, 1997.","title":"Perfect hashing","authors":"J Zbigniew, George Czech, Bohdan S Havas, Majewski","year":"1997","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Edelkamp and Kissmann, 2008] Stefan Edelkamp and Peter Kissmann. Partial symbolic pattern databases for optimal sequential planning. In KI 2008: Advances in Artificial Intelligence, 31st Annual German Conference on AI, KI 2008, Kaiserslautern, Germany, September 23-26, 2008. Proceedings, pages 193-200, 2008.","title":"Partial symbolic pattern databases for optimal sequential planning","authors":"Kissmann Edelkamp, Stefan Edelkamp, Peter Kissmann","year":"2008","venue":"KI 2008: Advances in Artificial Intelligence, 31st Annual German Conference on AI, KI 2008","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Edelkamp, 2001] Stefan Edelkamp. Planning with pattern databases. In Proceedings of the Sixth European Confer- ence on Planning, pages 13-24, 2001.","title":"Planning with pattern databases","authors":"Stefan Edelkamp","year":"2001","venue":"Proceedings of the Sixth European Conference on Planning","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Edelkamp, 2002] Stefan Edelkamp. Symbolifc pattern databases in heuristic search planning. In Proceedings of the Sixth International Conference on Artificial Intel- ligence Planning Systems, April 23-27, 2002, Toulouse, France, pages 274-283, 2002.","title":"Symbolifc pattern databases in heuristic search planning","authors":"Stefan Edelkamp, Edelkamp","year":"2002","venue":"Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Felner et al., 2007] Ariel Felner, Richard E. Korf, Ram Meshulam, and Robert C. Holte. Compressed pattern databases. Journal of Artificial Intelligence Research, 30:213-247, 2007.","title":"Compressed pattern databases","authors":"Ariel Felner, Richard E Korf, Ram Meshulam, Robert C Holte","year":"2007","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hart et al., 1968] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SSC-4(2):100-107, 1968.","title":"A formal basis for the heuristic determination of minimum cost paths","authors":"Peter E Hart, Nils J Nilsson, Bertram Raphael","year":"1968","venue":"IEEE Transactions on Systems Science and Cybernetics, SSC","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Helmert and Lasinger, 2010] Malte Helmert and Hauke Lasinger. The Scanalyzer domain: Greenhouse logistics as a planning problem. In Proceedings of the Twentieth Inter- national Conference on Automated Planning and Schedul- ing, pages 234-237, 2010.","title":"The Scanalyzer domain: Greenhouse logistics as a planning problem","authors":"Lasinger Helmert, Malte Helmert, Hauke Lasinger","year":"2010","venue":"Proceedings of the Twentieth International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Holte et al., 2014] Robert Holte, Broderick Arneson, and Neil Burch. PSVN manual (june 20, 2014). Technical Re- port 14-03, Department of Computing Science, University of Alberta, 2014.","title":"PSVN manual","authors":"Robert Holte, Broderick Arneson, Neil Burch","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Jensen et al., 2002] Rune M. Jensen, Randal E. Bryant, and Manuela M. Veloso. SetA*: An efficient BDD-based heuristic search algorithm. In Proceedings of the Eigh- teenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Arti- ficial Intelligence, pages 668-673, 2002.","title":"SetA*: An efficient BDD-based heuristic search algorithm","authors":"M Rune, Randal E Jensen, Manuela M Bryant, Veloso","year":"2002","venue":"Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Korf, 1985] Richard. E. Korf. Depth-first iterative- deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.","title":"Depth-first iterativedeepening: An optimal admissible tree search","authors":"Richard E Korf","year":"1985","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Majewski et al., 1996] Bohdan S. Majewski, Nicholas C. Wormald, George Havas, and Zbigniew J. Czech. A family of perfect hashing methods. Computer Journal, 39(6):547-554, 1996.","title":"A family of perfect hashing methods","authors":"S Bohdan, Nicholas C Majewski, George Wormald, Zbigniew J Havas, Czech","year":"1996","venue":"Computer Journal","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Mitzenmacher and Upfal, 2005] Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.","title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","authors":"Michael Mitzenmacher, Eli Upfal","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Sadeqi and Hamilton, 2016] Mehdi Sadeqi and Howard J. Hamilton. Efficient representation of pattern databases using acyclic random hypergraphs. In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, London, UK, June 12-17, pages 258-266, 2016.","title":"Efficient representation of pattern databases using acyclic random hypergraphs","authors":"Mehdi Sadeqi, Howard J Hamilton","year":"2016","venue":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Samadi et al., 2008] Mehdi Samadi, Maryam Siabani, Ariel Felner, and Robert Holte. Compressing pattern databases with learning. In Proceedings of the Eighteenth Euro- pean Conference on Artificial Intelligence, pages 495-499, 2008.","title":"Compressing pattern databases with learning","authors":"Mehdi Samadi, Maryam Siabani, Ariel Felner, Robert Holte","year":"2008","venue":"Proceedings of the Eighteenth European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Sturtevant et al., 2014] Nathan R. Sturtevant, Ariel Felner, and Malte Helmert. Exploiting the Rubik's cube 12-edge PDB by combining partial pattern databases and Bloom filters. In Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014.","title":"Exploiting the Rubik's cube 12-edge PDB by combining partial pattern databases and Bloom filters","authors":"Nathan R Sturtevant, Ariel Felner, Malte Helmert","year":"2014","venue":"Proceedings of the Seventh Annual Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Zobrist, 1970] Albert L. Zobrist. A new hashing method with application for game playing. Technical Report 88, 1970.","title":"A new hashing method with application for game playing","authors":"Albert L Zobrist","year":"1970","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}