承载网络实现自主移动支持的超5G社会:MAB算法在分布式协作机器人之间数据同步中的应用

So Hasegawa, Yoshito Watanabe, M. Hasegawa, Y. Shoji
{"title":"承载网络实现自主移动支持的超5G社会:MAB算法在分布式协作机器人之间数据同步中的应用","authors":"So Hasegawa, Yoshito Watanabe, M. Hasegawa, Y. Shoji","doi":"10.1109/wpmc52694.2021.9700441","DOIUrl":null,"url":null,"abstract":"This paper proposes a technique for pre-negotiation of transfer data for a millimeter-wave (mmW) Store-Carry-Forwarding (SCF) data transfer network called the Piggy-back network between autonomous mobile robots. Each robot has its own database on this network, and the purpose is to synchronize the entire network when a part of the data is updated from time to time. While mmW communication is capable of high-speed and large-capacity data communication, the communication range is short and the communication time is extremely limited when the robots are moving. In order to make the best use of communication time and transfer data, it is appropriate to decide in advance which data to receive or transmit. Therefore, by using medium-speed communication, which has a relatively large communication range, and exchanging meta information of each data before the robots approach each other, it is decided which data should be handled. This paper models the difference and update check of data managed in segments for data synchronization as the Multi Armed Bandit (MAB) problem, which is a bandit problem and propose a Tug-of-War (TOW) dynamics-based data query scheme, which is a MAB algorithm. In order to verify the effectiveness of the proposed method, some simulations are performed on the data hit rate, which means the detection rate of update data with a limited number of queries in the situation where the update data occurs randomly. The results show that when the data consists of 10 segments and there is a large bias in the update frequency of each data, the data query method using TOW achieves detection of updated data up to about 40% higher than the random query method.","PeriodicalId":299827,"journal":{"name":"2021 24th International Symposium on Wireless Personal Multimedia Communications (WPMC)","volume":"26 9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Piggy-back Network to Enable Beyond 5G Society Supported by Autonomous Mobilities: Application of MAB Algorithm for Data Synchronization Between Distributed Collaborative Robots\",\"authors\":\"So Hasegawa, Yoshito Watanabe, M. Hasegawa, Y. Shoji\",\"doi\":\"10.1109/wpmc52694.2021.9700441\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a technique for pre-negotiation of transfer data for a millimeter-wave (mmW) Store-Carry-Forwarding (SCF) data transfer network called the Piggy-back network between autonomous mobile robots. Each robot has its own database on this network, and the purpose is to synchronize the entire network when a part of the data is updated from time to time. While mmW communication is capable of high-speed and large-capacity data communication, the communication range is short and the communication time is extremely limited when the robots are moving. In order to make the best use of communication time and transfer data, it is appropriate to decide in advance which data to receive or transmit. Therefore, by using medium-speed communication, which has a relatively large communication range, and exchanging meta information of each data before the robots approach each other, it is decided which data should be handled. This paper models the difference and update check of data managed in segments for data synchronization as the Multi Armed Bandit (MAB) problem, which is a bandit problem and propose a Tug-of-War (TOW) dynamics-based data query scheme, which is a MAB algorithm. In order to verify the effectiveness of the proposed method, some simulations are performed on the data hit rate, which means the detection rate of update data with a limited number of queries in the situation where the update data occurs randomly. The results show that when the data consists of 10 segments and there is a large bias in the update frequency of each data, the data query method using TOW achieves detection of updated data up to about 40% higher than the random query method.\",\"PeriodicalId\":299827,\"journal\":{\"name\":\"2021 24th International Symposium on Wireless Personal Multimedia Communications (WPMC)\",\"volume\":\"26 9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 24th International Symposium on Wireless Personal Multimedia Communications (WPMC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/wpmc52694.2021.9700441\",\"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 24th International Symposium on Wireless Personal Multimedia Communications (WPMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/wpmc52694.2021.9700441","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种自动移动机器人之间的毫米波存储-携带转发(SCF)数据传输网络的数据预协商技术。每个机器人在这个网络上都有自己的数据库,目的是在不定期更新一部分数据时使整个网络同步。毫米波通信虽然能够实现高速大容量的数据通信,但在机器人运动时,通信范围短,通信时间极其有限。为了充分利用通信时间和传输数据,最好事先决定接收或传输哪些数据。因此,采用通信范围比较大的中速通信,在机器人靠近之前交换各数据的元信息,决定处理哪些数据。本文将数据同步中分段管理数据的差异和更新检查建模为多武装强盗问题(Multi - Armed Bandit, MAB),并提出了一种基于拔河(Tug-of-War, TOW)的动态数据查询方案,即MAB算法。为了验证所提方法的有效性,对数据命中率进行了仿真,数据命中率是指在更新数据随机发生的情况下,查询次数有限的更新数据的检测率。结果表明,当数据由10个片段组成且每个数据的更新频率存在较大偏差时,使用TOW的数据查询方法比随机查询方法对更新数据的检测效率提高约40%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Piggy-back Network to Enable Beyond 5G Society Supported by Autonomous Mobilities: Application of MAB Algorithm for Data Synchronization Between Distributed Collaborative Robots
This paper proposes a technique for pre-negotiation of transfer data for a millimeter-wave (mmW) Store-Carry-Forwarding (SCF) data transfer network called the Piggy-back network between autonomous mobile robots. Each robot has its own database on this network, and the purpose is to synchronize the entire network when a part of the data is updated from time to time. While mmW communication is capable of high-speed and large-capacity data communication, the communication range is short and the communication time is extremely limited when the robots are moving. In order to make the best use of communication time and transfer data, it is appropriate to decide in advance which data to receive or transmit. Therefore, by using medium-speed communication, which has a relatively large communication range, and exchanging meta information of each data before the robots approach each other, it is decided which data should be handled. This paper models the difference and update check of data managed in segments for data synchronization as the Multi Armed Bandit (MAB) problem, which is a bandit problem and propose a Tug-of-War (TOW) dynamics-based data query scheme, which is a MAB algorithm. In order to verify the effectiveness of the proposed method, some simulations are performed on the data hit rate, which means the detection rate of update data with a limited number of queries in the situation where the update data occurs randomly. The results show that when the data consists of 10 segments and there is a large bias in the update frequency of each data, the data query method using TOW achieves detection of updated data up to about 40% higher than the random query method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信