Yannan i run_final_tallerratio

iRun

Yannan Zheng

Ph.D. Candidate, MIT

Here is the problem

Here is the problem

Sometimes, I want to take a run from Lab to Home

Here is the problem


But I want to run different miles on different days

Here is the problem



I want to run different routes on different days

Here is the problem



I want to run different routes on different days

How to find routes with targeted distances?

Building a graph of Cambridge and Boston

Data Clean Up 0: Original Map

Data Clean Up I: Remove un-runnable area

Data Clean Up II: Remove isolated islands

Data Clean Up III: Remove spikes

Data Clean Up IV: Combine parallel roads

Data Clean Up IV: remove redundant nodes

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


My LabMy Home

Path Finding Algorithm: Monte Carloonly accept deterioration with low probability


My LabMy Home

Path Finding Algorithm: Monte Carlobest route after 1000 iterations


My LabMy Home

Path Finding Algorithm: Monte Carlobest route after another 1000 iterations


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

log(

prot

ein2

)

log(protein1)

About Me

Thank You!

Yannan i run_final_tallerratio

Technology

Transcript of Yannan i run_final_tallerratio