We aim to address the Nash equilibrium (NE) seeking problem for multiple players over Markovian switching communication networks in this article, where a new type of distributed synchronous discrete-time algorithm is proposed and utilized. Specifically, each player in the present game model is assumed to employ a gradient-like projection algorithm to choose its action based upon the estimated ones for all the others. Under the mild condition that the union network of all communication network candidates is connected, we show that the players' actions could converge to an arbitrarily small neighborhood of the NE in the mean-square sense by adjusting the algorithm parameters. It is further found that the unique NE is mean-square stable when it is not restricted by any constraint set. In addition, we show that the proposed distributed discrete-time NE seeking algorithm can be utilized to deal with the energy trading problem in microgrids where each microgrid is modeled as a rational player using a purchase price as its action to buy energy from other microgrids with surplus supplies. The energy market allocates the excess energy according to the principle of proportional distribution. Some numerical simulations are finally presented to verify the validity of the present discrete-time NE seeking algorithm in solving the energy trading problem.
2 November 2020 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
This article investigates the sliding-mode control design problem for uncertain time-varying delayed systems. A novel non-negative constraints approach is proposed, which can be used to determine the stability of the controlled systems during the sliding motion. A new stability condition is obtained, which is easy to satisfy and verify. The parameters of the sliding-mode surface can be calculated by solving the non-negative constraints-based optimization problem defined in this article. Simulation examples are presented to illustrate the effectiveness and advantages of the developed strategy.
This paper presents a power dispatch strategy combining the main grid and distributed generators based on aggregative game theory and the Cournot price mechanism. Such a dispatch strategy aims to increase the electricity under the power shortage situation. Under the proposed strategy, this paper designs a discrete-time algorithm fusing the estimation technique and the Digging method to solve the power shortage problem in a distributed way. The distributed algorithm can provide privacy protection and information safety and improve the power grid's extendibility. Moreover, the simulation results show that the proposed algorithm has favorable performance and effectiveness in the numerical example.