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 (at the chair of Prof. Dr. Jörg Hoffmann)
and Australian National University (supervised and supported through a scholarship by Dr. Pascal Bercher).
While there is no institutional affiliation, I am grateful for the additional supervision by Assoc. Prof. Dr. Γlvaro Torralba at Aalborg University, which started during my BSc thesis and persists to this day.
I work in the field of Planning, i.e. symbolic sequential decision making, with a primary emphasis on heuristic search.
I am intrigued by the underlying algorithmic challenges in the field.
I find the challenge of computing a fast, yet informative, heuristic particularly exciting.
My PhD thesis is centered in a sub-discipline known as Lifted Planning.
In this research, I explore a shift from the commonly used propositional (grounded) formulation found in most successful planning approaches
to the first-order logic (lifted) formulation typically used to describe planning tasks in practice.
This shift introduces unique challenges and allows to overcome obstacles that propositional approaches are not able to.
The transformation trade-off from first-order to propositional formulations precisely captures the
trade-off between speed and informativeness at the knowledge representation level.
For now I concentrate on classical planning and hierarchical planning formalisms, although I believe that the main ideas generalize to a broader context.
P. Lauer,
A. 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.
(Essentially the samer paper as IJCAI 2021. - Refer to the conference version for additional info.)
P. Lauer,
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.
(PDF, BibTex, Talk)
I was an organizer of the tutor didactics seminar for Programming 2 (2021), Software Engineering Lab (2021), Programming 2 (2022), Programming 2/CySec 2 (2023), Software Engineering Lab (2023).
I volunteered in the Mathematics Preparatory Course 2018(π).