Toward Simulation-Free Estimation of Critical Clearing Time
Contingency screening for transient stability of large-scale, strongly nonlinear, interconnected power systems is one of the most computationally challenging parts of Dynamic Security Assessment and requires huge resources to perform time-domain simulations-based assessment. To reduce computational...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers
2024
|
| Online Access: | https://hdl.handle.net/1721.1/155144 |
| _version_ | 1826188664614420480 |
|---|---|
| author | Vu, Thanh Long Al Araifi, Surour M. El Moursi, Mohamed S. Turitsyn, Konstantin |
| author2 | Massachusetts Institute of Technology. Department of Mechanical Engineering |
| author_facet | Massachusetts Institute of Technology. Department of Mechanical Engineering Vu, Thanh Long Al Araifi, Surour M. El Moursi, Mohamed S. Turitsyn, Konstantin |
| author_sort | Vu, Thanh Long |
| collection | MIT |
| description | Contingency screening for transient stability of large-scale, strongly nonlinear, interconnected power systems is one of the most computationally challenging parts of Dynamic Security Assessment and requires huge resources to perform time-domain simulations-based assessment. To reduce computational cost of time-domain simulations, direct energy methods have been extensively developed. However, these methods, as well as other existing methods, still rely on time-consuming numerical integration of the fault-on dynamics. This task is computationally hard, since possibly thousands of contingencies need to be scanned and thousands of accompanied fault-on dynamics simulations need to be performed and stored on a regular basis. In this paper, we introduce a novel framework to eliminate the need for fault-on dynamics simulations in contingency screening. This simulation-free framework is based on bounding the fault-on dynamics and extending the recently introduced Lyapunov Function Family approach for transient stability analysis of structure-preserving model. In turn, a lower bound of the critical clearing time is obtained by solving convex optimization problems without relying on any time-domain simulations. A comprehensive analysis is carried out to validate this novel technique on a number of IEEE test cases. |
| first_indexed | 2024-09-23T08:03:09Z |
| format | Article |
| id | mit-1721.1/155144 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2025-02-19T04:16:38Z |
| publishDate | 2024 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/1551442024-12-23T06:35:40Z Toward Simulation-Free Estimation of Critical Clearing Time Vu, Thanh Long Al Araifi, Surour M. El Moursi, Mohamed S. Turitsyn, Konstantin Massachusetts Institute of Technology. Department of Mechanical Engineering Contingency screening for transient stability of large-scale, strongly nonlinear, interconnected power systems is one of the most computationally challenging parts of Dynamic Security Assessment and requires huge resources to perform time-domain simulations-based assessment. To reduce computational cost of time-domain simulations, direct energy methods have been extensively developed. However, these methods, as well as other existing methods, still rely on time-consuming numerical integration of the fault-on dynamics. This task is computationally hard, since possibly thousands of contingencies need to be scanned and thousands of accompanied fault-on dynamics simulations need to be performed and stored on a regular basis. In this paper, we introduce a novel framework to eliminate the need for fault-on dynamics simulations in contingency screening. This simulation-free framework is based on bounding the fault-on dynamics and extending the recently introduced Lyapunov Function Family approach for transient stability analysis of structure-preserving model. In turn, a lower bound of the critical clearing time is obtained by solving convex optimization problems without relying on any time-domain simulations. A comprehensive analysis is carried out to validate this novel technique on a number of IEEE test cases. 2024-05-30T20:30:48Z 2024-05-30T20:30:48Z 2016-11 2024-05-30T20:11:16Z Article http://purl.org/eprint/type/JournalArticle 0885-8950 1558-0679 https://hdl.handle.net/1721.1/155144 T. L. Vu, S. M. Al Araifi, M. S. El Moursi and K. Turitsyn, "Toward Simulation-Free Estimation of Critical Clearing Time," in IEEE Transactions on Power Systems, vol. 31, no. 6, pp. 4722-4731, Nov. 2016. en 10.1109/tpwrs.2016.2523265 IEEE Transactions on Power Systems Creative Commons Attribution-Noncommercial-ShareAlike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers arxiv |
| spellingShingle | Vu, Thanh Long Al Araifi, Surour M. El Moursi, Mohamed S. Turitsyn, Konstantin Toward Simulation-Free Estimation of Critical Clearing Time |
| title | Toward Simulation-Free Estimation of Critical Clearing Time |
| title_full | Toward Simulation-Free Estimation of Critical Clearing Time |
| title_fullStr | Toward Simulation-Free Estimation of Critical Clearing Time |
| title_full_unstemmed | Toward Simulation-Free Estimation of Critical Clearing Time |
| title_short | Toward Simulation-Free Estimation of Critical Clearing Time |
| title_sort | toward simulation free estimation of critical clearing time |
| url | https://hdl.handle.net/1721.1/155144 |
| work_keys_str_mv | AT vuthanhlong towardsimulationfreeestimationofcriticalclearingtime AT alaraifisurourm towardsimulationfreeestimationofcriticalclearingtime AT elmoursimohameds towardsimulationfreeestimationofcriticalclearingtime AT turitsynkonstantin towardsimulationfreeestimationofcriticalclearingtime |