AI Planning Prof. Dr. Jörg Hoffmann Advanced Lecture (9 CP), Winter Semester 2019

News

12.03.2020

Re-Exam registration reminder

Dear students,

this is a kind reminder that the CMS registration for the re-exam ends this Sunday (March 15, 23:59).

If you want to take the re-exam, you *have* to register for it in CMS.

Regarding Corona: so far, we have no news that exams cannot take... Read more

Dear students,

this is a kind reminder that the CMS registration for the re-exam ends this Sunday (March 15, 23:59).

If you want to take the re-exam, you *have* to register for it in CMS.

Regarding Corona: so far, we have no news that exams cannot take place in the next few weeks. Thus, we assume that the re-exam will take place as planned. We will notify you as soon as possible when we get updates on this.

Kind regards,

Daniel

04.03.2020

Registration for re-exam

Dear students,

we just opened the CMS registration for the re-exam. Please register by 15.03.2020 23:59 if you want to take the exam, otherwise you will not be able to participate.

Kind regards,

Daniel

12.02.2020

Exam Inspection

The results of the first exam have been sent out and can be accessed on your status page. The exam inspection will be on Monday (February 17) at 3pm-4pm in our seminar room (E1 1 room 3.06).

06.02.2020

First Exam

As a reminder, the first exam will be next Tuesday (February 11th), at 15:00, in E1 3 HS003.

The slides from the exam preparation lecture are now online. Due to popular request, we have also uploaded solutions to exercises from a previous iteration of the course.... Read more

As a reminder, the first exam will be next Tuesday (February 11th), at 15:00, in E1 3 HS003.

The slides from the exam preparation lecture are now online. Due to popular request, we have also uploaded solutions to exercises from a previous iteration of the course. Keep in mind that there might be some exercises for topics that were not discussed this year, and we can not guarantee that all the solutions are correct.

23.01.2020

Competition Reminder

As described in the competition sheet, we will have a preliminary test run of the competition tomorrow. If you want your planner to be included in the test run, you need to prepare the submission until tonight (11:59 pm):

1. define your configuration aliases in... Read more

As described in the competition sheet, we will have a preliminary test run of the competition tomorrow. If you want your planner to be included in the test run, you need to prepare the submission until tonight (11:59 pm):

1. define your configuration aliases in the driver/aliases.py file, and
2. add a file called COMPETITION containing the names of your planner for each track.

If we notice any issues with your planner, we will let you know by mail after the test run.

For the final deadline (Sunday 11:59 pm), you will additionally need to submit a single PDF slide with a brief description of your planners to the CMS.

15.01.2020

Second Exam

Dear students,

we just fixed the date for the second exam to be March 31.

Since there might be only few of you taking the second exam, a potential oral second exam will take place in the same week.

Best regards,

Daniel

17.12.2019

Tutorial 3 and Christmas Surprise Lecture

Tomorrow's schedule for the Tutorial and Christmas Surprise Lecture (both in E1 1, room 3.06) will be as follows:
10:15-11:30: Tutorial
11:30-13:00: Christmas Surprise Lecture
There will be free pizza at the start of the lecture (at 11:30), so don't eat too much... Read more

Tomorrow's schedule for the Tutorial and Christmas Surprise Lecture (both in E1 1, room 3.06) will be as follows:
10:15-11:30: Tutorial
11:30-13:00: Christmas Surprise Lecture
There will be free pizza at the start of the lecture (at 11:30), so don't eat too much for breakfast!

28.11.2019

Additive and Max Heuristics Evaluation

The evaluation of the additive and max heuristics is now finished, the points should be visible on your personal status page. If you have less than 100% of the points, you will receive a short mail with some feedback for your submission. As announced at the start of... Read more

The evaluation of the additive and max heuristics is now finished, the points should be visible on your personal status page. If you have less than 100% of the points, you will receive a short mail with some feedback for your submission. As announced at the start of the lecture, if you have less than 50% of the project points so far, you are not admitted to the exam at the end of the term (i.e., at least 17.5 points if you submitted a counter-based implementation of h^max or h^add, or at least 12.5 points otherwise).

UPDATE: The points were initially incorrectly entered using maximum points of 15 and 25 points for the standard and counter-based implementations respectively. This has now been updated (to 20 respectively 30 maximum points as announced before).

28.11.2019

Project Groups Reminder

This is a reminder that the deadline to team up for the projects is coming up tonight. If you want to form a group, add the other group members to one of your repositories, and send me a mail with the link to the repository you want to use and the list of group... Read more

