z-logo
Premium
H  ∞  filtering for impulsive networked control systems with random packet dropouts and randomly occurring nonlinearities
Author(s) -
Kalidass Mathiyalagan,
Su Hongye,
Wu YuanQing,
Rathinasamy Sakthivel
Publication year - 2015
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.3169
Subject(s) - dropout (neural networks) , bernoulli's principle , network packet , control theory (sociology) , filter (signal processing) , linear matrix inequality , nonlinear system , bernoulli distribution , filtering problem , convex optimization , computer science , networked control system , control (management) , mathematics , regular polygon , mathematical optimization , filter design , engineering , random variable , physics , statistics , artificial intelligence , computer network , geometry , quantum mechanics , machine learning , computer vision , aerospace engineering
Summary In this paper, the problem of H  ∞  filtering for impulsive networked control systems with random packet dropouts and randomly occurring nonlinearities is investigated. By utilizing an impulsive model, the network‐induced imperfections including packet dropout and delay are described by the Bernoulli distributed sequence. The delay in the model is assumed to be time varying. Moreover, nonlinearity in the model is assumed to satisfy sector‐like nonlinearities. The H  ∞  filter is designed by using the linear matrix inequality (LMI) approach and convex optimization technique. The filter gain matrices for the nonlinear networked control systems can be achieved by solving LMIs, which can be easily facilitated by using some standard numerical packages. Finally, a numerical example is presented to demonstrate the effectiveness and applicability of the proposed results. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here