Assessment of stability of algorithms based on trust and reputation model

I. Viksnin, R. Iureva, I. Komarov, A. L. Drannik
{"title":"Assessment of stability of algorithms based on trust and reputation model","authors":"I. Viksnin, R. Iureva, I. Komarov, A. L. Drannik","doi":"10.1109/FRUCT-ISPIT.2016.7561551","DOIUrl":null,"url":null,"abstract":"Swarm robotic systems are actively developed and widely studied in the world scientific practice. It is expected that multiagent, distributed approach to creating artificial intelligence of autonomous systems will allow to solve a great number of complex problems in the areas of environmental protection, medicine, cleaning, patrolling, etc. Thereby the research of these systems (design and testing) in terms of information security becomes relevant. The key to a wide practical use of swarm robotic systems is the development of specific guidelines and algorithms for the organization of group actions. This research proposes the use of trust and reputation model for information security of swarm system. Swarm's agents generate trust levels to each other basing on the analysis of situation on the kth iteration step of the algorithm and using their sensor devices. On the calculated trust levels the collective recognition of saboteurs is carried out. To perform experiment software simulator was designed. It allows to vaiy the basic parameters of swarm robotic system (number of agents, number of targets, range of communication, number of saboteurs).","PeriodicalId":309242,"journal":{"name":"2016 18th Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology (FRUCT-ISPIT)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology (FRUCT-ISPIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FRUCT-ISPIT.2016.7561551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Swarm robotic systems are actively developed and widely studied in the world scientific practice. It is expected that multiagent, distributed approach to creating artificial intelligence of autonomous systems will allow to solve a great number of complex problems in the areas of environmental protection, medicine, cleaning, patrolling, etc. Thereby the research of these systems (design and testing) in terms of information security becomes relevant. The key to a wide practical use of swarm robotic systems is the development of specific guidelines and algorithms for the organization of group actions. This research proposes the use of trust and reputation model for information security of swarm system. Swarm's agents generate trust levels to each other basing on the analysis of situation on the kth iteration step of the algorithm and using their sensor devices. On the calculated trust levels the collective recognition of saboteurs is carried out. To perform experiment software simulator was designed. It allows to vaiy the basic parameters of swarm robotic system (number of agents, number of targets, range of communication, number of saboteurs).
基于信任和声誉模型的算法稳定性评估
群机器人系统在世界科学实践中得到了积极的发展和广泛的研究。预计,多智能体、分布式方法创建自主系统的人工智能将能够解决环境保护、医疗、清洁、巡逻等领域的大量复杂问题。因此,从信息安全的角度对这些系统进行研究(设计和测试)就显得十分重要。群体机器人系统广泛实际应用的关键是为组织群体行动制定具体的指导方针和算法。本研究提出将信任与声誉模型用于群体系统的信息安全。Swarm的agent基于对算法第k次迭代步骤的情况分析,使用自己的传感器设备,生成彼此之间的信任级别。在计算的信任水平上,对破坏者进行集体识别。为了进行实验,设计了仿真软件。它允许改变群体机器人系统的基本参数(代理数量,目标数量,通信范围,破坏者数量)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书