{"type":"ScholarlyArticle","title":"Lagrangian Decomposition for Classical Planning (Extended Abstract)","authors":[{"name":"Florian Pommerening","slug":"florian-pommerening","given":"Florian","family":"Pommerening","affiliation":"University of Basel , Basel , Switzerland"},{"name":"Gabriele Röger","slug":"gabriele-roger","given":"Gabriele","family":"Röger","affiliation":"University of Basel , Basel , Switzerland"},{"name":"Malte Helmert","slug":"malte-helmert","given":"Malte","family":"Helmert","affiliation":"University of Basel , Basel , Switzerland"},{"name":"Hadrien Cambazad","slug":"hadrien-cambazad","given":"Hadrien","family":"Cambazad","affiliation":"Univ. Grenoble Alpes , Grenoble INP , G-SCOP , 38000 Grenoble , France"},{"name":"Louis-Martin Rousseau","slug":"louis-martin-rousseau","given":"Louis-Martin","family":"Rousseau","affiliation":"Polytechnique Montreal , Montreal , Canada"},{"name":"Domenico Salvagnin","slug":"domenico-salvagnin","given":"Domenico","family":"Salvagnin","affiliation":"University of Padua , Padua , Italy"}],"abstract":"Optimal cost partitioning of classical planning heuristics has been shown to lead to excellent heuristic values but is often prohibitively expensive to compute. We analyze the application of Lagrangian decomposition, a classical tool in mathematical programming, to cost partitioning of operator-counting heuristics. This allows us to view the computation as an iterative process that can be seeded with any cost partitioning and that improves over time. In the case of non-negative cost partitioning of abstraction heuristics the computation reduces to independent shortest path problems and does not require an LP solver.","doi":"10.24963/ijcai.2020/663","url":"https://ijcai.org/proceedings/2020/663","pdf":"https://ijcai.org/proceedings/2020/0663.pdf","markdown":"https://ijcai.org/proceedings/2020/663.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/663","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":663,"pages":{"first":4770,"last":4774},"keywords":["Planning and Scheduling: Search in Planning and Scheduling","Heuristic Search and Game Playing: Heuristic Search","Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Planning and Scheduling: Theoretical Foundations of Planning"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25043/file_25043.m3u8","length_sec":300,"provider":"hls"}],"references":[{"position":1,"raw":"[Dijkstra, 1959] Edsger W. Dijkstra. A note on two prob- lems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.","title":"A note on two problems in connexion with graphs","authors":"W Edsger, Dijkstra","year":"1959","venue":"Numerische Mathematik","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Edelkamp, 2001] Stefan Edelkamp. Planning with pattern databases. In Amedeo Cesta and Daniel Borrajo, editors, Proceedings of the Sixth European Conference on Plan- ning (ECP 2001), pages 84-90. AAAI Press, 2001.","title":"Planning with pattern databases","authors":"Stefan Edelkamp","year":"2001","venue":"Proceedings of the Sixth European Conference on Planning (ECP 2001)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Geoffrion, 1974] Arthur M. Geoffrion. Lagrangean relax- ation for integer programming. Mathematical Program- ming, 2:82-114, 1974.","title":"Lagrangean relaxation for integer programming","authors":"M Arthur, Geoffrion","year":"1974","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Guignard and Kim, 1987] Monique Guignard and Siwhan Kim. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Program- ming, 39(2):215-228, 1987.","title":"Lagrangean decomposition: A model yielding stronger Lagrangean bounds","authors":"Kim ; Guignard, Monique Guignard, Siwhan Kim","year":"1987","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward plan- ning system. 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":6,"raw":"[Katz and Domshlak, 2010] Michael Katz and Carmel Domshlak. Optimal admissible composition of abstraction heuristics. Artificial 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":7,"raw":"[Pommerening et al., 2014] Florian Pommerening, Gabriele Röger, Malte Helmert, and Blai Bonet. LP-based heuris- tics for cost-optimal planning. In Steve Chien, Alan Fern, Wheeler Ruml, and Minh Do, editors, Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014), pages 226-234. AAAI Press, 2014.","title":"LP-based heuristics for cost-optimal planning","authors":"Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet","year":"2014","venue":"Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Pommerening et al., 2015] Florian Pommerening, Malte Helmert, Gabriele Röger, and Jendrik Seipp. From non-negative to general operator cost partitioning. In Blai Bonet and Sven Koenig, editors, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015), pages 3335-3341. AAAI Press, 2015.","title":"From non-negative to general operator cost partitioning","authors":"Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Pommerening et al., 2019] Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, and Domenico Salvagnin. Lagrangian decom- position for optimal cost partitioning. In Nir Lipovetzky, Eva Onaindia, and David E. Smith, editors, Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019), pages 338-347. AAAI Press, 2019.","title":"Lagrangian decomposition for optimal cost partitioning","authors":"Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin","year":"2019","venue":"Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Pommerening, 2017] Florian Pommerening. New Perspec- tives on Cost Partitioning for Optimal Classical Planning. PhD thesis, University of Basel, 2017.","title":"Florian Pommerening. New Perspectives on Cost Partitioning for Optimal Classical Planning","authors":"Pommerening","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Seipp et al., 2017] Jendrik Seipp, Thomas Keller, and Malte Helmert. A comparison of cost partitioning algorithms for optimal classical planning. In Laura Barbulescu, Jeremy Frank, Mausam, and Stephen F. Smith, editors, Proceed- ings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), pages 259-268. AAAI Press, 2017.","title":"A comparison of cost partitioning algorithms for optimal classical planning","authors":"Seipp","year":"2017","venue":"Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Shor, 1985] Naum Zuselevich Shor. Minimization meth- ods for non-differentiable functions, volume 3. Springer- Verlag Berlin Heidelberg, 1985.","title":"Naum Zuselevich Shor. Minimization methods for non-differentiable functions","authors":"Shor","year":"1985","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}