3. Here is the problem
Sometimes, I want to take a run from Lab to Home
4. 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
5. 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
6. 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?
17. Score
• Penalize difference between desired distance
and actual distance
• Penalize turns / loops / zigzags
• Penalize repetitive route
18. Path Finding Algorithm:
Monte Carlo Heuristic perturbation of route
penalty score = 4.99
path length = 1131m
My LabMy Home
19. Path Finding Algorithm: Monte Carlo
accept improvements
penalty score = 2.95
path length = 1875m
My LabMy Home
20. Path Finding Algorithm: Monte Carlo
only accept deterioration with low probability
penalty score = 39.32
path length = 8064m
My LabMy Home
21. Path Finding Algorithm: Monte Carlo
best route after 1000 iterations
penalty score = 0.495
path length = 2985m
My LabMy Home
22. Path Finding Algorithm: Monte Carlo
best route after another 1000 iterations
penalty score = 0.251
path length = 3202m
My LabMy Home
23.
24.
25. Summary
• Build a route recommendation system for runners
• Recommend different routes for given running
distances
• Customized running score
• Can be easily generalized for other purposes