TS Fuzzy Robust Sampled-Data Control for Nonlinear Systems with Bounded Disturbances

We investigate robust fault-tolerant control pertaining to Takagi–Sugeno (TS) fuzzy nonlinear systems with bounded disturbances, actuator failures, and time delays. A new fault model based on a sampled-data scheme that is able to satisfy certain criteria in relation to actuator fault matrix is introduced. Specifically, we formulate a reliable controller with state feedback, such that the resulting closed-loop-fuzzy system is robust, asymptotically stable, and able to satisfy a prescribed H∞ performance constraint. Linear matrix inequality (LMI) together with a proper construction of the Lyapunov–Krasovskii functional is leveraged to derive delay-dependent sufficient conditions with respect to the existence of robust H∞ controller. It is straightforward to obtain the solution by using the MATLAB LMI toolbox. We demonstrate the effectiveness of the control law and less conservativeness of the results through two numerical simulations.

Fixed-Time Formation Control for Second-Order Disturbed Multi-Agent Systems under Directed Graph

This paper investigates the fixed-time formation (FixF) control problem for second-order multi-agent systems (MASs), where each agent is subject to disturbance and the communication network is general directed. First, a FixF protocol is presented based on the backstepping technique, where the distributed cooperative variable structure control method is utilized to handle the bounded disturbances. Then, to remove the dependence of control gains on the global information, a practical adaptive FixF control is presented, where the MASs can achieve formation with a bounded error within fixed time. Finally, a numerical example is presented to validate the theoretical result.

Ellipsoidal Set Based Command Governors for Constrained Linear Systems with Bounded Disturbances

This paper provides a solution for a linear command governor (CG) that employs invariant and constraint-admissible ellipsoid. The motivation is to substitute the typical polyhedral set used in almost all CG schemes with the ellipsoidal one, which is much easier to construct. However the price for this offline computational efficiency is that the size of the feasible set can be relatively small, and the online computational burden is heavier than that of polyhedral set based CGs. The proposed solution overcomes these two weaknesses and offers a very attractive alternative to polyhedral set based CG. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed algorithm.

Ellipsoidal Set Based Command Governors for Constrained Linear Systems with Bounded Disturbances

This paper provides a solution for a linear command governor (CG) that employs invariant and constraint-admissible ellipsoid. The motivation is to substitute the typical polyhedral set used in almost all CG schemes with the ellipsoidal one, which is much easier to construct. However the price for this offline computational efficiency is that the size of the feasible set can be relatively small, and the online computational burden is heavier than that of polyhedral set based CGs. The proposed solution overcomes these two weaknesses and offers a very attractive alternative to polyhedral set based CG. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed algorithm.

A method for constructing an optimal control strategy in a linear terminal problem

This paper deals with an optimal control problem for a linear discrete system subject to unknown bounded disturbances, where the control goal is to steer the system with guarantees into a given terminal set while minimising the terminal cost function. We define an optimal control strategy which takes into account the state of the system at one future time instant and propose an efficient numerical method for its construction. The results of numerical experiments show an improvement in performance under the optimal control strategy in comparison to the optimal open-loop worst-case control while maintaining comparable computation times.