1 / 11

Traffic errr

Traffic errr. Chris Meyers. Scenario 1. You want the shortest time path to work today Static, pre-computed Grab all paths from A -> B Google maps  Find the fastest path based on users who have previously traveled that path. Route 1. Route 2. Route 3. Scenario 2.

lana
Download Presentation

Traffic errr

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Traffic errr Chris Meyers

  2. Scenario 1 • You want the shortest time path to work today • Static, pre-computed • Grab all paths from A -> B • Google maps  • Find the fastest path based on users who have previously traveled that path

  3. Route 1

  4. Route 2

  5. Route 3

  6. Scenario 2 • You want the shortest time path to work today, from your 3 pre-planed routes • Find the fastest path based on users who have recently traveled that path

  7. Tracking 1 • Constantly check what road the user is on • When you find a road that the user is on remember it (road_curr) • When the user turns off the road, onto a new road, log the time spent on the old road segment. Also log a timestamp • <segmentId, road, timestamp>

  8. Fastest Route 1 • Get all paths from A->B • {<segId1, segId2,…>, <segId1, segId2, …>, …} • For each path <segId1, segId2,…> grab the corresponding logs <segmentId, road, timestamp> • Do some calculations • Sum up all time segments on the path • Choose smallest time as the path

  9. Tracking 2 • Constantly check what road the user is on • When you find a road that the user is on remember it (road_curr) • When the user turns off the road, onto a new road, log the time spent on the old road segment. Factor the new time in with the running time

  10. Fastest Route 2 • Get all paths from A->B • {<segId1, segId2,…>, <segId1, segId2, …>, …} • For each path <segId1, segId2,…> lookup the running time • Sum up all time segments on the path • Choose smallest time as the path

  11. The End Questions ?

More Related