Inspiration
We have cut through buildings while traveling on campus during severe rain and wondered if there was a simple way to calculate the most efficient route which maximized time spent indoors.
What it does
Returns the optimal path using A* (distance between start and end as the crow flies is the heuristic) between two points which maximizes time spent indoors.
How we built it
We created a graph where each node is an accessible door on campus and edges are weighted to minimize distance and maximize time indoors. Dry Router takes two points as input and adds them to the graph, then calculates the best route between them using A*.
Challenges we ran into
It took us four tries to get a mapping API working. After we had one, our synchronous, blocking API requests severely bottlenecked our program.
Accomplishments that we're proud of
Converting our walking distance calculator to an asynchronous function.
What we learned
Mapping is hard and async/await is incredible.
What's next for Dry Router
Create a nicer interface and turn-by-turn directions.
Built With
- graphhopper
- networkx
- python
Log in or sign up for Devpost to join the conversation.