Analysis of security governed by dynamics of power systems, which we refer to as dynamic security analysis, is a primary but challenging task because of its hybrid nature, that is, nonlinear continuous-time dynamics integrated with discrete switchings. In this paper, we formulate this analysis problem as checking the reachability of a mathematical model representing dynamic performances of a target power system. We then propose a computational approach to the analysis based on the so-called RRT (Rapidly-exploring Random Tree) algorithm. This algorithm searches for a feasible trajectory connecting an initial state possibly at a lower security level and a target set with a desirable higher security level. One advantage of the proposed approach is that it derives a concrete control strategy to guarantee the desirable security level if the feasible trajectory is found. The performance and effectiveness of the proposed approach are demonstrated by applying it to two running examples on power system studies: single machine-infinite system and two-area system for frequency control problem.
Qiang WU
Chinese Academy of Sciences
Yoshihiko SUSUKI
Kyoto University,JST-CREST
T. John KOO
Hong Kong Science Park
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Qiang WU, Yoshihiko SUSUKI, T. John KOO, "RRT-Based Computation for Dynamic Security Analysis of Power Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 2, pp. 491-501, February 2016, doi: 10.1587/transfun.E99.A.491.
Abstract: Analysis of security governed by dynamics of power systems, which we refer to as dynamic security analysis, is a primary but challenging task because of its hybrid nature, that is, nonlinear continuous-time dynamics integrated with discrete switchings. In this paper, we formulate this analysis problem as checking the reachability of a mathematical model representing dynamic performances of a target power system. We then propose a computational approach to the analysis based on the so-called RRT (Rapidly-exploring Random Tree) algorithm. This algorithm searches for a feasible trajectory connecting an initial state possibly at a lower security level and a target set with a desirable higher security level. One advantage of the proposed approach is that it derives a concrete control strategy to guarantee the desirable security level if the feasible trajectory is found. The performance and effectiveness of the proposed approach are demonstrated by applying it to two running examples on power system studies: single machine-infinite system and two-area system for frequency control problem.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.491/_p
Copy
@ARTICLE{e99-a_2_491,
author={Qiang WU, Yoshihiko SUSUKI, T. John KOO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={RRT-Based Computation for Dynamic Security Analysis of Power Systems},
year={2016},
volume={E99-A},
number={2},
pages={491-501},
abstract={Analysis of security governed by dynamics of power systems, which we refer to as dynamic security analysis, is a primary but challenging task because of its hybrid nature, that is, nonlinear continuous-time dynamics integrated with discrete switchings. In this paper, we formulate this analysis problem as checking the reachability of a mathematical model representing dynamic performances of a target power system. We then propose a computational approach to the analysis based on the so-called RRT (Rapidly-exploring Random Tree) algorithm. This algorithm searches for a feasible trajectory connecting an initial state possibly at a lower security level and a target set with a desirable higher security level. One advantage of the proposed approach is that it derives a concrete control strategy to guarantee the desirable security level if the feasible trajectory is found. The performance and effectiveness of the proposed approach are demonstrated by applying it to two running examples on power system studies: single machine-infinite system and two-area system for frequency control problem.},
keywords={},
doi={10.1587/transfun.E99.A.491},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - RRT-Based Computation for Dynamic Security Analysis of Power Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 491
EP - 501
AU - Qiang WU
AU - Yoshihiko SUSUKI
AU - T. John KOO
PY - 2016
DO - 10.1587/transfun.E99.A.491
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2016
AB - Analysis of security governed by dynamics of power systems, which we refer to as dynamic security analysis, is a primary but challenging task because of its hybrid nature, that is, nonlinear continuous-time dynamics integrated with discrete switchings. In this paper, we formulate this analysis problem as checking the reachability of a mathematical model representing dynamic performances of a target power system. We then propose a computational approach to the analysis based on the so-called RRT (Rapidly-exploring Random Tree) algorithm. This algorithm searches for a feasible trajectory connecting an initial state possibly at a lower security level and a target set with a desirable higher security level. One advantage of the proposed approach is that it derives a concrete control strategy to guarantee the desirable security level if the feasible trajectory is found. The performance and effectiveness of the proposed approach are demonstrated by applying it to two running examples on power system studies: single machine-infinite system and two-area system for frequency control problem.
ER -