{"title":"Iterative Learning Consensus for Discrete-time Multi-Agent Systems with Measurement Saturation and Random Noises","authors":"Chen Liu, D. Shen","doi":"10.1109/DDCLS.2018.8516009","DOIUrl":null,"url":null,"abstract":"This paper investigates the consensus tracking problem for a class of multi-agent systems with measurement saturation and random noises. A distributed iterative learning control algorithm is proposed by utilizing the input signals and the measured output information from previous iterations. The considered multi-agent systems have a fixed topology of the communication graph and the desired trajectory is only accessible to a subset of agents. With the help of a decreasing gain sequence, it is proved that the input sequence will converge to the desired one in an almost sure sense as the iteration number goes to infinity. Simulation results are given to verify the effectiveness of the proposed algorithm.","PeriodicalId":6565,"journal":{"name":"2018 IEEE 7th Data Driven Control and Learning Systems Conference (DDCLS)","volume":"26 1","pages":"50-55"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 7th Data Driven Control and Learning Systems Conference (DDCLS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DDCLS.2018.8516009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper investigates the consensus tracking problem for a class of multi-agent systems with measurement saturation and random noises. A distributed iterative learning control algorithm is proposed by utilizing the input signals and the measured output information from previous iterations. The considered multi-agent systems have a fixed topology of the communication graph and the desired trajectory is only accessible to a subset of agents. With the help of a decreasing gain sequence, it is proved that the input sequence will converge to the desired one in an almost sure sense as the iteration number goes to infinity. Simulation results are given to verify the effectiveness of the proposed algorithm.