|
Size: 2292
Comment:
|
Size: 8988
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 7: | Line 7: |
| The teaching assistant for this course is Claudius Korzen (korzen@informatik.uni-freiburg.de). The tutors are Mirko Brodesser (mirko.brodesser@gmail.com) and Eugen Sawin (esawin@gmail.com). 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). | The tutors for this course are Mirko Brodesser (mirko.brodesser@gmail.com) and Eugen Sawin (esawin@gmail.com). 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). {{{ #!html <!-- <h2 style="color:red">Maintenance</h2> <p>All Daphne Services (SVN/Jenkins/...) will not be available for some time on Thursday 17. Mai and Friday 18. Mai. We apologize for any inconvenience.</p> <h2 style="color:red">NO LECTURE TODAY, on Wednesday June 20, at 4:15pm ... Prof. Bast is sick.</h2> --> }}} |
| Line 11: | Line 20: |
| * Here is the (not yet working) link to [[https://daphne.informatik.uni-freiburg.de/EfficientRoutePlanningSS2011|Daphne]] (points and links to your SVN and Jenkins). * Here is the (not yet working) link to the [[http://ad-forum.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2011|Forum]] (for annoucements and questions). |
* Here is the link to [[https://daphne.informatik.uni-freiburg.de/EfficientRoutePlanningSS2012|Daphne]], our course management system. * Here is the link to the [[https://daphne.informatik.uni-freiburg.de/forum/viewforum.php?f=12|Forum]] (for annoucements and questions). * Here is the link to our [[https://daphne.informatik.uni-freiburg.de/svn/CodingStandards/|CodingStandards]]. * Here is the link to the [[http://ad-wiki.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2011|slides, video recordings, etc. from last year]]. Note that the overall contents of this year's lecture will be similar, but that there will be quite a bit of variation / improvement, based on my experiences and the student feedback from last year. * Here is the link to the [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/snapshot.2012-05-16T16:00/|SVN snapshot]] of the code files just after the last exercise sheet deadline (May 16, 2012 @ 16:00). |
| Line 16: | Line 28: |
| [[http://ad-wiki.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2011|Here is a link to the slides, video recordings, etc. from last year]]. Note that the overall contents of this year's lecture will be similar, but there will be quite a bit of variation / improvement, based on my experiences and the student feedback from last year. | ''Remark about the video recordings:'' we have prepared videos in different formats, in particular: ''.m4v'', ''.mp4'', and ''.wmv''. If you click on one of the links "Video recording" you get that format of which our script thinks that it best fits your device / operating system / browser. If you explicitly want a particular format, simply copy the link address and add the desired extension by hand. |
| Line 18: | Line 30: |
| * Lecture 1, Wednesday, April 25, 2012 (Introduction, Road Networks, OSM Data): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-2.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-1.pdf|Exercise Sheet 1]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/saarland.osm.bz2|OSM data Saarland (bz2-compresssed)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/saarland.osm.bz2|OSM data Baden-Württemberg (bz2-compresssed)]]. |
* Lecture 1, Wednesday, April 25, 2012 (Introduction, Organizational, Road Networks, OSM Data): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-1|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-1.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-1.pdf|Exercise Sheet 1]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-1.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-1/|Code design suggestions]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/saarland.osm.bz2|OSM data Saarland (24-Apr-2012 18:52, bz2-compresssed)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/baden-wuerttemberg.osm.bz2|OSM data Baden-Württemberg (24-Apr-2012 19:44, bz2-compresssed)]], [[EfficientRoutePlanningSS2012/RoadTypesAndSpeeds|Table road types <-> speeds]], [[EfficientRoutePlanningSS2012/ReadOsmResults|Table with your "OSM -> graph" results]]. * Lecture 2, Wednesday, May 2, 2012 (Dijkstra's algorithm, Connected components, Jenkins): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-2|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-2.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-2.pdf|Exercise Sheet 2]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-2.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-2/|Code design suggestions]], [[EfficientRoutePlanningSS2012/DijkstraResults|Table with your Dijkstra results]]. * Lecture 3, Wednesday, May 9, 2012 (A*, Landmarks, Set Dijkstra): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-3|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-3.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-3.pdf|Exercise Sheet 3]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-3.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-3/|Code design suggestions]], [[EfficientRoutePlanningSS2012/AstarResults|Table with your A* results]]. * Lecture 4, Wednesday, May 16, 2012 (Arc Flags, Visualization): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-4.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-4.pdf|Exercise Sheet 4]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-4.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-4/|Code design suggestions]], [[EfficientRoutePlanningSS2012/ArcFlagsResults|Table with your Arc Flags results]]. * Lecture 5, Wednesday, May 16, 2012 (Web application, Google Maps API): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-5|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-5.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-5.pdf|Exercise Sheet 5]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-5.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-5/|Code from the lecture]]. * Lecture 6, Wednesday, June 6, 2012 (Contraction Hierarchies, Part 1): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-6|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-6.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-6.pdf|Exercise Sheet 6]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-6.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-6/|Code design suggestions]], [[EfficientRoutePlanningSS2012/ContractionResults|Table with your node contraction results]]. * Lecture 7, Wednesday, June 13, 2012 (Contraction Hierarchies, Part 2): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-7|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-7.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-7.pdf|Exercise Sheet 7]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-7.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-7/|Code design suggestions]], [[EfficientRoutePlanningSS2012/ContractionHierarchiesResults|Table with your Contraction Hierarchies results]]. * No lecture on Wednesday, June 20, 2012 (cancelled at short notice because Prof. Bast fell sick due to a vicious viral attack). Deadline for Exercise Sheet 7 was extended by one week, until June 27, 4:00pm. * Lecture 8, Wednesday, June 27, 2012 (Transit Node Routing): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-8.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-8.pdf|Exercise Sheet 8]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-8.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-8/|Code design suggestions]], [[EfficientRoutePlanningSS2012/TransitNodesResults|Table with your Transit Node Routing results]]. |
Welcome to the Wiki of the course '''Efficient Route Planning''' in the summer term 2012
The course is given by Prof. Dr. Hannah Bast and takes place every Wednesday from 4:15pm until 5:45pm, in seminar room 01-009/13 in building 101. The first lecture is on Wednesday, April 25, 2012 and the last lecture is on Wednesday, July 25, 2012. There will be no lecture on Wednesday, May 30, 2012 (pentecost holidays). That is 13 lectures altogether.
The tutors for this course are Mirko Brodesser (mirko.brodesser@gmail.com) and Eugen Sawin (esawin@gmail.com). 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, our course management system.
Here is the link to the Forum (for annoucements and questions).
Here is the link to our CodingStandards.
Here is the link to the slides, video recordings, etc. from last year. Note that the overall contents of this year's lecture will be similar, but that there will be quite a bit of variation / improvement, based on my experiences and the student feedback from last year.
Here is the link to the SVN snapshot of the code files just after the last exercise sheet deadline (May 16, 2012 @ 16:00).
Lecture Slides, Video Recordings, Exercise Sheets, and Code
Remark about the video recordings: we have prepared videos in different formats, in particular: .m4v, .mp4, and .wmv. If you click on one of the links "Video recording" you get that format of which our script thinks that it best fits your device / operating system / browser. If you explicitly want a particular format, simply copy the link address and add the desired extension by hand.
Lecture 1, Wednesday, April 25, 2012 (Introduction, Organizational, Road Networks, OSM Data): Video recording, Slides, Exercise Sheet 1, Points scheme, Code design suggestions, OSM data Saarland (24-Apr-2012 18:52, bz2-compresssed), OSM data Baden-Württemberg (24-Apr-2012 19:44, bz2-compresssed), Table road types <-> speeds, Table with your "OSM -> graph" results.
Lecture 2, Wednesday, May 2, 2012 (Dijkstra's algorithm, Connected components, Jenkins): Video recording, Slides, Exercise Sheet 2, Points scheme, Code design suggestions, Table with your Dijkstra results.
Lecture 3, Wednesday, May 9, 2012 (A*, Landmarks, Set Dijkstra): Video recording, Slides, Exercise Sheet 3, Points scheme, Code design suggestions, Table with your A* results.
Lecture 4, Wednesday, May 16, 2012 (Arc Flags, Visualization): Video recording, Slides, Exercise Sheet 4, Points scheme, Code design suggestions, Table with your Arc Flags results.
Lecture 5, Wednesday, May 16, 2012 (Web application, Google Maps API): Video recording, Slides, Exercise Sheet 5, Points scheme, Code from the lecture.
Lecture 6, Wednesday, June 6, 2012 (Contraction Hierarchies, Part 1): Video recording, Slides, Exercise Sheet 6, Points scheme, Code design suggestions, Table with your node contraction results.
Lecture 7, Wednesday, June 13, 2012 (Contraction Hierarchies, Part 2): Video recording, Slides, Exercise Sheet 7, Points scheme, Code design suggestions, Table with your Contraction Hierarchies results.
- No lecture on Wednesday, June 20, 2012 (cancelled at short notice because Prof. Bast fell sick due to a vicious viral attack). Deadline for Exercise Sheet 7 was extended by one week, until June 27, 4:00pm.
Lecture 8, Wednesday, June 27, 2012 (Transit Node Routing): Slides, Exercise Sheet 8, Points scheme, Code design suggestions, Table with your Transit Node Routing results.