Consensus of One-Sided Lipschitz Multiagents under Switching Topologies

Muhammad Ahsan Razaq; Muhammad Rehan; Choon Ki Ahn; Abdul Qayyum Khan; Muhammad Tufail

doi:10.1109/TSMC.2019.2897775

Consensus of One-Sided Lipschitz Multiagents under Switching Topologies

Muhammad Ahsan Razaq, Muhammad Rehan, Choon Ki Ahn, Abdul Qayyum Khan, Muhammad Tufail

Research output: Contribution to journal › Article › peer-review

50 Citations (Scopus)

Abstract

This paper considers the leader-following consensus of multiagents with one-sided Lipschitz nonlinear dynamics by considering switching topologies. For the suitable selection of the consensus control gain matrix and coupling weight, a new condition for consensus is achieved for switching communication links with a directed spanning tree in the topology by constraining the dwell time. Employing a communication restoration mechanism allows a method to be obtained for the case in which a topology violates a permanent directed spanning tree. Computationally straightforward consensus controller design conditions that are necessary and sufficient for the former conditions are also developed for both cases. These simpler conditions can be used to obtain consensus protocol gains directly through convex routines. An algorithm is also provided to solve nonlinear constraints using the cone complementary linearization approach by considering a nonlinear objective function optimization problem. A numerical simulation is provided for multiagents that demonstrates the proposed control schemes' efficiency.

Original language	English
Article number	8666133
Pages (from-to)	1485-1495
Number of pages	11
Journal	IEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume	51
Issue number	3
DOIs	https://doi.org/10.1109/TSMC.2019.2897775
Publication status	Published - 2021 Mar

Bibliographical note

Funding Information:
Manuscript received September 13, 2018; revised November 30, 2018; accepted January 20, 2019. Date of publication March 12, 2019; date of current version February 17, 2021. This work was supported in part by the National Research Foundation of Korea through the Ministry of Science, ICT and Future Planning under Grant NRF-2017R1A1A1A05001325, and in part by the Brain Korea 21 Plus Project in 2019. This paper was recommended by Associate Editor Z.-G. Wu. (Corresponding authors: Muhammad Rehan; Choon Ki Ahn.) M. A. Razaq, M. Rehan, A. Q. Khan, and M. Tufail are with the Department of Electrical Engineering, Pakistan Institute of Engineering and Applied Sciences, Islamabad 45650, Pakistan (e-mail: [email protected]; [email protected]; [email protected]; [email protected]).

Publisher Copyright:
© 2013 IEEE.

Keywords

Leader-following consensus
multiagents
one-sided Lipschitz systems
switching topology

ASJC Scopus subject areas

Software
Control and Systems Engineering
Human-Computer Interaction
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/TSMC.2019.2897775

Cite this

@article{30234b823f32449a9b98635e381707ef,

title = "Consensus of One-Sided Lipschitz Multiagents under Switching Topologies",

abstract = "This paper considers the leader-following consensus of multiagents with one-sided Lipschitz nonlinear dynamics by considering switching topologies. For the suitable selection of the consensus control gain matrix and coupling weight, a new condition for consensus is achieved for switching communication links with a directed spanning tree in the topology by constraining the dwell time. Employing a communication restoration mechanism allows a method to be obtained for the case in which a topology violates a permanent directed spanning tree. Computationally straightforward consensus controller design conditions that are necessary and sufficient for the former conditions are also developed for both cases. These simpler conditions can be used to obtain consensus protocol gains directly through convex routines. An algorithm is also provided to solve nonlinear constraints using the cone complementary linearization approach by considering a nonlinear objective function optimization problem. A numerical simulation is provided for multiagents that demonstrates the proposed control schemes' efficiency. ",

keywords = "Leader-following consensus, multiagents, one-sided Lipschitz systems, switching topology",

author = "Razaq, {Muhammad Ahsan} and Muhammad Rehan and Ahn, {Choon Ki} and Khan, {Abdul Qayyum} and Muhammad Tufail",

note = "Funding Information: Manuscript received September 13, 2018; revised November 30, 2018; accepted January 20, 2019. Date of publication March 12, 2019; date of current version February 17, 2021. This work was supported in part by the National Research Foundation of Korea through the Ministry of Science, ICT and Future Planning under Grant NRF-2017R1A1A1A05001325, and in part by the Brain Korea 21 Plus Project in 2019. This paper was recommended by Associate Editor Z.-G. Wu. (Corresponding authors: Muhammad Rehan; Choon Ki Ahn.) M. A. Razaq, M. Rehan, A. Q. Khan, and M. Tufail are with the Department of Electrical Engineering, Pakistan Institute of Engineering and Applied Sciences, Islamabad 45650, Pakistan (e-mail: [email protected]; [email protected]; [email protected]; [email protected]). Publisher Copyright: {\textcopyright} 2013 IEEE.",

year = "2021",

month = mar,

doi = "10.1109/TSMC.2019.2897775",

language = "English",

volume = "51",

pages = "1485--1495",

journal = "IEEE Transactions on Systems, Man, and Cybernetics: Systems",

issn = "2168-2216",

publisher = "IEEE Advancing Technology for Humanity",

number = "3",

}

