Maximum reward collection problem: a cooperative receding horizon approach for dynamic clustering

M. Khosravi, H. Khodadadi, A. Aghdam, H. Rivaz
{"title":"Maximum reward collection problem: a cooperative receding horizon approach for dynamic clustering","authors":"M. Khosravi, H. Khodadadi, A. Aghdam, H. Rivaz","doi":"10.1145/2811411.2811550","DOIUrl":null,"url":null,"abstract":"In this paper, the Maximum Reward Collection Problem (MRCP) in uncertain environments is investigated where multiple agents cooperate to maximize the total reward collected from a set of moving targets in the mission space with unknown arrival times, trajectories and dynamics. The reward with respect to each of the targets has a time discounting value and can be collected only if a cluster of agents with proper number of elements visits the targets. Meanwhile, in each cluster, it is assumed that agents are able to extract a larger fraction of reward when their configuration in the cluster is close to specific configuration around the respective target. The inherited uncertainty in the environment and the dynamic clustering factor render the one-shot optimization in MRCP rather impractical. Therefore, a Cooperative Receding Horizon (CRH) controller is utilized toward maximizing the collected reward and based on the prediction of the future positions of targets with the given limited information. Some analytical aspects of problem is discussed and the effectiveness and advantages of the proposed algorithm is demonstrated via numerical simulations.","PeriodicalId":165245,"journal":{"name":"Proceedings of the 2015 Conference on research in adaptive and convergent systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 Conference on research in adaptive and convergent systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2811411.2811550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, the Maximum Reward Collection Problem (MRCP) in uncertain environments is investigated where multiple agents cooperate to maximize the total reward collected from a set of moving targets in the mission space with unknown arrival times, trajectories and dynamics. The reward with respect to each of the targets has a time discounting value and can be collected only if a cluster of agents with proper number of elements visits the targets. Meanwhile, in each cluster, it is assumed that agents are able to extract a larger fraction of reward when their configuration in the cluster is close to specific configuration around the respective target. The inherited uncertainty in the environment and the dynamic clustering factor render the one-shot optimization in MRCP rather impractical. Therefore, a Cooperative Receding Horizon (CRH) controller is utilized toward maximizing the collected reward and based on the prediction of the future positions of targets with the given limited information. Some analytical aspects of problem is discussed and the effectiveness and advantages of the proposed algorithm is demonstrated via numerical simulations.
最大奖励收集问题:一种动态聚类的协同后退视界方法
本文研究了不确定环境下的最大奖励收集问题(MRCP),该问题是指在未知到达时间、轨迹和动力学的任务空间中,多个智能体合作以最大限度地从一组运动目标中收集总奖励的问题。对于每个目标的奖励都有一个时间折扣值,并且只有当具有适当数量元素的agent集群访问目标时才能收集到奖励。同时,在每个集群中,假设智能体在集群中的配置接近各自目标周围的特定配置时,能够提取更大比例的奖励。环境的遗传不确定性和动态聚类因素使得MRCP的一次性优化方法不切实际。因此,在给定有限信息的情况下,基于对目标未来位置的预测,采用协同后退视界(CRH)控制器来实现所收集奖励的最大化。讨论了问题的一些分析方面,并通过数值模拟证明了所提算法的有效性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书