|
Size: 4288
Comment:
|
Size: 4686
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 15: | Line 15: |
| * Here is the link to an [[[[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/snapshot|SVN snapshot]] of the code files just after the last exercise sheet deadline. | |
| Line 20: | Line 21: |
| * 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]], [[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/|Code skeleton for RoadNetwork and DijkstraAlgorithm class]], [[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/exercise-sheet-2.pdf|Exercise Sheet 2]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/lecture-3|Code skeleton]], [[EfficientRoutePlanningSS2012/AstarResults|Table with your A* results]]. |
* 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/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/lectures/lecture-3/|Code design suggestions]], [[EfficientRoutePlanningSS2012/AstarResults|Table with your A* 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 an SVN snapshot of the code files just after the last exercise sheet deadline.
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): Slides, Exercise Sheet 3, Code design suggestions, Table with your A* results.