Papers › Two-Timescale Stochastic Dispatch of Smart Distribution Grids

Two-Timescale Stochastic Dispatch of Smart Distribution Grids

17 Aug 2016arXiv:1608.05269links table onlyarchive 2025-07-28

Luis M. Lopez-Ramos, Vassilis Kekatos, Antonio G. Marques, Georgios B. Giannakis

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Smart distribution grids should efficiently integrate stochastic renewable resources while effecting voltage regulation. The design of energy management schemes is challenging, one of the reasons being that energy management is a multistage problem where decisions are not all made at the same timescale and must account for the variability during real-time operation. The joint dispatch of slow- and fast-timescale controls in a smart distribution grid is considered here. The substation voltage, the energy exchanged with a main grid, and the generation schedules for small diesel generators have to be decided on a slow timescale; whereas optimal photovoltaic inverter setpoints are found on a more frequent basis. While inverter and looser voltage regulation limits are imposed at all times, tighter bus voltage constraints are enforced on the average or in probability, thus enabling more efficient renewable integration. Upon reformulating the two-stage grid dispatch as a stochastic convex-concave problem, two distribution-free schemes are put forth. An average dispatch algorithm converges provably to the optimal two-stage decisions via a sequence of convex quadratic programs. Its non-convex probabilistic alternative entails solving two slightly different convex problems and is numerically shown to converge. Numerical tests on a real-world distribution feeder verify that both novel data-driven schemes yield lower costs over competing alternatives.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections