Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.29656

Toward a decentralized design framework for discrete-time distributed algorithms via their emergent dynamics

Jinwook Heo·Hyungbo Shim·Jin Gyu Lee
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper develops a procedure for designing discrete-time distributed algorithms to achieve a desired collective behavior. Each agent combines its node and coupling updates at every iteration, in either explicit or implicit form. For this structure, we derive necessary and sufficient conditions on the local parameters for realizing a desired continuous-time blended dynamics. These conditions yield a decentralized procedure for computing the parameters. A Tikhonov-type approximation result relates the resulting agent trajectories to the blended dynamics on a rescaled time axis. Under a stability condition imposed only on the blended dynamics, we further establish uniform-in-time approximation bounds. We also characterize the trade-off between approximation accuracy and the iteration count guaranteed by these bounds. The framework is illustrated through four applications in distributed computation and estimation.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jinwook Heo, Hyungbo Shim, Jin Gyu Lee. 2026-10-21. Toward a decentralized design framework for discrete-time distributed algorithms via their emergent dynamics. https://arxiv.org/abs/2610.29656

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Optimal Control of Behavioral-Feedback SIR Epidemic Model

We consider a behavioral-feedback SIR epidemic model, in which the infection rate depends in feedback on the fractions of susceptible and infected agents. Contrary to the classic SIR dynamics, the considered model allows one to account for endogenous adaptation mechanisms of the agents in response to the epidemics, such as voluntary social distancing, or the adoption of face masks. For this model, we formulate an optimal control problem for a social planner that has the ability to reduce the infection rate to keep the infection curve below a certain threshold within an infinite time horizon, while minimizing the intervention cost. Based on the dynamic properties of the model, we prove that, under quite general conditions on the infection rate, the filling-the-box strategy is the optimal control. This strategy consists in letting the epidemics spread without intervention until the threshold is reached, then applying the minimum control that leaves the fraction of infected individuals constantly at the threshold until the reproduction number becomes less than one and the infection naturally fades out. Our contribution enhances the understanding of epidemic management while accounting for adaptive human behavior, offering novel insights for robust containment strategies.

eess.SY↗
arXiv2026

The Cheap Hours Don't Stay Cheap: Price-Chasing Data Centers Reshape Grids and Markets

Data centers unsettle the paradigm of location-bound electricity demand: computing workloads can migrate across sites and hours, whereas facilities and grid connections remain fixed. This mobility reduces electricity costs but reshapes the spatiotemporal structure of nodal prices. A model-driven framework couples US wholesale market signals with optimal fleet scheduling, showing how their interaction alters prices and other participants' responses. Greater flexibility enlarges savings yet can erode network benefits: in a Texas study, temporal shifting and cross-site allocation each relieve congestion, but their combination leaves total congestion nearly unchanged. At continental scale, computing demand gravitating toward cheaper electricity narrows price differences and compresses the low-price hours storage arbitrage relies on, threatening storage investment recovery. Cost-minimizing scheduling may therefore undermine grid-supporting resources. Comparing job-level and aggregate fleet representations reveals a trade-off between operational visibility and information disclosure, informing requirements and incentives that could turn workload mobility into a lever for system-wide efficiency.

eess.SY↗
arXiv2026

Traffic State Prediction and Control Using a Koopman Operator Framework with Polynomial Observables

In this paper, we develop a Koopman operator framework for modeling and control of traffic flow governed by the Lighthill--Whitham--Richards (LWR) conservation law. We show that the nonlinear dynamics induced by the Greenshields flow--density relation naturally motivate a dictionary of polynomial observables, while the controlled dynamics become bilinear in the lifted Koopman coordinates. A reduced-order Koopman model is identified from spatio-temporal traffic-density snapshots and used as the prediction model in a model predictive control (MPC) framework for ramp metering. The resulting Koopman-MPC is compared with two predictive control baselines that use, respectively, a fixed linearized LWR model and the nonlinear finite-volume LWR model. In a one-hour freeway experiment, the Koopman-based controller maintains the traffic density below the critical Greenshields value and closely reproduces the behavior of the nonlinear PDE-based MPC, with a maximum-density difference below 1%. The Koopman predictor also reduces the mean online model-evaluation cost by approximately one order of magnitude relative to the nonlinear PDE predictor. In contrast, the linearized LWR predictor is computationally cheaper but exhibits substantially larger prediction errors and yields a more conservative metering policy. These results demonstrate that the analytical structure of the nonlinear traffic conservation law can be exploited to construct an interpretable data-driven surrogate for efficient traffic prediction and control

eess.SY↗