Show simple item record

dc.contributor.advisorChakravarthy, Animesh
dc.contributor.authorKhatiwada, Dipendra
dc.date.accessioned2017-02-16T20:06:02Z
dc.date.available2017-02-16T20:06:02Z
dc.date.issued2016-07
dc.identifier.othert16044
dc.identifier.urihttp://hdl.handle.net/10057/12869
dc.descriptionThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science
dc.description.abstractThis thesis provides a framework for a combined analysis of consensus algorithms for multi-agent systems that include the presence of obstacles and the presence of communication time delays. The consensus algorithms are based on Laplacian matrix theories and the collision avoidance algorithms are based on collision cone approach. We study and verify the conditions for all agents in a multi agent system to reach consensus with simultaneous collision avoidance using both analytical and graphical methods. The upper bound on the time delay with which consensus and collision avoidance can both be simultaneously achieved is evaluated for agents with different types of dynamics.
dc.format.extentx, 76
dc.language.isoen_US
dc.publisherWichita State University
dc.rightsCopyright 2016 by Dipendra Khatiwada
dc.subject.lcshElectronic thesis
dc.titleAnalysis of consensus and collision avoidance using the collision cone approach in the presence of time delays
dc.typeThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record