Loading…
Distributed discrete‐time optimization algorithms with applications to resource allocation in epidemics control
Summary This work presents and analyzes 2 novel distributed discrete‐time nonlinear algorithms to solve a class of decentralized resource allocation problems. The algorithms allow an interconnected group of agents to collectively minimize a global cost function under inequality and equality constrai...
Saved in:
Published in: | Optimal control applications & methods 2018-01, Vol.39 (1), p.160-180 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Summary
This work presents and analyzes 2 novel distributed discrete‐time nonlinear algorithms to solve a class of decentralized resource allocation problems. The algorithms allow an interconnected group of agents to collectively minimize a global cost function under inequality and equality constraints. Under some technical conditions, it is shown that the first proposed algorithm converges asymptotically to the desired equilibrium, while the second one converges to the solution in a practical way as long as the stepsize chosen is sufficiently small. Of particular interest is that the algorithms are designed to be robust to temporary errors in communication or computation. In addition, agents do not require global knowledge of total resources in the network or any specific procedure for initialization and the cost function is not required to be separable. The convergence of the algorithms is established via nonsmooth Lyapunov analysis. Finally, we illustrate the applicability of our strategies on a virus mitigation problem over computer and human networks. |
---|---|
ISSN: | 0143-2087 1099-1514 |
DOI: | 10.1002/oca.2340 |