1,919 research outputs found

    Sparse and Constrained Stochastic Predictive Control for Networked Systems

    Full text link
    This article presents a novel class of control policies for networked control of Lyapunov-stable linear systems with bounded inputs. The control channel is assumed to have i.i.d. Bernoulli packet dropouts and the system is assumed to be affected by additive stochastic noise. Our proposed class of policies is affine in the past dropouts and saturated values of the past disturbances. We further consider a regularization term in a quadratic performance index to promote sparsity in control. We demonstrate how to augment the underlying optimization problem with a constant negative drift constraint to ensure mean-square boundedness of the closed-loop states, yielding a convex quadratic program to be solved periodically online. The states of the closed-loop plant under the receding horizon implementation of the proposed class of policies are mean square bounded for any positive bound on the control and any non-zero probability of successful transmission

    Distributed filtering of networked dynamic systems with non-gaussian noises over sensor networks: A survey

    Get PDF
    summary:Sensor networks are regarded as a promising technology in the field of information perception and processing owing to the ease of deployment, cost-effectiveness, flexibility, as well as reliability. The information exchange among sensors inevitably suffers from various network-induced phenomena caused by the limited resource utilization and complex application scenarios, and thus is required to be governed by suitable resource-saving communication mechanisms. It is also noteworthy that noises in system dynamics and sensor measurements are ubiquitous and in general unknown but can be bounded, rather than follow specific Gaussian distributions as assumed in Kalman-type filtering. Particular attention of this paper is paid to a survey of recent advances in distributed filtering of networked dynamic systems with non-Gaussian noises over sensor networks. First, two types of widely employed structures of distributed filters are reviewed, the corresponding analysis is systematically addressed, and some interesting results are provided. The inherent purpose of adding consensus terms into the distributed filters is profoundly disclosed. Then, some representative models characterizing various network-induced phenomena are reviewed and their corresponding analytical strategies are exhibited in detail. Furthermore, recent results on distributed filtering with non-Gaussian noises are sorted out in accordance with different network-induced phenomena and system models. Another emphasis is laid on recent developments of distributed filtering with various communication scheduling, which are summarized based on the inherent characteristics of their dynamic behavior associated with mathematical models. Finally, the state-of-the-art of distributed filtering and challenging issues, ranging from scalability, security to applications, are raised to guide possible future research

    Non-fragile estimation for discrete-time T-S fuzzy systems with event-triggered protocol

    Get PDF
    summary:This paper investigates the non-fragile state estimation problem for a class of discrete-time T-S fuzzy systems with time-delays and multiple missing measurements under event-triggered mechanism. First of all, the plant is subject to the time-varying delays and the stochastic disturbances. Next, a random white sequence, the element of which obeys a general probabilistic distribution defined on [0,1][0,1], is utilized to formulate the occurrence of the missing measurements. Also, an event generator function is employed to regulate the transmission of data to save the precious energy. Then, a non-fragile state estimator is constructed to reflect the randomly occurring gain variations in the implementing process. By means of the Lyapunov-Krasovskii functional, the desired sufficient conditions are obtained such that the Takagi-Sugeno (T-S) fuzzy estimation error system is exponentially ultimately bounded in the mean square. And then the upper bound is minimized via the robust optimization technique and the estimator gain matrices can be calculated. Finally, a simulation example is utilized to demonstrate the effectiveness of the state estimation scheme proposed in this paper

    Design of State-based Schedulers for a Network of Control Loops

    Full text link
    For a closed-loop system, which has a contention-based multiple access network on its sensor link, the Medium Access Controller (MAC) may discard some packets when the traffic on the link is high. We use a local state-based scheduler to select a few critical data packets to send to the MAC. In this paper, we analyze the impact of such a scheduler on the closed-loop system in the presence of traffic, and show that there is a dual effect with state-based scheduling. In general, this makes the optimal scheduler and controller hard to find. However, by removing past controls from the scheduling criterion, we find that certainty equivalence holds. This condition is related to the classical result of Bar-Shalom and Tse, and it leads to the design of a scheduler with a certainty equivalent controller. This design, however, does not result in an equivalent system to the original problem, in the sense of Witsenhausen. Computing the estimate is difficult, but can be simplified by introducing a symmetry constraint on the scheduler. Based on these findings, we propose a dual predictor architecture for the closed-loop system, which ensures separation between scheduler, observer and controller. We present an example of this architecture, which illustrates a network-aware event-triggering mechanism.Comment: 17 pages, technical repor
    corecore