Welcome!

I am assistant professor in Artificial Intelligence at Linköping University, Sweden. Together with Hector Geffner and Ulf Nilsson, I lead the "Representation, Learning and Planning" lab in the AIICS division. My main research interests are automated planning and its connections to machine learning.

Short bio

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.

For more information, please see my academic CV.

Software

• Planning system: Fast Downward
• Optimal classical planner: Scorpion
• Experiment framework: Downward Lab

Tutorials

• ICAPS 2020 tutorial "Evaluating Planners with Downward Lab"
• ICAPS 2015 tutorial "Latest Trends in Abstraction Heuristics for Classical Planning" (with Malte Helmert and Silvan Sievers)

Awards for Academic Publications

• ICAPS 2020 Best Dissertation Award for the doctoral thesis Counterexample-guided Cartesian Abstraction Refinement and Saturated Cost Partitioning for Optimal Classical Planning (PDF) at the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020).
• SoCS 2020 Best Paper Award for the paper An Atom-Centric Perspective on Stubborn Sets (PDF) with Gabriele Röger, Malte Helmert and Silvan Sievers at the 13th International Symposium on Combinatorial Search (SoCS 2020).
• SoCS 2017 Best Student Paper Award for the paper Better Orders for Saturated Cost Partitioning in Optimal Classical Planning (PDF) at the 10th Annual Symposium on Combinatorial Search (SoCS 2017).
• AAAI 2015 Outstanding Paper Award for the paper From Non-Negative to General Operator Cost Partitioning (PDF) with Florian Pommerening, Malte Helmert and Gabriele Röger at the 29th AAAI Conference on Artificial Intelligence (AAAI 2015).

Awards for Planning Systems

• Winner, Deterministic Sequential Satisficing Track for the planning system Fast Downward Stone Soup 2018 (PDF) with Gabriele Röger 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 Gabriele Röger at the 9th International Planning Competition (IPC 2018) at ICAPS 2018.
• Winner, Unsolvability IPC 2016 for the planning system Fast Downward Aidos (PDF) with Florian Pommerening, Silvan Sievers, Martin Wehrle, Chris Fawcett and Yusra Alkhazraji at the 1st Unsolvability International Planning Competition (UIPC 2016) at ICAPS 2016.
• Runner-Up and "Best Learner" Award, IPC 2014 Learning Track for the planning system Fast Downward Cedalion (PDF) with Silvan Sievers and Frank Hutter at the 8th International Planning Competition (IPC 2014) at ICAPS 2014.
• Third Place and "Best Basic Solver" Award, IPC 2014 Learning Track for the planning system Fast Downward SMAC (PDF) with Silvan Sievers and Frank Hutter at the 8th International Planning Competition (IPC 2014) at ICAPS 2014.
• 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, Gabriele Röger and Matthias Westphal 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 Gabriele Röger 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 Gabriele Röger at the 7th International Planning Competition (IPC 2011) at ICAPS 2011.

Publications

2021

• Simon Ståhlberg, Guillem Francès and Jendrik Seipp.
  Learning Generalized Unsolvability Heuristics for Classical Planning.
  In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2020). 2021.
  paper citation

• Dominik Drexler, Jendrik Seipp and David Speck.
  Subset-Saturated Transition Cost Partitioning.
  In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
  paper citation

• Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers and Malte Helmert.
  Dantzig-Wolfe Decomposition for Cost Partitioning.
  In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
  paper citation

• Jendrik Seipp.
  Online Saturated Cost Partitioning for Classical Planning.
  In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
  paper citation

• Álvaro Torralba, Jendrik Seipp and Silvan Sievers.
  Automatic Instance Generation for Classical Planning.
  In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
  paper citation

• Jendrik Seipp, Thomas Keller and Malte Helmert.
  Saturated Post-hoc Optimization for Classical Planning.
  In Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021). 2021.
  paper slides recording poster citation

2020

• Jendrik Seipp, Thomas Keller and Malte Helmert.
  Saturated Cost Partitioning for Optimal Classical Planning.
  Journal of Artificial Intelligence Research 67, pp. 129-167. 2020.
  paper citation

• 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.
  paper slides recording citation

• Jendrik Seipp, Samuel Allmen and Malte Helmert.
  Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement.
  In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (ICAPS 2020), pp. 244-248. 2020.
  paper slides recording poster citation

• Jendrik Seipp.
  Online Saturated Cost Partitioning for Classical Planning.
  In ICAPS 2020 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP), pp. 16-22. 2020.
  paper slides recording citation

• Álvaro Torralba, Jendrik Seipp and Silvan Sievers.
  Automatic Configuration of Benchmark Sets for Classical Planning.
  In ICAPS 2020 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP), pp. 58-66. 2020.
  paper slides recording citation

• Patrick Ferber and Jendrik Seipp.
  Explainable Planner Selection.
  In ICAPS 2020 Workshop on Explainable AI Planning (XAIP). 2020.
  paper slides recording poster citation

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.
  paper slides citation

• Jendrik Seipp and Malte Helmert.
  Subset-Saturated Cost Partitioning for Optimal Classical Planning.
  In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019), pp. 391-400. 2019.
  paper technical report slides citation

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

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

2018

• Jendrik Seipp.
  Fast Downward Remix.
  In Ninth International Planning Competition (IPC-9): planner abstracts, pp. 74-76. 2018.
  paper citation

