We realised after production of the video that a company in Latin America already uses the name CarCool. They offer a different service (industrial mobility solutions) than our proposed project (carpooling) but it is still quite sad. Unfortunately, we have no more time to switch the name.

We wanted to do something with complex algorithms, and this seemed like a perfect match between something actually useful and very nerdy.

It's a pathfinding algorithm that matches passengers with drivers such that their travel time is minimized.

How we built it

Challenges we ran into

Accomplishments that we're proud of

What we learned

What's next for LazyTown

Built With

Share this project:

Updates

posted an update

We have narrowed down the problem with our Dijkstra path finding to a problem in the data. So the path finding is well implemented it's just that we would have to clean up the data we got from Données Ouvertes first. We believe the data has a lot of discontinuities in intersections of roads. (A lot of unreachable nodes in the graph). This would stop it working on majority of attempts since roads are usually fully connected.

Log in or sign up for Devpost to join the conversation.