.png){kind=icon}
.png){kind=icon}
Return
Distributed Feedback-Feedforward Algorithms for Time-Varying Resource Allocation
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2025.3616202.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article studies distributed time-varying resource allocation (TVRA) where the local cost functions, global equality constraints, and local feasibility constraints (LFCs) vary with time. Algorithms that mimic the structure of feedback-feedforward control systems are proposed. Feedback and feedforward laws are generated using local estimates from a distributed estimator, while a distributed controller enforces the stationarity condition within a fixed time and updates the candidate solution accordingly. To handle the LFCs, feedback laws based on projection and feedforward laws that switch between different modes are introduced as an initialization-free alternative to the barrier-based methods used in most related works. Our projection-based method guarantees that, for any infeasible initial value, the state trajectory enters the locally feasible set within a fixed time and remains within it thereafter, and that the set is forward invariant if the initial value is locally feasible. Convergence analyses are conducted under mild assumptions. For cases without LFCs, the proposed algorithm converges to the optimal trajectory within a fixed time. For cases with LFCs, the proposed algorithm is globally asymptotically stable at the optimal trajectory while exhibiting fixed-time convergence between consecutive switching instants. Numerical examples and a power system application verify their effectiveness.
Keywords:
Distributed optimization
projection-based method
resource allocation
time-varying optimization
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W