Back to selection
45400-01 - Lecture: Planning and Optimization (8 CP)
| Semester | fall semester 2018 |
| Further events belonging to these CP |
45400-01 (Lecture) 45400-02 (Practical course) |
| Course frequency | Every fall sem. |
| Lecturers |
Thomas Keller (tho.keller@unibas.ch)
Gabriele Röger (gabriele.roeger@unibas.ch, Assessor) |
| Content | The course provides an introduction to the theory and algorithms for planning, with an emphasis on classical and probabilistic planning. These are concerned with determining actions that transform a given initial state into a desirable state in very large state spaces. Topics covered include: planning formalisms and normal forms; progression and regression; computational complexity of planning; planning as heuristic search; dynamic programming; Monte-Carlo tree search; |
| Learning objectives | The participants get to know the theoretical and algorithmic foundations of action planning as well as their practical implementation. They understand the fundamental concepts underlying modern planning algorithms as well as the theoretical relationships that connect them. They are equipped to understand research papers and conduct projects in this area. |
| Bibliography | There is no textbook for the course. The course slides will be made available to the participants, and additional research papers complementing the course materials will be uploaded to the course webpage during the semester. |
| Weblink | course web page |
| Admission requirements | Good knowledge in the foundations and core areas of computer science are assumed, in particular algorithms and data structures, complexity theory, mathematical logic and programming. Good knowledge of the contents of the course "Foundations of Artificial Intelligence" (13548) is assumed, in particular the chapters on state-space search. Students who have not previously passed the prerequisite course are strongly advised to learn the necessary material in self-study prior to the beginning of this course. If you are interested in participating in this course but do not yet have strong knowledge on state-space search, we strongly encourage you to contact the lecturers prior to the semester to discuss a possible self-study plan. |
| Course application | Course: https://services.unibas.ch/ Exercises: https://courses.cs.unibas.ch/ |
| Language of instruction | English |
| Use of digital media | Online, mandatory |
| Course auditors welcome |
| Interval | Weekday | Time | Room |
|---|
No dates available. Please contact the lecturer.
| Modules |
Doctorate Computer Science: Recommendations (PhD subject: Computer Science) Electives Master Computer Science: Recommendations (Master's Studies: Computer Science (Start of studies before 01.08.2016)) Modul Concepts of Machine Intelligence (Master's degree subject: Computer Science) Module: Applications of Distributed Systems (Master's Studies: Computer Science) Module: Computer Sciences: Core Area (Master's Studies: Computer Science (Start of studies before 01.08.2016)) Module: Concepts of Machine Intelligence (Master's Studies: Computer Science) |
| Assessment format | continuous assessment |
| Assessment details | Oral examination Dates: Monday, 28 January; Tuesday, 29 January; Wednesday, 30 January Room: Office 06.004 Marked homework exercises will be handed out in order to support and assess the learning progress. To qualify for the oral examination, students must obtain at least 50% of the total marks from the exercises. Exercise marks do not contribute to the final grade for the course, which is exclusively based on the oral examination. |
| Assessment registration/deregistration | Reg.: course registration, dereg: cancel course registration |
| Repeat examination | no repeat examination |
| Scale | 1-6 0,5 |
| Repeated registration | as often as necessary |
| Responsible faculty | Faculty of Science, studiendekanat-philnat@unibas.ch |
| Offered by | Fachbereich Informatik |