Guaranteed state estimation of synchronous generators based on DC programming

Author(s):  
Yongzhi Cai ◽  
Haoyong Chen ◽  
Pascal Dieu Seul Assala ◽  
Manlan Guo
2017 ◽  
Vol 40 (5) ◽  
pp. 1471-1480 ◽  
Author(s):  
Fuqiang You ◽  
Hualu Zhang ◽  
Fuli Wang

This paper presents a new improved set-membership algorithm for guaranteed state estimation for non-linear discrete-time systems with an unknown but bounded description of disturbance and noise. In this paper, the non-linear model is linearized first and the difference of convex (DC) programming method is used to outer-bound the linearization error, which is regarded as a disturbance of the system, and the improved set-membership algorithm guaranteed state estimation for the linearization system. An example is given to illustrate the proposed algorithm.


1987 ◽  
Vol 20 (5) ◽  
pp. 17-23
Author(s):  
F.L. Chernousko ◽  
A.I. Ovseevich ◽  
V.L. Trushchenkov

2017 ◽  
Vol 50 (1) ◽  
pp. 5418-5423 ◽  
Author(s):  
Md Masud Rana ◽  
Li Li ◽  
Steven W. Su

Automatica ◽  
2005 ◽  
Vol 41 (6) ◽  
pp. 1035-1043 ◽  
Author(s):  
T. Alamo ◽  
J.M. Bravo ◽  
E.F. Camacho

2018 ◽  
pp. 18-25 ◽  
Author(s):  
Boris Ananyev

The control problem by parameters in the course of the guaranteed state estimation of linear non-stationary systems is considered. It is supposed that unknown disturbances in the system and the observation channel are limited by norm in the space of square integrable functions and the initial state of the system is also unknown. The process of guaranteed state estimation includes the solution of a matrix Riccati equation that contains some parameters, which may be chosen at any instant of time by the first player (an observer) and the second player (an opponent of the observer). The purposes of players are diametrically opposite: the observer aims to minimize diameter of information set at the end of observation process, and the second player on the contrary aims to maximize it. This problem is interpreted as a differential game with two players for the Riccati equation. All the choosing parameters are limited to compact sets in appropriate spaces of matrices. The payoff of the game is interpreted through the Euclidean norm of the inverse Riccati matrix at the end of the process. A specific case of the problem with constant matrices is considered. Methods of minimax optimization, the theory of optimal control, and the theory of differential games are used. Examples are also given.


Sign in / Sign up

Export Citation Format

Share Document