Online Motion Planning

Lecture

Examination dates

Preliminaries
Background in Computational Geometry will be helpful but is not necessary.

Mailing list
Please subscribe to the mailing list! Subscribers receive the latest information concerning organisation, answers to frequently asked questions and important announcements. Each subscriber can post questions or answers to the list. Comprehension questions regarding exercise sheets are allowed unless the answer is part of the exercise itself.

Literature

Summary

We will concern ourselves with 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.

Exercise Groups

Contact If there are any questions you can contact [[staff:rainerpenniger|Rainer Penninger}}.

Übungsblätter:
exercisesheet1.pdf
exercisesheet2.pdf
exercisesheet3.pdf
exercisesheet4.pdf
exercisesheet5.pdf
exercisesheet6.pdf
exercisesheet7.pdf
exercisesheet8.pdf
exercisesheet9.pdf
exercisesheet10.pdf