Sell Your Projects | My Account | Careers | This email address is being protected from spambots. You need JavaScript enabled to view it. | Call: +91 9573777164

Network-Based Filtering for Discrete-Time Systems

1 1 1 1 1 Rating 4.78 (46 Votes)


This correspondence is concerned with network-based $H_{infty}$ filtering for discrete-time systems. The output signals of the system under consideration are transmitted to the filter through a constraint communication network, which usually leads to network-induced delays and packet dropouts. By introducing a logic data packet processor to choose the newest data signal from the network to actuate the filter, network-induced delays and packet dropouts are modeled as a Markov chain taking values in a finite set. As a result, the filter to be designed is modeled as a Markov jumping linear filter. By introducing some slack matrix variables in terms of probability identity, a less conservative bounded real lemma (BRL) is derived to ensure that the filtering error system is stochastically stable with a prescribed $H_{infty}$ level. Based on this BRL, suitable $H_{infty}$ filters are designed by employing a cone complementary approach. A practical example on the Leslie model about some certain pest's structured population dynamics is given to show the effectiveness of the proposed approach.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

Network-Based Filtering for Discrete-Time Systems - 4.8 out of 5 based on 46 votes

Project EnquiryLatest Ready Available Academic Live Projects in affordable prices

Included complete project review wise documentation with project explanation videos and Much More...