Tracking control problem in multiagent systems with Lipschitz nonlinearities and external disturbances

Jenabzadeh, Ahmadreza; Safarinejadian, Behrouz

doi:10.1177/0142331218771147

Cited by 10 publications

(5 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Remark 4: The consensus algorithm in Theorem 1 is designed to achieve the sign-consensus for nonlinear multi-agents over a signed graph. It is worth noting that the problem developed is advantageous in two aspects with respect to the conventional consensus methods for Lipschitz systems (Agha et al, 2017; Jenabzadeh and Safarinejadian, 2019; Rehman et al, 2018; Wen et al, 2013; Wang et al, 2017). First, the sign-consensus can be achieved even if a conventional unsigned graph is employed rather than a signed graph.…”

Section: Resultsmentioning

confidence: 99%

Adaptive fully-distributed sign-consensus control approach for nonlinear multi-agent systems over a signed graph

Shams

Rehan

Tufail

et al. 2021

Transactions of the Institute of Measurement and Control

View full text Add to dashboard Cite

In this paper, the notion of sign-consensus for the Lipschitz nonlinear multi-agents over a signed graph is introduced and controller design conditions are provided for realizing consensus among signs of states of agents. The previous works on sign-consensus are limited to the linear systems only. The attainment of sign-consensus for the nonlinear multi-agent systems is a non-trivial control problem, for which Lipschitz nonlinear dynamics are reformulated using the linear parameter varying (LPV) transformation. To guarantee the sign-consensus in a network of multiple agents, fully-distributed adaptive protocol is applied using reformulated Lipschitz nonlinear dynamics, and two design conditions are provided based on the Lipschitz constant oriented and LPV-based approaches. The first approach is comparatively less computationally complex while LPV approach holds significance for developing less conservative sign-consensus control scheme. To the best of our knowledge, distributed sign consensus methods for Lipschitz systems, based on LPV formulation, have been analyzed for the first time. The proposed approach is adaptive and can be regarded as fully-distributed, as it does not require the central knowledge of graph properties. Further, results are extended for nonlinear systems undergoing disturbances and ultimate boundedness of sign-consensus error is guaranteed. Numerical simulations on groups of Chua’s circuits and mechanical oscillators are presented to validate the results.

show abstract

Section: Resultsmentioning

confidence: 99%

Adaptive fully-distributed sign-consensus control approach for nonlinear multi-agent systems over a signed graph

Shams

Rehan

Tufail

et al. 2021

Transactions of the Institute of Measurement and Control

View full text Add to dashboard Cite

show abstract

“…The synchronization problem is a widespread problem in the research field of MASs, and its task is to design a controller, which guarantees that all agents can converge to a certain state synchronously (Cao et al, 2023; Tan and Zhou, 2019; Zhai et al, 2023). Generally speaking, there exists local information interaction among each agent and its neighbors (Jenabzadeh and Safarinejadian, 2019; Liang et al, 2023a). Through this local information sharing, the distributed control strategy can achieve global synchronization.…”

Section: Introductionmentioning

confidence: 99%

Security bipartite synchronization of MASs resilient to DoS attacks

Chang,

Liang,

Cao

2023

Transactions of the Institute of Measurement and Control

View full text Add to dashboard Cite

This paper considers the security bipartite synchronization problem of nonlinear multi-agent systems (MASs) under the impact of denial-of-service (DoS) attacks. Notice that malicious attackers may block the neighbor information transmission among agents, which will reduce the efficiency of the distributed control strategy and even paralyze the entire system. In order to eliminate the impact of DoS attacks on the stability of MASs, this paper represents the first attempt to solve the security bipartite synchronization problem with the help of a distributed leader state observer. An observer that can obtain the leader state estimation is established, and the control strategy constructed based on the observer can eliminate the impact of DoS attacks. Theoretical analysis shows that the control strategy proposed in this paper can realize the security bipartite synchronization of the system under the impact of DoS attacks. The validity of the proposed results is verified by several presented simulation results.

show abstract

“…Robustness is a critical criterion to evaluate whether the designed controller could maintain the desired performances under a wide range of perturbations (Ren and Yu, 2016). Until now, many researches have been reported on the robust consensus problem of multiagent systems with external disturbances, see, for example, Popov and Werner (2012), Wang and Yang (2016), Yu et al (2018, 2017), and Jenabzadeh and Safarinejadian (2019). The distributed H ∞ consensus problem was investigated in Wang and Yang (2016), where sufficient conditions for deriving the control protocol were given by a set of linear matrix inequalities (LMIs).…”

Section: Introductionmentioning

confidence: 99%

Robust secure consensus of multiagent systems with DoS attacks

Yan

Qiao

2022

Transactions of the Institute of Measurement and Control

View full text Add to dashboard Cite

The secure consensus problem of multiagent systems with fixed topology and external disturbances is investigated in this paper. Along with external disturbances, the studied multiagent system is also subjected to denial-of-service (DoS) attacks. First, some graph-based Lyapunov functions are presented for the robust consensus analysis. Second, the duration and attack frequency are introduced to quantitatively analyze the DoS attacks’ effects on the consensus. Third, the gain of the controller is acquired by solving an algebraic Riccati equation (ARE), which can always be guaranteed compared with solving linear matrix inequalities (LMIs). Finally, a numerical simulation of a microgrid test system is provided to demonstrate the effectiveness of the proposed strategy.

show abstract

Tracking control problem in multiagent systems with Lipschitz nonlinearities and external disturbances

Cited by 10 publications

References 40 publications

Adaptive fully-distributed sign-consensus control approach for nonlinear multi-agent systems over a signed graph

Adaptive fully-distributed sign-consensus control approach for nonlinear multi-agent systems over a signed graph

Security bipartite synchronization of MASs resilient to DoS attacks

Robust secure consensus of multiagent systems with DoS attacks

Contact Info

Product

Resources

About