{"title":"一阶多智能体系统的离散有限时间一致性算法","authors":"Yuping He, Shijie Zhang, Weijian Zhang, Weile Chen","doi":"10.1109/IAI53119.2021.9619391","DOIUrl":null,"url":null,"abstract":"A new consensus problem of first-order leaderless multi-agent systems with external disturbance is presented. The proposed consensus algorithm, based on sampled data, combines data-sample control with finite-time theory. The new discrete-time finite-time (DTFT) consensus algorithm enables the consensus errors of agents converge to a small region within a limited time due to the robustness and fast convergence ability of finite time theory. Simulation results verify the effectiveness of the proposed method.","PeriodicalId":106675,"journal":{"name":"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Discrete-time finite-time consensus algorithm for first-order multi-agent systems\",\"authors\":\"Yuping He, Shijie Zhang, Weijian Zhang, Weile Chen\",\"doi\":\"10.1109/IAI53119.2021.9619391\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new consensus problem of first-order leaderless multi-agent systems with external disturbance is presented. The proposed consensus algorithm, based on sampled data, combines data-sample control with finite-time theory. The new discrete-time finite-time (DTFT) consensus algorithm enables the consensus errors of agents converge to a small region within a limited time due to the robustness and fast convergence ability of finite time theory. Simulation results verify the effectiveness of the proposed method.\",\"PeriodicalId\":106675,\"journal\":{\"name\":\"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAI53119.2021.9619391\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAI53119.2021.9619391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discrete-time finite-time consensus algorithm for first-order multi-agent systems
A new consensus problem of first-order leaderless multi-agent systems with external disturbance is presented. The proposed consensus algorithm, based on sampled data, combines data-sample control with finite-time theory. The new discrete-time finite-time (DTFT) consensus algorithm enables the consensus errors of agents converge to a small region within a limited time due to the robustness and fast convergence ability of finite time theory. Simulation results verify the effectiveness of the proposed method.