Traditionally,offline optimization of power systems is acceptable due to the largely predictable loads and reliable generation.The increasing penetration of fluctuating renewable generation and internet-of-things devi...Traditionally,offline optimization of power systems is acceptable due to the largely predictable loads and reliable generation.The increasing penetration of fluctuating renewable generation and internet-of-things devices allowing for fine-grained controllability of loads have led to the diminishing applicability of offline optimization in the power systems domain,and have redirected attention to online optimization methods.However,online optimization is a broad topic that can be applied in and motivated by different settings,operated on different time scales,and built on different theoretical foundations.This paper reviews the various types of online optimization techniques used in the power systems domain and aims to make clear the distinction between the most common techniques used.In particular,we introduce and compare four distinct techniques used covering the breadth of online optimization techniques used in the power systems domain,i.e.,optimization-guided dynamic control,feedback optimization for single-period problems,Lyapunov-based optimization,and online convex optimization techniques for multi-period problems.Lastly,we recommend some potential future directions for online optimization in the power systems domain.展开更多
In this paper,the problem of online distributed optimization subject to a convex set is studied via a network of agents.Each agent only has access to a noisy gradient of its own objective function,and can communicate ...In this paper,the problem of online distributed optimization subject to a convex set is studied via a network of agents.Each agent only has access to a noisy gradient of its own objective function,and can communicate with its neighbors via a network.To handle this problem,an online distributed stochastic mirror descent algorithm is proposed.Existing works on online distributed algorithms involving stochastic gradients only provide the expectation bounds of the regrets.Different from them,we study the high probability bound of the regrets,i.e.,the sublinear bound of the regret is characterized by the natural logarithm of the failure probability's inverse.Under mild assumptions on the graph connectivity,we prove that the dynamic regret grows sublinearly with a high probability if the deviation in the minimizer sequence is sublinear with the square root of the time horizon.Finally,a simulation is provided to demonstrate the effectiveness of our theoretical results.展开更多
软件定义网络可以搭载灵活的流调度策略来提升网络服务系统的服务质量,但随着业务流量复杂度的提升,现有的流调度算法会因场景匹配度的下降而导致性能受到影响。为此提出一种基于深度强化学习的智能路由策略。该策略通过软件定义网络收...软件定义网络可以搭载灵活的流调度策略来提升网络服务系统的服务质量,但随着业务流量复杂度的提升,现有的流调度算法会因场景匹配度的下降而导致性能受到影响。为此提出一种基于深度强化学习的智能路由策略。该策略通过软件定义网络收集各链路信息,基于长短期记忆网络与近端策略优化算法实现特征提取与状态感知,最终决策生成符合业务场景下服务质量(quality of service,QoS)目标的动态流量调度策略,并实现QoS最大化。实验结果表明,所提的方案与现有的路由策略相比可以使整套系统QoS指标提升7.06%,有效地提升了业务系统的吞吐率。展开更多
基金supported by the National Natural Science Foundation of China(62103265)the“ChenGuang Program”Supported by the Shanghai Education Development Foundation+1 种基金Shanghai Municipal Education Commission of China(20CG11)the Young Elite Scientists Sponsorship Program by Cast of China Association for Science and Technology。
文摘Traditionally,offline optimization of power systems is acceptable due to the largely predictable loads and reliable generation.The increasing penetration of fluctuating renewable generation and internet-of-things devices allowing for fine-grained controllability of loads have led to the diminishing applicability of offline optimization in the power systems domain,and have redirected attention to online optimization methods.However,online optimization is a broad topic that can be applied in and motivated by different settings,operated on different time scales,and built on different theoretical foundations.This paper reviews the various types of online optimization techniques used in the power systems domain and aims to make clear the distinction between the most common techniques used.In particular,we introduce and compare four distinct techniques used covering the breadth of online optimization techniques used in the power systems domain,i.e.,optimization-guided dynamic control,feedback optimization for single-period problems,Lyapunov-based optimization,and online convex optimization techniques for multi-period problems.Lastly,we recommend some potential future directions for online optimization in the power systems domain.
文摘In this paper,the problem of online distributed optimization subject to a convex set is studied via a network of agents.Each agent only has access to a noisy gradient of its own objective function,and can communicate with its neighbors via a network.To handle this problem,an online distributed stochastic mirror descent algorithm is proposed.Existing works on online distributed algorithms involving stochastic gradients only provide the expectation bounds of the regrets.Different from them,we study the high probability bound of the regrets,i.e.,the sublinear bound of the regret is characterized by the natural logarithm of the failure probability's inverse.Under mild assumptions on the graph connectivity,we prove that the dynamic regret grows sublinearly with a high probability if the deviation in the minimizer sequence is sublinear with the square root of the time horizon.Finally,a simulation is provided to demonstrate the effectiveness of our theoretical results.
文摘软件定义网络可以搭载灵活的流调度策略来提升网络服务系统的服务质量,但随着业务流量复杂度的提升,现有的流调度算法会因场景匹配度的下降而导致性能受到影响。为此提出一种基于深度强化学习的智能路由策略。该策略通过软件定义网络收集各链路信息,基于长短期记忆网络与近端策略优化算法实现特征提取与状态感知,最终决策生成符合业务场景下服务质量(quality of service,QoS)目标的动态流量调度策略,并实现QoS最大化。实验结果表明,所提的方案与现有的路由策略相比可以使整套系统QoS指标提升7.06%,有效地提升了业务系统的吞吐率。
