Show simple item record

dc.contributor.advisorKoziol, Scott M.
dc.creatorGarvey, Sean E., 1992-
dc.date.accessioned2016-09-01T13:42:06Z
dc.date.available2016-09-01T13:42:06Z
dc.date.created2016-08
dc.date.issued2016-05-31
dc.date.submittedAugust 2016
dc.identifier.urihttp://hdl.handle.net/2104/9817
dc.description.abstractPath planning is a principle component of research in the field of robotics. The purpose of any path planning method is to successfully determine an efficient path that navigates an environment while avoiding various obstacles. Typically, path planning algorithms are developed using digital or computer based systems. Some of the more traditional techniques, such as Breadth First Search (BFS) and A*, are foundational to many methods used in this field. Recently, path planning methods have expanded to include analog circuits in at least part of the solution process. This thesis presents a new path planning technique, the Phase Delay Method, that uses an analog grid environment for its path planning. Results will show that as the solution length increases, this solution method outperforms digital solutions in terms of time and memory performance and will work with larger grids than other analog path planning methods.
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectPath planning. Robotics. Analog circuits.
dc.titleRobotic path planning solution using phase delay in analog circuits.
dc.typeThesis
dc.rights.accessrightsWorldwide access.
dc.rights.accessrightsAccess changed 1/7/2019.
dc.type.materialtext
thesis.degree.nameM.S.E.C.E.
thesis.degree.departmentBaylor University. Dept. of Electrical & Computer Engineering.
thesis.degree.grantorBaylor University
thesis.degree.levelMasters
dc.date.updated2016-09-01T13:42:06Z
local.embargo.lift2018-08-01
local.embargo.terms2018-08-01


Files in this item

Thumbnail
Thumbnail


This item appears in the following Collection(s)

Show simple item record