A robot that maps a maze and finds the shortest path. An innovatory method of randomness is devised for mapping purpose and the map is stored in a 3-D character array. For finding the shortest path, concurrent Dijkstra's Algorithm or method of wavefronts is used. Hardware used is Atmega32 microcontroller.
-
Notifications
You must be signed in to change notification settings - Fork 0
shanks-d/maze_solver
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Labyrinth Challenge
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published