• Jendrik Seipp.
  Fast Downward Scorpion.
  In Ninth International Planning Competition (IPC-9): planner abstracts, pp. 77-79. 2018.
  paper citation

• Jendrik Seipp and Gabriele Röger.
  Fast Downward Stone Soup 2018.
  In Ninth International Planning Competition (IPC-9): planner abstracts, pp. 80-82. 2018.
  paper citation

• Jendrik Seipp and Malte Helmert.
  Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning.
  Journal of Artificial Intelligence Research 62, pp. 535-577. 2018.
  paper citation

• Jendrik Seipp.
  Counterexample-guided Cartesian Abstraction Refinement and Saturated Cost Partitioning for Optimal Classical Planning.
  PhD thesis, University of Basel, 2018.
  paper slides ICAPS 2020 best dissertation award talk citation

2017

• Jendrik Seipp, Thomas Keller and Malte Helmert.
  A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.
  In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), pp. 259-268. 2017.
  paper slides recording poster citation

• 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.
  paper slides citation

• Jendrik Seipp, Thomas Keller and Malte Helmert.
  Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.
  In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 3651-3657. 2017.
  paper slides citation

2016

• Jendrik Seipp, Florian Pommerening, Silvan Sievers, Martin Wehrle, Chris Fawcett and Yusra Alkhazraji.
  Fast Downward Aidos.
  In Unsolvability International Planning Competition: planner abstracts, pp. 28-38. 2016.
  paper citation

• Florian Pommerening and Jendrik Seipp.
  Fast Downward Dead-End Pattern Database.
  In Unsolvability International Planning Competition: planner abstracts, pp. 2. 2016.
  paper citation

• 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.
  paper technical report citation

• 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.
  paper slides poster citation

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

2015

• Jendrik Seipp, Florian Pommerening and Malte Helmert.
  New Optimization Functions for Potential Heuristics.
  In Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 193-201. 2015.
  paper slides recording citation

• Jendrik Seipp, Silvan Sievers, Malte Helmert and Frank Hutter.
  Automatic Configuration of Sequential Planning Portfolios.
  In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3364-3370. 2015.
  paper technical report slides code and data citation

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

2014

• Jendrik Seipp, Silvan Sievers and Frank Hutter.
  Fast Downward Cedalion.
  In Eighth International Planning Competition (IPC-8) Planning and Learning Part: planner abstracts. 2014.
  paper citation

• Jendrik Seipp, Silvan Sievers and Frank Hutter.
  Fast Downward SMAC.
  In Eighth International Planning Competition (IPC-8) Planning and Learning Part: planner abstracts. 2014.
  paper citation

• Gabriele Röger, Florian Pommerening and Jendrik Seipp.
  Fast Downward Stone Soup 2014.
  In Eighth International Planning Competition (IPC-8): planner abstracts, pp. 28-31. 2014.
  paper citation

• Jendrik Seipp, Silvan Sievers and Frank Hutter.
  Fast Downward Cedalion.
  In Eighth International Planning Competition (IPC-8): planner abstracts, pp. 17-27. 2014.
  paper citation

• Jendrik Seipp, Manuel Braun and Johannes Garimort.
  Fast Downward Uniform Portfolio.
  In Eighth International Planning Competition (IPC-8): planner abstracts, pp. 32. 2014.
  paper citation

• Jendrik Seipp and Malte Helmert.
  Diverse and Additive Cartesian Abstraction Heuristics.
  In Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 289-297. 2014.
  paper slides recording citation

2013

• Jendrik Seipp and Malte Helmert.
  Counterexample-guided Cartesian Abstraction Refinement.
  In Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 347-351. 2013.
  paper slides recording citation

• 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) – AAAI Technical Report WS-13-17, pp. 119-121. 2013.
  paper citation

2012

• Jendrik Seipp, Manuel Braun, Johannes Garimort and Malte Helmert.
  Learning Portfolios of Automatically Tuned Planners.
  In Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 368-372. 2012.
  paper technical report slides code and data citation (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.)

• Jendrik Seipp.
  Counterexample-guided Abstraction Refinement for Classical Planning.
  Master's thesis, University of Freiburg, 2012.
  paper citation

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.
  In IPC 2011 planner abstracts, pp. 91-95. 2011.
  paper citation

• 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.
  In IPC 2011 planner abstracts, pp. 38-45. 2011.
  paper citation

• Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
  FD-Autotune: Automated Configuration of Fast Downward.
  In IPC 2011 planner abstracts, pp. 31-37. 2011.
  paper citation

• Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
  FD-Autotune: Domain-Specific Configuration of Fast Downward.
  In IPC 2011 planner abstracts, Planning and Learning Part. 2011.
  paper citation

• Jendrik Seipp and Malte Helmert.
  Fluent Merging for Classical Planning Problems.
  In ICAPS 2011 Workshop on Knowledge Engineering for Planning and Scheduling, pp. 47-53. 2011.
  paper slides code and data citation (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.)

• Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
  FD-Autotune: Domain-Specific Configuration using Fast Downward.
  In ICAPS 2011 Workshop on Planning and Learning, pp. 13-17. 2011.
  paper citation

2009

• Jendrik Seipp.
  Fluent Merging für klassische Planungsprobleme.
  Bachelor's thesis, University of Freiburg, 2009.
  paper citation (In German.)