Gabriele Röger

Gabriele Röger
Address
Department of Mathematics and Computer Science
Spiegelgasse 1
CH - 4051 Basel, Switzerland
Room
04.005
Email
Phone
+41 61 207 05 37

Short bio

I am a lecturer and senior research associate at the AI group of the University of Basel. Previously, I was at the University of Freiburg from which I received my doctoral degree (Dr. rer. nat) in June 2014. My research is mostly on classical planning and heuristic search.

I am a co-developer of the Fast Downward and Temporal Fast Downward planning systems and obtained six awards at the International Planning Competitions 2008-2018. In 2016, I received the ICAPS best dissertation award and so far I was co-author of three best (student) papers at ICAPS and two best papers at AAAI. I am in the program or senior program committees of all major AI and planning conferences (IJCAI, AAAI, ICAPS, ECAI), was area chair at AAAI 2019 and 2022 and am a member of the JAIR editorial board. I have been a conference co-chair of SoCS 2013, program co-chair of ICAPS 2018 and associate program co-chair of AAAI 2021. From 2022-2024 I serve as ICAPS president.

For further information, please consult my academic CV (PDF).

Tutorials

Publications

(Show all abstracts) (Hide all abstracts)

2022

  • Michael Katz, Gabriele Röger and Malte Helmert.
    On Producing Shortest Cost-Optimal Plans.
    In Proceedings of the 15th International Symposium on Combinatorial Search (SoCS 2022), pp. 100-108. 2022.
    (Show abstract) (PDF) (slides; PDF)

  • Lucas Galery Käser, Clemens Büchner, Augusto B. Corrêa, Florian Pommerening and Gabriele Röger.
    Machetli: Simplifying Input Files for Debugging.
    In System Demonstrations at the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022). 2022.
    (Show abstract) (PDF) (poster; PDF) (video; MP4) (interactive demo)

  • Andrea Micheli, Alexandre Arnold, Arthur Bit-Monnot, Luigi Bonassi, Luca Framba, Alfonso Emilio Gerevini, Selvakumar Hastham Sathiya Satchi, Malte Helmert, Felix Ingrand, Luca Iocchi, Uwe Kockemann, Oscar Lima, Fabio Patrizi, Federico Pecora, Guillaume Poveda, Gabriele Röger, Alessandro Saetti, Alessandro Saffiotti, Enrico Scala, Ivan Serina, Sebastian Stock, Florent Teichteil-Koenigsbuch, Alessandro Trapasso, Paolo Traverso and Alessandro Valentini.
    Unified Planning: A Python Library Making Planning Technology Accessible.
    In System Demonstrations at the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022). 2022.
    (Show abstract) (PDF) (poster; PDF) (video)

  • Thorsten Klößner, Florian Pommerening, Thomas Keller and Gabriele Röger.
    Cost Partitioning Heuristics for Stochastic Shortest Path Problems.
    In Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), pp. 193-202. 2022.
    (Show abstract) (PDF) (technical report; PDF)

2020

  • Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau and Domenico Salvagnin.
    Lagrangian Decomposition for Classical Planning (Extended Abstract).
    In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), pp. 4770-4774. 2020.
    Note: This paper was invited for submission to the Best Papers From Sister Conferences Track, based on a paper that appeared in the International Conference on Automated Planning and Scheduling (ICAPS) 2019. When referring to this work, please cite the ICAPS 2019 paper instead of this version.
    (Show abstract) (PDF) (slides; PDF) (short recording; MP4) (long recording; MP4) (poster; PDF)

  • Gabriele Röger, Malte Helmert, Jendrik Seipp and Silvan Sievers.
    An Atom-Centric Perspective on Stubborn Sets.
    In Proceedings of the 13th Annual Symposium on Combinatorial Search (SoCS 2020), pp. 57-65. 2020.
    Note: SoCS 2020 Best Paper Award.
    (Show abstract) (PDF) (slides; HTML) (recording; MP4) (code, scripts and data)

