Dr. Jendrik Seipp

Dr. Jendrik Seipp
I have left the Artificial Intelligence research group. Please see my new homepage.

I received my MSc in computer science from the University of Freiburg, Germany, in December 2012. In March 2018, I completed my PhD under the supervision of Prof. Malte Helmert with the Artificial Intelligence group at the University of Basel, Switzerland. Afterwards, I stayed on as a postdoc until I became assistant professor at Linköping University, Sweden, in January 2021.

Software

Tutorials

Awards

Publications

(Show all abstracts) (Hide all abstracts)

2023

  • Remo Christen, Salomé Eriksson, Michael Katz, Christian Muise, Alice Petrov, Florian Pommerening, Jendrik Seipp, Silvan Sievers and David Speck.
    PARIS: Planning Algorithms for Reconfiguring Independent Sets.
    In Proceedings of the 26th European Conference on Artifical Intelligence (ECAI 2023), pp. 453-460. 2023.
    (PDF) (slides; PDF) (poster; PDF) (code, scripts and data)

  • Augusto B. Corrêa, Guillem Francès, Markus Hecher, Davide Mario Longo and Jendrik Seipp.
    Levitron: Combining Ground and Lifted Planning (planner abstract).
    In Tenth International Planning Competition (IPC 2023), Deterministic Part. 2023.
    (PDF)

  • Augusto B. Corrêa, Guillem Francès, Markus Hecher, Davide Mario Longo and Jendrik Seipp.
    The Powerlifted Planning System in the IPC 2023 (planner abstract).
    In Tenth International Planning Competition (IPC 2023), Deterministic Part. 2023.
    (PDF)

  • Augusto B. Corrêa, Guillem Francès, Markus Hecher, Davide Mario Longo and Jendrik Seipp.
    Scorpion Maidu: Width Search in the Scorpion Planning System (planner abstract).
    In Tenth International Planning Competition (IPC 2023), Deterministic Part. 2023.
    (PDF)

  • Clemens Büchner, Remo Christen, Augusto B. Corrêa, Salomé Eriksson, Patrick Ferber, Jendrik Seipp and Silvan Sievers.
    Fast Downward Stone Soup 2023 (planner abstract).
    In Tenth International Planning Competition (IPC 2023), Deterministic Part. 2023.
    (PDF) (code, scripts and data)

  • Remo Christen, Salomé Eriksson, Michael Katz, Christian Muise, Alice Petrov, Florian Pommerening, Jendrik Seipp, Silvan Sievers and David Speck.
    PARIS: Planning Algorithms for Reconfiguring Independent Sets.
    In Proceedings of the ICAPS 2023 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2023). 2023.
    Note: This paper is superseded by the ECAI 2023 paper by the same name.
    (Show abstract) (PDF) (slides; PDF)

2022

  • Patrick Ferber, Liat Cohen, Jendrik Seipp and Thomas Keller.
    Learning and Exploiting Progress States in Greedy Best-First Search.
    In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), pp. 4740-4746. 2022.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF) (code and data)

  • Remo Christen, Salomé Eriksson, Michael Katz, Emil Keyder, Christian Muise, Alice Petrov, Florian Pommerening, Jendrik Seipp, Silvan Sievers and David Speck.
    (PARIS) Planning Algorithms for Reconfiguring Independent Sets.
    In First Combinatorial Reconfiguration Challenge (CoRe Challenge 2022), pp. 15-22. 2022.
    (PDF)

  • Christian Muise, Florian Pommerening, Jendrik Seipp and Michael Katz.
    Planutils: Bringing Planning to the Masses.
    In System Demonstrations at the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022). 2022.
    (Show abstract) (PDF) (poster; PDF) (video)

  • Clemens Büchner, Patrick Ferber, Jendrik Seipp and Malte Helmert.
    A Comparison of Abstraction Heuristics for Rubik's Cube.
    In Proceedings of the ICAPS 2022 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2022). 2022.
    (Show abstract) (PDF) (slides; PDF) (recording; MP4) (code)

  • Augusto B. Corrêa and Jendrik Seipp.
    Best-First Width Search for Lifted Classical Planning.
    In Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022). 2022.
    (Show abstract) (PDF) (poster; PDF) (slides; PDF) (code, scripts, and data)

  • André Biedenkapp, David Speck, Silvan Sievers, Frank Hutter, Marius Lindauer and Jendrik Seipp.
    Learning Domain-Independent Policies for Open List Selection.
    In Proceedings of the ICAPS 2022 Workshop on Bridging the Gap Between AI Planning and Reinforcement Learning (PRL 2022). 2022.
    (Show abstract) (PDF) (slides; PDF) (talk)

  • Patrick Ferber and Jendrik Seipp.
    Explainable Planner Selection for Classical Planning.
    In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), pp. 9741-9749. 2022.
    (Show abstract) (PDF) (slides (long); PDF) (slides (short); PDF) (poster; PDF) (code)

