M. Ahmadzadeh, M. Ahmadi, Mina Babahaji, I. Sharifi
{"title":"面对智能攻击的交换网络双积分器系统的弹性共识","authors":"M. Ahmadzadeh, M. Ahmadi, Mina Babahaji, I. Sharifi","doi":"10.1109/ICRoM48714.2019.9071915","DOIUrl":null,"url":null,"abstract":"In this paper, an algorithm is considered for the double integrator multi-agent system to achieve consensus resiliently. Considering the stable control of the system in presence of malicious attack is called resilient control. The network graph is varying in this paper, and the malicious node is smart as meaning that its position is changing between the minimum and maximum value. It is presumed that we know how many malicious nodes is in vicinity of each node and its number is limited. The smart node which wants to damage network, oscillate between the minimum and maximum value of the position, so, W-MSR algorithm on the position is not able to determine malicious node and isolate it. This paper utilizes velocity instead of using position so, the modified version of W-MSR called MW-MSR is proposed. Finally, it is provided some numerical simulations to show the performance and efficiency of the theoretical results.","PeriodicalId":191113,"journal":{"name":"2019 7th International Conference on Robotics and Mechatronics (ICRoM)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Resilient Consensus in Double-Integrator Systems with Switching Networks Facing Smart Attacks\",\"authors\":\"M. Ahmadzadeh, M. Ahmadi, Mina Babahaji, I. Sharifi\",\"doi\":\"10.1109/ICRoM48714.2019.9071915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an algorithm is considered for the double integrator multi-agent system to achieve consensus resiliently. Considering the stable control of the system in presence of malicious attack is called resilient control. The network graph is varying in this paper, and the malicious node is smart as meaning that its position is changing between the minimum and maximum value. It is presumed that we know how many malicious nodes is in vicinity of each node and its number is limited. The smart node which wants to damage network, oscillate between the minimum and maximum value of the position, so, W-MSR algorithm on the position is not able to determine malicious node and isolate it. This paper utilizes velocity instead of using position so, the modified version of W-MSR called MW-MSR is proposed. Finally, it is provided some numerical simulations to show the performance and efficiency of the theoretical results.\",\"PeriodicalId\":191113,\"journal\":{\"name\":\"2019 7th International Conference on Robotics and Mechatronics (ICRoM)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 7th International Conference on Robotics and Mechatronics (ICRoM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRoM48714.2019.9071915\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 7th International Conference on Robotics and Mechatronics (ICRoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRoM48714.2019.9071915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Resilient Consensus in Double-Integrator Systems with Switching Networks Facing Smart Attacks
In this paper, an algorithm is considered for the double integrator multi-agent system to achieve consensus resiliently. Considering the stable control of the system in presence of malicious attack is called resilient control. The network graph is varying in this paper, and the malicious node is smart as meaning that its position is changing between the minimum and maximum value. It is presumed that we know how many malicious nodes is in vicinity of each node and its number is limited. The smart node which wants to damage network, oscillate between the minimum and maximum value of the position, so, W-MSR algorithm on the position is not able to determine malicious node and isolate it. This paper utilizes velocity instead of using position so, the modified version of W-MSR called MW-MSR is proposed. Finally, it is provided some numerical simulations to show the performance and efficiency of the theoretical results.