.png){kind=icon}
返回
A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2023.3279336.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one component in particular, i.e., the function to search for an augmenting path. An augmenting path is a common tool used in most BAP algorithms and poses a particular challenge for this distributed approach. Given this significance, we compare the properties of two different methods to search for an augmenting path in a bipartite graph. We evaluate the derived approaches with a simulation-based complexity investigation.
Keyword:
Autonomous agents
autonomous systems
distributed algorithms
multi-agent systems
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏A distributed simplex algorithm for degenerate linear programs and multi-agent assignments.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏分享收藏
查看更多内容