Inspiration
I came to this hackathon in order to finish an assignment for research.
What it does
The algorithm is meant to solve an exponential graph that plots all possible states of a car over an interval of time for shortest path.
How I built it
Going into the hackathon I had an algorithm that created a semi-optimized graph and solved it using Dijkstras, but it took far too long. I optimized the algorithm and used A-star instead of Dijkstra's.
Challenges I ran into
Although I optimized the graph for large time intervals the algorithm is still too slow.
Accomplishments that I'm proud of
Going into the hackathon my algorithm didn't finish for a 20 second interval- now it finishes in under 20 seconds for a 70 second interval.
What I learned
I learned how to use A* in place of Dijkstra's.
Log in or sign up for Devpost to join the conversation.