Jendrik Seipp

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 Professor 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.

Education and Academic Degrees

• Docent in Computer Science, Linköping University, Sweden. September 2022.
• Ph.D. degree from University of Basel, Switzerland. February 2018.
• M.Sc. in Computer Science from University of Freiburg, Germany. December 2012.
• B.Sc. in computer science from University of Freiburg, Germany. September 2009.

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

Awards

• 4x First Place, 3x Second Place, 1x Third Place (in nine tracks) at the First CoRe Challenge at the ICALP 2022 Workshop on Combinatorial Reconfiguration, Paris, for the system PARIS: Planning Algorithms for Reconfiguring Independent Sets 
• Second Place, System Demonstrations Track at the 32th International Conference on Automated Planning and Scheduling (ICAPS 2022) at the 32th International Conference on Automated Planning and Scheduling (ICAPS 2022) for the system Planutils: Bringing Planning to the Masses
• IJCAI 2021 Distinguished Paper Award at the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) for the paper Learning Generalized Unsolvability Heuristics for Classical Planning
• ICAPS 2020 Best Dissertation Award at the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020) for the doctoral thesis Counterexample-guided Cartesian Abstraction Refinement and Saturated Cost Partitioning for Optimal Classical Planning
• SoCS 2020 Best Paper Award at the 13th International Symposium on Combinatorial Search (SoCS 2020) for the paper An Atom-Centric Perspective on Stubborn Sets
• Winner, Deterministic Sequential Satisficing Track at the 9th International Planning Competition (IPC 2018) at ICAPS 2018 for the planning system Fast Downward Stone Soup 2018  
• Winner, Deterministic Sequential Cost-Bounded Track at the 9th International Planning Competition (IPC 2018) at ICAPS 2018 for the planning system Fast Downward Stone Soup 2018 

• SoCS 2017 Best Student Paper Award at the 10th Annual Symposium on Combinatorial Search (SoCS 2017) for the paper Better Orders for Saturated Cost Partitioning in Optimal Classical Planning 
• Winner, Unsolvability IPC 2016 at the 1st Unsolvability International Planning Competition (UIPC 2016) at ICAPS 2016 for the planning system Fast Downward Aidos
• AAAI 2015 Outstanding Paper Award at the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) for the paper From Non-Negative to General Operator Cost Partitioning 
• Runner-Up and "Best Learner" Award, Learning Track at the 8th International Planning Competition (IPC 2014) at ICAPS 2014 for the planning system Fast Downward Cedalion 
• Third Place and "Best Basic Solver" Award, Learning Track at the 8th International Planning Competition (IPC 2014) at ICAPS 2014 for the planning system Fast Downward SMAC 
• Winner, Deterministic Sequential Optimization Track at the 7th International Planning Competition (IPC 2011) at ICAPS 2011 for the planning system Fast Downward Stone Soup-1 
• Runner-Up, Deterministic Sequential Satisficing Track at the 7th International Planning Competition (IPC 2011) at ICAPS 2011 for the planning system Fast Downward Stone Soup 
• Runner-Up, Learning Track at the 7th International Planning Competition (IPC 2011) at ICAPS 2011 for the planning system Fast Downward Autotune-speed