z-logo
Premium
State estimation for a networked control system with packet delay, packet dropouts, and uncertain observation in S‐E and C‐A channels
Author(s) -
Roy Avinash Kumar,
Srinivasan K.
Publication year - 2020
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.2614
Subject(s) - estimator , network packet , bernoulli's principle , control theory (sociology) , minimum variance unbiased estimator , computer science , actuator , random variable , variance (accounting) , state (computer science) , channel (broadcasting) , mathematics , mathematical optimization , control (management) , algorithm , engineering , statistics , computer network , accounting , artificial intelligence , aerospace engineering , business
Summary In this work, a minimum variance estimator is designed for a networked system with inherent network imperfections in both sensor to estimator (S‐E) and controller to actuator (C‐A) channels simultaneously. The channels are affected by packet delays, dropouts, and uncertain observations. These effects are modeled using five Bernoulli distributed random variables. Correlation of noise at neighboring time caused by random delay is avoided by introducing two additional variables in the augmented stochastic model. The developed augmented stochastic model can handle network imperfections in both the S‐E and C‐A channels simultaneously. A minimum variance recursive linear estimator is designed using an innovation approach and projection theorem. Furthermore, sufficient condition is presented for the existence of steady state property of the proposed estimator. Simulation studies are carried out for the proposed estimator using a numerical example and a single link robot arm. Finally, performance comparison with other popular filters shows the effectiveness of the designed estimator.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here