Institute of Artificial Intelligence

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

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

 

  • Lecture "Knowledge-Based Artificial Intelligence" (WiSe 21/22)
  • Lecture "Intelligente Handlungsplanung" (engl. Automated Planning) (SoSe 21)
  • Lecture "Introduction to Artificial Intelligence" (WiSe 19/20, 20/21)
  • Lecture "Introduction to Computer Science" (SoSe 19)
  • Pro-Seminar "Artificial Intelligence" (since SoSe 19)
  • Projekt "AI for Autonomous Systems"
  • Project "AI in Games"

 

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"

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

Bachelor Theses

  • Algorithms for Identifying and Eliminating Redundant Actions in Partially Ordered Plans (2019)
  • Enriching Hierarchical Plans by Extracting Summary Information for Abstract Tasks (2020)
  • Inferring Effects of Compound Tasks in HTN Planning Domains: Implementation and Evaluation (2020)
  • Landmarks and Preconditions and Effects of Compound Tasks - What’s the Connection? (2022)
  • Pruning Utilizing Preconditions and Effects of Compound Tasks in Totally Ordered HTN Planning - An Evaluation (2022)

Master Theses

  • On the Exploitation of Total Order in Partial Order HTN Planning (2021)

Program Committee (PC) member at conferences:

  • AAAI: 2021
  • ICAPS: 2023


Program Committee (PC) member at workshops:

  • HPLAN, i.e., Hierarchical Planning: 2020, 2021, 2023

Publications

2023

9.
C. Olz and P. Bercher, "A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements" in Proceedings of the 16th International Symposium on Combinatorial Search (SoCS 2023), AAAI Press, 2023.
8.
C. Olz and P. Bercher, "Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks" in Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023.
7.
S. Lin, C. Olz, M. Helmert and P. Bercher, "On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence" in Proceedings of the 6th ICAPS Workshop on Hierarchical Planning (HPlan 2023), 2023.

2022

6.
C. Olz and P. Bercher, "On the Efficient Inference of Preconditions and Effects of Compound Tasks in Partially Ordered HTN Planning Domains" in Proceedings of the 5th ICAPS Workshop on Hierarchical Planning (HPlan 2022), 2022, pp. 47--51.
File:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2022/Olz2022POPrecsAndEffects.pdf
5.
F. Lindner and C. Olz, "Step-by-Step Task Plan Explanations Beyond Causal Links" in 2022 31st IEEE International Conference on Robot & Human Interactive Communication (RO-MAN), IEEE, 2022, pp. 45--51.
File:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2022/Lindner22PlanExplanationBeyondCL.pdf

2021

4.
C. Olz, S. Biundo and P. Bercher, "Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis" in Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), AAAI Press, 2021.
File:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2021/Olz21CompoundEffects.pdf
3.
C. Olz, E. Wierzba, P. Bercher and F. Lindner, "Towards Improving the Comprehension of HTN Planning Domains by Means of Preconditions and Effects of Compound Tasks" in Proceedings of the 10th Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2021), 2021.
File:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2021/Olz2021ComprehendHTNModels.pdf

2020

2.
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.
File:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2020/Bercher2020POPvsPOCL.pdf

2019

1.
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.
File:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Olz2019StepElimination.pdf