The exams will take place on 05.02.2013 and 26.03.2013.
Background in Computational Geometry will be helpful but is not necessary.
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.
Problem Set 1
Problem Set 2
Problem Set 3
Problem Set 4
Problem Set 5
Problem Set 6
Problem Set 7
Problem Set 8
Problem Set 9
Problem Set 10
You should subscribe to the lecture's mailing list: https://lists.iai.uni-bonn.de/mailman/listinfo.cgi/vl-bpr
You can find the Polygon Exploration Paper at http://epubs.siam.org/doi/abs/10.1137/S0097539799348670.
You will find Slides for the Window Shopper Problem and the Spiral Search here: http://tizian.cs.uni-bonn.de/Lehre/Vorlesungen/Bewegungsplanung1112/VL17AllgStrahlenAnim.pdf Professor Klein's notes. Caution! These notes are not proofread. They probably contain errors. Do not use them as primary source.