.png){kind=icon}
返回
Communication constrained task allocation with optimized local task swaps
.png){kind=icon}
PRE
AI
DOI：10.1007/s10514-015-9481-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Communication constraints dictated by hardware often require a multi-robot system to make decisions and take actions locally. Unfortunately, local knowledge may impose limits that ultimately impede global optimality in a decentralized optimization problem. This paper enhances a recent anytime optimal assignment method based on a task-swap mechanism, redesigning the algorithm to address task allocation problems in a decentralized fashion. We propose a fully decentralized approach that allows local search processes to execute concurrently while minimizing interactions amongst the processes, needing neither global broadcast nor a multi-hop communication protocol. The formulation is analyzed in a novel way using tools from group theory and optimization duality theory to show that the convergence of local searching processes is related to a shortest path routing problem on a graph subject to the network topology. Simulation results show that this fully decentralized method converges quickly while sacrificing little optimality.
Keyword:
Decentralized task allocation
Communication constraint
Task swaps
Permutation group
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
1.7K
被引数:
5.0K
机构
引用论文
分享收藏分享收藏分享收藏Mechanical Properties of Fibre Reinforced Polymers under Elevated Temperatures: An Overview.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏
查看更多内容