|
Size: 6808
Comment:
|
Size: 6807
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 16: | Line 16: |
| * Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/get-video.php?file=/lecture-3.wmv|Video]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-3.pdf|Slides]], [[attachment:exercise-sheet-2.pdf|Exercise Sheet 2]], [[http://www.avglab.com/andrew/pub/soda05.pdf|A* with Landmarks paper]]. | * Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/get-video.php?file=lecture-3.wmv|Video]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-3.pdf|Slides]], [[attachment:exercise-sheet-2.pdf|Exercise Sheet 2]], [[http://www.avglab.com/andrew/pub/soda05.pdf|A* with Landmarks paper]]. |
Welcome to the Wiki of the course '''Efficient Route Planning''' in the summer term 2011
The course is given by Prof. Dr. Hannah Bast and takes place every Friday from 2:15pm until about 3:45pm, in room 00-026 (µ-Saal) in building 101. The first lecture is on Friday, May 6 and the last lecture is on Friday, August 5. There will be no lecture on the following dates: Friday, May 27 (FAM-workshop) and Friday, June 17 (pentecost holidays). That is 12 lectures altogether.
The teaching assistant for this course is Mirko Brodesser (brodessm@informatik.uni-freiburg.de). The responsibles for the supporting systems (Daphne, SVN, Forum, Jenkins) are Jens Hoffmann (hoffmaje@informatik.uni-freiburg.de) and Axel Lehmann (lehmanna@informatik.uni-freiburg.de).
Important Links
Here is the link to Daphne (points and links to your SVN and Jenkins).
Here is the link to the Forum (for annoucements and questions).
Lectures and Exercise Sheets
Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): Video, Slides, Exercise Sheet 1, Master solutions, Table Road Types <-> Speeds, Table with your experimental results.
Lecture 2, Friday, May 13 2011 (Implementation advice, Build, Test, Style): Video (raw Camtasia AVI), Slides, no new exercise sheet for this lecture, Coding-standards.
Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): Video, Slides, Exercise Sheet 2, A* with Landmarks paper.
Lecture 4, Friday, June 3 2011 (Arc flags): Video (raw Camtasia AVI), Slides, Exercise Sheet 3, Code from the lecture, Table Dijkstra & Arc flags, Arc flags papers.
Lecture 5, Friday, June 11 2011 (Web application, Google Maps API): Video (raw Camtasia AVI), Slides, Exercise Sheet 4, Code from the lecture, Google Maps JavaScript API.
Lecture 6, Friday, June 24 2011 (Highway & Contraction Hierarchies): Video (raw Camtasia AVI), Slides, Exercise Sheet 5, Contraction Hierarchies paper.
Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice, exam info I): Video (raw Camtasia AVI), Slides, no new exercise sheet for this lecture, Code from the lecture, Results of contraction hierarchies experiments.
Lecture 8, Friday, July 8, 2011 (Transit Node Routing): Video, Recording as MP4, Slides, Exercise Sheet 6, Transit Node Routing paper, Results of transit node routing experiments.
Lecture 9, Friday, July 15, 2011 (Transit networks, GTFS): Video, Slides, Exercise Sheet 7, Code from the lecture (CsvParser), Results of transit network experiments.
Lecture 10, Friday, July 22, 2011 (Transit networks again, multi-label Dijkstra): Video, Recording as MP4, Slides, no new exercise sheet for this lecture.