Conny Olz

I joined the institute in January 2019, where I am working on theoretical foundations of Hierarchical Planning, in particular for domain modelling support. Between 2012 and 2018 I studied mathematics at Ulm University. During my studies I was mainly interested in Graph Theory and Combinatorial Optimization.

Further Information

  • Research Interests

    • Theoretical foundations of Hierarchical Planning
    • Domain modelling support
    • Computational complexity theory
    • Post-optimization of partially ordered plans


  • Teaching

    • Sose 20: Pro-Seminar "Artificial Intelligence"
    • WiSe 19/20: Lecture "Introduction to Artificial Intelligence"
    • Sose 19: Lecture "Introduction to Computer Science"
    • Sose 19: Pro-Seminar "Artificial Intelligence"


    As a student

    • SoSe 18: Tutor for "Elementare Zahlentheorie"
    • SoSe 16: Tutor for "Optimierung/OR 1"
    • WiSe 15/16: Tutor for "Analysis 1"
    • SoSe 14: Tutor for "Analysis 1
  • Supervised Theses

    I've been the supervisor of the following student's theses:

    Bachelor Theses

    • Enriching Hierarchical Plans by Extracting Summary Information for Abstract Tasks (2020)
    • Algorithms for Identifying and Eliminating Redundant Actions in Partially Ordered Plans (2019)



P. Bercher and C. Olz, "POP ≡ POCL, right? Complexity Results for Partial Order (Causal Link) Makespan Minimization" in Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), AAAI Press, 2020. pp. 9785--9793.


C. Olz and P. Bercher, "Eliminating Redundant Actions in Partially Ordered Plans -- A Complexity Analysis" in Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), AAAI Press, 2019. pp. 310--319.