动态多目标分配与分散在线学习实现多个同步目标

D. Nguyen, Arvind Rajagopalan, Jijoong Kim, C. Lim, David Hubczenko
{"title":"动态多目标分配与分散在线学习实现多个同步目标","authors":"D. Nguyen, Arvind Rajagopalan, Jijoong Kim, C. Lim, David Hubczenko","doi":"10.1109/ICMLC51923.2020.9469589","DOIUrl":null,"url":null,"abstract":"In this paper, we present a decentralised online decision-making strategy for multi-agents carrying out a cooperative mission. Our solution provides the capability for agents to dynamically choose their best targets and arrive at their target locations simultaneously at pre-specified angles. Additionally, the agents are able to cope with any obstacles encountered without compromising the mission goals. The algorithm combines game-theoretic regret minimisation with current best-practice solutions to satisfy complex mission requirements. It is decentralised and readily scalable to a large number of agents for wide area operations. Simulation results show it can be applied to teams of agents in challenging environments and exhibits fast convergence and adaptability.","PeriodicalId":170815,"journal":{"name":"2020 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic Multi-Target Assignment with Decentralised Online Learning to Achieve Multiple Synchronised Goals\",\"authors\":\"D. Nguyen, Arvind Rajagopalan, Jijoong Kim, C. Lim, David Hubczenko\",\"doi\":\"10.1109/ICMLC51923.2020.9469589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a decentralised online decision-making strategy for multi-agents carrying out a cooperative mission. Our solution provides the capability for agents to dynamically choose their best targets and arrive at their target locations simultaneously at pre-specified angles. Additionally, the agents are able to cope with any obstacles encountered without compromising the mission goals. The algorithm combines game-theoretic regret minimisation with current best-practice solutions to satisfy complex mission requirements. It is decentralised and readily scalable to a large number of agents for wide area operations. Simulation results show it can be applied to teams of agents in challenging environments and exhibits fast convergence and adaptability.\",\"PeriodicalId\":170815,\"journal\":{\"name\":\"2020 International Conference on Machine Learning and Cybernetics (ICMLC)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Machine Learning and Cybernetics (ICMLC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLC51923.2020.9469589\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Machine Learning and Cybernetics (ICMLC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC51923.2020.9469589","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了一种多智能体执行合作任务的分散在线决策策略。我们的解决方案为智能体提供了动态选择最佳目标并以预先指定的角度同时到达目标位置的能力。此外,特工们能够在不影响任务目标的情况下处理遇到的任何障碍。该算法将博弈论的遗憾最小化与当前的最佳实践解决方案相结合,以满足复杂的任务要求。它是分散的,并且易于扩展到大量代理进行广域操作。仿真结果表明,该方法可以应用于复杂环境下的智能体团队,具有较快的收敛性和适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Multi-Target Assignment with Decentralised Online Learning to Achieve Multiple Synchronised Goals
In this paper, we present a decentralised online decision-making strategy for multi-agents carrying out a cooperative mission. Our solution provides the capability for agents to dynamically choose their best targets and arrive at their target locations simultaneously at pre-specified angles. Additionally, the agents are able to cope with any obstacles encountered without compromising the mission goals. The algorithm combines game-theoretic regret minimisation with current best-practice solutions to satisfy complex mission requirements. It is decentralised and readily scalable to a large number of agents for wide area operations. Simulation results show it can be applied to teams of agents in challenging environments and exhibits fast convergence and adaptability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信