21 May 2020 in IEEE Transactions on Industrial Informatics
The economic dispatch problem (EDP) plays a fundamental and significant role in smart grids. Its purpose is to decide the output power of every generator in smart grids for achieving the minimal generation cost. With advantages in flexibility, robustness, and scalability, it is desirable to apply distributed optimization methods to solve EDPs. In most existing distributed optimization approaches, all generators explicitly exchange their states with neighbors to obtain the optimal solution, which may result in disclosing the privacy information of generators. This problem becomes worse if there are some adversaries aimed at inferring privacy information from the communication network for nefarious purposes. For privacy preservation, a privacy preserving distributed optimization algorithm over time-varying directed communication networks is proposed in this article by adding conditional noises to the exchanged states. It is proved that this proposed algorithm is able to solve the EDP. Moreover, the convergence rate and privacy analysis of the proposed algorithm are also shown in this article. An example is provided to confirm the effectiveness of this proposed algorithm.
19 August 2019 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
The economic dispatch problem (EDP) is one of the fundamental and important problems in power systems. The objective of EDP is to determine the output generation of generators to minimize the total generation cost under various constraints. In this article, a finite-time consensus-based distributed optimization algorithm is proposed to solve EDP. It is only required that each device in the communication network has access to its own local generation cost function, designed virtual local demand and its neighbors' local optimization variables. The proposed finite-time algorithm can solve EDP, if the gain parameters in the algorithm satisfy some conditions under undirected and connected time-varying graphs. Moreover, the bounded or linear increasing assumption on the gradient and subgradient of objecive functions is relaxed in this algorithm. Examples under several cases are provided to verify the effectiveness of the proposed distributed optimization algorithm.
8 April 2021 in IEEE Transactions on Automatic Control
The problem of exponential stability for semi-Markov jump stochastic nonlinear systems is studied in this article. Semi-Markov chain is well known as an extension of the Markov chain, whose sojourn time distribution depends on the current and next states, and is no longer limited to the exponential distribution. However, in the existing works, the independence and the distribution function limitation are imposed on the sojourn time of semi-Markov jump systems. In this article, without additional constraints for the sojourn time, the problem of almost surely exponential stability is investigated for semi-Markov jump stochastic nonlinear systems by developing a new stochastic analysis method. In addition, mode-dependent linear comparable relationships are assumed among Lyapunov like functions, which can effectively reduce the conservatism caused by mode-independent case. To validate the developed theoretic results, two examples are provided in this article.
17 January 2022 in IEEE Transactions on Circuits and Systems I: Regular Papers
Setting retail electricity prices is one of the significant strategies for energy management of multi-microgrid (MMG) systems integrated with renewable energy. Nevertheless, the need of privacy preservation, the uncertainties of renewable energy and loads, as well as the time-varying scenarios, bring challenges for pricing problems. In this paper, a two-level pricing framework is proposed based on interval predictions and model-free reinforcement learning to address these challenges. In particular, at the higher level, the distribution system operator (DSO) is viewed as an agent, which sets retail electricity prices without detailed user information for privacy protection to maximize the total revenue from selling energy with reinforcement learning. For time-varying scenarios with intermittent photovoltaic power generation and diverse loads, a differentiable trust region layer is considered in reinforcement learning to improve the robustness of the policy updating process. While at the lower level, operators in microgrids solve three-phase unbalanced optimal power flow (OPF) problems to minimize generation cost and network power loss. Additionally, to deal with the challenges from the uncertainties of renewable power generation and user loads, interval predictions are chosen to quantify prediction errors and improve the flexibility of pricing policies. Finally, a set of experiments are conducted to validate the effectiveness of the proposed method for pricing problems in MMG systems.
25 October 2022 in IEEE Transactions on Network Science and Engineering
With the rapid development of the scale of distributed energy resources, the implementation of distributed algorithms imposes ever-increasing requirements on communication resources. With the aim of reducing the communication burden required to solve the economic dispatch problem, we here consider three key aspects, namely the amount of information exchanged per broadcast, the broadcast frequency per iteration, and the number of iterations needed to achieve a certain accuracy. The proposed primal-dual based algorithm is integrated with a discrete dynamic event-triggered scheme and enjoys significant advantages in all three mentioned aspects. We prove that the proposed algorithm converges to the optimal point at a linear convergence rate for suitable operating parameters and for cost functions that are strongly convex and smooth. We confirm the effectiveness and demonstrate the advantages of our approach by means of a set of simulation experiments.
9 November 2020 in IEEE Transactions on Network Science and Engineering
AVAthanasios V. Vasilakos
This paper develops a model-free approach to solve the event-triggered optimal consensus of multiple Euler-Lagrange systems (MELSs) via reinforcement learning (RL). Firstly, an augmented system is constructed by defining a pre-compensator to circumvent the dependence on system dynamics. Secondly, the Hamilton-Jacobi-Bellman (HJB) equations are applied to the deduction of the model-free event-triggered optimal controller. Thirdly, we present a policy iteration (PI) algorithm derived from RL, which converges to the optimal policy. Then, the value function of each agent is represented through a neural network to realize the PI algorithm. Moreover, the gradient descent method is used to update the neural network only at a series of discrete event-triggered instants. The specific form of the event-triggered condition is then proposed, and it is guaranteed that the closed-loop augmented system under the event-triggered mechanism is uniformly ultimately bounded (UUB). Meanwhile, the Zeno behavior is also eliminated. Finally, the validity of this approach is verified by a simulation example.