https://github.com/cbebe/driving-route-finder

An Arduino application that finds the shortest driving route using Dijkstra's Algorithm
https://github.com/cbebe/driving-route-finder

arduino dijkstra-shortest-path map

Last synced: 3 months ago
JSON representation

An Arduino application that finds the shortest driving route using Dijkstra's Algorithm

• Host: GitHub
• URL: https://github.com/cbebe/driving-route-finder
• Owner: cbebe
• Created: 2020-01-24T23:13:16.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2024-01-25T19:50:00.000Z (over 1 year ago)
• Last Synced: 2025-01-24T10:08:23.010Z (5 months ago)
• Topics: arduino, dijkstra-shortest-path, map
• Language: C++
• Homepage:
• Size: 16.6 MB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Driving Route Finder

![](graph.png)




Created by: [Charles Ancheta](https://github.com/cbebe) and [Poulomi Ganguly](https://github.com/poulomi-g)

An Arduino/CMPUT 275 VM application that finds the shortest driving route between two locations using Dijkstra's algorithm

## How it Works

The Arduino functions as a client that displays a map of Edmonton and prompts the user for start and end points. The client then sends the coordinates to the Ubuntu virtual machine server and finds the shortest route between the two coordinates. This is done using Dijkstra's Algorithm in a weighted graph of the city roads. The server then sends the waypoints one by one to the client who then prints out the path on the displayed map.

### Limitations

Due to memory constraints, the Arduino can only store up to 500 waypoints. The route may not be displayed if it is a long path with many turns and curves.

[Download Link for CMPUT 274/275 VMWare Ubuntu Virtual Machine](https://drive.google.com/file/d/1D0Kh16pOu5PJLu1d-Ff9V2u6g6mYQT2j/view?usp=sharing)