2000 character limit reached
Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit
Published 2 Aug 2013 in cs.SY, cs.IT, math.IT, and math.OC | (1308.0518v1)
Abstract: We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an L0 optimization, which can be effectively solved by orthogonal matching pursuit. Our formulation ensures asymptotic stability of the control loop in the presence of bounded packet dropouts.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.