2021

  • Dominik Drexler, Jendrik Seipp and David Speck.
    Subset-Saturated Transition Cost Partitioning.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 131-139. 2021.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF) (code)

  • Jendrik Seipp.
    Online Saturated Cost Partitioning for Classical Planning.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 317-321. 2021.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF) (code)

  • Álvaro Torralba, Jendrik Seipp and Silvan Sievers.
    Automatic Instance Generation for Classical Planning.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 376-384. 2021.
    (Show abstract) (PDF) (slides; PDF) (talk) (poster; PDF) (code)

  • Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers and Malte Helmert.
    Dantzig-Wolfe Decomposition for Cost Partitioning.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 271-280. 2021.
    (Show abstract) (PDF) (technical report; PDF) (slides; PDF) (recording) (poster; PDF) (code)

  • Jendrik Seipp, Thomas Keller and Malte Helmert.
    Saturated Post-hoc Optimization for Classical Planning.
    In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), pp. 11947-11953. 2021.
    (Show abstract) (PDF) (slides; PDF) (recording; MP4) (poster; PDF) (code)

2020

  • Jendrik Seipp, Samuel von Allmen and Malte Helmert.
    Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement.
    In Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020), pp. 244-248. 2020.
    (Show abstract) (PDF) (slides; PDF) (recording) (poster; PDF) (code)

  • Patrick Ferber and Jendrik Seipp.
    Explainable Planner Selection.
    In Proceedings of the ICAPS 2020 Workshop on Explainable AI Planning (XAIP 2020). 2020.
    (Show abstract) (PDF) (slides; PDF) (recording; MP4) (poster; PDF) (code and data)

  • Jendrik Seipp.
    Online Saturated Cost Partitioning for Classical Planning.
    In Proceedings of the ICAPS 2020 Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2020), pp. 16-22. 2020.
    Superseded by the ICAPS 2021 paper by the same name.
    (Show abstract) (PDF) (slides; PDF) (recording) (code)

  • Álvaro Torralba, Jendrik Seipp and Silvan Sievers.
    Automatic Configuration of Benchmark Sets for Classical Planning.
    In Proceedings of the ICAPS 2020 Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2020), pp. 58-66. 2020.
    Superseded by the ICAPS 2021 paper "Automatic Instance Generation for Classical Planning".
    (Show abstract) (PDF) (slides; PDF) (recording)

  • 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)

  • Jendrik Seipp, Thomas Keller and Malte Helmert.
    Saturated Cost Partitioning for Optimal Classical Planning.
    Journal of Artificial Intelligence Research 67, pp. 129-167. 2020.
    (Show abstract) (PDF) (code)

2019

  • Jendrik Seipp.
    Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning.
    In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), pp. 5621-5627. 2019.
    (Show abstract) (PDF) (slides; PDF) (code)

  • Jendrik Seipp and Malte Helmert.
    Subset-Saturated Cost Partitioning for Optimal Classical Planning.
    In Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), pp. 391-400. 2019.
    (Show abstract) (PDF) (technical report; PDF) (slides; PDF) (code)

  • Jendrik Seipp.
    Planner Metrics Should Satisfy Independence of Irrelevant Alternatives (position paper).
    In Proceedings of the ICAPS-2019 Workshop on the International Planning Competition (WIPC 2019), pp. 40-41. 2019.
    (Show abstract) (PDF) (slides; PDF)

  • Jendrik Seipp.
    Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning.
    In Proceedings of the ICAPS-2019 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2019), pp. 72-80. 2019.
    Superseded by the IJCAI 2019 paper by the same name.
    (Show abstract) (PDF) (slides; PDF)

  • Jendrik Seipp.
    Kronk (planner abstract).
    In Sparkle Planning Challenge 2019. 2019.
    (PDF)

2018

  • Jendrik Seipp and Malte Helmert.
    Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning.
    Journal of Artificial Intelligence Research 62, pp. 535-577. 2018.
    (Show abstract) (PDF)

  • Jendrik Seipp.
    Fast Downward Remix (planner abstract).
    In Ninth International Planning Competition (IPC 2018), Deterministic Part, pp. 74-76. 2018.
    (PDF)

  • Jendrik Seipp.
    Scorpion (planner abstract).
    In Ninth International Planning Competition (IPC 2018), Deterministic Part, pp. 77-79. 2018.
    (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)

  • Jendrik Seipp.
    Counterexample-guided Cartesian Abstraction Refinement and Saturated Cost Partitioning for Optimal Classical Planning.
    Ph.D. Thesis, University of Basel, Switzerland, 2018.
    Date of disputation: 2018-02-28.
    (Show abstract) (PDF) (slides; PDF) (ICAPS 2020 Best Dissertation Award Talk)

