Upload
-
View
49
Download
0
Tags:
Embed Size (px)
Citation preview
Here is the problem
Sometimes, I want to take a run from Lab to Home
But I want to run different miles on different days
Here is the problem
Sometimes, I want to take a run from Lab to Home
But I want to run different miles on different days
I want to run different routes on different days
Here is the problem
Sometimes, I want to take a run from Lab to Home
But I want to run different miles on different days
I want to run different routes on different days
How to find routes with targeted distances?
After Data Clean Up
103,365 Nodes, 225,766 edges
17,480 Nodes, 49,354 edges
5min 30s for path search
~5 fold reduction
Starting Address: My Lab
Ending Address: My Home
Desired Distance: 3km
Path Finding Algorithm:
My LabMy Home
Path Finding Algorithm:Dijkstra’s Algorithm finding shortest path
Shortest Path Length 1131m
My LabMy Home
Score
• Penalize difference between desired distance
and actual distance
• Penalize turns / loops / zigzags
• Penalize repetitive route
Path Finding Algorithm:Monte Carlo Heuristic perturbation of route
penalty score = 4.99path length = 1131m
My LabMy Home
Path Finding Algorithm: Monte Carloaccept improvements
penalty score = 2.95path length = 1875m
My LabMy Home
Path Finding Algorithm: Monte Carloonly accept deterioration with low probability
penalty score = 39.32path length = 8064m
My LabMy Home
Path Finding Algorithm: Monte Carlobest route after 1000 iterations
penalty score = 0.495path length = 2985m
My LabMy Home
Path Finding Algorithm: Monte Carlobest route after another 1000 iterations
penalty score = 0.251path length = 3202m
My LabMy Home
Summary
• Build a route recommendation system for runners
• Recommend different routes for given runningdistances
• Customized running score
• Can be easily generalized for other purposes