Institut für Künstliche Intelligenz

Dr. Conny Olz

Ich bin seit 2019 wissenschaftliche Mitarbeiterin am Institut und beschäftige mich hauptsächlich mit theoretischen Grundlagen im hierarchischen Planen, vor allem im Bezug zur heuristischen Suche. Meine Dissertation wurde betreut von Prof. Dr. Susanne Biundo-Stephan und Dr. Pascal Bercher von der Australian National University (ANU) in Canberra.

Davor habe ich Wirtschaftsmathematik bzw. Mathematik an der Universität Ulm studiert mit Schwerpunkt Graphentheorie und kombinatorischer Optimierung.

Weitere Information

  • Theoretische Grundlagen des Hierarchischen Planens
  • Modellierungsunterstützung
  • Komplexitätstheorie
  • Post-Optimierung von partiell geordneten Plänen

Ich bin und war bei der Betreuung folgender Lehrveranstaltungen beteiligt:

  • Vorlesung "AI Planning" (WiSe 23/24)
  • Vorlesung "Knowledge-Based Artificial Intelligence" (WiSe 21/22)
  • Vorlesung "Intelligente Handlungsplanung" (SoSe 21)
  • Vorlesung "Introduction to Artificial Intelligence" (WiSe 19/20, 20/21)
  • Vorlesung "Einführung in die Informatik" (SoSe 19)
  • Proseminar "Künstliche Intelligenz"
  • Seminar "Advances in Artificial Intelligence"
  • Projekt "AI for Autonomous Systems"
  • Projekt "AI in Games"


Als Student

  • SoSe 18: Korrektur der Übungsblätter für die Vorlesung "Elementare Zahlentheorie"
  • SoSe 16: Korrektur der Übungsblätter für die Vorlesung "Optimierung/OR 1"
  • WiSe 15/16: Tutorin für die Vorlesung "Analysis 1"
  • SoSe 14: Tutorin für die Vorlesung "Analysis 1"

Bachelorarbeiten

  • 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)
  • A Heuristic Based on Vector Space Embeddings for Classical Planning (2023/24)
  • A First Approach to Developing Excuses for Unsolvable HTN Planning Problems (2024)

Masterarbeiten

  • On the Exploitation of Total Order in Partial Order HTN Planning (2021)
  • An Evaluation of Hierarchical Planning Heuristics Using Integer Linear Programming (2023)
  • Development and Evaluation of a Pattern Database Heuristic for HTN-Planning (2023/24)
  • Examining Specialized Heuristics for Acyclic Search Nodes in HTN Planning Using Iterative Deepening Depth-First Search (2023/24)

Program Committee (PC) member oder Reviewer an Konferenzen:

  • AAAI: 2021, 2024
  • ICAPS: 2023, 2024
  • ECAI: 2024


Program Committee (PC) member an Workshops:

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

Gewinner aller total-order tracks an der International Planning Competition (IPC) 2023 im Bereich des HTN Planens. Die Ergebnisse können hier eingesehen werden.

Publikationen

2024

15.
C. Olz, A. Lodemann and P. Bercher, "A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming" in Proceedings of the 27th European Conference on Artificial Intelligence (ECAI 2024), IOS Press, 2024, pp. 4303--4310.
DOI:10.3233/FAIA241005
Datei:/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2024/Olz24ILP.pdf
14.
C. Olz, A. Lodemann and P. Bercher, "An ILP Heuristic for Total-Order HTN Planning" in Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024), 2024.
13.
C. Olz, "Exploring the hierarchy: extracting and exploiting state information of compound tasks in HTN planning", 2024.
DOI:10.18725/OPARU-53481
Datei:https://oparu.uni-ulm.de/items/e6887ad7-6494-4deb-96c4-81edf63cffac
12.
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 38th AAAI Conference on Artificial Intelligence (AAAI 2024), AAAI Press, 2024, pp. 20203--20211.
DOI:https://doi.org/10.1609/aaai.v38i18.30000
Datei:/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2024/Lin2024PlanVerificationComplexity.pdf

2023

11.
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, pp. 65--73.
DOI:https://doi.org/10.1609/socs.v16i1.27284
Datei:/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2023/Olz23Loohahead.pdf
10.
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), AAAI Press, 2023, pp. 314--323.
DOI:https://doi.org/10.1609/icaps.v33i1.27209
Datei:/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2023/Olz23ConjunctivePossEffs.pdf
9.
Y. X. Wu, C. Olz, S. Lin and P. Bercher, "Grounded (Lifted) Linearizer at the IPC 2023: Solving Partial Order HTN Problems by Linearizing Them" in Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC), 2023.
Datei:/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2023/Wu2023IPCLinearizer.pdf
8.
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.
7.
C. Olz, D. Höller and P. Bercher, "The PANDADealer System for Totally Ordered HTN Planning in the 2023 IPC" in Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC), 2023.
Datei:/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2023/Olz23PandaDealer.pdf

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.
Datei: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.
DOI:https://doi.org/10.1109/RO-MAN53752.2022.9900590
Datei: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, pp. 11903--11912.
DOI:https://doi.org/10.1609/aaai.v35i13.17414
Datei: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.
Datei: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.
DOI:https://doi.org/10.1609/aaai.v34i06.6530
Datei: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.
DOI:10.1609/icaps.v29i1.3493
Datei:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Olz2019StepElimination.pdf