This is a reminder that the deadline to team up for the projects is coming up tonight. If you want to form a group, add the other group members to one of your repositories, and send me a mail with the link to the repository you want to use and the list of group members. We highly encourage you to do so, as the remaining projects will be more difficult and complex than the first ones. Feel free to use the forum if you are still looking for team members.

12.11.2019

Proof Relaxed Plan Heuristic Correctness

Hi all,

for lack of a more adequate means to communicate this information, I'm posting this as "news" for the time being:

Regarding the discussion today in the lecture, proof of correctness for relaxed plan extraction:The proof as stated was correct, it just... Read more

Hi all,

for lack of a more adequate means to communicate this information, I'm posting this as "news" for the time being:

Regarding the discussion today in the lecture, proof of correctness for relaxed plan extraction:The proof as stated was correct, it just didn't spell out in sufficient detail why the case of a precondition in Closed isn't problematic. I have fixed this in the post-handouts. (The reason is simply that, then, the best supporter for that precondition must have been selected beforehand)

best,

Jörg

 

22.10.2019

Paper Exercises

We just uploaded the first Paper Exercise Sheet.

This is just to remind you that you do not need to submit solutions to the sheet to qualify for the exam.

You can do so to obtain some feedback on your solution, however. Submission will be via CMS until one day... Read more

We just uploaded the first Paper Exercise Sheet.

This is just to remind you that you do not need to submit solutions to the sheet to qualify for the exam.

You can do so to obtain some feedback on your solution, however. Submission will be via CMS until one day before the tutorial in which the sheet is discussed. Please read the submission instructions on the sheet for further details.

 

17.10.2019

Programming Projects

The programming projects overview is now online (see course material). In this sheet, you will find all the organizational details regarding the projects (repository setup, nightly tests, grading), as well as a short description for each individual subproject and... Read more

The programming projects overview is now online (see course material). In this sheet, you will find all the organizational details regarding the projects (repository setup, nightly tests, grading), as well as a short description for each individual subproject and their dependencies.

There will be a programming workshop on Thursday October 31st at 2:15pm in our seminar room (E1 1, room 3.06). In the workshop, we will give you a brief overview of the projects you can choose to implement. We will also give you an introduction to the Fast Downward framework with some live coding to prepare you for the projects (in fact, you might already be able to finish the first project in the workshop). Before the workshop, you should have read the projects overview, and have set up your repository so you can follow the live coding in the workshop.

Please use the forums for general questions about the projects. If you have specific questions about your code, you can visit our offices (E1 1, rooms 3.14 and 3.08) during the office hours (Wednesdays 2-4pm) or send a mail to Maximilian Fickert.

17.10.2019

2. Planning Formalisms: hand-outs available

I uploaded the hand-outs now. Sorry, I had forgotten to upload the pre-handouts before the lecture yesterday.

15.10.2019

1. About this Course: post-handout available

The post-handouts for Chapter 1. About this Course are now available under Materials.

15.10.2019

Welcome!

Welcome everybody to the 19/20 edition of our AI Planning course!

If you have any questions, please do not hesitate to send emails to me or Maximilian Fickert.

Good luck!

Show all
 

AI Planning

AI Planning is one of the fundamental sub-areas of Artificial Intelligence, concerned with algorithms that can generate strategies of action for arbitrary autonomous agents in arbitrary environments. The course will address so-called classical planning, where the actions and environment are assumed to be deterministic; this is a central area in planning, and has been the source of many influential ideas. It is also successfully applied in practice, as we will exemplify in the course. We will examine the technical core of the current research on solving this kind of problem. We will consider four different paradigms for automatically generating heuristic functions (lower bound solution cost estimators): critical paths, ignoring delete lists, abstractions, landmarks. Apart from understanding these techniques themselves, we will learn how to analyze, combine, and compare such estimators. We will furthermore consider optimality-preserving pruning techniques based on partial-order reduction, symmetries, and dominance pruning. The course contains many research results from the last decade, close to the current research frontier in planning.

Prerequisites. Ideally, participating students should have successfully completed an introductory course in Artificial Intelligence. However, the course is self-contained and any student with a solid basis in Computer Science -- algorithms, data structures, programming, propositional logic, NP-hardness -- should in principle be able to follow. Prior knowledge about search (the A* algorithm etc) is an advantage. Students who have already passed Automatic Planning in previous years are not allowed to attend the course.



Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators