A Memory Weighted Protocol for Sampled-Data Systems Subjected to Packet Dropouts

We present a novel memory weighted protocol for consensus of first order agents under sampled-data communication subject to packet loses. Our protocol generalizes existing consensus protocols which consider lost packets as either switching topologies or time delays when a memory storage is available. It allows for a convex combination of these two strategies still maintaining the necessary row stochasticity. We use the L
²
joint spectral radius to analyze the convergence characteristics of our protocol. A theoretical analysis of our protocol is presented for different parameter regimes and supported by numerical simulations.