Mean-square consensus of hybrid multi-agent systems with noise and nonlinear terms over jointly connected topologies |
| |
| Institution: | 1. Key Laboratory of Intelligent Analysis and Decision on Complex Systems, School of Science, Chongqing University of Posts and Telecommunications, Chongqing, PR China;2. Key Laboratory of Intelligent Air-Ground Cooperative Control for Universities in Chongqing, College of Automation, Chongqing University of Posts and Telecommunications, Chongqing, PR China;3. Department of Complexity Science, Potsdam Institute for Climate Impact Research, Potsdam, Germany;4. Institute of Physics, Humboldt University of Berlin, Berlin, Germany;1. Dynamic Systems and Simulation Laboratory, Technical University of Crete, Chania, 73100, Greece;2. Dept. of Mathematics, National Technical University of Athens, Zografou Campus, 15780, Athens, Greece;3. Faculty of Maritime and Transportation, Ningbo University, Ningbo, China;1. LAJ Laboratory, University of Jijel, Algeria;2. Université Paris-Saclay, Univ Evry, IBISC, Evry 91020, France;1. Department of State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, 110819, China;2. School of Electronic Electrical and Communication Engineering, University of Chinese Academy of Sciences, Beijing, 101408, China;3. Qiqihar Heavy CNC Equipment Corp., Ltd., Qiqihar, 161000, China;1. Department of Intelligent Mechatronics Engineering and Convergence Engineering for Intelligent Drone, Sejong University, Seoul 05006, South Korea;2. Department of Mathematics and Algorithms Research, Nokia Bell Labs, Murray Hill NJ 07974, USA |
| |
| Abstract: | This paper studies the mean-square consensus of second-order hybrid multi-agent systems over jointly connected topologies. Systems with time-varying delay and multiplicative noise are considered. The date sampling control technique is adopted. Through matrix transformation, a positive definite matrix transformed by the Laplacian matrix is obtained, where the Laplacian matrix is a connected subgraph divided by the jointly connected topologies. By using graph theory, matrix theory and Lyapunov stability theory, sufficient conditions and the upper bound of time delays for the mean-square consensus are obtained. Finally, several simulations are presented to demonstrate the validity of the control method. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
