← Search

Jendrik Seipp

7 accepted papers

2025

Classical Planning with LLM-Generated Heuristics: Challenging the State of the Art with Python Code

NeurIPS 2025poster

In recent years, large language models (LLMs) have shown remarkable performance in many problems. However, they fail to plan reliably. Specialized attempts to improve their planning capabilities still produce incorrect plans and fail to generalize to larger tasks. Furthermore, LLMs designed for expl…

Cited by 0SourceScholar
2022

Learning and Exploiting Progress States in Greedy Best-First Search

IJCAI 2022poster

Previous work introduced the concept of progress states. After expanding a progress state, a greedy best-first search (GBFS) will only expand states with lower heuristic values. Current methods can identify progress states only for a single task and only after a solution for the task has been f…

Cited by 6SourcePDFScholar
2021

Learning Generalized Unsolvability Heuristics for Classical Planning

IJCAI 2021poster

Recent work in classical planning has introduced dedicated techniques for detecting unsolvable states, i.e., states from which no goal state can be reached. We approach the problem from a generalized planning perspective and learn first-order-like formulas that characterize unsolvability for entire…

Cited by 24SourcePDFScholar