2019

  • Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau and Domenico Salvagnin.
    Lagrangian Decomposition for Optimal Cost Partitioning.
    In Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), pp. 338-347. 2019.
    (Show abstract) (PDF) (slides; PDF)

  • Silvan Sievers, Gabriele Röger, Martin Wehrle and Michael Katz.
    Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks.
    In Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), pp. 446-454. 2019.
    (Show abstract) (PDF) (slides; PDF) (code and scripts) (data)

2018

  • Salomé Eriksson, Gabriele Röger and Malte Helmert.
    Inductive Certificates of Unsolvability for Domain-Independent Planning.
    In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), pp. 5244-5248. 2018.
    Note: This paper was invited for submission to the Best Papers From Sister Conferences Track, based on a paper that appeared in the International Conference on Automated Planning and Scheduling (ICAPS) 2017. When referring to this work, please cite the ICAPS 2017 paper instead of this version.
    (Show abstract) (PDF)

  • Jendrik Seipp and Gabriele Röger.
    Fast Downward Stone Soup 2018 (planner abstract).
    In Ninth International Planning Competition (IPC 2018), Deterministic Part, pp. 80-82. 2018.
    (PDF)

  • Salomé Eriksson, Gabriele Röger and Malte Helmert.
    A Proof System for Unsolvable Planning Tasks.
    In Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS 2018), pp. 65-73. 2018.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF)

  • Gabriele Röger, Silvan Sievers and Michael Katz.
    Symmetry-based Task Reduction for Relaxed Reachability Analysis.
    In Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS 2018), pp. 208-217. 2018.
    (Show abstract) (PDF) (slides; PDF) (code, scripts and data)

2017

  • Gabriele Röger.
    Towards Certified Unsolvability in Classical Planning.
    In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 5141-5145. 2017.
    Early career track.
    (Show abstract) (PDF)

  • Salomé Eriksson, Gabriele Röger and Malte Helmert.
    Unsolvability Certificates for Classical Planning.
    In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017), pp. 88-97. 2017.
    (Show abstract) (PDF) (slides; PDF)

  • Silvan Sievers, Gabriele Röger, Martin Wehrle and Michael Katz.
    Structural Symmetries of the Lifted Representation of Classical Planning Tasks.
    In Proceedings of the ICAPS-2017 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2017), pp. 67-74. 2017.
    Note: This paper is superseded by the ICAPS 2019 paper "Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks".
    Erratum: Definition 7 is wrong because the for a given ASG, the corresponding abstract structure is not uniquely defined. Consider the following example: A = {B, C}, B = (X, Y), C = (X, Z). ASG_A will have nodes a, b, c, x, y, and z, and edges a -> b, a -> c, b -> x -> y, and c -> x -> z. The problem lies in x being re-used as component of b and c: now there are multiple possible abstract structures A' that induce ASG_A, namely all A' = {B, C} where B is any of (X, Y) and (X, Z) and C is any of (X, Z) and (X, Y). This error is fixed in the ICAPS 2019 paper.
    (Show abstract) (PDF) (slides; PDF) (code, scripts and data)

  • Gerald Paul, Gabriele Röger, Thomas Keller and Malte Helmert.
    Optimal Solutions to Large Logistics Planning Domain Problems.
    In Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017), pp. 73-81. 2017.
    (Show abstract) (PDF) (technical report; PDF)

2016

  • Jendrik Seipp, Florian Pommerening, Gabriele Röger and Malte Helmert.
    Correlation Complexity of Classical Planning Domains.
    In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 3242-3250. 2016.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF)

  • Jendrik Seipp, Florian Pommerening, Gabriele Röger and Malte Helmert.
    Correlation Complexity of Classical Planning Domains.
    In Proceedings of the ICAPS-2016 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2016), pp. 12-20. 2016.
    Superseded by the IJCAI 2016 paper by the same name.
    (Show abstract) (PDF) (slides; PDF)

