
Jendrik Seipp
Assistant Professor
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
- IJCAI 2021 Distinguished Paper Award for the paper Learning Generalized Unsolvability Heuristics for Classical Planning (PDF) with Simon Ståhlberg and Guillem Francès at the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021).
- 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
2022
Best-First Width Search for Lifted Classical Planning.
In Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022). 2022.
paper citation
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width.
In Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022). 2022.
paper citation
New Refinement Strategies for Cartesian Abstractions.
In Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022). 2022.
paper citation
Explainable Planner Selection for Classical Planning.
In Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2022). 2022.
paper citation
2021
Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches.
In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), pp. 258-268. 2021.
paper citation
Learning Generalized Unsolvability Heuristics for Classical Planning.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), pp. 4175-4181. 2021.
paper slides poster code citation
Subset-Saturated Transition Cost Partitioning.
In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 131-139. 2021.
paper slides poster code citation
Dantzig-Wolfe Decomposition for Cost Partitioning.
In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
paper slides poster code citation
Online Saturated Cost Partitioning for Classical Planning.
In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
paper slides poster code citation
Automatic Instance Generation for Classical Planning.
In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 376-384. 2021.
paper slides poster code citation
Saturated Post-hoc Optimization for Classical Planning.
In Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021), pp. 11947-11953. 2021.
paper slides recording poster code citation
2020
Saturated Cost Partitioning for Optimal Classical Planning.
Journal of Artificial Intelligence Research 67, pp. 129-167. 2020.
paper code citation
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
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 code citation
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 code citation
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
Explainable Planner Selection.
In ICAPS 2020 Workshop on Explainable AI Planning (XAIP). 2020.
paper slides recording poster citation
2019
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 code citation
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 code citation
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.)
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
Fast Downward Remix.
In Ninth International Planning Competition (IPC-9): Planner Abstracts, pp. 74-76. 2018.
paper citation
Fast Downward Scorpion.
In Ninth International Planning Competition (IPC-9): Planner Abstracts, pp. 77-79. 2018.
paper citation
Fast Downward Stone Soup 2018.
In Ninth International Planning Competition (IPC-9): Planner Abstracts, pp. 80-82. 2018.
paper citation
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning.
Journal of Artificial Intelligence Research 62, pp. 535-577. 2018.
paper citation
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
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
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
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
Fast Downward Aidos.
In Unsolvability International Planning Competition: Planner Abstracts, pp. 28-38. 2016.
paper citation
Fast Downward Dead-End Pattern Database.
In Unsolvability International Planning Competition: Planner Abstracts, pp. 2. 2016.
paper citation
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
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
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
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
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
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
Fast Downward Cedalion.
In Eighth International Planning Competition (IPC-8) Planning and Learning Part: Planner Abstracts. 2014.
paper citation
Fast Downward SMAC.
In Eighth International Planning Competition (IPC-8) Planning and Learning Part: Planner Abstracts. 2014.
paper citation
Fast Downward Stone Soup 2014.
In Eighth International Planning Competition (IPC-8): Planner Abstracts, pp. 28-31. 2014.
paper citation
Fast Downward Cedalion.
In Eighth International Planning Competition (IPC-8): Planner Abstracts, pp. 17-27. 2014.
paper citation
Fast Downward Uniform Portfolio.
In Eighth International Planning Competition (IPC-8): Planner Abstracts, pp. 32. 2014.
paper citation
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
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
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
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.)
Counterexample-guided Abstraction Refinement for Classical Planning.
Master's thesis, University of Freiburg, 2012.
paper citation
2011
BJOLP: The Big Joint Optimal Landmarks Planner.
In IPC 2011 Planner Abstracts, pp. 91-95. 2011.
paper citation
Fast Downward Stone Soup.
In IPC 2011 Planner Abstracts, pp. 38-45. 2011.
paper citation
FD-Autotune: Automated Configuration of Fast Downward.
In IPC 2011 Planner Abstracts, pp. 31-37. 2011.
paper citation
FD-Autotune: Domain-Specific Configuration of Fast Downward.
In IPC 2011 Planner Abstracts, Planning and Learning Part. 2011.
paper citation
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.)
FD-Autotune: Domain-Specific Configuration using Fast Downward.
In ICAPS 2011 Workshop on Planning and Learning, pp. 13-17. 2011.
paper citation