z-logo
Premium
Bounded Consensus Algorithms for Multi‐Agent Systems in Directed Networks
Author(s) -
Du Haibo,
Li Shihua,
Ding Shihong
Publication year - 2013
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.533
Subject(s) - bounded function , nonlinear system , multi agent system , consensus , saturation (graph theory) , control theory (sociology) , consensus algorithm , computer science , mathematics , algorithm , mathematical optimization , control (management) , artificial intelligence , mathematical analysis , physics , quantum mechanics , combinatorics
In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here