{"type":"ScholarlyArticle","title":"Additive Merge-and-Shrink Heuristics for Diverse Action Costs","authors":[{"name":"Gaojian Fan","slug":"gaojian-fan","given":"Gaojian","family":"Fan","affiliation":"University of Alberta , Canada"},{"name":"Martin Müller","slug":"martin-muller","given":"Martin","family":"Müller","affiliation":"University of Alberta , Canada"},{"name":"Robert Holte","slug":"robert-holte","given":"Robert","family":"Holte","affiliation":"University of Alberta , Canada"}],"abstract":"In many planning applications, actions can have highly diverse costs. Recent studies focus on the effects of diverse action costs on search algorithms, but not on their effects on domain-independent heuristics. In this paper, we demonstrate there are negative impacts of action cost diversity on merge-and-shrink (M&S), a successful abstraction method for producing high-quality heuristics for planning problems. We propose a new cost partitioning method for M&S to address the negative effects of diverse action costs. We investigate non-unit cost IPC domains, especially those for which diverse action costs have severe negative effects on the quality of the M&S heuristic. Our experiments demonstrate that in these domains, an additive set of M&S heuristics using the new cost partitioning method produces much more informative and effective heuristics than creating a single M&S heuristic which directly encodes diverse costs.","doi":"10.24963/ijcai.2017/599","url":"https://ijcai.org/proceedings/2017/599","pdf":"https://ijcai.org/proceedings/2017/0599.pdf","markdown":"https://ijcai.org/proceedings/2017/599.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/599","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":599,"pages":{"first":4287,"last":4293},"keywords":["Planning and Scheduling: Search in Planning and Scheduling","Combinatorial & Heuristic Search: Combinatorial search/optimisation","Planning and Scheduling: Planning Algorithms","Combinatorial & Heuristic Search: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Aghighi and Bäckström, 2015] Meysam Aghighi and Christer Bäckström. Cost-optimal and net-benefit plan- ning -A parameterised complexity view. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, pages 1487-1493, 2015.","title":"Cost-optimal and net-benefit planning -A parameterised complexity view","authors":"Bäckström Aghighi, Meysam Aghighi, Christer Bäckström","year":"2015","venue":"Proceedings of the 24th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/213"},{"position":2,"raw":"[Aghighi and Bäckström, 2016] Meysam Aghighi and Christer Bäckström. A multi-parameter complexity analysis of cost-optimal and net-benefit planning. In Proceedings of the 26th International Conference on Automated Planning and Scheduling, pages 2-10, 2016.","title":"A multi-parameter complexity analysis of cost-optimal and net-benefit planning","authors":"Bäckström Aghighi, Meysam Aghighi, Christer Bäckström","year":"2016","venue":"Proceedings of the 26th International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Hector Geffner. Planning as heuristic search. Artificial Intelligence, 129(1- 2):5-33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Hector Geffner","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cushing et al., 2010] William Cushing, J. Benton, and Sub- barao Kambhampati. Cost based search considered harm- ful. In Proceedings of the 3rd Annual Symposium on Com- binatorial Search, pages 140-141, 2010.","title":"Cost based search considered harmful","authors":"William Cushing, J Benton, Subbarao Kambhampati","year":"2010","venue":"Proceedings of the 3rd Annual Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dräger et al., 2006] Klaus Dräger, Bernd Finkbeiner, and Andreas Podelski. Directed model checking with distance- preserving abstractions. In Proceedings of Model Check- ing Software, 13th International SPIN Workshop, volume 3925, pages 19-34, 2006.","title":"Directed model checking with distancepreserving abstractions","authors":"Dräger","year":"2006","venue":"Proceedings of Model Checking Software, 13th International SPIN Workshop","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Fan et al., 2017] Gaojian Fan, Martin Müller, and Robert Holte. The two-edged nature of diverse action costs. In Proceedings of the 27th International Conference on Au- tomated Planning and Scheduling, 2017. To appear. [Helmert and Domshlak, 2009] Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway? In Proceedings of the 19th International Conference on Automated Planning and Scheduling, pages 162-169, 2009.","title":"Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway","authors":"Fan","year":"2009","venue":"Proceedings of the 27th International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Helmert et al., 2014] Malte Helmert, Patrik Haslum, Jörg Hoffmann, and Raz Nissim. Merge-and-shrink abstrac- tion: A method for generating lower bounds in factored state spaces. Journal of the ACM, 61(3):16:1-16:63, 2014.","title":"Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces","authors":"Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim","year":"2014","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Katz and Domshlak, 2008] Michael Katz and Carmel Domshlak. Optimal additive composition of abstraction- based admissible heuristics. In Proceedings of the 18th International Conference on Automated Planning and Scheduling, pages 174-181, 2008.","title":"Optimal additive composition of abstractionbased admissible heuristics","authors":"Michael Katz, Carmel Domshlak","year":"2008","venue":"Proceedings of the 18th International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Nissim et al., 2011] Raz Nissim, Jörg Hoffmann, and Malte Helmert. Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in opti- mal planning. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pages 1983- 1990, 2011.","title":"Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning","authors":"Raz Nissim, Jörg Hoffmann, Malte Helmert","year":"2011","venue":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2011/331"},{"position":10,"raw":"[Seipp and Helmert, 2014] Jendrik Seipp and Malte Helmert. Diverse and additive cartesian abstraction heuristics. In Proceedings of the 24th International Conference on Automated Planning and Scheduling, pages 289-297, 2014.","title":"Jendrik Seipp and Malte Helmert. Diverse and additive cartesian abstraction heuristics","authors":"Helmert Seipp","year":"2014","venue":"Proceedings of the 24th International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Seipp et al., 2017] Jendrik Seipp, Thomas Keller, and Malte Helmert. Narrowing the gap between saturated and opti- mal cost partitioning for classical planning. In Proceed- ings of the 31st AAAI Conference on Artificial Intelligence, pages 3651-3657, 2017.","title":"Narrowing the gap between saturated and optimal cost partitioning for classical planning","authors":"Seipp","year":"2017","venue":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Sievers et al., 2014] Silvan Sievers, Martin Wehrle, and Malte Helmert. Generalized label reduction for merge- and-shrink heuristics. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, pages 2358-2366, 2014.","title":"Generalized label reduction for mergeand-shrink heuristics","authors":"Sievers","year":"2014","venue":"Proceedings of the 28th AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Thayer and Ruml, 2011] Jordan Tyler Thayer and Wheeler Ruml. Bounded suboptimal search: A direct approach us- ing inadmissible estimates. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pages 674-679, 2011.","title":"Bounded suboptimal search: A direct approach using inadmissible estimates","authors":"Ruml ; Thayer, Tyler Jordan, Wheeler Thayer, Ruml","year":"2011","venue":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2011/119"},{"position":14,"raw":"[Wilt and Ruml, 2011] Christopher Makoto Wilt and Wheeler Ruml. Cost-based heuristic search is sensitive to the ratio of operator costs. In Proceedings of the 4th Annual Symposium on Combinatorial Search, pages 192-197, 2011.","title":"Cost-based heuristic search is sensitive to the ratio of operator costs","authors":"Ruml ; Wilt, Makoto Christopher, Wheeler Wilt, Ruml","year":"2011","venue":"Proceedings of the 4th Annual Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Wilt and Ruml, 2014] Christopher Makoto Wilt and Wheeler Ruml. Speedy versus greedy search. In Pro- ceedings of the 7th Annual Symposium on Combinatorial Search, pages 184-192, 2014.","title":"Speedy versus greedy search","authors":"Ruml ; Wilt, Makoto Christopher, Wheeler Wilt, Ruml","year":"2014","venue":"Proceedings of the 7th Annual Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":"/proceedings/2015/616"},{"position":16,"raw":"[Yang et al., 2008] Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, and Ariel Felner. A general theory of additive state space abstractions. Journal of Artificial In- telligence Research, 32:631-662, 2008.","title":"A general theory of additive state space abstractions","authors":"Fan Yang, Joseph C Culberson, Robert Holte, Uzi Zahavi, Ariel Felner","year":"2008","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}