ABSTRACT
In this chapter, the SMC problem is studied for state-saturated systems under multiple-packet transmission protocol, in which a generalized time-varying fading channel is concerned. The underlying fading channels, whose channel fading amplitudes are allowed to be different, are modelled as a finite-state Markov process. A key feature of the problem addressed is to use a hidden Markov mode detector to estimate the actual network mode. The novel model of hidden Markov fading channels is shown to be more general yet practical than the existing fading channel models. Based on a linear sliding surface, a switching-type SMC law is dedicatedly constructed by just using the estimated network mode. By exploiting the approach of hidden Markov models, sufficient conditions are obtained for the resultant SMC systems that ensure both the mean-square stability and the reachability with a sliding region. With the aid of the Hadamard product, a binary genetic algorithm (GA) is developed to solve the proposed SMC design problem subject to some nonconvex constraints induced by the state saturations and the fading channels, where the proposed GA is based on the objective function for optimal reachability. Finally, a numerical example is employed to verify the proposed results.
