Lecturing will start at Tuesday April 18th at 10:15 at LBH, Seminarroom E08!
In this lecture we consider algorithmic aspects of motion planning, i.e. efficient Algorithms for motion planning problems for autonomous agents will be presented.
In contrast to other motion planning tasks we will consider motion planning under incomplete information: At the beginning, we do not have at hand all the information necessary to find an optimal or a correct path. Therefore our topic belongs to the realm of Online algorithms. We will compare online strategies to optimal offline strategies to measure their quality.
|Oral Exams I||15.8||LBH, Room E01||Appointments by secretary||Langetepe, NN|
|Oral Exams II||26.9||LBH, Room E01||Appointments by secretary||Langetepe, NN|
|Lecture||Tuesday 10:15 to 11:45||LBH, E08||Start: April 18th 2017||Langetepe|
|Lecture||Thursday 10:15 to 11:45||LBH, E08||Langetepe|
|Tutorials||Tuesday/Thursday 12-14||LBH, E08||Start: April 27th 2017||Langetepe/Wiemker|
Some of the applets shown during the lecture can be found in our geometry lab .