Distributed Feedback-Feedforward Algorithms for Time-Varying Resource Allocation
Yiqiao Xu, Tengyang Gong, Zhengtao Ding, Alessandra Parisio

TL;DR
This paper introduces distributed feedback-feedforward algorithms for time-varying resource allocation problems, ensuring feasibility and convergence even with changing constraints and initial infeasibility.
Contribution
It proposes a novel initialization-free, projection-based method with fixed-time convergence for distributed time-varying resource allocation, handling local feasibility constraints effectively.
Findings
Guarantees entry into feasible set within fixed time
Ensures convergence to optimal trajectory
Effective in power system applications
Abstract
This paper 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