2015

  • Florian Pommerening, Gabriele Röger, Malte Helmert and Blai Bonet.
    Heuristics for Cost-Optimal Classical Planning based on Linear Programming.
    In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 4303-4309. 2015.
    Note: This paper was invited for submission to the Best Papers From Sister Conferences Track, based on a paper that appeared in the International Conference on Automated Planning and Scheduling (ICAPS) 2014. When referring to this work, please cite the ICAPS 2014 paper instead of this version.
    (Show abstract) (PDF)

  • Salomé Simon and Gabriele Röger.
    Finding and Exploiting LTL Trajectory Constraints in Heuristic Search.
    In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015), pp. 113-121. 2015.
    A non-archival version of this paper was also presented at the ICAPS-2015 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP).
    (Show abstract) (PDF) (slides; PDF) (slides HSDIP; PDF)

  • Malte Helmert, Gabriele Röger and Silvan Sievers.
    On the Expressive Power of Non-Linear Merge-and-Shrink Representations.
    In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 106-114. 2015.
    (Show abstract) (PDF)

  • Florian Pommerening, Malte Helmert, Gabriele Röger and Jendrik Seipp.
    From Non-Negative to General Operator Cost Partitioning.
    In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3335-3341. 2015.
    (Show abstract) (PDF) (slides; PDF) (technical report; PDF) (erratum; PDF)

  • Gabriele Röger and Florian Pommerening.
    Linear Programming for Heuristics in Optimal Planning.
    In Proceedings of the AAAI-2015 Workshop on Planning, Search, and Optimization (PlanSOpt), pp. 69-76. 2015.
    (Show abstract) (PDF)

2014

  • Gabriele Röger, Florian Pommerening and Malte Helmert.
    Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context-Splitting.
    In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), pp. 765-770. 2014.
    (Show abstract) (PDF)

  • Gabriele Röger, Florian Pommerening and Jendrik Seipp.
    Fast Downward Stone Soup 2014 (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Deterministic Part, pp. 28-31. 2014.
    (PDF)

  • Florian Pommerening, Gabriele Röger, Malte Helmert and Blai Bonet.
    LP-based Heuristics for Cost-optimal Planning.
    In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 226-234. 2014.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF)

  • Gabriele Röger, Florian Pommerening and Malte Helmert.
    Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context-Splitting.
    In Proceedings of the ICAPS-2014 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP), pp. 80-87. 2014.
    Superseded by the ECAI 2014 paper by the same name.
    (Show abstract) (PDF)

  • Gabriele Röger.
    Planning Techniques and the Action Language Golog.
    Ph.D. Thesis, Albert-Ludwigs-Universität Freiburg, Germany, 2014.
    (PDF)

2013

2012

  • Gabriele Röger and Malte Helmert.
    Non-optimal Multi-Agent Pathfinding is Solved (Since 1984).
    In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), pp. 173-174. 2012.
    A non-archival version of this paper was also presented at the AAAI 2012 Workshop on Multi-Agent Pathfinding (WoMP)..
    (Show abstract) (PDF)

  • Jens Claßen, Gabriele Röger, Gerhard Lakemeyer and Bernhard Nebel.
    PLATAS – Integrating Planning and the Action Language Golog.
    KI – Künstliche Intelligenz 26 (1), pp. 61-67. 2012.
    Authors' preprint. See also the final publication at www.springerlink.com.
    (Show abstract) (PDF)

