Event-Triggered Recursive Filtering for Shift-Varying Linear Repetitive Processes.

This paper addresses the recursive filtering problem for shift-varying linear repetitive processes (LRPs) with limited network resources. To reduce the resource occupancy, a novel event-triggered strategy is proposed where the concern is to broadcast those necessary measurements to update the innovation information only when certain events appear. The primary goal of this paper is to design a recursive filter rendering that, under the event-triggered communication mechanism, an upper bound (UB) on the filtering error variance is ensured and then optimized by properly determining the filter gains. As a distinct kind of 2-D systems, the LRPs are cast into a general Fornasini-Marchesini model by using the lifting technique. A new definition of the triggering-shift sequence is introduced and an event-triggered rule is then constructed for the transformed system. With the aid of mathematical induction, the filtering error variance is guaranteed to have a UB which is subsequently optimized with appropriate filter parameters via solving two series of Riccati-like difference equations. Theoretical analysis further reveals the monotonicity of the filtering performance with regard to the event-triggering threshold. Finally, an illustrative simulation is given to show the feasibility of the designed filtering scheme.