Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
DOI10.1016/j.sysconle.2023.105657arXiv2310.18225OpenAlexW4388263130MaRDI QIDQ6131454
Unnamed Author, Maria Vrakopoulou, Hamid R. Rabiee, Themistoklis Charalambous, Usman A. Khan, Alireza Aghasi
Publication date: 5 April 2024
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2310.18225
graph theoryconvex analysistime-varying delaysconstrained distributed resource allocationuniform-connectivity
Decentralized systems (93A14) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Multi-agent systems (93A16) Networked control (93B70)
Cites Work
- Unnamed Item
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Distributed resource allocation on dynamic networks in quadratic time
- Optimal scaling of a gradient method for distributed resource allocation
- Consensus dynamics with arbitrary sign-preserving nonlinearities
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Tracking-ADMM for distributed constraint-coupled optimization
- Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
- Global regulated state synchronization for homogeneous networks of non-introspective agents in presence of input saturation: scale-free nonlinear and linear protocol designs
- Performance Analysis of Gradient-Based Nash Seeking Algorithms Under Quantization
- Robust Distributed Average Consensus via Exchange of Running Sums
- Distributed Optimization Over Time-Varying Directed Graphs
- Average Consensus in the Presence of Delays in Directed Graph Topologies
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Necessary and sufficient conditions for a penalty method to be exact
- Handbook of Graph Theory
- Convergence Analysis of Quantized Primal-Dual Algorithms in Network Utility Maximization Problems
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- Communication over fading channels with delay constraints
- A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks
- Nonlinear Consensus Protocols With Applications to Quantized Communication and Actuation
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Design of Robust Controller for a Class of Uncertain Discrete-Time Systems Subject to Actuator Saturation
- A Distributed Algorithm for Proportional Task Allocation in Networks of Mobile Agents
- Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
- Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
This page was built for publication: Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
