Robust adaptive backstepping controller design for DC-DC buck converters with external disturbances

In modern power electronic systems, DC-DC converter is one of the main controlled power sources for driving DC systems. But the inherent nonlinear and time-varying characteristics often result in some difficulties mostly related to the control issue. This paper presents a robust nonlinear adaptive controller design with a recursive methodology based on the pulse width modulation (PWM) to drive a DC-DC buck converter. The proposed controller is designed based on the dynamical model of the buck converter where all parameters within the model are assumed as unknown. These unknown parameters are estimated through the adaptation laws and the stability of these laws are ensured by formulating suitable control Lyapunov functions (CLFs) at different stages. The proposed control scheme also provides robustness against external disturbances as these disturbances are considered within the model. One of the main features of the proposed scheme is that it overcomes the over-parameterization problems of unknown parameters which usually appear in some conventional adaptive methods. Finally, the effectiveness of the proposed control scheme is verified through the simulation results and compared to that of an existing adaptive backstepping controller. Simulation results clearly indicate the performance improvement in terms of a faster output voltage tracking response.

Reachable sets bounding for generalized neural networks with interval time-varying delay and bounded disturbances

This paper deals with the problem of finding outer bound of forwards reachable sets and interbound of backwards reachable sets of generalized neural network systems with interval nondifferentiable time-varying delay and bounded disturbances. Based on constructing a suitable Lyapunov–Krasovskii functional and utilizing some improved Jensen integral-based inequalities, two sufficient conditions are derived for the existence of: (1) the smallest possible outer bound of forwards reachable sets and (2) the largest possible interbound of backwards reachable sets. These conditions are delay dependent and in the form of matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. Three numerical examples with simulation results are provided to demonstrate the effectiveness of our results.