Stability and Robustness Analysis of Finite-Time Consensus Algorithm for Second-Order Multiagent Systems Under Sampled-Data Control
The consensus problem for second-order multiagent systems based on nonsmooth sampled-data control is considered. First, a continuous-time nonsmooth consensus protocol is proposed, which can realize the consensus of systems in a finite time when the external disturbance is absent. Next, based on the...
Saved in:
| Published in | IEEE transactions on systems, man, and cybernetics. Systems Vol. 53; no. 3; pp. 1 - 8 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
IEEE
01.03.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2168-2216 2168-2232 |
| DOI | 10.1109/TSMC.2022.3199452 |
Cover
| Summary: | The consensus problem for second-order multiagent systems based on nonsmooth sampled-data control is considered. First, a continuous-time nonsmooth consensus protocol is proposed, which can realize the consensus of systems in a finite time when the external disturbance is absent. Next, based on the sampled data and the zero-order holder, a new discrete-time nonsmooth protocol is proposed. Considering external disturbances, the explicit relationship between the ultimate boundary of errors of any two agents and the sampling period and external disturbance is given with the Lyapunov method and graph theory, which theoretically shows that the nonsmooth control algorithm has a stronger ability to resist external disturbance than the smooth control algorithm. Finally, a simulation example shows the superiority of the nonsmooth consensus algorithm over a smooth consensus algorithm. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2168-2216 2168-2232 |
| DOI: | 10.1109/TSMC.2022.3199452 |