首页> 外文期刊>Neural Networks and Learning Systems, IEEE Transactions on >State-Saturated Recursive Filter Design for Stochastic Time-Varying Nonlinear Complex Networks Under Deception Attacks
【24h】

State-Saturated Recursive Filter Design for Stochastic Time-Varying Nonlinear Complex Networks Under Deception Attacks

机译:用于随机时变非线性复杂网络的状态饱和递归滤波器设计在欺骗性攻击下

获取原文
获取原文并翻译 | 示例
       

摘要

This article tackles the recursive filtering problem for a class of stochastic nonlinear time-varying complex networks (CNs) suffering from both the state saturations and the deception attacks. The nonlinear inner coupling and the state saturations are taken into account to characterize the nonlinear nature of CNs. From the defender's perspective, the randomly occurring deception attack is governed by a set of Bernoulli binary distributed white sequence with a given probability. The objective of the addressed problem is to design a state-saturated recursive filter such that, in the simultaneous presence of the state saturations and the randomly occurring deception attacks, a certain upper bound is guaranteed on the filtering error covariance, and such an upper bound is then minimized at each time instant. By employing the induction method, an upper bound on the filtering error variance is first constructed in terms of the solutions to a set of matrix difference equations. Subsequently, the filter parameters are appropriately designed to minimize such an upper bound. Finally, a numerical simulation example is provided to demonstrate the feasibility and usefulness of the proposed filtering scheme.
机译:本文解决了患有状态饱和和欺骗攻击的一类随机非线性时变网络(CNS)的递归过滤问题。非线性内耦合和状态饱和性被考虑以表征CNS的非线性性质。从后卫的角度来看,随机发生的欺骗攻击由一组Bernoulli二进制分布式白色序列管辖,具有给定概率。解决问题的目的是设计一种状态饱和的递归滤波器,使得在状态饱和和随机发生的欺骗攻击的同时存在中,在滤波误差协方差上保证某个上限,并且如此上限然后在每次瞬间最小化。通过采用感应方法,首先以对一组矩阵差方程的解决方案构造过滤误差方差的上限。随后,适当地设计过滤器参数以最小化这种上限。最后,提供了数值模拟示例以证明所提出的过滤方案的可行性和有用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号