Variance-constrained multiobjective control and filtering for nonlinear stochastic systems: A survey

The multiobjective control and filtering problems for nonlinear stochastic systems with variance constraints are surveyed. First, the concepts of nonlinear stochastic systems are recalled along with the introduction of some recent advances. Then, the covariance control theory, which serves as a practical method for multi-objective control design as well as a foundation for linear system theory, is reviewed comprehensively. The multiple design requirements frequently applied in engineering practice for the use of evaluating system performances are introduced, including robustness, reliability, and dissipativity. Several design techniques suitable for the multi-objective variance-constrained control and filtering problems for nonlinear stochastic systems are discussed. In particular, as a special case for the multi-objective design problems, the mixed H 2 / H ∞ control and filtering problems are reviewed in great detail. Subsequently, some latest results on the variance-constrained multi-objective control and filtering problems for the nonlinear stochastic systems are summarized. Finally, conclusions are drawn, and several possible future research directions are pointed out

On general systems with network-enhanced complexities

In recent years, the study of networked control systems (NCSs) has gradually become an active research area due to the advantages of using networked media in many aspects such as the ease of maintenance and installation, the large flexibility and the low cost. It is well known that the devices in networks are mutually connected via communication cables that are of limited capacity. Therefore, some network-induced phenomena have inevitably emerged in the areas of signal processing and control engineering. These phenomena include, but are not limited to, network-induced communication delays, missing data, signal quantization, saturations, and channel fading. It is of great importance to understand how these phenomena influence the closed-loop stability and performance properties

Fuzzy-logic-based control, filtering, and fault detection for networked systems: A Survey

This paper is concerned with the overview of the recent progress in fuzzy-logic-based filtering, control, and fault detection problems. First, the network technologies are introduced, the networked control systems are categorized from the aspects of fieldbuses and industrial Ethernets, the necessity of utilizing the fuzzy logic is justified, and the network-induced phenomena are discussed. Then, the fuzzy logic control strategies are reviewed in great detail. Special attention is given to the thorough examination on the latest results for fuzzy PID control, fuzzy adaptive control, and fuzzy tracking control problems. Furthermore, recent advances on the fuzzy-logic-based filtering and fault detection problems are reviewed. Finally, conclusions are given and some possible future research directions are pointed out, for example, topics on two-dimensional networked systems, wireless networked control systems, Quality-of-Service (QoS) of networked systems, and fuzzy access control in open networked systems.This work was supported in part by the National Natural Science Foundation of China under Grants 61329301, 61374039, 61473163, and 61374127, the Hujiang Foundation of China under Grants C14002 andD15009, the Engineering and Physical Sciences Research Council (EPSRC) of the UK, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Event-Based H∞ filter design for a class of nonlinear time-varying systems with fading channels and multiplicative noises

In this paper, a general event-triggered framework is developed to deal with the finite-horizon H∞ filtering problem for discrete time-varying systems with fading channels, randomly occurring nonlinearities and multiplicative noises. An event indicator variable is constructed and the corresponding event-triggered scheme is proposed. Such a scheme is based on the relative error with respect to the measurement signal in order to determine whether the measurement output should be transmitted to the filter or not. The fading channels are described by modified stochastic Rice fading models. Some uncorrelated random variables are introduced, respectively, to govern the phenomena of state-multiplicative noises, randomly occurring nonlinearities as well as fading measurements. The purpose of the addressed problem is to design a set of time-varying filter such that the influence from the exogenous disturbances onto the filtering errors is attenuated at the given level quantified by a H∞ norm in the mean-square sense. By utilizing stochastic analysis techniques, sufficient conditions are established to ensure that the dynamic system under consideration satisfies the H∞ filtering performance constraint, and then a recursive linear matrix inequality (RLMI) approach is employed to design the desired filter gains. Simulation results demonstrate the effectiveness of the developed filter design scheme

Variance-constrained state estimation for networked multi-rate systems with measurement quantization and probabilistic sensor failures

This paper is concerned with the variance-constrained state estimation problem for a class of networked multi-rate systems (NMSs) with network-induced probabilistic sensor failures and measurement quantization. The stochastic characteristics of the sensor failures are governed by mutually independent random variables over the interval [0,1]. By applying the lifting technique, an augmented system model is established to facilitate the state estimation of the underlying NMSs. With the aid of the stochastic analysis approach, sufficient conditions are derived under which the exponential mean-square stability of the augmented system is guaranteed, the prescribed H∞ performance constraint is achieved, and the individual variance constraint on the steady-state estimation error is satisfied. Based on the derived conditions, the addressed variance-constrained state estimation problem of NMSs is recast as a convex optimization one that can be solved via the semi-definite program method. Furthermore, the explicit expression of the desired estimator gains is obtained by means of the feasibility of certain matrix inequalities. Two additional optimization problems are considered with respect to the H∞ performance index and the weighted error variances. Finally, a simulation example is utilized to illustrate the effectiveness of the proposed state estimation method

Gossip Algorithms for Distributed Signal Processing

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page

Capturing Aggregate Flexibility in Demand Response

Flexibility in electric power consumption can be leveraged by Demand Response (DR) programs. The goal of this paper is to systematically capture the inherent aggregate flexibility of a population of appliances. We do so by clustering individual loads based on their characteristics and service constraints. We highlight the challenges associated with learning the customer response to economic incentives while applying demand side management to heterogeneous appliances. We also develop a framework to quantify customer privacy in direct load scheduling programs.Comment: Submitted to IEEE CDC 201

Distributed Detection and Estimation in Wireless Sensor Networks

In this article we consider the problems of distributed detection and estimation in wireless sensor networks. In the first part, we provide a general framework aimed to show how an efficient design of a sensor network requires a joint organization of in-network processing and communication. Then, we recall the basic features of consensus algorithm, which is a basic tool to reach globally optimal decisions through a distributed approach. The main part of the paper starts addressing the distributed estimation problem. We show first an entirely decentralized approach, where observations and estimations are performed without the intervention of a fusion center. Then, we consider the case where the estimation is performed at a fusion center, showing how to allocate quantization bits and transmit powers in the links between the nodes and the fusion center, in order to accommodate the requirement on the maximum estimation variance, under a constraint on the global transmit power. We extend the approach to the detection problem. Also in this case, we consider the distributed approach, where every node can achieve a globally optimal decision, and the case where the decision is taken at a central node. In the latter case, we show how to allocate coding bits and transmit power in order to maximize the detection probability, under constraints on the false alarm rate and the global transmit power. Then, we generalize consensus algorithms illustrating a distributed procedure that converges to the projection of the observation vector onto a signal subspace. We then address the issue of energy consumption in sensor networks, thus showing how to optimize the network topology in order to minimize the energy necessary to achieve a global consensus. Finally, we address the problem of matching the topology of the network to the graph describing the statistical dependencies among the observed variables.Comment: 92 pages, 24 figures. To appear in E-Reference Signal Processing, R. Chellapa and S. Theodoridis, Eds., Elsevier, 201