A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
From MaRDI portal
Publication:4620790
DOI10.1109/TSP.2017.2669896zbMath1414.94698MaRDI QIDQ4620790
No author found.
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Related Items (14)
Distributed optimization with hybrid linear constraints for multi‐agent networks ⋮ Distributed safe resource allocation using barrier functions ⋮ Autonomous and non-autonomous fixed-time leader-follower consensus for second-order multi-agent systems ⋮ Distributed resource allocation algorithm for second-order multi-agent systems with external disturbances ⋮ A distributed extremum seeking based resource allocation algorithm over switching networks ⋮ On predefined-time consensus protocols for dynamic networks ⋮ On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs ⋮ Predefined-time consensus of nonlinear first-order systems using a time base generator ⋮ Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs ⋮ Distributed constrained optimization for multi-agent networks with nonsmooth objective functions ⋮ Hierarchical task-based formation control and collision avoidance of UAVs in finite time ⋮ A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks ⋮ A class of robust consensus algorithms with predefined‐time convergence under switching topologies ⋮ Distributed optimisation for resource allocation with event-triggered communication over general directed topology
This page was built for publication: A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs