ABSTRACT The problem of secure observed‐based guaranteed cost control for networked control systems with mixed anomalies is studied in this article, and the anomalies are considered to exist in both the actuators and the communication channels. The mixed anomalies have brought new challenges to the secure guaranteed cost control because of the coupling property and diversity modes of anomalies. Thus, a secure generalized extended state observer is presented for the estimation of the system state and actuator anomalies. Then the systems with communication‐channel‐anomalies is modeled as switched systems and the secure observer‐based guaranteed cost control strategy is designed. Finally, simulation examples are given to show the effectiveness of the secure observer‐based guaranteed cost control method.

ABSTRACTThis paper investigates the cooperative output regulation (COR) problem for switched multi‐agent systems (MASs) with frequent asynchronism via an event‐triggered mechanism (ETM). In order to reduce the conservatism of the traditional approach that allows only one switching during the event interval, the frequent asynchronous switching strategy is introduced into the MASs with switching dynamics. This eliminates the restriction on the minimum dwell time for individual subsystems, and thus permits to switch more frequently during a triggered interval. Subsequently, a distributed event‐triggered dynamic compensator is designed. This compensator effectively facilitates the MASs to realize asymptotic tracking of the reference input while successfully rejecting the external disturbance. In contrast to the current achievements, the ETM presented in this article eliminates the need for any global information and avoids persistent communication between neighboring agents. Finally, the rationality of the proposed approach is confirmed by two examples.

ABSTRACTThis paper proposes an integral sliding mode control (ISMC) method based on preview repetitive control (PRC) for continuous‐time nonlinear systems with the presence of matched uncertainties, external disturbances, and norm‐bounded nonlinearities. First, a two‐dimensional (2D) dynamic system is constructed. Second, the linear matrix inequality (LMI)‐based condition is proposed, and the PRC law is designed for the nominal system. Then, a preview repetitive integral sliding mode control (PRISMC) law is obtained by combining an integral sliding mode controller with the preview repetitive controller, which ensures the robustness of the linear system. Finally, the effectiveness of the method is verified by a numerical simulation.

ABSTRACTThis paper proposes an adaptive multi‐lane fusion control strategy for a 2‐D plane vehicle platoon with delayed imposed distance constraints (DIDC) and actuator faults. DIDC is a novel distance constraint strategy that allows vehicles to operate freely at the initial stage and gradually enforces the constraint, thereby avoiding excessive early control efforts and enhancing flexibility in distance regulation. To handle the discontinuity caused by transitioning from no constraints to constraints, a shifting function and a transformed error function are designed, converting constrained variables into unconstrained ones while keeping the unconstrained part unchanged. Additionally, dead‐zone and actuator fault inputs are linearized, and unknown nonlinearities functions are approximated by radial basis function neural networks (RBFNNs) with weight update laws based on gradient descent to ensure fast convergence. Sliding‐mode controllers are developed for position and angle to achieve multi‐lane fusion and maintain platoon stability. Simulations and comparative analyses validate the effectiveness of the proposed method.

ABSTRACTThis paper investigates stochastic discrete‐time systems with multiplicative state‐dependent and input‐dependent noise via a novel adaptive dynamic programming(ADP) based control method combined with optimal stationary control techniques. Imposing a notably greater difficulty, the tracking control problem without the knowledge of system dynamics and the reference system has been generalized that the system dynamics do not have to be Hurwitz which is more practically relevant. An augmented system has been constructed while a discount factor has been introduced into the cost function. After the discount factor has been brought in to solve the stochastic algebraic Riccati equation(SARE), the linear quadratic tracking(LQT) problem has been proved to be well‐posed. Hence, we develop a second‐order moment formulation to solve the SARE. Based on stochastic adaptive control, a novel on‐policy ADP algorithm has been proposed to solve the LQT problem by only the state and input data. The convergence and stability of the novel ADP algorithm has been rigorously investigated and discussed. Finally, numerical simulations and practical experiments of two distinguished systems are performed to validate the effectiveness and practicability of the proposed ADP methodology.