2017

  • Jendrik Seipp, Thomas Keller and Malte Helmert.
    A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.
    In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017), pp. 259-268. 2017.
    (Show abstract) (PDF) (slides; PDF) (recording) (poster; PDF)

  • Jendrik Seipp.
    Better Orders for Saturated Cost Partitioning in Optimal Classical Planning.
    In Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017), pp. 149-153. 2017.
    (Show abstract) (PDF) (slides; PDF)

  • Jendrik Seipp, Thomas Keller and Malte Helmert.
    Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.
    In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 3651-3657. 2017.
    (Show abstract) (PDF) (slides; PDF)

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 Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 3161-3169. 2016.
    (Show abstract) (PDF) (technical report; PDF)

  • 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, Silvan Sievers, Martin Wehrle, Chris Fawcett and Yusra Alkhazraji.
    Fast Downward Aidos (planner abstract).
    In First Unsolvability International Planning Competition (UIPC 2016). 2016.
    (PDF) (Code)

  • Florian Pommerening and Jendrik Seipp.
    Fast Downward Dead-End Pattern Database (planner abstract).
    In First Unsolvability International Planning Competition (UIPC 2016). 2016.
    (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

  • Jendrik Seipp, Florian Pommerening and Malte Helmert.
    New Optimization Functions for Potential Heuristics.
    In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 193-201. 2015.
    (Show abstract) (PDF) (slides; PDF) (recording)

  • Jendrik Seipp, Silvan Sievers, Malte Helmert and Frank Hutter.
    Automatic Configuration of Sequential Planning Portfolios.
    In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3364-3370. 2015.
    (Show abstract) (PDF) (technical report with portfolios; PDF) (slides; PDF) (code and data) (additional data)

  • 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)

2014

  • Jendrik Seipp, Silvan Sievers and Frank Hutter.
    Fast Downward Cedalion (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Planning and Learning Part. 2014.
    (PDF) (code and data)

  • Jendrik Seipp, Silvan Sievers and Frank Hutter.
    Fast Downward SMAC (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Planning and Learning Part. 2014.
    (PDF) (code and data)

  • 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)

  • Jendrik Seipp, Silvan Sievers and Frank Hutter.
    Fast Downward Cedalion (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Deterministic Part, pp. 17-27. 2014.
    (PDF) (code and data)

  • Jendrik Seipp, Manuel Braun and Johannes Garimort.
    Fast Downward Uniform Portfolio (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Deterministic Part, p. 32. 2014.
    (PDF)

  • Jendrik Seipp and Malte Helmert.
    Diverse and Additive Cartesian Abstraction Heuristics.
    In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 289-297. 2014.
    (Show abstract) (PDF) (slides; PDF) (recording)

2013

  • Jendrik Seipp, Silvan Sievers and Frank Hutter.
    Automatic Configuration of Sequential Planning Portfolios.
    Technical Report CS-2013-005, Department of Mathematics and Computer Science, University of Basel, 2013.
    Superseded by the AAAI 2015 paper by the same name.
    (Show abstract) (PDF)

  • Jendrik Seipp and Malte Helmert.
    Additive Counterexample-guided Cartesian Abstraction Refinement.
    In Late-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2013), pp. 119-121. 2013.
    (Show abstract) (PDF)

  • Jendrik Seipp and Malte Helmert.
    Counterexample-guided Cartesian Abstraction Refinement.
    In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 347-351. 2013.
    (Show abstract) (PDF) (slides; PDF) (recording)

2012

  • Jendrik Seipp.
    Counterexample-guided Abstraction Refinement for Classical Planning.
    Master's thesis, Albert-Ludwigs-Universität Freiburg, 2012.
    (Show abstract) (PDF)

  • Jendrik Seipp, Manuel Braun, Johannes Garimort and Malte Helmert.
    Learning Portfolios of Automatically Tuned Planners.
    In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 368-372. 2012.
    Erratum: This version of the paper fixes a small mistake in the published version. In Section "Tuning Planners", the published version states that preferred operators are used in 20 of the 21 configurations. The correct statement is that they are used in 19 of the 21 configurations.
    (Show abstract) (PDF) (technical report; PDF) (slides; PDF) (code and data)

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)

  • 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)

  • Jendrik Seipp and Malte Helmert.
    Fluent Merging for Classical Planning Problems.
    In Proceedings of the ICAPS-2011 Workshop on Knowledge Engineering for Planning and Scheduling (KEPS), pp. 47-53. 2011.
    Note: This version of the paper fixes two mistakes (in Def. 2 and in the text after Def. 3) that are present in the version of the paper that is linked from the workshop webpage.
    (Show abstract) (PDF) (slides; PDF) (code and data)

2009

  • Jendrik Seipp.
    Fluent Merging für klassische Planungsprobleme.
    Bachelor's thesis, Albert-Ludwigs-Universität Freiburg, 2009.
    In German.
    (Show abstract) (PDF)