.png){kind=icon}
返回
Distributed task assignment for mobile agents
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2007.894545.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This note demonstrates how the distributed auction algorithm can be modified to assign mobile agents to spatially distributed tasks despite communication delays and the fact that agent movement may cause the benefit associated with each possible agent-task assignment to vary during the execution of the algorithm. Bounds on the convergence time of the algorithm and the sub-optimality of the resulting solution are provided. Monte Carlo simulations are provided to show the conditions under which the modified distributed auction can outperform centralized calculation.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
暂无机构信息
.png){kind=icon}