ABSTRACTThis paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the distributed safe control of MASs. To bypass system identification, the closed‐loop dynamics are represented using collected data, and the safety constraints are imposed on this closed‐loop representation. This data‐efficient representation is subsequently integrated into QP optimizations, resulting in data‐driven QP formulations that learn the closed‐loop systems and their corresponding controllers, ensuring the safety of the MASs. As a result, the presented CBF‐based approach designs a safe controller based solely on input, state, and state‐derivative measurements without requiring knowledge of the underlying dynamics of the agents. Furthermore, for the special case of linear controllers, we show that the need for state‐derivative measurements can be eliminated. We also show that the sample complexity of learning closed‐loop dynamics is less than that of its model‐based counterpart, which relies on open‐loop system identification. The simulation results for a safe formation control problem demonstrate the efficacy of the proposed approach for the MASs.

ABSTRACTThis paper addresses the problem of event‐triggered predefined‐time adaptive bipartite consensus control for nonlinear multi‐agent systems (MASs) with actuator faults. By incorporating the command filter and error compensation mechanism into the backstepping design framework, the problem of “explosion of complexity” is effectively handled, while simultaneously reducing the effect of filtered errors. Moreover, the utilization of the adaptive compensation technique and event‐triggered control strategy effectively handles unknown actuator faults and conserves communication resources. The singularity issue is resolved by utilizing the feature of hyperbolic tangent functions. It is proven that the closed‐loop system is practically predefined‐time stable, and the bipartite consensus errors converge to a small neighborhood of the origin within a predefined time. Finally, simulation results confirm the effectiveness of the proposed predefined‐time control method.

ABSTRACTThis paper presents a dissipative filtering approach for a specific class of discrete‐time switched interconnected systems (DTSIS). The study considers discrete‐time subsystems with coupled states, while accounting for disturbances, sensor failures, and time‐varying delays. Also, the DTSIS is subject to uncertainties in the system parameters, which may affect its robustness, stability, and performance. Sensor signals are modeled as sequences of Bernoulli‐distributed white noise, reflecting potential errors and inconsistencies. The primary objective is to design a reliable dissipative filter capable of reducing the impact of external noise sources. The challenges posed by switching within the system are addressed using the average dwell time (ADT) method, which helps control the switching behavior. First, a filter is developed for the system under consideration, and the error dynamics are then analyzed through a linear matrix inequality (LMI) approach and Lyapunov‐Krasovskii theory. Stability conditions for the augmented system, encompassing both the system and error states, are derived. Finally, a numerical example is provided to demonstrate the effectiveness and practicality of the proposed approach.

ABSTRACTThis paper proposes a novel high‐precision distributed secure state estimation strategy for interconnected cyber‐physical systems (CPSs) under false data injection (FDI) attacks. To address the challenge of poor error convergence by existing theoretical suppression of actuator attacks and sensor attacks, intermediate variables and observer matrices are constructed to decouple the impact of actuator attacks, thereby ensuring that the estimation errors of system states and sensor attacks converge asymptotically with an explicitly controlled decay rate. This approach overcomes the precision limitations inherent in conventional methods, significantly improving both estimation accuracy and practical applicability. For the estimation of actuator attacks, distributed intermediate observers are designed based on the method and the observer designed for system state estimation. All observer matrices for actuator and sensor attacks are derived by solving linear matrix inequalities (LMIs). The observer design and stability conditions are based on the original system framework, without employing the popular augmented methods, while reducing communication overhead. Numerical simulations validate the theoretical claims and demonstrate the superior performance of the proposed distributed secure state estimation strategy.

ABSTRACTFor an r‐input m‐output multivariable ARX system, it is commonly decomposed into m subsystems for identification. However, the corresponding identification algorithms incur a high computational burden because they fail to account for the coupling between variables within the subsystems. After parameterization, considering that all subsystem identification models share a common input information vector, we derive the coupled identification model for the entire system. Based on the obtained coupled identification model, this paper presents a hierarchical stochastic gradient identification algorithm and a hierarchical multi‐innovation stochastic gradient identification algorithm, and their variants for multivariable ARX systems. Finally, the simulation example is provided to show the effectiveness of the proposed algorithms.