.png){kind=icon}
.png){kind=icon}
Return
A set-membership state estimation algorithm based on DC programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2007.05.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new approach to guaranteed state estimation for nonlinear discrete-time systems with a bounded description of noise and parameters. The sets of states that are consistent with the evolution of the system, the measured outputs and bounded noise and parameters are represented by zonotopes DC programming and intersection operations are used to obtain a tight bound. An example is given to illustrate the proposed algorithm. (C) 2007 Published by Elsevier Ltd.
Keywords:
nonlinear observers
set-membership state estimation
DC programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
