Please use this identifier to cite or link to this item:
|Title:||Second-order continuous-time algorithm for optimal resource allocation in power systems||Authors:||Wang, Dong
|Keywords:||Engineering::Mechanical engineering||Issue Date:||2018||Source:||Wang, D., Wang, Z., Wen, C. & Wang, W. (2018). Second-order continuous-time algorithm for optimal resource allocation in power systems. IEEE Transactions On Industrial Informatics, 15(2), 626-637. https://dx.doi.org/10.1109/TII.2018.2881974||Journal:||IEEE Transactions on Industrial Informatics||Abstract:||In this paper, based on differential inclusions and the saddle point dynamics, a novel second-order continuous-time algorithm is proposed to solve the optimal resource allocation problem in power systems. The considered cost function is the sum of all local cost functions with a set of affine equality demand constraints and an inequality constraint on generating capacity of the generator. In virtue of nonsmooth analysis, geometric graph theory, and Lyapunov stability theory, all generators achieve consensus on the Lagrange multipliers associated with a set of affine equality constraints while the proposed algorithm converges exponentially to the optimal solution of the resource allocation problem starting from any initial states over an undirected and connected graph. Moreover, the obtained results can be further extended to the optimal resource allocation problem in case of switching communication topologies. Finally, two numerical examples involving a smart grid system composed of five generators and the IEEE 30-bus system demonstrate the effectiveness and the performance of the theoretical results.||URI:||https://hdl.handle.net/10356/150999||ISSN:||1551-3203||DOI:||10.1109/TII.2018.2881974||Rights:||© 2018 IEEE. All rights reserved.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||MAE Journal Articles|
Updated on Oct 19, 2021
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.