A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

被引：0

作者：

Khoo, Mitchell ^{[1
]}

Wood, Tony A. ^{[2
]}

Manzie, Chris ^{[1
]}

Shames, Iman ^{[3
]}

机构：

[1] Univ Melbourne, Dept Elect & Elect Engn, Melbourne, Vic 3010, Australia

[2] Ecole Polytech Fed Lausanne EPFL, Sycamore, CH-1015 Lausanne, Switzerland

[3] Australia Natl Univ, Sch Engn, CIICADA Lab, Canberra, ACT 0200, Australia

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2024年 / 69卷 / 02期

关键词：

Autonomous agents; autonomous systems; distributed algorithms; multi-agent systems; HUNGARIAN METHOD; ALGORITHM;

D O I：

10.1109/TAC.2023.3279336

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1210 / 1217

页数：8

共 24 条

[1] PARALLEL SYNCHRONOUS AND ASYNCHRONOUS IMPLEMENTATIONS OF THE AUCTION ALGORITHM [J].