2015
DOI: 10.1007/s13369-015-1698-6
|View full text |Cite
|
Sign up to set email alerts
|

State Space Least Mean Fourth Algorithm for Dynamic State Estimation in Power Systems

Abstract: Power system dynamic state estimation (DSE) has always been a critical problem in studying power systems. One of the essential parts of power systems are synchronous machines. In this work, we dealt with the problem of DSE of a synchronous machine by introducing a novel state space-based least mean fourth (SSLMF) algorithm. The rationale behind the proposed algorithm is the fact that a power system may encounter non-Gaussian disturbances/state errors and the least mean fourth algorithm is proven to be better i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 34 publications
0
6
0
Order By: Relevance
“…According to the steepest decent approach, the state updated rule is given by [ 2 , 3 , 24 ]: Here, is the predicted states, is the previous estimated states, μ is the scalar step size parameter, J ( k ) is the objective function to be minimized and Δ J ( k ) is the gradient decent. The cost function is defined by [ 2 , 3 ]: Here, e n ( k ) is the n-th error function, which is defined as follows: Here, and H n is the n-th row of the observation matrix.…”
Section: Proposed Estimation Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…According to the steepest decent approach, the state updated rule is given by [ 2 , 3 , 24 ]: Here, is the predicted states, is the previous estimated states, μ is the scalar step size parameter, J ( k ) is the objective function to be minimized and Δ J ( k ) is the gradient decent. The cost function is defined by [ 2 , 3 ]: Here, e n ( k ) is the n-th error function, which is defined as follows: Here, and H n is the n-th row of the observation matrix.…”
Section: Proposed Estimation Algorithmmentioning
confidence: 99%
“…According to the steepest decent approach, the state updated rule is given by [ 2 , 3 , 24 ]: Here, is the predicted states, is the previous estimated states, μ is the scalar step size parameter, J ( k ) is the objective function to be minimized and Δ J ( k ) is the gradient decent. The cost function is defined by [ 2 , 3 ]: Here, e n ( k ) is the n-th error function, which is defined as follows: Here, and H n is the n-th row of the observation matrix. The minimization of the cost function with respect to the predicted states lead to the following expression: From Eq (16) and Eq (19) , the update state estimation is expressed by [ 2 , 3 ]: Here, K is the user defined matrix, which depends on the specific application [ 2 , 3 ].…”
Section: Proposed Estimation Algorithmmentioning
confidence: 99%
See 3 more Smart Citations