Skip to content
A repository for routing algorithm for pedestrian
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
PedestrianRoutingAlgorithms @ 3f77fd2
Pedestrian_Routing @ f9afc7e
images
routing-with-landmark @ ffec6e6
.gitmodules
LICENSE
README.md

README.md

pedestrian-routing

This is the repository to store the work that has been done for the Evaluating routing-algorithm approaches for pedestrian behaviour simulation course in the University of Muenster 2019.

Shortest Distance (A*) with landmarks Least Angular Change and Landmark using Djikstra
Shortest Distance (A*) with landmark Least Angular Change and Landmark using Djikstra

Content

  1. Landmark Extraction
  2. Shortest Distance (A*) with landmarks
  3. Least Angular Change and Landmark using Djikstra
  4. Hausdorff Distance metric

Team Members

  1. Benjamin Amir Karic
  2. Ismail Sunni
  3. Lia Kirsch
  4. Tina Baidar

Results

Heat map of number of participants taking various routes Heat map of number of participants taking various routes

Bar chart with error bars representing overall comparison result from (a) Hausdorff distance and (b) Area between the routes Bar chart with error bars representing overall comparison result from (a) Hausdorff distance and (b) Area between the routes

Results for route A with (a) Map showing the computed and observed routes, and Bar chartwith error bars showing results from (b) Hausdorff distance (c) Area between the routes Results for route A with (a) Map showing the computed and observed routes, and Bar chartwith error bars showing results from (b) Hausdorff distance (c) Area between the routes

You can’t perform that action at this time.