Environmental Data Science · 2025
Robust machine-learned algorithms for efficient grid operation
Environmental Data Science
Can learned dispatch policies remain reliable under distribution shift?
RobustML combines a learned dispatch algorithm with a bound on worst case cost. A combined cycle cogeneration case study examines dispatch and ramping costs as renewable penetration increases, including performance under distribution shift.
Research themes
Connections
Guarantees meet physical infrastructure
Aggregate flexibility communicates feasible actions for coordinated charging. Robust dispatch and safe water control connect performance guarantees to operational costs and physical constraints.
Cite this paper
Nicolas Christianson, Christopher Yeh, Tongxin Li, Mehdi Hosseini, Mahdi Torabi Rad, Azarang Golmohammadi, Adam Wierman. Robust machine-learned algorithms for efficient grid operation. Environmental Data Science, 2025. https://doi.org/10.1017/eds.2024.28
BibTeX
@article{tongxin-robust-grid,
title = {{Robust machine-learned algorithms for efficient grid operation}},
author = {Nicolas Christianson and Christopher Yeh and Tongxin Li and Mehdi Hosseini and Mahdi Torabi Rad and Azarang Golmohammadi and Adam Wierman},
year = {2025},
journal = {Environmental Data Science},
url = {https://doi.org/10.1017/eds.2024.28},
doi = {10.1017/eds.2024.28}
}
Related papers
Learning-Augmented Online Control for Decarbonizing Water Infrastructures
LAOC restricts online decisions to safe action sets while exploiting learned predictions for pump scheduling. Analysis characterizes the relationship between safety requirements and operating costs, with a building water supply case study.
Can learned pump control reduce carbon costs while meeting safety constraints? AI for energy electric vehicle charging demand response renewable energy load forecasting decarbonization model predictive control MPC stability recursive feasibility distributed control system level synthesis learning augmented algorithms algorithms with predictions competitive analysis robustness consistency online optimizationInformation Aggregation for Constrained Online Control
Entropic aggregation summarizes a local controller's feasible actions for a remote decision maker. Penalized Predictive Control can approach the regret of full information control under causal invariance and a sufficiently long prediction window.
How much feasibility information must a local controller share? model predictive control MPC stability recursive feasibility distributed control system level synthesis information theory graph learning sample complexity compressed sensing graph neural networks Riemannian geometry AI for energy electric vehicle charging demand response renewable energy load forecasting decarbonizationLearning-Based Predictive Control via Real-Time Aggregate Flexibility
Maximum entropy feedback summarizes the feasible actions of controllable loads. Reinforcement learning approximates this feedback for Penalized Predictive Control, reducing information and computation requirements. Charging data demonstrates the coordination approach.
How can an aggregator communicate flexibility in real time? model predictive control MPC stability recursive feasibility distributed control system level synthesis AI for energy electric vehicle charging demand response renewable energy load forecasting decarbonization large language models LLM agents contextual control world models reinforcement learning dueling bandits