Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling
Abstract
Existing works on multi-agent time-varying optimization allow agents to asynchronously communicate and/or compute, but do not allow asynchronous sampling of objectives. Sampling can be difficult to synchronize, and we therefore present a multi-agent optimization framework that allows asynchrony in sampling, communications, and computations for time-varying quadratic programs. We show that agents have bounded error when tracking the solution to the asynchronously sampled problem, which solves an open problem for quadratic programs. Simulations validate these results.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.