A virtual actuator approach for the secure control of networked LPV systems under pulse-width modulated DoS attacks

In this paper, we formulate and analyze the problem of secure control in the context of networked linear parameter varying (LPV) systems. We consider an energy-constrained, pulse-width modulated (PWM) jammer, which corrupts the control communication channel by performing a denial-of-service (DoS) attack. In particular, the malicious attacker is able to erase the data sent to one or more actuators. In order to achieve secure control, we propose a virtual actuator technique under the assumption that the behavior of the attacker has been identified. The main advantage brought by this technique is that the existing components in the control system can be maintained without need of retuning them, since the virtual actuator will perform a reconfiguration of the plant, hiding the attack from the controller point of view. Using Lyapunov-based results that take into account the possible behavior of the attacker, design conditions for calculating the virtual actuators gains are obtained. A numerical example is used to illustrate the proposed secure control strategy.Peer ReviewedPostprint (author's final draft

Mathematical control of complex systems 2013

Mathematical control of complex systems have already become an ideal research area for control engineers, mathematicians, computer scientists, and biologists to understand, manage, analyze, and interpret functional information/dynamical behaviours from real-world complex dynamical systems, such as communication systems, process control, environmental systems, intelligent manufacturing systems, transportation systems, and structural systems. This special issue aims to bring together the latest/innovative knowledge and advances in mathematics for handling complex systems. Topics include, but are not limited to the following: control systems theory (behavioural systems, networked control systems, delay systems, distributed systems, infinite-dimensional systems, and positive systems); networked control (channel capacity constraints, control over communication networks, distributed filtering and control, information theory and control, and sensor networks); and stochastic systems (nonlinear filtering, nonparametric methods, particle filtering, partial identification, stochastic control, stochastic realization, system identification)

Analysis, filtering, and control for Takagi-Sugeno fuzzy models in networked systems

Copyright © 2015 Sunjie Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.The fuzzy logic theory has been proven to be effective in dealing with various nonlinear systems and has a great success in industry applications. Among different kinds of models for fuzzy systems, the so-called Takagi-Sugeno (T-S) fuzzy model has been quite popular due to its convenient and simple dynamic structure as well as its capability of approximating any smooth nonlinear function to any specified accuracy within any compact set. In terms of such a model, the performance analysis and the design of controllers and filters play important roles in the research of fuzzy systems. In this paper, we aim to survey some recent advances on the T-S fuzzy control and filtering problems with various network-induced phenomena. The network-induced phenomena under consideration mainly include communication delays, packet dropouts, signal quantization, and randomly occurring uncertainties (ROUs). With such network-induced phenomena, the developments on T-S fuzzy control and filtering issues are reviewed in detail. In addition, some latest results on this topic are highlighted. In the end, conclusions are drawn and some possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 11301118 and 61174136, the Natural Science Foundation of Jiangsu Province of China under Grant BK20130017, the Fundamental Research Funds for the Central Universities of China under Grant CUSF-DH-D-2013061, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks

Copyright © 2014 Derui Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Distributed Event-triggered Fault-tolerant Consensus Control of Multi-agent Systems under DoS Attacks

This study investigates the distributed fault-tolerant consensus issue of multi-agent systems subject to complicated abrupt and incipient time-varying actuator faults in physical hierarchy and aperiodic denial-of-service (DoS) attacks in networked hierarchy. Decentralized estimators are devised to estimate consecutive system states and actuator faults. A unified framework with an absolute local output-based closed-loop estimator in decentralized fault estimation design and a relative broadcasting state-based open-loop estimator in distributed event-triggered fault-tolerant consensus design is developed. Criteria of exponential consensus of the faulty multi-agent systems under DoS attacks are derived by virtue of average dwelling time and attack frequency technique. Simulations are outlined to confirm the efficacy of the proposed distributed fault-tolerant consensus control algorithm based on an event-triggered mechanism

A robust asynchronous sampled-data control design for nonlinear systems with actuator failures

This paper presents a recent self-sampled-data control algorithm applied to nonlinear systems with actuator failures. Our approach uses the linear model of a given nonlinear system, and based on a granted actuator fault observer method, an asynchronous sampled-data fault compensator controller is then formulated. The proposed sampling rule is realized by using an event-detector monitoring signal invention. On this way, the sampled rate is self governed and asynchronous by nature. Hence, our contribution is twofold. Fist, a new auto-generated non-uniform sampled-data mechanism is stated. Second, we grant an event-triggered control law with actuator failure observation and compensation. Our findings are completely supported by employing Lyapunov’s theory. Finally, according to our numerical experiments applied to an undamped torsional pendulum, our design is able to detect a failure in the actuator device and it can stabilize the undamped torsional pendulum system presenting better performance in comparison to its open-loop deployment.Postprint (published version

Self-Triggered and Event-Triggered Set-Valued Observers

This paper addresses the problem of reducing the required network load and computational power for the implementation of Set-Valued Observers (SVOs) in Networked Control System (NCS). Event- and self-triggered strategies for NCS, modeled as discrete-time Linear Parameter-Varying (LPV) systems, are studied by showing how the triggering condition can be selected. The methodology provided can be applied to determine when it is required to perform a full (``classical'') computation of the SVOs, while providing low-complexity state overbounds for the remaining time, at the expenses of temporarily reducing the estimation accuracy. As part of the procedure, an algorithm is provided to compute a suitable centrally symmetric polytope that allows to find hyper-parallelepiped and ellipsoidal overbounds to the exact set-valued state estimates calculated by the SVOs. By construction, the proposed triggering techniques do not influence the convergence of the SVOs, as at some subsequent time instants, set-valued estimates are computed using the \emph{conventional} SVOs. Results are provided for the triggering frequency of the self-triggered strategy and two interesting cases: distributed systems when the dynamics of all nodes are equal up to a reordering of the matrix; and when the probability distribution of the parameters influencing the dynamics is known. The performance of the proposed algorithm is demonstrated in simulation by using a time-sensitive example

Data analytics for stochastic control and prognostics in cyber-physical systems

In this dissertation, several novel cyber fault diagnosis and prognosis and defense methodologies for cyber-physical systems have been proposed. First, a novel routing scheme for wireless mesh network is proposed. An effective capacity estimation for P2P and E2E path is designed to guarantee the vital transmission safety. This scheme can ensure a high quality of service (QoS) under imperfect network condition, even cyber attacks. Then, the imperfection, uncertainties, and dynamics in the cyberspace are considered both in system model and controller design. A PDF identifier is proposed to capture the time-varying delays and its distribution. With the modification of traditional stochastic optimal control using PDF of delays, the assumption of full knowledge of network imperfection in priori is relaxed. This proposed controller is considered a novel resilience control strategy for cyber fault diagnosis and prognosis. After that, we turn to the development of a general framework for cyber fault diagnosis and prognosis schemes for CPSs wherein the cyberspace performance affect the physical system and vice versa. A novel cyber fault diagnosis scheme is proposed. It is capable of detecting cyber fault by monitoring the probability of delays. Also, the isolation of cyber and physical system fault is achieved with cooperating with the traditional observer based physical system fault detection. Next, a novel cyber fault prognosis scheme, which can detect and estimate cyber fault and its negative effects on system performance ahead of time, is proposed. Moreover, soft and hard cyber faults are isolated depending on whether potential threats on system stability is predicted. Finally, one-class SVM is employed to classify healthy and erroneous delays. Then, another cyber fault prognosis based on OCSVM is proposed --Abstract, page iv