AI Planning

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

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.

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.

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).

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.

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

 

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.

 

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.