{"type":"ScholarlyArticle","title":"From Qualitative to Quantitative Dominance Pruning for Optimal Planning","authors":[{"name":"Álvaro Torralba","slug":"alvaro-torralba","given":"Álvaro","family":"Torralba","affiliation":"Saarland University , Saarland Informatics Campus , Saarbrücken , Germany"}],"abstract":"Dominance relations compare states to determine whether one is at least as good as another in terms of their goal distance. We generalize these qualitative yes/no relations to functions that measure by how much a state is better than another. This allows us to distinguish cases where the state is strictly closer to the goal. Moreover, we may obtain a bound on the difference in goal distance between two states even if there is no qualitative dominance.We analyze the multiple advantages that quantitative dominance has, like discovering coarser dominance relations, or trading dominance by g-value. Moreover, quantitative dominance can also be used to prove that an action starts an optimal plan from a given state. We introduce a novel action selection pruning that uses this to prune any other successor. Results show that quantitative dominance pruning greatly reduces the search space, significantly increasing the planners' performance.","doi":"10.24963/ijcai.2017/618","url":"https://ijcai.org/proceedings/2017/618","pdf":"https://ijcai.org/proceedings/2017/0618.pdf","markdown":"https://ijcai.org/proceedings/2017/618.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/618","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":618,"pages":{"first":4426,"last":4432},"keywords":["Planning and Scheduling: Search in Planning and Scheduling","Planning and Scheduling: Planning Algorithms"],"videos":[],"references":[{"position":1,"raw":"[Rosa et al., 2011] Tomás de la Rosa, Sergio Jiménez Celorrio, Raquel Fuentetaja, and Daniel Borrajo. Scaling up heuristic planning with relational decision trees. Jour- nal of Artificial Intelligence Research, 40:767-813, 2011.","title":"Tomás de la Rosa, Sergio Jiménez Celorrio, Raquel Fuentetaja, and Daniel Borrajo. Scaling up heuristic planning with relational decision trees","authors":"Rosa","year":"2011","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Domshlak et al., 2012] Carmel Domshlak, Michael Katz, and Alexander Shleyfman. Enhanced symmetry breaking in cost-optimal planning as forward search. In Proceed- ings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS'12). AAAI Press, 2012.","title":"Enhanced symmetry breaking in cost-optimal planning as forward search","authors":"Domshlak","year":"2012","venue":"Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS'12)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Dräger et al., 2006] Klaus Dräger, Bernd Finkbeiner, and Andreas Podelski. Directed model checking with distance- preserving abstractions. In Proceedings of the 13th In- ternational SPIN Workshop (SPIN 2006), volume 3925 of Lecture Notes in Computer Science, pages 19-34. Springer-Verlag, 2006.","title":"Directed model checking with distancepreserving abstractions","authors":"Dräger","year":"2006","venue":"Proceedings of the 13th International SPIN Workshop (SPIN 2006)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dräger et al., 2009] Klaus Dräger, Bernd Finkbeiner, and Andreas Podelski. Directed model checking with distance- preserving abstractions. International Journal on Software Tools for Technology Transfer, 11(1):27-37, 2009.","title":"Directed model checking with distancepreserving abstractions","authors":"Dräger","year":"2009","venue":"International Journal on Software Tools for Technology Transfer","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Hall et al., 2013] David Hall, Alon Cohen, David Burkett, and Dan Klein. Faster optimal planning with partial-order pruning. In Proceedings of the 23rd International Confer- ence on Automated Planning and Scheduling (ICAPS'13). AAAI Press, 2013.","title":"Faster optimal planning with partial-order pruning","authors":"David Hall, Alon Cohen, David Burkett, Dan Klein","year":"2013","venue":"Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS'13)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[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 (ICAPS'09), pages 162-169. AAAI Press, 2009.","title":"Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway?","authors":"Domshlak Helmert","year":"2009","venue":"Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS'09)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Helmert et al., 2007] Malte Helmert, Patrik Haslum, and Jörg Hoffmann. Flexible abstraction heuristics for optimal sequential planning. In Proceedings of the 17th Interna- tional Conference on Automated Planning and Scheduling (ICAPS'07), pages 176-183.","title":"Flexible abstraction heuristics for optimal sequential planning","authors":"Malte Helmert, Patrik Haslum, Jörg Hoffmann","year":null,"venue":"Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS'07)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"Morgan Kaufmann, 2007.","title":null,"authors":"Morgan Kaufmann","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Helmert et al., 2014] Malte Helmert, Patrik Haslum, Jörg Hoffmann, and Raz Nissim. Merge & shrink abstraction: A method for generating lower bounds in factored state spaces. Journal of the Association for Computing Machin- ery, 61(3), 2014.","title":"Merge & 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 Association for Computing Machinery","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hennessy and Milner, 1985] Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concur- rency. Journal of the Association for Computing Machin- ery, 32(1):137-161, 1985.","title":"Algebraic laws for nondeterminism and concurrency","authors":"Matthew Hennessy, Robin Milner","year":"1985","venue":"Journal of the Association for Computing Machinery","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Krajnansky et al., 2014] Michal Krajnansky, Olivier Buffet, Jörg Hoffmann, and Alan Fern. Learning pruning rules for heuristic search planning. In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), pages 483-488. IOS Press, August 2014.","title":"Learning pruning rules for heuristic search planning","authors":"Michal Krajnansky, Olivier Buffet, Jörg Hoffmann, Alan Fern","year":"2014","venue":"Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Leckie and Zukerman, 1998] Christopher Leckie and Ingrid Zukerman. Inductive learning of search control rules for planning. Artificial Intelligence, 101(1-2):63-98, 1998.","title":"Inductive learning of search control rules for planning","authors":"Zukerman Leckie, Christopher Leckie, Ingrid Zukerman","year":"1998","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"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 optimal planning. In Proceedings of the 22nd Inter- national Joint Conference on Artificial Intelligence (IJ- CAI'11), pages 1983-1990. AAAI Press/IJCAI, 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 (IJ-CAI'11)","doi":null,"url":null,"internal_url":"/proceedings/2011/331"},{"position":14,"raw":"[Pochter et al., 2011] Nir Pochter, Aviv Zohar, and Jeffrey S. Rosenschein. Exploiting problem symmetries in state- based planners. In Proceedings of the 25th National Con- ference of the American Association for Artificial Intelli- gence (AAAI'11). AAAI Press, July 2011.","title":"Exploiting problem symmetries in statebased planners","authors":"Nir Pochter, Aviv Zohar, Jeffrey S Rosenschein","year":"2011","venue":"Proceedings of the 25th National Conference of the American Association for Artificial Intelligence (AAAI'11)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Radzi, 2011] M. Radzi. Multi-objective planning using lin- ear programming. PhD thesis, University of Strathclyde, 2011.","title":"Multi-objective planning using linear programming","authors":"M Radzi","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"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 (AAAI'14), pages 2358-2366. AAAI Press, January 2014.","title":"Generalized label reduction for mergeand-shrink heuristics","authors":"Sievers","year":"2014","venue":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI'14)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Torralba and Hoffmann, 2015] Álvaro Torralba and Jörg Hoffmann. Simulation-based admissible dominance prun- ing. In Proceedings of the 24th International Joint Con- ference on Artificial Intelligence (IJCAI'15), pages 1689- 1695. AAAI Press/IJCAI, 2015.","title":"Simulation-based admissible dominance pruning","authors":"Hoffmann Torralba, Álvaro Torralba, Jörg Hoffmann","year":"2015","venue":"Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI'15)","doi":null,"url":null,"internal_url":"/proceedings/2015/241"},{"position":18,"raw":"[Torralba and Kissmann, 2015] Álvaro Torralba and Peter Kissmann. Focusing on what really matters: Irrelevance pruning in merge-and-shrink. In Proceedings of the 8th Annual Symposium on Combinatorial Search (SOCS'15), pages 122-130. AAAI Press, 2015.","title":"Focusing on what really matters: Irrelevance pruning in merge-and-shrink","authors":"Kissmann Torralba, Álvaro Torralba, Peter Kissmann","year":"2015","venue":"Proceedings of the 8th Annual Symposium on Combinatorial Search (SOCS'15)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Torralba, 2017] Álvaro Torralba. From qualitative to quantitative dominance pruning for optimal plan- ning -technical report. Technical report, Saarland University, 2017. Available at http://fai.cs.uni- saarland.de/torralba/papers/ijcai17a-tr.pdf.","title":"From qualitative to quantitative dominance pruning for optimal planning -technical report","authors":"Álvaro Torralba, Torralba","year":"2017","venue":null,"doi":null,"url":"http://fai.cs.uni-saarland.de/torralba/papers/ijcai17a-tr.pdf","internal_url":null},{"position":20,"raw":"[Wehrle and Helmert, 2012] Martin Wehrle and Malte Helmert. About partial order reduction in planning and computer aided verification. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS'12). AAAI Press, 2012.","title":"About partial order reduction in planning and computer aided verification","authors":"Helmert Wehrle, Martin Wehrle, Malte Helmert","year":"2012","venue":"Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS'12)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Wehrle and Helmert, 2014] Martin Wehrle and Malte Helmert. Efficient stubborn sets: Generalized algorithms and selection strategies. In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS'14). AAAI Press, 2014.","title":"Efficient stubborn sets: Generalized algorithms and selection strategies","authors":"Helmert Wehrle, Martin Wehrle, Malte Helmert","year":"2014","venue":"Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS'14)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Wehrle et al., 2008] Martin Wehrle, Sebastian Kupfer- schmid, and Andreas Podelski. Useless actions are use- ful. In Proceedings of the Eighteenth International Con- ference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Australia, September 14-18, 2008, pages 388-395. AAAI Press, 2008.","title":"Useless actions are useful","authors":"Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski","year":"2008","venue":"Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wehrle et al., 2013] Martin Wehrle, Malte Helmert, Yusra Alkhazraji, and Robert Mattmüller. The relative pruning power of strong stubborn sets and expansion core. In Pro- ceedings of the 23rd International Conference on Auto- mated Planning and Scheduling (ICAPS'13). AAAI Press, 2013.","title":"The relative pruning power of strong stubborn sets and expansion core","authors":"Martin Wehrle, Malte Helmert, Yusra Alkhazraji, Robert Mattmüller","year":"2013","venue":"Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS'13)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}