Jendrik Seipp

According to our database, Jendrik Seipp authored at least 38 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Eliminating Redundant Actions from Plans Using Classical Planning.

Mauricio Salerno, Raquel Fuentetaja, Jendrik Seipp

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Learning Hierarchical Policies by Iteratively Reducing the Width of Sketch Rules.

Dominik Drexler, Jendrik Seipp, Hector Geffner

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Cartesian Abstractions and Saturated Cost Partitioning in Probabilistic Planning.

Thorsten Klößner, Jendrik Seipp, Marcel Steinmetz

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Sensitivity Analysis for Saturated Post-Hoc Optimization in Classical Planning.

Paul Höft, David Speck, Jendrik Seipp

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

PARIS: Planning Algorithms for Reconfiguring Independent Sets.

Remo Christen, Salomé Eriksson, Michael Katz, Christian Muise, Alice Petrov, Florian Pommerening, Jendrik Seipp, Silvan Sievers, David Speck

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Finding Matrix Multiplication Algorithms with Classical Planning.

David Speck, Paul Höft, Daniel Gnad, Jendrik Seipp

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width: Extended Version.

Dominik Drexler, Jendrik Seipp, Hector Geffner

CoRR, 2022

Learning and Exploiting Progress States in Greedy Best-First Search.

Patrick Ferber, Liat Cohen, Jendrik Seipp, Thomas Keller

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width.

Dominik Drexler, Jendrik Seipp, Hector Geffner

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Best-First Width Search for Lifted Classical Planning.

Augusto B. Corrêa, Jendrik Seipp

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

New Refinement Strategies for Cartesian Abstractions.

David Speck, Jendrik Seipp

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Explainable Planner Selection for Classical Planning.

Patrick Ferber, Jendrik Seipp

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches: Extended Version.

Dominik Drexler, Jendrik Seipp, Hector Geffner

CoRR, 2021

Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches.

Dominik Drexler, Jendrik Seipp, Hector Geffner

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Learning Generalized Unsolvability Heuristics for Classical Planning.

Simon Ståhlberg, Guillem Francès, Jendrik Seipp

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Automatic Instance Generation for Classical Planning.

Álvaro Torralba, Jendrik Seipp, Silvan Sievers

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Online Saturated Cost Partitioning for Classical Planning.

Jendrik Seipp

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Dantzig-Wolfe Decomposition for Cost Partitioning.

Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Subset-Saturated Transition Cost Partitioning.

Dominik Drexler, Jendrik Seipp, David Speck

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Saturated Post-hoc Optimization for Classical Planning.

Jendrik Seipp, Thomas Keller, Malte Helmert

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Saturated Cost Partitioning for Optimal Classical Planning.

Jendrik Seipp, Thomas Keller, Malte Helmert

J. Artif. Intell. Res., 2020

An Atom-Centric Perspective on Stubborn Sets.

Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement.

Jendrik Seipp, Samuel von Allmen, Malte Helmert

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019

Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning.

Jendrik Seipp

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Subset-Saturated Cost Partitioning for Optimal Classical Planning.

Jendrik Seipp, Malte Helmert

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018

Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning.

Jendrik Seipp, Malte Helmert

J. Artif. Intell. Res., 2018

2017

Better Orders for Saturated Cost Partitioning in Optimal Classical Planning.

Jendrik Seipp

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.

Jendrik Seipp, Thomas Keller, Malte Helmert

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.

Jendrik Seipp, Thomas Keller, Malte Helmert

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Correlation Complexity of Classical Planning Domains.

Jendrik Seipp, Florian Pommerening, Gabriele Röger, Malte Helmert

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning.

Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer, Robert Mattmüller

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

New Optimization Functions for Potential Heuristics.

Jendrik Seipp, Florian Pommerening, Malte Helmert

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Automatic Configuration of Sequential Planning Portfolios.

Jendrik Seipp, Silvan Sievers, Malte Helmert, Frank Hutter

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

From Non-Negative to General Operator Cost Partitioning.

Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Diverse and Additive Cartesian Abstraction Heuristics.

Jendrik Seipp, Malte Helmert

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013

Counterexample-Guided Cartesian Abstraction Refinement.

Jendrik Seipp, Malte Helmert

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Additive Counterexample-Guided Cartesian Abstraction Refinement.

Jendrik Seipp, Malte Helmert

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

Learning Portfolios of Automatically Tuned Planners.

Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012