H bipartite consensus of nonlinear multi-agent systems over a directed signed graph with a leader of non-zero input

Amina Shams, Muhammad Rehan*, Muhammad Tufail

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

This paper examines the bipartite tracking consensus for nonlinear multi-agents over a directed signed graph under (Formula presented.) bounded disturbances and a non-zero bounded input of the leader. For dealing with disturbances, the (Formula presented.) control theory has been adopted to develop a robust bipartite tracking consensus protocol. An additional switching control action is proposed to counteract the bounded matching input of the leader. The proposed control ensures the asymptotic convergence of the consensus error for known matching bounded input at the leader without disturbances, and an (Formula presented.) performance criterion from bounded disturbances to the consensus error has been provided. Contrary to the traditional consensus frameworks, our approach considers the nonlinear agents to resolve the bipartite consensus, (Formula presented.) disturbances for a robust distributed control, directed signed graphs, and bounded non-zero input at the leader for dealing with a realistic consensus scenario. Two simulation examples are provided for illustration.

Original languageEnglish
Pages (from-to)1944-1958
Number of pages15
JournalInternational Journal of Control
Volume95
Issue number7
DOIs
StatePublished - 2022
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2021 Informa UK Limited, trading as Taylor & Francis Group.

Keywords

  • Bipartite tracking consensus
  • external disturbances
  • leader with non-zero input
  • nonlinear multi-agents
  • robust control
  • signed graphs

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'H bipartite consensus of nonlinear multi-agent systems over a directed signed graph with a leader of non-zero input'. Together they form a unique fingerprint.

Cite this