معرفی
Gregor Behnke is an Assistant Professor (Universitair Docent) at the Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam, Faculty of Science. He heads the research group on Planning and Symbolic AI within the Theoretical Computer Science unit. His primary affiliation is with the Institute for Logic, Language and Computation, where he conducts research at LAB42, Science Park 900, Amsterdam.
Dr. Behnke's research focuses on solving optimization and decision problems using symbolic AI methods, with particular emphasis on AI planning, automated decision making, complexity theory, and combinatorial optimization. His specific interests include Hierarchical (HTN) Planning, Planning using Symbolic Methods (SAT, BDDs), Lifted Planning, Theory of Planning and its Complexity, Domain and Action Model Learning, and Epistemic Planning. He is particularly interested in developing practically efficient solutions to complex planning problems.
His recent publications demonstrate a strong focus on computational complexity analysis of planning problems, verification methods for hierarchical planning, and domain learning techniques. His work bridges theoretical foundations with practical implementations, as evidenced by his development of planning systems.
- ICAPS 2018 Best Student Paper Award for 'A Generic Method to Guide HTN Progression Search with Classical Heuristics'
- ICTAI 2018 CV Ramamoorthy Best Paper Award for 'Plan and Goal Recognition as HTN Planning'
- TCST 2018 Best Paper Award for 'Towards a Companion System Incorporating Human Planning Behavior -- A Qualitative Analysis of Human Strategies'
Dr. Behnke supervises two PhD students: P. Maurice Dekker (funded by a startersbeurze, working on Bounded Rationality in Planning since January 2024) and João Sá (funded by an NWO Open Competitie M, working on SAT planning since March 2024). He is the main developer (together with Daniel Höller) of the HTN planning system PANDA, which has two maintained versions: PANDA3 (Java/Scala) and pandaPI (C++). His research group currently consists of himself and his two PhD students.
His laboratory work centers around the development and analysis of planning algorithms, particularly focusing on HTN planning systems and their verification. The group works on both theoretical aspects of planning complexity and practical implementations of planning systems.
