{"type":"ScholarlyArticle","title":"On Creating Complementary Pattern Databases","authors":[{"name":"Santiago Franco","slug":"santiago-franco","given":"Santiago","family":"Franco","affiliation":"School of Computing and Engineering , University of Huddersfield , UK; Universidade Federal de Vic ¸osa , Brazil"},{"name":"Álvaro Torralba","slug":"alvaro-torralba","given":"Álvaro","family":"Torralba","affiliation":"Saarland University , Saarland Informatics Campus , Saarbrücken , Germany"},{"name":"Levi H. S. Lelis","slug":"levi-h-s-lelis","given":"Levi H. S.","family":"Lelis","affiliation":"Departamento de Informática , Universidade Federal de Vic ¸osa , Brazil"},{"name":"Mike Barley","slug":"mike-barley","given":"Mike","family":"Barley","affiliation":"Computer Science Department , Auckland University , New Zealand"}],"abstract":"A pattern database (PDB) for a planning task is a heuristic function in the form of a lookup table that contains optimal solution costs of a simplified version of the task. In this paper we introduce a method that sequentially creates multiple PDBs which are later combined into a single heuristic function. \r\nAt a given iteration, our method uses estimates of the A* running time to create a PDB that complements the strengths of the PDBs created in previous iterations. We evaluate our algorithm using explicit and symbolic PDBs. Our results show that the heuristics produced by our approach are able to outperform existing schemes, and that our method is able to create PDBs that complement the strengths of other existing heuristics such as a symbolic perimeter heuristic.","doi":"10.24963/ijcai.2017/601","url":"https://ijcai.org/proceedings/2017/601","pdf":"https://ijcai.org/proceedings/2017/0601.pdf","markdown":"https://ijcai.org/proceedings/2017/601.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/601","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":601,"pages":{"first":4302,"last":4309},"keywords":["Combinatorial & Heuristic Search: Meta-Reasoning and Meta-heuristics","Combinatorial & Heuristic Search: Combinatorial search/optimisation","Planning and Scheduling: Planning Algorithms","Combinatorial & Heuristic Search: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Alcázar and Torralba, 2015] Vidal Alcázar and Álvaro Torralba. A reminder about the importance of computing and exploiting in- variants in planning. In Proc. ICAPS, 2015.","title":"A reminder about the importance of computing and exploiting invariants in planning","authors":"Torralba ; Alcázar, Álvaro Vidal Alcázar, Torralba","year":"2015","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Anderson et al., 2007] Kenneth Anderson, Robert Holte, and Jonathan Schaeffer. Partial pattern databases. In Proc. SARA, pages 20-34, 2007.","title":"Partial pattern databases","authors":"Kenneth Anderson, Robert Holte, Jonathan Schaeffer","year":"2007","venue":"Proc. SARA","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Auer, 2002] P. Auer. Using confidence bounds for exploitation- exploration trade-offs. Journal of Machine Learning Research, 3:397-422, 2002.","title":"Using confidence bounds for exploitationexploration trade-offs","authors":"P Auer","year":"2002","venue":"Journal of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bäckström and Nebel, 1995] C. Bäckström and B. Nebel. Com- plexity results for SAS+ planning. Computational Intelligence, 11:625-656, 1995.","title":"Complexity results for SAS+ planning","authors":"C Bäckström, B Nebel","year":"1995","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Barley et al., 2014] Michael W. Barley, Santiago Franco, and Pa- tricia J. Riddle. Overcoming the utility problem in heuristic gen- eration: Why time matters. In Proc. ICAPS, 2014.","title":"Overcoming the utility problem in heuristic generation: Why time matters","authors":"Michael W Barley, Santiago Franco, Patricia J Riddle","year":"2014","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bryant, 1986] Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Comput- ers, 35(8):677-691, 1986.","title":"Graph-based algorithms for boolean function manipulation","authors":"Randal E Bryant","year":"1986","venue":"IEEE Transactions on Computers","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chen, 1992] P.-C. Chen. Heuristic sampling: A method for pre- dicting the performance of tree searching programs. SIAM Jour- nal on Computing, 21:295-315, 1992.","title":"Heuristic sampling: A method for predicting the performance of tree searching programs","authors":"P.-C Chen","year":"1992","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Culberson and Schaeffer, 1998] Joseph C. Culberson and Jonathan Schaeffer. Pattern databases. Computational Intelligence, 14(3):318-334, 1998.","title":"Pattern databases","authors":"Joseph C Culberson, Jonathan Schaeffer","year":"1998","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Edelkamp, 2001] Stefan Edelkamp. Planning with pattern databases. In Proc. ECP, pages 13-24, 2001.","title":"Planning with pattern databases","authors":"Stefan Edelkamp","year":"2001","venue":"Proc. ECP","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Edelkamp, 2002] Stefan Edelkamp. Symbolic pattern databases in heuristic search planning. In Proc. AIPS, pages 274-283, 2002.","title":"Symbolic pattern databases in heuristic search planning","authors":"Stefan Edelkamp, Edelkamp","year":"2002","venue":"Proc. AIPS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Edelkamp, 2006] Stefan Edelkamp. Automated creation of pattern database search heuristics. In Proc. MOCHART, pages 35-50, 2006.","title":"Automated creation of pattern database search heuristics","authors":"Stefan Edelkamp, Edelkamp","year":"2006","venue":"Proc. MOCHART","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Felner et al., 2004] Ariel Felner, Richard E. Korf, and Sarit Hanan. Additive pattern database heuristics. Journal of Artificial Intelli- gence Research, 22:279-318, 2004.","title":"Additive pattern database heuristics","authors":"Ariel Felner, Richard E Korf, Sarit Hanan","year":"2004","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hart et al., 1968] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of min- imum cost paths. IEEE Transactions on Systems Science and Cybernetics, 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","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Haslum et al., 2007] Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, and Sven Koenig. Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proc. AAAI, pages 1007-1012, 2007.","title":"Domain-independent construction of pattern database heuristics for cost-optimal planning","authors":"Haslum","year":"2007","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Haslum et al., 2015] Patrik Haslum, Blai Bonet, and Héctor Geffner. New admissible heuristics for domain-independent plan- ning. In Proc. AAAI, pages 1163-1168, 2015.","title":"New admissible heuristics for domain-independent planning","authors":"Haslum","year":"2015","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Helmert, 2004] Malte Helmert. A planning heuristic based on causal graph analysis. In Proc. ICAPS, pages 161-170, 2004.","title":"A planning heuristic based on causal graph analysis","authors":"Malte Helmert","year":"2004","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward planning sys- tem. Journal of Artificial Intelligence Research, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert","year":"2006","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Holte et al., 2006] R. C. Holte, A. Felner, J. Newton, R. Meshu- lam, and D. Furcy. Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence, 170(16- 17):1123-1136, 2006.","title":"Maximizing over multiple pattern databases speeds up heuristic search","authors":"R C Holte, A Felner, J Newton, R Meshulam, D Furcy","year":"2006","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Katz and Domshlak, 2008] Michael Katz and Carmel Domshlak. Optimal additive composition of abstraction-based admissible heuristics. In Proc. ICAPS, pages 174-181, 2008.","title":"Optimal additive composition of abstraction-based admissible heuristics","authors":"Michael Katz, Carmel Domshlak","year":"2008","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Katz and Domshlak, 2010] Michael Katz and Carmel Domshlak. Optimal admissible composition of abstraction heuristics. Artifi- cial Intelligence, 174(12-13):767-798, 2010.","title":"Optimal admissible composition of abstraction heuristics","authors":"Michael Katz, Carmel Domshlak","year":"2010","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Keller et al., 2016] Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer, and Robert Mattmüller. State-dependent cost partitionings for cartesian abstractions in classical planning. In Proc. IJCAI, pages 3161-3169, 2016. [Kissmann and Edelkamp, 2011] Peter Kissmann and Stefan Edelkamp. Improving cost-optimal domain-independent symbolic planning. In Proc. AAAI, pages 992-997, 2011.","title":"State-dependent cost partitionings for cartesian abstractions in classical planning","authors":"Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer, Robert Mattmüller","year":"2011","venue":"Kissmann and Edelkamp","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lelis et al., 2014] Levi H. S. Lelis, Roni Stern, and Nathan R. Sturtevant. Estimating search tree size with duplicate detection. In Proc. SOCS, pages 114-122, 2014.","title":"Estimating search tree size with duplicate detection","authors":"H S Levi, Roni Lelis, Nathan R Stern, Sturtevant","year":"2014","venue":"Proc. SOCS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lelis et al., 2016] Levi H. S. Lelis, Santiago Franco, Marvin Abis- rror, Mike Barley, Sandra Zilles, and Robert C. Holte. Heuris- tic subset selection in classical planning. In Proc. IJCAI, pages 3185-3191, 2016.","title":"Heuristic subset selection in classical planning","authors":"H S Levi, Santiago Lelis, Marvin Franco, Mike Abisrror, Sandra Barley, Robert C Zilles, Holte","year":"2016","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/451"},{"position":24,"raw":"[McMillan, 1993] Kenneth L. McMillan. Symbolic Model Check- ing. Kluwer Academic Publishers, 1993.","title":"Symbolic Model Checking","authors":"L Kenneth, Mcmillan","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Mladenovic and Hansen, 1997] Nenad Mladenovic and Pierre Hansen. Variable neighborhood search. Computers & OR, 24(11):1097-1100, 1997.","title":"Variable neighborhood search","authors":"Hansen Mladenovic, Nenad Mladenovic, Pierre Hansen","year":"1997","venue":"Computers & OR","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pommerening et al., 2013] Florian Pommerening, Gabriele Röger, and Malte Helmert. Getting the most out of pattern databases for classical planning. In Proc. IJCAI, 2013.","title":"Getting the most out of pattern databases for classical planning","authors":"Florian Pommerening, Gabriele Röger, Malte Helmert","year":"2013","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/347"},{"position":27,"raw":"[Pommerening et al., 2015] Florian Pommerening, Malte Helmert, Gabriele Röger, and Jendrik Seipp. From non-negative to gen- eral operator cost partitioning. In Proc. AAAI, pages 3335-3341, 2015.","title":"From non-negative to general operator cost partitioning","authors":"Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp","year":"2015","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Scherrer et al., 2015] Sascha Scherrer, Florian Pommerening, and Martin Wehrle. Improved pattern selection for PDB heuristics in classical planning (extended abstract). In Proc. SOCS, pages 216-217, 2015.","title":"Improved pattern selection for PDB heuristics in classical planning (extended abstract)","authors":"Sascha Scherrer, Florian Pommerening, Martin Wehrle","year":"2015","venue":"Proc. SOCS","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Seipp and Helmert, 2014] Jendrik Seipp and Malte Helmert. Di- verse and additive cartesian abstraction heuristics. In Proc. ICAPS, pages 289-297, 2014.","title":"Jendrik Seipp and Malte Helmert. Diverse and additive cartesian abstraction heuristics","authors":"Helmert Seipp","year":"2014","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Seipp et al., 2017a] Jendrik Seipp, Thomas Keller, and Malte Helmert. A comparison of cost partitioning algorithms for op- timal classical planning. In Proc. ICAPS, 2017.","title":"A comparison of cost partitioning algorithms for optimal classical planning","authors":"Seipp","year":"2017","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Seipp et al., 2017b] Jendrik Seipp, Thomas Keller, and Malte Helmert. Narrowing the gap between saturated and optimal cost partitioning for classical planning. In Proc. AAAI, pages 3651- 3657, 2017.","title":"Narrowing the gap between saturated and optimal cost partitioning for classical planning","authors":"Seipp","year":"2017","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Sievers et al., 2012] Silvan Sievers, Manuela Ortlieb, and Malte Helmert. Efficient implementation of pattern database heuristics for classical planning. In Proc. SOCS, 2012.","title":"Efficient implementation of pattern database heuristics for classical planning","authors":"Sievers","year":"2012","venue":"Proc. SOCS","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Torralba et al., 2014] Álvaro Torralba, Vidal Alcázar, Daniel Bor- rajo, Peter Kissmann, and Stefan Edelkamp. SymBA*: A sym- bolic bidirectional A* planner. In IPC 2014 planner abstracts, pages 105-109, 2014.","title":"SymBA*: A symbolic bidirectional A* planner","authors":"Álvaro Torralba, Daniel Vidal Alcázar, Peter Borrajo, Stefan Kissmann, Edelkamp","year":"2014","venue":"IPC 2014 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Torralba et al., 2016] Álvaro Torralba, Carlos Linares López, and Daniel Borrajo. Abstraction heuristics for symbolic bidirectional search. In Proc. IJCAI, 2016.","title":"Abstraction heuristics for symbolic bidirectional search","authors":"Álvaro Torralba, Carlos Linares López, Daniel Borrajo","year":"2016","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/463"},{"position":35,"raw":"[Torralba et al., 2017] Álvaro Torralba, Vidal Alcázar, Peter Kiss- mann, and Stefan Edelkamp. Efficient symbolic search for cost- optimal planning. Artificial Intelligence, 242:52-79, 2017.","title":"Efficient symbolic search for costoptimal planning","authors":"Álvaro Torralba, Peter Vidal Alcázar, Stefan Kissmann, Edelkamp","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}