Ultimately Bounded Output Feedback Control for Networked Nonlinear Systems With Unreliable Communication Channel: A Buffer-Aided Strategy

This paper concerns ultimately bounded output-feedback control problems for networked systems with unknown nonlinear dynamics. Sensor-to-observer signal transmission is facilitated over networks that has communication constraints.These transmissions are carried out over an unreliable communication channel. In order to enhance the utilization rate of measurement data, a buffer-aided strategy is novelly employed to store historical measurements when communication networks are inaccessible. Using the neural network technique, a novel observer-based controller is introduced to address effects of signal transmission behaviors and unknown nonlinear dynamics.Through the application of stochastic analysis and Lyapunov stability, a joint framework is constructed for analyzing resultant system performance under the introduced controller. Subsequently, existence conditions for the desired output-feedback controller are delineated. The required parameters for the observerbased controller are then determined by resolving some specific matrix inequalities. Finally, a simulation example is showcased to confirm method efficacy.

Online Learning Approaches in Maximizing Weighted Throughput in an Unreliable Channel

We design online algorithms to schedule unit-length packets with values and deadlines through an unreliable communication channel. In this model, time is discrete. Packets arrive over time; each packet has a non-negative value and an integer deadline. In each time step, at most one packet can be sent. The ratio of successfully delivering a packet depends on the channel＇s quality of reliability. The objective is to maximize the total value gained by delivering packets no later than their respective deadlines. In this paper, we conduct theoretical and empirical studies of online learning approaches for this model and a few of its variants. These online learning algorithms are analyzed in terms of external regret. We conclude that no online learning algorithms have constant regrets. Our online learning algorithms outperform online competitive algorithms in terms of algorithmic simplicity and running complexity. In general, these online learning algorithms work no worse than the best known competitive online algorithm for maximizing weighted throughput in practice.