Ergodic theorems for discrete time stochastic systems using a stochastic lyapunov function
SIAM Journal on Control and Optimization
Brief paper: Stabilization of linear systems over networks with bounded packet loss
Automatica (Journal of IFAC)
Stability of Kalman filtering with Markovian packet losses
Automatica (Journal of IFAC)
Optimal control of LTI systems over unreliable communication links
Automatica (Journal of IFAC)
Brief paper: Kalman filtering over a packet-delaying network: A probabilistic approach
Automatica (Journal of IFAC)
Brief paper: Limitations in remote stabilization over unreliable channels without acknowledgements
Automatica (Journal of IFAC)
Brief paper: Tradeoffs between quantization and packet loss in networked control of linear systems
Automatica (Journal of IFAC)
Input-to-state stability of networked control systems
Automatica (Journal of IFAC)
Brief Nonlinear model predictive control with polytopic invariant sets
Automatica (Journal of IFAC)
Control over unreliable networks affected by packet erasures and variable transmission delays
IEEE Journal on Selected Areas in Communications
Automatica (Journal of IFAC)
Technical communique: A network-bound-dependent stabilization method of networked control systems
Automatica (Journal of IFAC)
Hi-index | 22.15 |
We study a predictive control formulation for uncertain discrete-time non-linear uniformly continuous plant models where controller output data is transmitted over an unreliable communication channel. The channel introduces Markovian data-loss and does not provide acknowledgments of receipt. To achieve robustness with respect to dropouts, at every sampling instant the controller transmits packets of data. These contain possible control inputs for a finite number of future time instants, and minimize a finite horizon cost function. At the actuator side, received packets are buffered, providing the plant inputs. Within this context, we adopt a stochastic Lyapunov function approach to establish stability results of the networked control system. A distinguishing aspect of this work is that it considers situations where the maximum number of consecutive packet dropouts has unbounded support.