Mathematical Problems for Complex NetworksView this Special Issue
Recent Advances on Filtering and Control for Nonlinear Stochastic Complex Systems with Incomplete Information: A Survey
Some recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.
Filtering and control problems have long been a fascinating focus of research attracting constant attention from a variety of engineering areas. In recent years, with the rapid development of the network technology, 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 low cost, reduced weight and power requirements, simple installation and maintenance, as well as high reliability. It is well known that the devices in networks are mutually connected via communication cables which are of limited capacity. Therefore, some new 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 time delay, data missing (also called packet dropout or missing measurement), quantization, saturation, and channel fading. Note that these phenomena could drastically deteriorate the performance of the networked filtering or control systems and, as such, the aim of this paper is to deal with the filtering and control problems for nonlinear stochastic complex systems with aforementioned network-induced phenomena. In this paper, the information with respect to the network-induced phenomena is customarily referred to as the incomplete information.
Nowadays, practical engineering systems typically exhibit a great deal of complexity which poses significant challenges for the analysis and synthesis of such systems. Among others, the nonlinearity and stochasticity serve as two of the main sources in reality that have resulted in considerable system complexity and have received recurring research attention. Moreover, due to the unavoidable modeling errors and coupled dynamics, some new interesting phenomena (such as parameter uncertainties and coupling between control nodes) should be taken into account to achieve the desired performance. The complexity sources mentioned above give rise to the urgent necessity for developing new filtering and control technologies for various kinds of complex systems in order to meet the needs of practical engineering. It is not surprising that, in the past few years, the control and filtering problems for complex systems with incomplete information have been extensively investigated by many researchers.
In this paper, we focus mainly on the filtering and control problem for complex systems with incomplete information and aim to give a survey on some recent advances in this area. The incomplete information under consideration includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. The modeling issues are first discussed to reflect the real complexity of the nonlinear stochastic systems. Based on the models established, various filtering and control problems with incomplete information are reviewed in detail. Then, we deal with the complex systems from three aspects, that is, nonlinear stochastic systems, complex networks, and sensor networks. Both theories and techniques for dealing with complex systems are reviewed and, at the same time, some challenging issues for future research are raised. Subsequently, the filtering problems for the stochastic nonlinear complex networks with incomplete information are paid particular attention by summarizing the latest results. Finally, some conclusions are drawn and several possible related research directions are pointed out.
The remainder of this paper is organized as follows. In Section 2, the motivation for addressing the incomplete information is discussed. Section 3 reviews the developments of filtering and control issues for three kinds of complex systems. Section 4 gives latest results on filtering problems for the stochastic nonlinear complex networks with incomplete information. The conclusions and future work are given in Section 5.
2. Incomplete Information
Recently, the signal transmission via networked systems has become prevalent and, accordingly, network-induced issues have drawn considerable research interests. These issues mainly include missing measurements (also called packet dropouts), randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling whose mathematical models are listed in Table 1, where is the external disturbance while represents both the exogenous random inputs and parameter uncertainty of the system. Let us now discuss the network-induced issues one by one as follows in order to motivate the research problem to be investigated.
2.1. Missing Measurements
It is quite common in practice that the measurement output of a discrete-time stochastic system is not consecutive but contains missing observations due to a variety of causes such as sensor temporal failure and network-induced packet loss, see, for example, [1–3]. Therefore, it is not surprising that the filtering problem for systems with missing measurements has recently attracted much attention. For example, a binary switching sequence has been used in [4–6], which can be viewed as a Bernoulli distributed white sequence taking values of 0 and 1, to model the measurement missing phenomena. A Markovian jumping process has been employed in  to reflect the measurement missing problem. In [8, 9], the data missing (dropout) rate has been converted into the signal transmission delay that has both the upper and lower bounds. In , a model of multiple missing measurements has been presented by using a diagonal matrix to account for the different missing probability for individual sensors. By introducing a certain set of indicator functions, the packet dropouts and random sensor delays have been modeled in a unified way in . The optimal filtering problem for linear systems with multiple packet dropouts has been studied in , whereas the optimal filtering problem has been dealt with in  for the same systems. Moreover, the optimal filter design problem has been tackled in  for systems with multiple packet dropouts by solving a recursive difference equation (RDE).
2.2. Randomly Varying Sensor Delays
In practical applications such as engineering, biological, and economic systems, the measured output may be delayed. Therefore, the problem of filtering with delayed measurements has been attracting considerable research interests, see [7, 15, 16], for some recent publications, where the time-delay in the measurement is customarily assumed to be deterministic. However, it is quite common in practice that the time-delays occur in a random way, rather than a deterministic way, for a number of engineering applications such as real-time distributed decision-making and multiplexed data communication networks. Hence, there is a great need to develop new filtering approaches for the systems with randomly varying delayed measurements, and some efforts have been made in this regard so far. For example, in , a linear unbiased state estimation problem has been examined for discrete-time systems with random sensor delays over both finite- and infinite-horizons where the full and reduced-order filters have been designed to achieve specific estimation error covariances. These results have been extended in  to the case where parameter uncertainties are taken into account. A robust suboptimal filter design problem has been considered for uncertain discrete time-varying systems with randomly varying sensor delay in , where some sufficient conditions have been developed for the filter design such that the upper-bound of the state estimation error variance is minimized. Very recently, in , a linear matrix inequality (LMI) approach  has been developed to discuss the infinite-horizon filtering problem for linear discrete-time systems with randomly varying sensor delays.
2.3. Signal Quantization
The signal quantization is considered as another source that has significant impact on the achievable performance of the networked systems and, therefore, it is necessary to conduct analysis on the quantizers and understand how much effect the quantization makes on the overall networked systems. In fact, the problem of quantized control for nonnetworked systems has been reported as early as in 1990 . So far, a great number of results have been available in the literature, see for example, [22–27]. In , the feedback stabilization problems have been considered for linear time-invariant control systems with saturating quantized measurements. In , some general types of quantizers have been developed to solve the problem of feedback stabilization for general nonlinear systems. Recently, a new type of quantizer (called logarithmic quantizer) has attracted considerable research interest. Such a quantizer has proven to be the coarsest one in the problem of quadratic stabilization for discrete-time single-input-single-output linear time-invariant systems using quantized feedback under the assumption that the quantizer is static and time-invariant . Based on that, a number of quantized feedback design problems have been studied in  for linear systems, where the major contribution of  lies in that many quantized feedback design problems have been found to be equivalent to the well-known robust control problems with sector-bounded uncertainties. Later, the elegant results obtained in  have been generalized to the multiple-input-multiple-output systems and to control design with performance constraints. Inspiringly, in recent years, there have appeared some new results on NCSs with the consideration of signal quantization effects. In , the network-based guaranteed cost problem has been dealt with for linear systems with state and input quantization by using the method of sector bound uncertainties. Moreover, in , the problem of quantized state feedback stabilization has been addressed for linear time-invariant systems over data networks with limited network quality-of-service. Following that, the problem of output feedback control for NCSs with limited communication capacity has been investigated in , where the packet losses and quantization effects are taken into account simultaneously.
2.4. Sensor Saturations
In reality, the obstacles in delivering the high performance promises of traditional filter theories are often due to the physical limitations of system components, of which the most commonly encountered one stems from the saturation that occurs in any actuators, sensors, or certain system components. Saturation brings in nonlinear characteristics that can severely restrict the amount of deployable filter scheme. Such a characteristic not only limits the filtering performance that can otherwise be achieved without saturation, it may also lead to undesirable oscillatory behavior or, even worse, instability. Therefore, the control problems for systems under actuator/sensor saturations have attracted considerable research interests (see e.g., [31–37]), and the related filtering problem has also gained some scattered research attention [38, 39].
It should be pointed out that, in almost all the relevant literature, the saturation is implicitly assumed to occur already. However, in networked environments such as wireless sensor networks, the sensor saturation itself may be subject to random abrupt changes, for example, random sensor failures leading to intermittent saturation, sensor aging resulting in changeable saturation level, repairs of partial components, changes in the interconnections of subsystems, sudden environment changes, modification of the operating point of a linearized model of a nonlinear systems, and so forth. In other words, the sensor saturations may occur in a probabilistic way and are randomly changeable in terms of their types and/or intensity. Such a phenomenon of sensor saturation, namely, randomly occurring sensor saturation (ROSS), has been largely overlooked in the area.
2.5. Signal Sampling
With the rapid development of high-speed computers, modern control systems tend to be controlled by digital controllers, that is, only the samples of the control input signals at discrete time instants will be employed. The traditional approach is to use periodic sampling technique to obtain a discrete-time system for modeling the real plant. However, such a discrete-time model might not capture the intersample behavior of the real system, especially for the case when the sampling period is time-varying. On this account, considerable research efforts have been made on various aspects of sampled-data systems. For example, the optimal and suboptimal control problems for sampled-data systems have been studied in [40, 41] and [42, 43], respectively. As for the sampled-data filtering problem, let us mention some representative work here. In , the robust filtering problem has been investigated for a class of systems with parametric uncertainties and unknown time delays under sampled measurements. The nonlinear filtering problem for sampled-data systems has been considered in , where a set of certain continuous and discrete Hamilton-Jacobi equations has been established for the existence of the desired filter. In , the performance criterion in terms of the estimation error covariance has been proposed and the corresponding sampled-data filtering problem has been solved. It is worth pointing out that, in [47, 48], a new approach to dealing with the sampled-data control problems has been proposed by converting the sampling period into a time-varying but bounded delay, and then the sampled-data control problem has been investigated by recurring to the control theory for the time-delay systems. Based on this method, the sampled-data control and filtering problems have been thoroughly investigated in  and , respectively, where the stochastic sampling has been taken into account.
3. Complex Systems
In this section, we take a look at the theories and technologies for handling the filtering and control problems for the complex systems including nonlinear stochastic systems, complex networks, and sensor networks. Afterwards, we point out some challenging issues to be studied.
3.1. Nonlinear Stochastic Systems
The nonlinearity and stochasticity are arguably two of the main resources in reality that have resulted in considerable system complexity . In the past few years, nonlinear filtering and control have been an active branch within the general research area of nonlinear control problems, and a great deal of results have been available in the literature. For the control problems, we refer the readers to [51–54] and the references therein. With respect to the filtering problems, we mention some representative work as follows. In , the filtering problem has been investigated for a class of uncertain stochastic time-delay systems with sector-bounded nonlinearities. The reduced-order approximation of two-dimensional digital filters has been considered in , while  has designed a full-order filter for 2D Markovian jump systems. In , a nonlinear filtering problem has been studied for sampled-data systems. In [57, 58], the filtering problem has been considered for systems with constant and time-varying delay, respectively. It should be pointed out that, in all the papers mentioned above, the nonlinearities have been assumed to be bounded by a linearity-like form (e.g., Lipschitz and sector conditions), and the filters have been designed by solving a set of LMIs. With respect to general stochastic systems, the nonlinear filtering problem has been considered for discrete-time systems in , and a great effort has been paid in  to investigate the filtering problem for continuous stochastic systems with a very general form.
3.2. Complex Networks
Complex networks are made up of interconnected nodes and are used to describe various systems of real world. Many real world systems can be described by complex networks, such as the World Wide Web, telephone call graphs, neural networks, scientific citation web, and so forth. Since the discoveries of the “small-world” and “scale-free” properties of complex networks [61, 62], complex networks become a focus point of research which has attracted increasing attention from various fields of science and engineering. In particular, special attention has been paid to the synchronization problem for dynamical complex networks, in which each node is regarded as a dynamical element [63–65]. It has been shown that the synchronization is ubiquitous in many system models of the natural world, for example, the large-scale and complex networks of chaotic oscillators [66–73], the coupled systems exhibiting spatiotemporal chaos and autowaves , and the array of coupled neural networks [75–84].
Recently, the synchronization problem for discrete-time stochastic complex networks has drawn much research attention since it is rather challenging to understand the interaction topology of complex networks because of the discrete and random nature of network topology . On one hand, discrete-time networks could be more suitable to model digitally transmitted signals in many application areas such as image processing, time series analysis, quadratic optimization problems, and system identification. On the other hand, the stochastic disturbances over a real complex network may result from the release of probabilistic causes such as neurotransmitters , random phase-coupled oscillators , and packet dropouts . A great number of results have been available in the recent literature on the general topic of stochastic synchronization problem for discrete-time complex networks. For example, in , the synchronization stability problem has been studied for a class of complex dynamical networks with Markovian jumping parameters and mixed time delays.
Although the synchronization problem for discrete-time stochastic complex networks is now attracting an increasing research attention, there are still several open problems deserving further investigation. In a real world, virtually all complex networks are time-varying, that is, all the network parameters are explicitly dependent on time. For example, a major challenge in biological networks is to understand and model, quantitatively, the dynamic topological and functional properties of biological networks. Such time, or condition specific biological circuitries are referred to as time-varying networks or structural nonstationary networks, which are common in biological systems. The synchronization problem for time-varying complex networks has received some scattered research interest, where most literature has focused on time-varying coupling or time-varying delay terms. For example, in , a time-varying complex dynamical network model has been introduced and it has been revealed that the synchronization of such a model is completely determined by the innercoupling matrix, the eigenvalues, and the corresponding eigenvectors of the coupling configuration matrix of the network. Very recently, in , a class of controlled time-varying complex dynamical networks with similarity has been investigated and a decentralized holographic-structure controller has been designed to stabilize the network asymptotically at its equilibrium states. It should be pointed out that, up to now, the general synchronization results for complex networks with time-varying network parameters have been very few, especially when the networks exhibit both discrete-time and stochastic natures.
Closely associated with the synchronization problem is the so-called state estimation problem for complex networks. For large-scale complex networks, it is quite common that only partial information about the network nodes (states) is accessible from the network outputs. Therefore, in order to make use of key network nodes in practice, it becomes necessary to estimate the network nodes through available measurements. Note that the state estimation problem for neural networks (a special class of complex networks) was first addressed in  and has then drawn particular research interests, see, for example, [93, 94], where the networks are deterministic and continuous-time. Recently, the state estimation problem for complex networks has also gained much attention, see .
3.3. Sensor Networks
Sensor networks have recently received increasing interests due to their extensive application in areas such as information collection, environmental monitoring, industrial automation, and intelligent buildings [96, 97]. In particular, the distributed filtering or estimation for sensor networks has been an ongoing research issue that attracts increasing attention from researchers in the area. Compared to the single sensor, filter in a sensor network estimates the system state based not only on the sensor 's measurement but also on its neighboring sensors' measurements according to the topology of the given sensor network. Such a problem is usually referred to as the distributed filtering or estimation problem. The main difficulty in designing distributed filters lies in how to deal with the complicated coupling between one sensor and its neighboring sensors.
Recently, considerable research efforts have been made with respect to distributed filtering, and some novel distributed filters have been proposed. For example, a distributed estimation algorithm for sensor networks has been proposed in , where each node computes its estimate as a weighted sum of its own and its neighbors' measurements and estimates, and the weights are adaptively updated to minimize the variance of the estimation error. In , diffusion strategies have been suggested and then successfully applied to the distributed Kalman filtering, where nodes communicate with their direct neighbors only and the information is diffused across the network. By using the same diffusion strategies, the distributed Kalman smoother has been designed in . In , the notion of distributed bounded consensus filters has been proposed and the convergence analysis has been conducted for the corresponding distributed filters. It has been shown in  that, in view of the pinning control approach, only a small fraction of sensors are needed to measure the target information while the whole network can be controlled.
In the past few years, the consensus problems of multiagent networks have stirred a great deal of research interests, and a rich body of research results has been reported in the literature, see, for example, [102–110]. Representatively, in , a systematical framework of consensus problem has been proposed, and three kinds of networks including directed networks with fixed topology, directed networks with switching topology, and undirected networks with communication delay and fixed topology have been discussed by using the Lyapunov approach and the frequency domain theory. In , the performance constraint has been introduced to the consensus context, and a distributed robust consensus controller has been designed for the directed networks of agents with time-delay. The consensus protocol has been extended in , where the measurement noises have also been taken into account in constructing the consensus protocol. Comparing to the work mentioned above, in , the average consensus problems have been studied for agents with integrator dynamics in presence of communication delays. Recently, the consensus problem has also been studied for designing distributed Kalman filters (DKFs). For example, a distributed filter has been introduced in  that allows the nodes of a sensor network to track the average of sensor measurements using an average consensus-based distributed filter called consensus filter. The DKF algorithm presented in  has been modified in , where another two novel DKF algorithms have been proposed and the communication complexity as well as packet-loss issues have been discussed. The DKF problem considered in  is also based on the average consensus, where the node hierarchy has been used with nodes performing different types of processing and communications. Very recently, the consensus-based overlapping decentralized estimation problem has been dealt with in  for systems with missing observations and communication faults.
It is worth mentioning that, in almost all the literature concerning the distributed filtering problems, the filter design algorithm has been mainly based on the traditional Kalman filtering theory. Unfortunately, it is now well known that the robust performance of Kalman filters cannot always be guaranteed since Kalman filters tend to be sensitive to model structure drift [7, 45, 57, 60, 115–118]. As such, a variety of robust and/or filtering approaches have been proposed in the literature to improve the robustness of the filters against parameter uncertainties and exogenous disturbances. In this sense, it seems natural to include the robust and/or performance requirements for the distributed consensus filtering problems, and this deserves deep investigation.
4. Latest Progress
Very recently, the filtering problem for the stochastic nonlinear complex systems with incomplete information has been intensively studied and some elegant results have been reported. In this section, we highlight some of the newest work with respect to this topic.
(i) In , the filtering problem has been studied for a general class of nonlinear discrete-time stochastic systems with missing measurements and a filter of very general form has been designed such that the filtering process is stochastically stable and the filtering error satisfies performance constraint for all admissible missing observations and nonzero exogenous disturbances under the zero-initial condition. The existence conditions of the desired filter have been derived in terms of the Hamilton-Jacobi-Isaacs inequalities (HJIs). Then, by using similar analysis techniques, the filtering problem with randomly varying sensor delays has been considered in , and a set of parallel results has been derived.
(ii) In order to describe the phenomena of a nonlinear disturbance appearing in a random way, a notion of the randomly occurring nonlinearity has been introduced in [121, 122]. In , a new robust filtering technique has been developed for the Itô-type discrete time-varying stochastic systems with polytopic uncertainties, quantization effects, and randomly occurring nonlinearities. Then, the robust finite-horizon filtering problem has been studied in  for a class of discrete time-varying stochastic systems with norm-bounded uncertainties, multiple randomly occurred nonlinearities, and successive packet dropouts.
(iii) The filtering problem has been studied in  for a class of nonlinear systems with randomly occurring incomplete information, where the considered incomplete information includes both the sensor saturations and the missing measurements. A new phenomenon of sensor saturation, namely, randomly occurring sensor saturation, has first been put forward in order to better reflect the reality in a networked environment. Then, a novel sensor model has been established to account for both the randomly occurring sensor saturation and missing measurement in a unified representation. Based on this sensor model, a regional filter with a certain ellipsoid constraint has been designed such that the filtering error dynamics is locally mean-square asymptotically stable and the -norm requirement is satisfied.
(iv) In , a new distributed -consensus filtering problem over a finite-horizon has been addressed for sensor networks with multiple missing measurements. The so-called -consensus performance requirement is defined to quantify bounded consensus regarding the filtering errors (agreements) over a finite-horizon. A sufficient condition has first been established in terms of a set of difference linear matrix inequalities (DLMIs) under which the expected -consensus performance constraint is guaranteed. Then, the filter parameters have been explicitly parameterized by means of the solutions to a certain set of DLMIs that can be computed recursively. Subsequently, two kinds of robust distributed -consensus filters have been designed for the systems with norm-bounded uncertainties and polytopic uncertainties.
(v) In , the distributed filtering problem is dealt with for a class of polynomial nonlinear stochastic systems in sensor networks. A Lyapunov function candidate whose entries are polynomials has been adopted and then, a sufficient condition for the existence of a feasible solution to the addressed distributed filtering problem has been derived in terms of parameter-dependent linear matrix inequalities (PDLMIs). For computational convenience, these PDLMIs have further been converted into a set of sums of squares (SOSs) that can be solved effectively by using the semidefinite programming technique.
(vi) In , the problem of distributed filtering in sensor networks using a stochastic sampled-data approach has been investigated. The signal received by each sensor is sampled by a sampler separately with stochastic sampling periods before it is employed by the corresponding filter. By using the method of converting the sampling periods into bounded time-delays, the design problem of the stochastic sampled-data-based distributed filters amounts to solving the filtering problem for a class of stochastic nonlinear systems with multiple bounded time-delays. Then, by constructing a new Lyapunov functional and employing both the Gronwall's inequality and the Jenson integral inequality, a sufficient condition has been derived to guarantee the performance as well as the exponential mean-square stability of the resulting filtering error dynamics. Subsequently, the desired sampled-data-based distributed filters have been designed in terms of the solution to certain matrix inequalities.
(vii) In , new synchronization and state estimation problems have been considered for an array of coupled discrete time-varying stochastic complex networks over a finite-horizon. A novel concept of bounded synchronization has been proposed to handle the time-varying nature of the complex networks. By utilizing a time-varying real-valued function and the Kronecker product, criteria have been established that ensure the bounded synchronization in terms of a set of recursive linear matrix inequalities (RLMIs). The bounded state estimation problem has then been studied for the same complex network, where the purpose is to design a state estimator to estimate the network states through available output measurements such that, over a finite-horizon, the dynamics of the estimation error is guaranteed to be bounded with a given disturbance attenuation level. Again, an RLMI approach has been developed for the state estimation problem.
5. Conclusions and Future Work
In this paper, we have surveyed some recent advances on the filtering and control for complex systems with incomplete information. The developments of the incomplete information models have been reviewed and various filtering and control problems based on these incomplete information have been discussed. Then, we have introduced basic theories and methods for dealing with filtering and control problems of complex systems and raised a few challenging issues. Subsequently, we have paid particular attention to the filtering problems of the stochastic nonlinear complex systems with incomplete information and given the latest results. Related topics for the future research work are listed below.(i)In practical engineering, there still exist many more complex yet important network-induced issues which, however, have not been studied. Therefore, these new phenomena of incomplete information should be paid great attention to, and a unified measurement model accounting for these issues simultaneously also remains to be established.(ii)The polynomial nonlinear system is one of the most important classes of nonlinear systems. The control and filtering problems for polynomial nonlinear systems with kinds of incomplete information are interesting and deserve further investigation. The analysis and synthesis of polynomial nonlinear controllers and filters for the polynomial nonlinear systems would be a challenging research topic.(iii)The problems of fault detection and fault tolerant control in the presence of incomplete information are of engineering significance, especially when the system is time varying. Hence, the problems of fault detection and fault tolerant control for time-varying systems with incomplete information over a finite time-horizon would be another interesting topic.(iv)Note that the incomplete information usually occurs in a random way which makes the considered system stochastic. In this case, the performance objection is only required to be achieved in the desired probability. Therefore, the control and filtering problems for nonlinear stochastic systems with probabilistic performance are of significant engineering importance.(v)Applications of the existing theories and methodologies to some practical engineering problems such as the mobile robot navigation would be another one of the future work.
This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany.
M. Basin, E. Sanchez, and R. Martinez-Zuniga, “Optimal linear filtering for systems with multiple state and observation delays,” International Journal of Innovative Computing, Information and Control, vol. 3, no. 5, pp. 1309–1320, 2007.View at: Google Scholar
M. Basin, J. Perez, and D. Calderon-Alvarez, “Optimal filtering for linear systems over polynomial observations,” International Journal of Innovative Computing, Information and Control, vol. 4, no. 2, pp. 313–320, 2008.View at: Google Scholar
M. S. Mahmoud, Y. Shi, and H. N. Nounou, “Resilient observer-based control of uncertain time-delay systems,” International Journal of Innovative Computing, Information and Control, vol. 3, no. 2, pp. 407–418, 2007.View at: Google Scholar
E. Yaz and A. Ray, “Linear unbiased state estimation for random models with sensor delay,” in Proceedings of the 35th IEEE Conference on Decision and Control, pp. 47–52, Kobe, Japan, December 1996.View at: Google Scholar
D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.View at: Google Scholar
V. Perez-Munuzuri, V. Perez-Villar, and L. O. Chua, “Autowaves for image processing on a two-dimensional CNN array of excitable nonlinear circuits: flat and wrinkled labyrinths,” IEEE Transactions on Circuits and Systems I, vol. 40, no. 3, pp. 174–181, 1993.View at: Publisher Site | Google Scholar | Zentralblatt MATH
X. Hu and J. Wang, “Design of general projection neural networks for solving monotone linear variational inequalities and linear and quadratic optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 37, no. 5, pp. 1414–1421, 2007.View at: Publisher Site | Google Scholar
Z. Toroczkai, “Complex networks: the challenge of interaction topology,” Los Alamos Science, no. 29, pp. 94–109, 2005.View at: Google Scholar
W. Zhong, J. D. Stefanovski, G. M. Dimirovski, and J. Zhao, “Decentralized control and synchronization of time-varying complex dynamical network,” Kybernetika, vol. 45, no. 1, pp. 151–167, 2009.View at: Google Scholar
F. S. Cattivelli, C. G. Lopes, and A. H. Sayed, “Diffusion strategies for distributed Kalman filtering: formulation and perfor- mance analysis,” in Proceedings of the IAPR Workshop on Cognitive Information, Santorini, Greece, June 2008.View at: Google Scholar
F. S. Cattivelli and A. H. Sayed, “Diffusion mechanisms for fixed-point distributed Kalman smoothing,” in Proceedings of the European Signal Processing Conference, pp. 1–4, Lausanne, Switzerland, August 2008.View at: Google Scholar
B. D. O. Anderson and J. B. Moore, Optimal Filtering, Prentice-Hall, Englewood Cliffs, NJ, USA, 1979.View at: Zentralblatt MATH
Z. Wang, B. Shen, and X. Liu, “ filtering with randomly occurring sensor saturations and missing measurements,” Automatica. In press.View at: Google Scholar
B. Shen, Z. Wang, Y. S. Hung, and G. Chesi, “Distributed filtering for polynomial nonlinear stochastic systems in sensor networks,” IEEE Transactions on Industrial Electronics, vol. 58, no. 5, pp. 1971–1979, 2011.View at: Google Scholar