Datar, AdwaitAdwaitDatarSchneider, DanielDanielSchneiderMirali, FurughFurughMiraliWerner, HerbertHerbertWernerFrey, HannesHannesFrey2019-04-252019-04-252018-08-09American Control Conference (2018-June): 2485-2490 (2018-08-09)http://hdl.handle.net/11420/2487© 2018 AACC. 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 L2 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.en0743-1619201824852490Conference Paper10.23919/ACC.2018.8431063Other