.png){kind=icon}
返回
A novel suboptimal method for solving polynomial filtering problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2015.09.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we derive the stochastic differentials of the conditional central moments of the nonlinear filtering problems, especially those of the polynomial filtering problem, and develop a novel suboptimal method by solving this evolution equation. The basic idea is to augment the state of the original nonlinear system by including the original states' conditional central moments such that the augmented states form a so-called bilinear system after truncating. During our derivation, it is clear to see that the stochastic differentials of the conditional central moments of the linear filtering problem (i.e., f, g and h are all at most degree one polynomials) form a closed system automatically without truncation. This gives one reason for the existence of optimal filtering for linear problems. On the contrary, the conditional central moments form an infinite dimensional system, in general. To reduce it to a closed-form, we let all the high enough central moments to be zero, as one did in the Carleman approach (Germani et al., 2007). Consequently, a novel suboptimal method is developed by dealing with the bilinear system. Numerical simulation is performed for the cubic sensor problem to illustrate the accuracy and numerical stability. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Polynomial filtering problems
Suboptimal filter
Recursive algorithm
Estimation theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏Highly Effective Recyclable Palladium-Catalyzed Ligand-Free Heck Reactions under Aerobic Conditions.png)
Synlett
SynlettIF0
PREAI
分享收藏
查看更多内容