4 May 2018 in IEEE Transactions on Smart Grid
Economic dispatch problem (EDP) is a fundamental optimization problem of power systems. With the penetration of renewable energy sources in microgrids, this paper proposes a distributed algorithm based on consensus theory to solve the EDP with a quadratic cost function. The method takes advantage of the fact that incremental costs need to be equal for all buses at optimal output power values. Thus, the incremental cost of each bus is selected as a consensus variable and the local mismatch between total demand and generation is assigned as a feedback variable to meet demand constraints. Unlike the existing related works, the feedback gains for the feedback variables are different and time-varying. Using multi-parameter perturbation theory and graph theory, the convergence of the algorithm is proved. Furthermore, the upper bounds of the feedback gains are given theoretically, and we obtain that the algorithm converges to the optimal solution at a rate governed by the second largest eigenvalue of the system matrix. Meanwhile, the algorithm is a fully distributed algorithm without a leader or a virtual command node. The simulation results illustrate the effectiveness of the algorithm even though there is a demand change or some generator is damaged. Some simulation results intuitively illustrate how the convergence speed changes with the feedback gains.
1 July 2019 in IEEE Transactions on Industrial Electronics
Motivated by the fact that gossip algorithms are asynchronous and suitable for the sensor networks with random link failures, a gossip-based distributed algorithm for the economic dispatch problem in smart grids is addressed. Random communication link failure phenomena may be very common in the realistic communication network. By modeling thus network as a Bernoulli network, the proposed algorithm can solve the economic dispatch problem in the imperfect communication network. Mean square consensus and almost sure consensus are adopted to analyze the convergence of the algorithm. Using matrix theory and perturbation theory, we prove that the algorithm can achieve mean square consensus and almost sure consensus. Therefore, the proposed algorithm converges to the optimal solution of the economic dispatch problem with probability one. The convergence speed of the algorithm is discussed and simulation results show that the convergence rate is governed by the second largest eigenvalue of the system matrix. Case studies are designed to illustrate the effectiveness and plug-and-play capability of the algorithm.
23 May 2024 in IEEE Transactions on Industrial Informatics
The transmission losses exist in power systems, and the communication network of smart grids is not fixed and reliable because of the intermittency of distributed renewable generations, packet loss, and uncertainty. Taking the issues into consideration in this work, we presented a distributed economic dispatch algorithm to address them. Assumed that the communication is random time-varying in the communication network and we proposed a distributed algorithm for the economic dispatch with B coefficient-based transmission losses. Instead of using simulation results to illustrate the effectiveness of the algorithm, the convergence and optimality of the designed algorithm are studied in this article. Furthermore, we show that the convergent speed is determined by the second largest eigenvalue (in modulus). Several simulation and comparison studies are given to show the effectiveness and superiority of the algorithm.
2 March 2023 in International Journal of Electrical Power & Energy Systems
10 November 2016 in SpringerPlus
We consider a class of second-order Emden–Fowler equations with positive and nonpositve neutral coefficients. By using the Riccati transformation and inequalities, several oscillation and asymptotic results are established. Some examples are given to illustrate the main results.
1 December 2024 in Journal of Mathematical Physics
In this paper, we consider a class nonlocal Kirchhoff–Choquard equation. Firstly, with the help of Pohozaev identity and Hardy–Littlewood–Sobolev inequality, we show a nonexistence result. Furthermore, by new truncation and subadditivity, as a ∈ (0, a*), we prove the existence of a couple of solution (u0,λ0)∈S(c)×R+. Lastly, as μ > 0, p = 2α, and 143<q<6, combining the technology and ideas of Jeanjean [Nonlinear Anal. Theory Math. Appl. 28(10), 1633 (1997)], we obtain at least one couple of solution (uc,λc)∈H1(RN)×R+.