Hello,
I have been working on this project for the past month and have decided to open-source it here, as it may provide assistance and insights to other engineers. I would also appreciate any feedback, questions, or recommendations on how to improve the current model and approach.
The videos demonstrates path planning for a mobile wheeled robot using Dijkstra's and BFS algorithms. A UI element allows input of start and end nodes, as well as the percentage of obstacles. The Dijkstra algorithm finds the shortest path between the specified nodes, while the BFS algorithm performs a level-order traversal of all nodes in the generated graph.
Dijkstra: [youtube]https://youtu.be/_8gr4TjwNdU?si=fAvjh1OQLollrAoE[/youtube]
Breath First Search: [youtube]https://youtu.be/SW6ufd4bhbk?si=3ryKBaNrmkMwUmpw[/youtube]
Github for code: https://github.com/Humphery7/path_plann ... tion_robot