未知环境中合作探索策略的建模与仿真

Yong Peng;Yue Hu;Chuan Ai
{"title":"未知环境中合作探索策略的建模与仿真","authors":"Yong Peng;Yue Hu;Chuan Ai","doi":"10.23919/CSMS.2023.0014","DOIUrl":null,"url":null,"abstract":"Cooperative spatial exploration in initially unknown surroundings is a common embodied task in various applications and requires satisfactory coordination among the agents. Unlike many other research questions, there is a lack of simulation platforms for the cooperative exploration problem to perform and statistically evaluate different methods before they are deployed in practical scenarios. To this end, this paper designs a simulation framework to run different models, which features efficient event scheduling and data sharing. On top of such a framework, we propose and implement two different cooperative exploration strategies, i.e., the synchronous and asynchronous ones. While the coordination in the former approach is conducted after gathering the perceptive information from all agents in each round, the latter enables an ad-hoc coordination. Accordingly, they exploit different principles for assigning target points for the agents. Extensive experiments on different types of environments and settings not only validate the scheduling efficiency of our simulation engine, but also demonstrate the respective advantages of the two strategies on different metrics.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"3 4","pages":"343-356"},"PeriodicalIF":0.0000,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10347385","citationCount":"0","resultStr":"{\"title\":\"Modeling and Simulation of Cooperative Exploration Strategies in Unknown Environments\",\"authors\":\"Yong Peng;Yue Hu;Chuan Ai\",\"doi\":\"10.23919/CSMS.2023.0014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cooperative spatial exploration in initially unknown surroundings is a common embodied task in various applications and requires satisfactory coordination among the agents. Unlike many other research questions, there is a lack of simulation platforms for the cooperative exploration problem to perform and statistically evaluate different methods before they are deployed in practical scenarios. To this end, this paper designs a simulation framework to run different models, which features efficient event scheduling and data sharing. On top of such a framework, we propose and implement two different cooperative exploration strategies, i.e., the synchronous and asynchronous ones. While the coordination in the former approach is conducted after gathering the perceptive information from all agents in each round, the latter enables an ad-hoc coordination. Accordingly, they exploit different principles for assigning target points for the agents. Extensive experiments on different types of environments and settings not only validate the scheduling efficiency of our simulation engine, but also demonstrate the respective advantages of the two strategies on different metrics.\",\"PeriodicalId\":65786,\"journal\":{\"name\":\"复杂系统建模与仿真(英文)\",\"volume\":\"3 4\",\"pages\":\"343-356\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10347385\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"复杂系统建模与仿真(英文)\",\"FirstCategoryId\":\"1089\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10347385/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"复杂系统建模与仿真(英文)","FirstCategoryId":"1089","ListUrlMain":"https://ieeexplore.ieee.org/document/10347385/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在初始未知环境中进行合作空间探索是各种应用中常见的体现任务,需要代理之间进行令人满意的协调。与许多其他研究问题不同,合作探索问题缺乏仿真平台,无法在实际应用前对不同方法进行执行和统计评估。为此,本文设计了一个运行不同模型的仿真框架,它具有高效的事件调度和数据共享功能。在此框架基础上,我们提出并实施了两种不同的合作探索策略,即同步策略和异步策略。前者的协调是在每轮收集所有代理的感知信息后进行的,而后者则是临时协调。因此,它们利用不同的原则来为代理分配目标点。在不同类型的环境和设置下进行的大量实验不仅验证了我们模拟引擎的调度效率,还证明了两种策略在不同指标上的各自优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modeling and Simulation of Cooperative Exploration Strategies in Unknown Environments
Cooperative spatial exploration in initially unknown surroundings is a common embodied task in various applications and requires satisfactory coordination among the agents. Unlike many other research questions, there is a lack of simulation platforms for the cooperative exploration problem to perform and statistically evaluate different methods before they are deployed in practical scenarios. To this end, this paper designs a simulation framework to run different models, which features efficient event scheduling and data sharing. On top of such a framework, we propose and implement two different cooperative exploration strategies, i.e., the synchronous and asynchronous ones. While the coordination in the former approach is conducted after gathering the perceptive information from all agents in each round, the latter enables an ad-hoc coordination. Accordingly, they exploit different principles for assigning target points for the agents. Extensive experiments on different types of environments and settings not only validate the scheduling efficiency of our simulation engine, but also demonstrate the respective advantages of the two strategies on different metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.80
自引率
0.00%
发文量
0
期刊最新文献
Contents Front Cover Image Encryption Algorithm Based on a Hybrid Model of Novel Memristive Hyperchaotic Systems, DNA Coding, and Hash Functions Improved Dynamic Q-Learning Algorithm to Solve the Lot-Streaming Flowshop Scheduling Problem with Equal-Size Sublots A Multi-Objective Hybrid Algorithm for the Casting Scheduling Problem with Unrelated Batch Processing Machine
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1