Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

2013/08/02 by Masaaki Nagahara, Nagahara, Masaaki, Daniel E. Quevedo +3
Engineering · #37N35 #47N70 #49J15 #49M20 #93C41 #93D20 #Advanced Control Systems Optimization #Control Systems and Identification #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Fault Detection and Control Systems #Information Theory (cs.IT) #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1308.0518

openalex publication_date 2013/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

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.

Related

• Sparse Packetized Predictive Control of Disturbed Plants Over Channels with Data Loss
• Impact of packet dropouts on the performance of optimal controllers and observers
• Predictive Network Control and Throughput Sub-Optimality of MaxWeight
• Self-triggered MPC robust to bounded packet loss via a min-max approach: extended version
• Stability of multiplexed NCS based on an epsilon-greedy algorithm for communication selection