Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Bottom-up motion and task coordination for loosely-coupled multi-agent systems with dependent local tasks
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-4562-854X
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7309-8086
2015 (English)In: IEEE International Conference on Automation Science and Engineering, IEEE , 2015, 348-355 p.Conference paper, Published paper (Refereed)
Resource type
Text
Abstract [en]

We propose a bottom-up motion and task coordination scheme for loosely-coupled multi-agent systems under dependent local tasks. Instead of defining a global task for the whole team, each agent is assigned locally a task as syntactically co-safe linear temporal logic formulas that specify both motion and action requirements. Inter-agent dependency is introduced by collaborative actions of which the execution requires multiple agents' collaboration. The proposed solution contains an offline initial plan synthesis, an on-line request-reply messages exchange and a real-time plan adaptation algorithm. It is distributed in that any decision is made locally based on local computation and local communication within neighboring agents. It is scalable and resilient to agent failures as the dependency is formed and removed dynamically based on the plan execution status and agent capabilities, instead of pre-assigned agent identities. The overall scheme is demonstrated by a simulated scenario.

Place, publisher, year, edition, pages
IEEE , 2015. 348-355 p.
Keyword [en]
Automation, Computation theory, Distributed computer systems, Linear temporal logic, Local communications, Local computation, Loosely coupled, Multiple agents, Plan adaptation, Plan synthesis, Task coordination, Multi agent systems
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-181138DOI: 10.1109/CoASE.2015.7294103ISI: 000380453000056Scopus ID: 2-s2.0-84952776941ISBN: 9781467381833 (print)OAI: oai:DiVA.org:kth-181138DiVA: diva2:901649
Conference
11th IEEE International Conference on Automation Science and Engineering, CASE 2015, 24 August 2015 through 28 August 2015
Note

QC 20160208

Available from: 2016-02-08 Created: 2016-01-29 Last updated: 2016-08-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Guo, MengDimarogonas, Dimos V.
By organisation
Automatic ControlCentre for Autonomous Systems, CASACCESS Linnaeus Centre
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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