Masters Theses
Keywords and Phrases
Ant Colony Optimization (ACO); General Maze Problem; Neural Network; Path Planning
Abstract
Path planning is used in, but not limited to robotics, telemetry, aerospace, and medical applications. The goal of the path planning is to identify a route from an origination point to a destination point while avoiding obstacles. This path might not always be the shortest in distance as time, terrain, speed limits, and many other factors can affect the optimality of the path. However, in this thesis, the length, computational time, and the smoothness of the path are the only constraints that will be considered with the length of the path being the most important. There are a variety of algorithms that can be used for path planning but Ant Colony Optimization (ACO), Neural Network, and A* will be the only algorithms explored in this thesis. The problem of solving general mazes has been greatly researched, but the contributions of this thesis extended Ant Colony Optimization to path planning for mazes, created a new landscape for the Neural Network to use, and added a bird's eye view to the A* Algorithm. The Ant Colony Optimization that was used in this thesis was able to discover a path to the goal, but it was jagged and required a larger computational time compared to the Neural Network and A* algorithm discussed in this thesis. The Hopfield-type neural network used in this thesis propagated energy to create a landscape and used gradient decent to find the shortest path in terms of distance, but this thesis modified how the landscape was created to prevent the neural network from getting trapped in local minimas. The last contribution was applying a bird's eye view to the A* algorithm to learn more about the environment which helped to create shorter and smoother paths.
Advisor(s)
Kosbar, Kurt Louis
Committee Member(s)
Wunsch, Donald C.
Zawodniok, Maciej Jan, 1975-
Department(s)
Electrical and Computer Engineering
Degree Name
M.S. in Electrical Engineering
Publisher
Missouri University of Science and Technology
Publication Date
Fall 2012
Pagination
ix, 35 pages
Note about bibliography
Includes bibliographical references (page 31).
Rights
© 2012 Grant Gilbert Arthur River, All rights reserved.
Document Type
Thesis - Open Access
File Type
text
Language
English
Subject Headings
Mathematical optimizationAnt algorithmsAlgorithmsMaze tests
Thesis Number
T 10100
Electronic OCLC #
828860687
Recommended Citation
Rivera, Grant Gilbert Arthur, "Path planning for general mazes" (2012). Masters Theses. 6944.
https://scholarsmine.mst.edu/masters_theses/6944