{"title":"Scaled Position Consensus of High-Order Uncertain Multiagent Systems Over Switching Directed Graphs","authors":"Jie Mei;Kaixin Tian;Guangfu Ma","doi":"10.1109/TCYB.2023.3312696","DOIUrl":null,"url":null,"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.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 5","pages":"3093-3104"},"PeriodicalIF":9.4000,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cybernetics","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10283950/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
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.
期刊介绍:
The scope of the IEEE Transactions on Cybernetics includes computational approaches to the field of cybernetics. Specifically, the transactions welcomes papers on communication and control across machines or machine, human, and organizations. The scope includes such areas as computational intelligence, computer vision, neural networks, genetic algorithms, machine learning, fuzzy systems, cognitive systems, decision making, and robotics, to the extent that they contribute to the theme of cybernetics or demonstrate an application of cybernetics principles.