학술논문

Scaled Position Consensus of High-Order Uncertain Multiagent Systems Over Switching Directed Graphs
Document Type
Periodical
Author
Source
IEEE Transactions on Cybernetics IEEE Trans. Cybern. Cybernetics, IEEE Transactions on. 54(5):3093-3104 May, 2024
Subject
Signal Processing and Analysis
Communication, Networking and Broadcast Technologies
Robotics and Control Systems
General Topics for Engineers
Components, Circuits, Devices and Systems
Computing and Processing
Power, Energy and Industry Applications
Switches
Directed graphs
Uncertainty
Multi-agent systems
Heuristic algorithms
Control systems
Consensus algorithm
High-order multiagent systems
scaled position consensus
switching directed graphs
uncertainties
Language
ISSN
2168-2267
2168-2275
Abstract
We investigate the scaled position consensus of high-order multiagent systems with parametric uncertainties over switching directed graphs, where the agents’ position states reach a consensus value with different scales. The intricacy arises from the asymmetry inherent in information interaction. Achieving scaled position consensus in high-order multiagent systems over directed graphs remains a significant challenge, particularly when confronted with the following complex features: 1) uniformly jointly connected switching directed graphs; 2) complex agent dynamics with unknown inertias, unknown control directions, parametric uncertainties, and external disturbances; 3) interacting with each other via only relative scaled position information (without high-order derivatives of relative position); and 4) fully distributed in terms of no shared gains and no global gain dependency. To address these challenges, we propose a distributed adaptive algorithm based on a acrlong MRACon scheme, where a linear high-order reference model is designed for every individual agent employing relative scaled position information as input. A new transformation is proposed which converts the scaled position consensus of high-order linear reference models to that of first-order ones. Theoretical analysis is presented where agents’ positions achieve the scaled consensus over switching directed graphs. Numerical simulations are performed to validate the efficacy of our algorithm and some collective behaviors on traditional consensus, bipartite consensus, and cluster consensus are shown by precisely choosing the scales of the agents.