2011

  • Carmel Domshlak, Malte Helmert, Erez Karpas, Emil Keyder, Silvia Richter, Gabriele Röger, Jendrik Seipp and Matthias Westphal.
    BJOLP: The Big Joint Optimal Landmarks Planner (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 91-95. 2011.
    (Show abstract) (PDF)

  • Malte Helmert, Gabriele Röger, Jendrik Seipp, Erez Karpas, Jörg Hoffmann, Emil Keyder, Raz Nissim, Silvia Richter and Matthias Westphal.
    Fast Downward Stone Soup (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 38-45. 2011.
    (Show abstract) (PDF)

  • Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
    FD-Autotune: Automated Configuration of Fast Downward (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 31-37. 2011.
    (Show abstract) (PDF)

  • Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
    FD-Autotune: Domain-Specific Configuration using Fast Downward (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Planning and Learning Part. 2011.
    (Show abstract) (PDF)

  • Malte Helmert, Gabriele Röger and Erez Karpas.
    Fast Downward Stone Soup: A Baseline for Building Planner Portfolios.
    In Proceedings of the ICAPS-2011 Workshop on Planning and Learning (PAL), pp. 28-35. 2011.
    (Show abstract) (PDF)

  • Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
    FD-Autotune: Domain-Specific Configuration using Fast Downward.
    In Proceedings of the ICAPS-2011 Workshop on Planning and Learning (PAL), pp. 13-20. 2011.
    (Show abstract) (PDF)

2010

  • Malte Helmert and Gabriele Röger.
    Relative-Order Abstractions for the Pancake Problem.
    In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 745-750. 2010.
    (Show abstract) (PDF)

  • Gabriele Röger and Malte Helmert.
    The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning.
    In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 246-249. 2010.
    (Show abstract) (PDF) (technical report; PDF)

2009

  • Patrick Eyerich, Robert Mattmüller and Gabriele Röger.
    Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning.
    In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 130-137. 2009.
    (Show abstract) (PDF) (slides; PDF) (BIB)

  • Gabriele Röger and Malte Helmert.
    Combining Heuristic Estimators for Satisficing Planning.
    In Proceedings of the 2nd Workshop on Heuristics for Domain-independent Planning at ICAPS 2009. 2009.
    (Show abstract) (PDF)

2008

  • Gabriele Röger, Malte Helmert and Bernhard Nebel.
    On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle.
    In Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 544-550. 2008.
    (Show abstract) (PDF)

  • Jens Claßen, Viktor Engelmann, Gerhard Lakemeyer and Gabriele Röger.
    Integrating Golog and Planning: An Empirical Evaluation.
    In Proceedings of the 12th International Workshop on Nonmonotonic Reasoning (NMR 2008), pp. 10-18. 2008.
    (Show abstract) (PDF)

  • Malte Helmert and Gabriele Röger.
    How Good is Almost Perfect?
    In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 944-949. 2008.
    (Show abstract) (PDF) (slides; PDF)

2007

  • Malte Helmert and Gabriele Röger.
    How Good is Almost Perfect?
    In Proceedings of the ICAPS-2007 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges. 2007.
    Superseded by the AAAI 2008 paper by the same name.
    (Show abstract) (PDF)

  • Gabriele Röger and Bernhard Nebel.
    Expressiveness of ADL and Golog: Functions Make a Difference.
    In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 1051-1056. 2007.
    (Show abstract) (PDF) (PS.GZ)

2006

  • Malte Helmert, Robert Mattmüller and Gabriele Röger.
    Approximation Properties of Planning Benchmarks.
    In Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 585-589. 2006.
    (Show abstract) (PDF)

Awards

  • Distinguished Program Committee Member at the 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023).
  • Best Student Paper Runner-Up Award for the paper Cost Partitioning Heuristics for Stochastic Shortest Path Problems (PDF) with Thorsten Klößner, Florian Pommerening and Thomas Keller at the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022).
  • Best System Demonstration for the demo Machetli: Simplifying Input Files for Debugging (PDF) with Lucas Galery Käser, Clemens Büchner, Augusto B. Corrêa and Florian Pommerening at the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022).
  • Third Place, Best System Demonstration for the demo Unified Planning: A Python Library Making Planning Technology Accessible (PDF) with Andrea Micheli, Alexandre Arnold, Arthur Bit-Monnot, Luigi Bonassi, Luca Framba, Alfonso Gerevini, Selvakumar Hastham Sathiya Satchi, Malte Helmert, Félix Ingrand, Luca Iocchi, Uwe Köckemann, Oscar Lima, Fabio Patrizi, Federico Pecora, Guillaume Poveda, Alessandro Saetti, Alessandro Saffiotti, Enrico Scala, Ivan Serina, Sebastian Stock, Florent Teichteil-Koenigsbuch, Alessandro Trapasso and Paolo Traverso and Alessandro Valentini at the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022).
  • SoCS 2020 Best Paper Award for the paper An Atom-Centric Perspective on Stubborn Sets (PDF) with Malte Helmert, Jendrik Seipp and Silvan Sievers at the 13th International Symposium on Combinatorial Search (SoCS 2020).
  • ICAPS 2019 Best Paper Award for the paper Lagrangian Decomposition for Optimal Cost Partitioning (PDF) with Florian Pommerening, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau and Domenico Salvagnin at the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019).
  • Winner, Deterministic Sequential Satisficing Track for the planning system Fast Downward Stone Soup 2018 (PDF) with Jendrik Seipp at the 9th International Planning Competition (IPC 2018) at ICAPS 2018.
  • Winner, Deterministic Sequential Cost-Bounded Track for the planning system Fast Downward Stone Soup 2018 (PDF) with Jendrik Seipp at the 9th International Planning Competition (IPC 2018) at ICAPS 2018.
  • ICAPS 2017 Best Student Paper Award for the paper Unsolvability Certificates for Classical Planning (PDF) with Salomé Eriksson and Malte Helmert at the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017).
  • ICAPS Best Dissertation Award 2016 for the doctoral thesis Planning Techniques and the Action Language Golog (PDF) at the 26th International Conference on Automated Planning and Scheduling (ICAPS 2016).
  • AAAI 2015 Outstanding Paper Award for the paper From Non-Negative to General Operator Cost Partitioning (PDF) with Florian Pommerening, Malte Helmert and Jendrik Seipp at the 29th AAAI Conference on Artificial Intelligence (AAAI 2015).
  • ICAPS 2014 Outstanding Paper Award for the paper LP-based Heuristics for Cost-optimal Planning (PDF) with Florian Pommerening, Malte Helmert and Blai Bonet at the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014).
  • Outstanding PC Member Award at the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2013).
  • Winner, Deterministic Sequential Optimization Track for the planning system Fast Downward Stone Soup-1 (PDF) with Malte Helmert, Jörg Hoffmann, Erez Karpas, Emil Keyder, Raz Nissim, Silvia Richter, Jendrik Seipp and Matthias Westphal at the 7th International Planning Competition (IPC 2011) at ICAPS 2011.
  • Winner, Sequential Satisficing Track for the planning system LAMA 2011 (PDF) with Silvia Richter, Matthias Westphal and Malte Helmert at the 7th International Planning Competition (IPC 2011) at ICAPS 2011.
  • Runner-Up, Learning Track for the planning system Fast Downward Autotune-speed (PDF) with Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas and Jendrik Seipp at the 7th International Planning Competition (IPC 2011) at ICAPS 2011.
  • Runner-up, Deterministic Sequential Satisficing Track for the planning system Fast Downward Stone Soup (PDF) with Malte Helmert, Erez Karpas, Silvia Richter and Jendrik Seipp at the 7th International Planning Competition (IPC 2011) at ICAPS 2011.
  • Temporal Satisficing Runner-Up Award for the planning system Temporal Fast Downward with Patrick Eyerich and Robert Mattmüller at the 6th International Planning Competition (IPC 2008).
  • AAAI 2008 Outstanding Paper Award for the paper How Good is Almost Perfect? (PDF) with Malte Helmert at the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008).
  • Lehrpreis des Landes Baden-Württemberg (state teaching award) for the organization of the Sommercampus event with Amir Alsbih, Niklas Deutschmann, Nico Dietrich, Nikolaus Ehrenfeuchter, Jochen Eisinger, Janis Fehr, Malte Helmert, Bernhard Nebel, Thomas Nunninger, Martin Preen, Anne Repky, Silvia Richter, Sebastian Schulz, Alexander Scivos, Hendrik Tessendorf and Larissa Wißmann.