Current Semester (SoSe 21)
- BA-INF 051 - Projektgruppe Computational Geometry
The course will be held online by Elmar Langetepe. There will be two lectures per week and an additional tutorial with exercises.
The organisation and the information for the course will be available soon on eCampus. You can register there.
In this lecture we consider algorithmic aspects of motion planning, i.e. efficient algorithms for motion planning problems 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 and measure the quality.