Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Formation control of non-identical multi-agent systems

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 3 (2022)

DOI
10.11591/ijece.v12i3.pp2721-2732
ISSN
2722-2578, 2088-8708
Published
2022-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The problem considered in this work is formation control for non-identical linear multi-agent systems (MASs) under a time-varying communication network. The size of the formation is scalable via a scaling factor determined by a leader agent. Past works on scalable formation are limited to identical agents under a fixed communication network. In addition, the formation scaling variable is updated under a leader-follower network. Differently, this work considers a leaderless undirected network in addition to a leader-follower network to update the formation scaling variable. The control law to achieve scalable formation is based on the internal model principle and consensus algorithm. A biased reference output, updated in a distributed manner, is introduced such that each agent tracks a different reference output. Numerical examples show the effectiveness of the proposed method.

Collaboration network of the authors

6 authors · 9 co-authorship links · 3 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Sampoerna University
  • Bandung Institute of Technology
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Kushendarsyah SaptajiSampoerna University1
Fijai Naja AzmiSampoerna University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 1 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Formation control of non-identical multi-agent systems</dc:title><dc:creator>Djamari, Djati Wibowo</dc:creator><dc:creator>Fikri, Muhamad Rausyan</dc:creator><dc:creator>Budiman, Bentang Arief</dc:creator><dc:creator>Triawan, Farid</dc:creator><dc:description>&lt;jats:p&gt;The problem considered in this work is formation control for non-identical linear multi-agent systems (MASs) under a time-varying communication network. The size of the formation is scalable via a scaling factor determined by a leader agent. Past works on scalable formation are limited to identical agents under a fixed communication network. In addition, the formation scaling variable is updated under a leader-follower network. Differently, this work considers a leaderless undirected network in addition to a leader-follower network to update the formation scaling variable. The control law to achieve scalable formation is based on the internal model principle and consensus algorithm. A biased reference output, updated in a distributed manner, is introduced such that each agent tracks a different reference output. Numerical examples show the effectiveness of the proposed method.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i3.pp2721-2732</dc:identifier><dc:identifier>10.11591/ijece.v12i3.pp2721-2732</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 3 (2022); 2721</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/26023/15650</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>