TY - JOUR

T1 - Consensus of One-Sided Lipschitz Multiagents under Switching Topologies

AU - Razaq, Muhammad Ahsan

AU - Rehan, Muhammad

AU - Ahn, Choon Ki

AU - Khan, Abdul Qayyum

AU - Tufail, Muhammad

N1 - Funding Information: Manuscript received September 13, 2018; revised November 30, 2018; accepted January 20, 2019. Date of publication March 12, 2019; date of current version February 17, 2021. This work was supported in part by the National Research Foundation of Korea through the Ministry of Science, ICT and Future Planning under Grant NRF-2017R1A1A1A05001325, and in part by the Brain Korea 21 Plus Project in 2019. This paper was recommended by Associate Editor Z.-G. Wu. (Corresponding authors: Muhammad Rehan; Choon Ki Ahn.) M. A. Razaq, M. Rehan, A. Q. Khan, and M. Tufail are with the Department of Electrical Engineering, Pakistan Institute of Engineering and Applied Sciences, Islamabad 45650, Pakistan (e-mail: [email protected]; [email protected]; [email protected]; [email protected]). Publisher Copyright: © 2013 IEEE.

PY - 2021/3

Y1 - 2021/3

N2 - This paper considers the leader-following consensus of multiagents with one-sided Lipschitz nonlinear dynamics by considering switching topologies. For the suitable selection of the consensus control gain matrix and coupling weight, a new condition for consensus is achieved for switching communication links with a directed spanning tree in the topology by constraining the dwell time. Employing a communication restoration mechanism allows a method to be obtained for the case in which a topology violates a permanent directed spanning tree. Computationally straightforward consensus controller design conditions that are necessary and sufficient for the former conditions are also developed for both cases. These simpler conditions can be used to obtain consensus protocol gains directly through convex routines. An algorithm is also provided to solve nonlinear constraints using the cone complementary linearization approach by considering a nonlinear objective function optimization problem. A numerical simulation is provided for multiagents that demonstrates the proposed control schemes' efficiency.

AB - This paper considers the leader-following consensus of multiagents with one-sided Lipschitz nonlinear dynamics by considering switching topologies. For the suitable selection of the consensus control gain matrix and coupling weight, a new condition for consensus is achieved for switching communication links with a directed spanning tree in the topology by constraining the dwell time. Employing a communication restoration mechanism allows a method to be obtained for the case in which a topology violates a permanent directed spanning tree. Computationally straightforward consensus controller design conditions that are necessary and sufficient for the former conditions are also developed for both cases. These simpler conditions can be used to obtain consensus protocol gains directly through convex routines. An algorithm is also provided to solve nonlinear constraints using the cone complementary linearization approach by considering a nonlinear objective function optimization problem. A numerical simulation is provided for multiagents that demonstrates the proposed control schemes' efficiency.

KW - Leader-following consensus

KW - multiagents

KW - one-sided Lipschitz systems

KW - switching topology

UR - http://www.scopus.com/inward/record.url?scp=85101148107&partnerID=8YFLogxK

U2 - 10.1109/TSMC.2019.2897775

DO - 10.1109/TSMC.2019.2897775

M3 - Article

AN - SCOPUS:85101148107

SN - 2168-2216

VL - 51

SP - 1485

EP - 1495

JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems

JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems

IS - 3

M1 - 8666133

ER -

Consensus of One-Sided Lipschitz Multiagents under Switching Topologies

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this