Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.13032

Virtual Transmission Lines from Data Center Workload Migration: Coordinated Multi-Year Transmission Expansion Planning

Mengxin Zhu·Qian Kai·Yadong Liu·Yingjie Yan·Haoyu Zhao
View original source ↗Read source document ↗Export metadata ↓

Abstract

The rapid growth of electricity demand from AI data centers is creating a dual mismatch in power systems: a temporal mismatch between fast-rising demand and slow transmission expansion, and a spatial mismatch between concentrated data-center loads and geographically dispersed renewable resources. These mismatches can exacerbate transmission congestion, resulting in unserved data-center load and renewable-energy curtailment. This study models geographic workload migration as a virtual transmission line (VTL) that changes nodal data-center demand without transferring physical electricity. A mixed-integer linear programming model is then developed to co-optimize multi-year candidate-line construction and workload migration, subject to construction delays, renewable-energy curtailment, unserved data-center load, workload-balance requirements, communication-bandwidth constraints, and link-latency limits. The model is evaluated over an eight-year planning horizon on a modified IEEE 14-bus system. The results show that coordinating VTL with physical transmission expansion reduces total system cost, unserved data-center load, and renewable-energy curtailment while alleviating transmission congestion. VTL-aware planning also requires one fewer candidate line than build-only planning. However, VTL alone cannot meet system demand and does not eliminate the need for physical transmission reinforcement. Sensitivity analysis indicates that VTL provides the greatest value when transfer capacity is tight, construction costs are high, load growth is rapid, and data-center flexibility is greater. Additional validation on the IEEE 118-bus system over a five-year planning horizon shows that coordinated planning retains its cost and reliability benefits while reducing physical expansion requirements.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mengxin Zhu, Qian Kai, Yadong Liu, Yingjie Yan, Haoyu Zhao. 2026-10-09. Virtual Transmission Lines from Data Center Workload Migration: Coordinated Multi-Year Transmission Expansion Planning. https://arxiv.org/abs/2610.13032

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

KEEP EXPLORING

Related papers

arXiv2026

Scenario-Game ADMM: A Parallelized Scenario-Based Solver for Stochastic Noncooperative Games

Decision-making in multi-player games can be extremely challenging, particularly under uncertainty. In this work, we propose a new sample-based approximation to a class of stochastic, general-sum, pure Nash games, where each player has an expected-value objective and a set of chance constraints. This new approximation scheme inherits the accuracy of objective approximation from the established sample average approximation (SAA) method and enjoys a feasibility guarantee derived from the scenario optimization literature. We characterize the sample complexity of this new game-theoretic approximation scheme, and observe that high accuracy usually requires a large number of samples, which results in a large number of sampled constraints. To accommodate this, we decompose the approximated game into a set of smaller games with few constraints for each sampled scenario, and propose a decentralized, consensus-based ADMM algorithm to efficiently compute a generalized Nash equilibrium (GNE) of the approximated game. We prove the convergence of our algorithm to a GNE and empirically demonstrate superior performance relative to a recent baseline algorithm based on ADMM and interior point method.

eess.SY↗
arXiv2026

Learning event-triggered controllers for linear parameter-varying systems from data

Nonlinear dynamical behaviors in engineering applications can be approximated by linear-parameter varying (LPV) representations, but obtaining precise model knowledge to develop a control algorithm is difficult in practice. In this paper, we develop data-driven control strategies for event-triggered linear parameter-varying (LPV) systems with stability verifications. First, we theoretically analyze the $θ$-persistence of excitation condition for LPV systems, which leads to feasible data-based representations. Then, in terms of the available perturbed data, we establish the stability certificates for event-triggered LPV systems with the aid of Petersen's lemma, in the sense of robust control, resulting in computationally tractable semidefinite programs whose feasible solutions yield the gain-scheduling controllers. Besides, we generalize the data-driven event-triggered LPV stabilization methods to the case of trajectory tracking, and discuss robust tracking stability accordingly. Finally, we verify the effectiveness of our theoretical derivations through numerical examples.

eess.SY↗
arXiv2026

A Fully Analog Implementation of Model Predictive Control with Application to Buck Converters

This paper proposes a novel approach to design analog electronic circuits that implement Model Predictive Control (MPC) policies for dynamical systems described by affine models. Effective approaches to define a reduced-complexity explicit MPC are combined and applied to realize an analog circuit comprising a limited set of low-latency, commercially available components. The practical feasibility and effectiveness of the proposed approach are demonstrated through its application in the design of a novel controller for DC-DC Buck converters. We formally analyze the stability of the resulting system and conduct extensive numerical simulations to demonstrate the control system's performance in rejecting line and load disturbances.

eess.SY↗