Skip navigation
Skip navigation

Control of Formations with Non-rigid and Hybrid Graphs

Hou, Yun

Description

This thesis studies the problem of control of multi-agent formations, of which the interaction architectures can be modeled by undirected and directed graphs or a mixture of the two (hybrid graphs). The algorithms proposed in this thesis can be applied to control the architectures of multi-agent systems or sensor networks, and the developed control laws can be employed in the autonomous agents of various types within multi-agent systems. This thesis...[Show more]

dc.contributor.authorHou, Yun
dc.date.accessioned2016-11-30T22:27:44Z
dc.identifier.otherb40393628
dc.identifier.urihttp://hdl.handle.net/1885/110870
dc.description.abstractThis thesis studies the problem of control of multi-agent formations, of which the interaction architectures can be modeled by undirected and directed graphs or a mixture of the two (hybrid graphs). The algorithms proposed in this thesis can be applied to control the architectures of multi-agent systems or sensor networks, and the developed control laws can be employed in the autonomous agents of various types within multi-agent systems. This thesis discusses two major issues. The first tackles formations with undirected and directed underlying graphs, more specifically, the problems of rigidity restoration and persistence verification for multi-agent formations are studied. The second discusses the control of formations with both undirected and directed interaction architectures (hybrid formations) by distance-based control methods. The main contributions of this thesis are: definition of spindle agent and basic graphs for non-rigid undirected graphs, development of new operations for the constructions of undirected and directed graphs, design of graph rigidity restoration strategy by merging two or more non-rigid graphs, development of new persistence analysis strategy for arbitrary directed graphs, definition and investigation of hybrid formations and the underlying hybrid graphs, verification of persistence and minimal persistence for hybrid graphs, as well as the control of persistent hybrid formations by distance-based approaches.
dc.language.isoen
dc.subjectformation control
dc.subjectgraph rigidity
dc.subjecthybrid graph
dc.titleControl of Formations with Non-rigid and Hybrid Graphs
dc.typeThesis (PhD)
local.contributor.supervisorYu, Brad(Changbin)
local.contributor.supervisorcontactbrad.yu@anu.edu.au
dcterms.valid2016
local.description.notesauthor deposited 1/12/2016
local.type.degreeDoctor of Philosophy (PhD)
dc.date.issued2016
local.contributor.affiliationResearch School of Information Science and Engineering, The Australian National University
local.identifier.doi10.25911/5d763514363ca
dc.provenance6.2.2020 - Made open access after no response to emails re: extending restriction.
local.mintdoimint
CollectionsOpen Access Theses

Download

File Description SizeFormat Image
Hou Thesis 2016.pdf10.77 MBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator