This paper studies a hybrid discrete-time signed gradient-consensus method with heavy-ball momentum, paired communication delays, and fixed logarithmic quantization. The method preserves the aggregate supply-demand equality at every iteration. For a static connected undirected graph and bounded delays, a Lyapunov-Krasovskii analysis establishes practical stability by isolating the discontinuous quantization error as an additive disturbance and closing a computable invariant-sublevel argument. The resulting ergodic residual bound is quadratic in the quantization resolution, and exact convergence to the smooth penalized equality-constrained optimizer is recovered in the unquantized case. For delay-free unquantized quadratic costs, an exact modal analysis identifies the heavy-ball stability region and optimal parameters, with the predicted rate validated on a fixed sparse network. A reproducible delayed experiment reports all constants and a certificate whose guaranteed steady-state level lies below the reported initialization. A separate mixed generator-battery experiment exercises the signed update directly. Finite smooth penalties approximate, but do not generally enforce, the local box constraints exactly.
This paper provides a complete Lyapunov-based convergence analysis for the fixed-step-size regime and addresses local box constraints via smooth penalty relaxation and quantify explicitly how the penalty weight interacts with the step-size bound and the optimality gap.
This paper investigates optimal resource allocation in multi-agent networks subject to simultaneous measurement and communication delays. We propose a distributed stochastic extremum seeking (SES) algorithm for connected undirected graphs with heterogeneous constant communication delays. The algorithm uses only delayed...
This letter establishes exact finite-time average consensus for driftless agents with unknown, possibly heterogeneous constant actuation delays and a known common upper bound. A command emulator, initialized once from the physical state and driven by the undelayed command, reproduces the physical trajectories without d...
C. U. Solís-Cervantes· IEEE Control Systems Letters· 0 citations
We study when selected coordinates become and remain zero in a finite-dimensional sparse-regression primal--dual flow and its exact full resolvent iteration. Invariant balls centered at \((0,z)\), with \(z\) strictly dual feasible, give computable deadlines without rank assumptions or optimizer knowledge. The certifica...
This paper studies constraint certification in synchronous distributed model predictive control (DMPC) when neighboring predictions change between sampling instants. Before the parallel local solves, each agent communicates a shifted prediction and an announced update budget. A hard trajectory trust region makes that b...
Sheng-Jun Zhang, Ting Liu, Lei Xu et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.