TY - JOUR
T1 - Survey of distributed algorithms for resource allocation over multi-agent systems
AU - Doostmohammadian, Mohammadreza
AU - Aghasi, Alireza
AU - Pirani, Mohammad
AU - Nekouei, Ehsan
AU - Zarrabi, Houman
AU - Keypour, Reza
AU - Rikos, Apostolos I.
AU - Johansson, Karl H.
N1 - Research Unit(s) information for this publication is provided by the author(s) concerned.
PY - 2025
Y1 - 2025
N2 - Resource allocation and scheduling in multi-agent systems present challenges due to complex interactions and decentralization. This survey paper provides a comprehensive analysis of distributed algorithms for addressing the distributed resource allocation (DRA) problem over multi-agent systems. It covers a significant area of research at the intersection of optimization, multi-agent systems, and distributed consensus-based computing. The paper begins by presenting a mathematical formulation of the DRA problem, establishing a solid foundation for further exploration. Real-world applications of DRA in various domains are examined to underscore the importance of efficient resource allocation, and relevant distributed optimization formulations are presented. The survey then delves into existing solutions for DRA, encompassing linear, nonlinear, primal-based, and dual-formulation-based approaches. Furthermore, this paper evaluates the features and properties of DRA algorithms, addressing key aspects such as feasibility, convergence rate, and network reliability. The analysis of mathematical foundations, diverse applications, existing solutions, and algorithmic properties contributes to a broader comprehension of the challenges and potential solutions for this domain. © 2024 Elsevier Ltd.
AB - Resource allocation and scheduling in multi-agent systems present challenges due to complex interactions and decentralization. This survey paper provides a comprehensive analysis of distributed algorithms for addressing the distributed resource allocation (DRA) problem over multi-agent systems. It covers a significant area of research at the intersection of optimization, multi-agent systems, and distributed consensus-based computing. The paper begins by presenting a mathematical formulation of the DRA problem, establishing a solid foundation for further exploration. Real-world applications of DRA in various domains are examined to underscore the importance of efficient resource allocation, and relevant distributed optimization formulations are presented. The survey then delves into existing solutions for DRA, encompassing linear, nonlinear, primal-based, and dual-formulation-based approaches. Furthermore, this paper evaluates the features and properties of DRA algorithms, addressing key aspects such as feasibility, convergence rate, and network reliability. The analysis of mathematical foundations, diverse applications, existing solutions, and algorithmic properties contributes to a broader comprehension of the challenges and potential solutions for this domain. © 2024 Elsevier Ltd.
KW - Distributed coupling-constrained optimization
KW - Distributed resource allocation
KW - Graph theory
KW - Consensus
KW - Convex analysis
UR - http://www.scopus.com/inward/record.url?scp=85210387820&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85210387820&origin=recordpage
U2 - 10.1016/j.arcontrol.2024.100983
DO - 10.1016/j.arcontrol.2024.100983
M3 - RGC 21 - Publication in refereed journal
SN - 1367-5788
VL - 59
JO - Annual Reviews in Control
JF - Annual Reviews in Control
M1 - 100983
ER -