Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cooperative Planning Control and Formation Control of Multi-Agent Systems
KTH, School of Electrical Engineering (EES), Automatic Control.
2017 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Cooperative planning control is an active topic of research, with many practical applications including multi-robot systems, transportation, multi-point surveillance and biological systems. The contributions of this thesis lie in the scope of three topics: formation control, time-constrained cooperative planning control and probabilistic control synthesis, all of the them in the framework of multi-agent systems.

In the first part of the thesis, given a team of rigid-bodies, we propose decentral-ized control protocols such that desired position and orientation-based formationbetween neighboring agents is achieved. Inter-agent collisions and collisions betweenagents and static obstacles of the workspace are guaranteed to be avoided by theproposed control scheme. Furthermore, the connectivity between the agents thatare initially connected is preserved. In the second part of the thesis, we considera team of agents, modeled by coupled single-integrator dynamics. Each agent isassigned with individual high-level tasks, given in Metric Interval Temporal Logic(MITL). By abstracting the motion of each agent into Transition Systems (TS), wepropose decentralized control methodologies that guarantee the satisfaction of thedesired tasks of each agent. In the final part, a coupled multi-agent system underthe presence of uncertainties and model errors is considered. Each agent is modeledby a Markov Decision Process (MDP) and is assigned with a high-level task givenin Probabilistic Computational Tree Logic (PCTL). The goal is to design controlpolicies such that each agent is performing a desired task. By clustering the agentsinto dependency clusters, we propose control algorithms that guarantee that thedesired specifications are fulfilled. Numerical simulations conducted in MATLABverify the claimed results.

Place, publisher, year, edition, pages
Kungliga Tekniska högskolan, 2017. , p. 120
Series
TRITA-EE, ISSN 1653-5146
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-206998ISBN: 978-91-7729-420-7 (print)OAI: oai:DiVA.org:kth-206998DiVA, id: diva2:1094985
Presentation
2017-06-02, 10:00 (English)
Opponent
Supervisors
Note

QC 20170512

Available from: 2017-05-12 Created: 2017-05-11 Last updated: 2017-05-12Bibliographically approved

Open Access in DiVA

fulltext(1751 kB)216 downloads
File information
File name FULLTEXT01.pdfFile size 1751 kBChecksum SHA-512
0bf952e611edd149af1012194109122d3fad68f931c46f080fd108612c397c87d30866ea32fad8f2af3ac111a4744340a4742bc8fe06c1ec5a4dabe97cacc055
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Nikou, Alexandros
By organisation
Automatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 216 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 530 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf