.png){kind=icon}
返回
Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2019.03.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a multi-agent task assignment problem where a group of agents need to select tasks from their admissible task sets. The utility of an assignment profile is measured by the sum of individual task utilities, which is a submodular function of the set of agents that are assigned to it. The objective is to find an assignment profile that maximizes the global utility. This problem is NP-hard in general. In this paper we propose an algorithm that provides an assignment profile with utility at least 1/(1 + kappa) of the optimal utility, where kappa is an element of [0, 1] is a parameter for the curvature of the submodular utility functions. In the worst case, when kappa = 1, our algorithm achieves utility at least 1/2 of the optimal. Moreover, when the communication links between agents are consistent with the admissible task sets, the algorithm can be implemented distributedly and asynchronously, which means that there is no centralized coordinator and each agent selects its task using only local information and local communication based on its own time-clock. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Optimization
Submodular functions
Task assignment
Multi-agent systems
Distributed algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Robots for Environmental Monitoring Significant Advancements and Applications用于环境监测的机器人的重大进步和应用
PREAI
分享收藏An Overview of Small Unmanned Aerial Vehicles for Air Quality Measurements: Present Applications and Future Prospectives用于空气质量测量的小型无人机概述: 当前应用和未来展望.png)
SENSORSOAAI
SENSORSIF3.5
OAAI分享收藏
查看更多内容