Truman Yang
Software Systems
Maze solving algorithm is the search for an optimal path from a start location to a goal location in a maze. Maze solving algorithms are typically designed as a kind of graph search. Some are AI-based, such as Q-learning algorithms. Some are not, for example, A*, DFS, BFS, Dijacstra, etc. The performance of these algorithms is affected by several factors such as the maze size, path length, the number and distribution of obstacles. In this project, students will implement multiple maze solving and obstacle avoid algorithms using robot and evaluate their difference on performance.
The object of the project is to implement a few maze solving and obstacle avoid algorithms. The algorithms are compared by some criteria such as length of the found path, time for finding the path, etc. The results, presented analytically and graphically, show the application of different algorithms for mazes with various size and number of obstacles. In addition, improvement on these algorithms should be proposed and evaluated.
(1) Students’ design will be based on existing algorithms. Further improvement on design and performance evaluation are needed.
(2) Software development with Python should be efficient and effective.
(1) Literature review of maze solving and obstacle avoid algorithms will be conducted.
(2) Idea generation technique with SCAMPER.
(3) All functions from experiment should be detailed documented.
Familiar with existing algorithm. Design, implement, and test new algorithms as specified above.
Analyze and implement existing maze solving and obstacle avoid algorithms and implement them on the robot
Evaluate the performance of algorithms
Detail documentation of the project
Design and implement an App for demonstration
COE318: Software Systems
TY07: Autonomous maze solving and obstacle avoid algorithms | Truman Yang | Wednesday August 31st 2022 at 09:29 AM