arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.16879math.OCcs.SYeess.SY
收藏

随机电力系统的最优控制——算法与数学分析

Optimal Control of a Stochastic Power System -- Algorithms and Mathematical Analysis

Zhen Wang, Kaihua Xi, Aijie Cheng, Hai Xiang Lin, Jan H. van Schuppen

AI总结:

针对随机电力系统暂态稳定概率最小化的最优控制问题,证明了非凸不可微目标函数最小值的存在性,提出结合投影广义次梯度法与最速下降法的两步求解流程并证明其收敛性。

摘要:

本文研究的随机电力系统最优控制问题,是选取一组供电向量,使网络中任意潮流的相角差因超出临界子集而危及电力系统暂态稳定的概率达到下确界。控制律集合被限定为基于下一个短时段电力需求预测、周期性重新计算的固定供电向量集合,不使用状态反馈或输出反馈。对应的控制目标函数是Lipschitz连续、不可微且非凸的。本文的研究结果包括:控制目标函数的值域内存在最小值;此外,提出了一种基于两种关键方法计算近似极小值点的两步流程:(1)用于计算初始向量的投影广义次梯度法,(2)用于逼近局部极小值点的最速下降法;最后,给出了两个收敛定理,证明近似序列收敛到局部最小值。

英文摘要:

The considered optimal control problem of a stochastic power system, is to select the set of power supply vectors which infimizes the probability that the phase-angle differences of any power flow of the network, endangers the transient stability of the power system by leaving a critical subset. The set of control laws is restricted to be a periodically recomputed set of fixed power supply vectors based on predictions of power demand for the next short horizon. Neither state feedback nor output feedback is used. The associated control objective function is Lipschitz continuous, nondifferentiable, and nonconvex. The results of the paper include that a minimum exists in the value range of the control objective function. Furthermore, it includes a two-step procedure to compute an approximate minimizer based on two key methods: (1) a projected generalized subgradient method for computing an initial vector, and (2) a steepest descent method for approximating a local minimizer. Finally, it includes two convergence theorems that an approximation sequence converges to a local minimum.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