Hi, I am Pascal.
In 2020 I received my B.Sc. at Saarland University.
I continued my studies at Saarland University and obtained my M.Sc. in 2022.
I am now a PhD student in a Dual PhD arrangement between Saarland University (under Prof. Dr. Jörg Hoffmann)
and Australian National University (under Prof. Dr. Pascal Bercher).
As per ANU regulations, I also have two additional co-supervisors: Assoc. Prof. Dr. Álvaro Torralba and Assoc. Prof. Dr. Daniel Fišer. Álvaro has been a mentor since my B.Sc. thesis, and his support continues to this day. I also had the opportunity to work with Dan as undergrad in Saarland. While co-supervisor roles are often just a formality, I continued to work closely with both Álvaro and Dan, in addition to Jörg and Pascal, and I deeply appreciate the support and guidance from all of them.
I work in the field of Automated Planning, which focuses on developing general problem solvers for decision-making problems.
Here, a user defines a world state and specifies ways (called actions) to modify the state consecutively.
The planner then generates a sequence of actions (a plan) to achieve the goal condition set by the user.
Many successful planners rely on heuristic search.
But most heuristic search approaches use a propositional (grounded) formulation of actions, even though users typically describe problems in a more compact first-order logic (lifted) form.
Converting lifted to grounded can be computationally infeasible.
My PhD research analyzes this issue and explores ways to mitigate it.
I identify use-cases where lifted approaches are provably beneficial and develop heuristics that operate directly on lifted representations.
This overcomes limitations of propositional methods.
Here, the solver makes the best use of the description the user provides.
So, rather than solely optimizing the solver to its limits, an alternative approach is to examine how a problem should be modeled to make solving easier.
I have recently started exploring this perspective as well, as I believe considering both perspectives is crucial to achieving the best performance.
Overall, by focusing on a user provided knowledge representation, my research closely aligns with general problem-solving paradigms from fields like logic or operations research.
Many advancements from these areas directly benefit my work.
I hope that in the future my research will, in turn, contribute to these fields as well.
P. Lauer,
and
D. Fišer,
Potential Heuristics: Weakening Consistency Constraints, Proceedings of the 35th International Conference on Automated Planning and Scheduling (ICAPS'25), 2025.
P. Lauer,
Á. Torralba,
D. Höller,
and
J. Hoffmann,
Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted hAdd, Proceedings of the 35th International Conference on Automated Planning and Scheduling (ICAPS'25), 2025.
P. Lauer,
S. Lin,
and
P. Bercher,
Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence, Proceedings of the 35th International Conference on Automated Planning and Scheduling (ICAPS'25), 2025.
P. Lauer,
Á. Torralba,
D. Höller,
and
J. Hoffmann,
A Lifted Backward Computation of hAdd, Proceedings of the 16th Workshop on Heuristic Search for Domain-Independent Planning (HSDIP'24) at ICAPS'24, 2024.
(Technical Report, HSDIP PDF, Slides)
This paper is the workshop version of Lauer et al. in ICAPS 2025. Please refer to the conference version instead.
P. Lauer,
Á. Torralba,
D. Fišer,
D. Höller,
J. Wichlacz,
and
J. Hoffmann,
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning, Proceedings of the 13th Workshop on Heuristic Search for Domain-Independent Planning (HSDIP'21) at ICAPS'21, 2021.
This paper is the workshop version of Lauer et al. in IJCAI 2021. Please refer to the conference version instead.
P. Lauer,
and
M. Fickert,
Beating LM-cut with LM-cut: Quick Cutting and Practical Tie Breaking for the Precondition Choice Function, Proceedings of the 12th Workshop on Heuristic Search for Domain-Independent Planning (HSDIP'20) at ICAPS'20, 2020.
(Paper, Talk)
The roles listed were all teaching positions in at Saarland University in Germany. In Germany, a teaching assistant is more like an Australian course convener, responsible for creating materials and handling organizational matter, while the professor gives the lectures. A student teaching assistant mainly helps with tutorials. The supervising student teaching assistant role is a rare position between the two mentioned roles and involves helping organize the workload for large tutor groups.
Academic services:
Reviewing:
I was a reviewer for the following journal(s):
Journal of Artificial Intelligence Research (JAIR)
(Journal Website)
Shuran Zhang, Honours Thesis, Title: Let Grounding Do the Heavy Lifting: Lifted Heuristics by Task Compilation,
started February 2025 (ongoing),
Australian National University
Sven Tangermann, MSc. Thesis, Title: Exploiting Symmetries in Lifted Heuristic Search,
started February 2025 (ongoing),
Saarland University
Ninos Oshana, BSc. Thesis, Title: Design, Implementation and Evaluation of Benchmarks in Lifted Planning,
submitted February 2024,
Saarland University
Jonas Krück, BSc. Thesis, Title: A Dynamic Approach to Lifted Successor Generation in Classical Planning,
submitted January 2024,
Saarland University
Other Activities:
2023-2021
: Organizer of
5 Tutor Didactics Seminars
(Prog2 2021, SE Lab 2021, Prog2 2022, Prog2/CySec 2 2023, SE Lab 2023)
2021-2020
: Organizer of
the Programming 2 Preparatory Course
(2020🔒, 2021🔒)
2019
: Founder and Organizer of
the Programming 2 Preparatory Course
(2019🔒)