This paper is concerned with overlapping modedependent H∞ control for a discrete-time Markov jump linear system in the presence of overlapping local operation modes and incomplete mode transition probabilities. By developing a randomly overlapping decomposition method, the system with deficient global operation modes is reformulated by a set of locally overlapping switched groups with accessible group and local modes. An overlapping group- And local-mode-dependent state feedback controller is delicately constructed. Unlike some existing controllers proposed in the literature, we do not require complete global mode information, but take full advantage of the knowledge of group and local modes of the reformulated system. Moreover, overlapping local modes are allowed to be existed in the formed groups. The stability analysis and control design procedures are developed based on the stochastic Lyapunov functional approach. The proposed framework is shown to be more general, which covers the traditional Markovian jump linear system with completely available global modes as a special case. In the case of only one local group, it is also shown that some existing results from the literature can be regarded as a special case of our derived results. A simulation example is finally presented to show the effectiveness and merits of the proposed method. © 2013 IEEE.
A self-triggered sampling scheme (STS) is proposed for a networked control system with consideration of data losses and communication delays. By making use of this scheme, the next sampling instant does not depend on online estimation of an event-triggered condition and the successive measurement of the state, and can be dynamically determined with respect to the transmitted packet, the desired control performance, and the allowable number of consecutive data losses and communication delays. Consequently, the sampling interval can be adaptively adjusted. Therefore, the communication burden can be greatly reduced and the energy efficiency can be much improved while preserving the desired H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> performance. An inverted pendulum and a one-area power system controlled over a wireless sensor network are given to illustrate the effectiveness of the proposed STS.
This paper is concerned with the stabilization for systems with two additive time-varying input delays arising from networked control systems. A new Lyapunov functional is constructed and a tighter upper bound of the derivative of the Lyapunov functional is derived by applying a convex polyhedron method. The resulting stability criteria are of fewer matrix variables and less conservative than some existing ones. Based on the stability criteria, a state feedback controller is designed such that the closed-loop system is asymptotically stable. Numerical examples are given to show the less conservatism of the stability criteria and the effectiveness of the designed method.
ChatGPT is a powerful artificial intelligence (AI) language model that has demonstrated significant improvements in various natural language processing (NLP) ta
This paper investigates the problem of robust stabilization of uncertain saturating actuator systems with a time-varying delay in both state and control. Employing the Razumikhin approach for the stability of functional differential equations, upper bounds on the time-varying delay are proposed such that the considered uncertain system is robustly globally or locally asymptotically stabilizable via memoryless state feedback control laws. These conditions are shown to be an extension of those given by [7] and less restrictive than those derived by [1]. A numerical example is included to illustrate the obtained results.
This study addresses the problem of distributed event‐triggered set‐membership filtering for a class of discrete time‐varying systems in the presence of unknown‐but‐bounded noises. First, an event‐triggered mechanism is introduced to choose those necessary data packets to be transmitted. Second, a partial information transmission scheme is proposed, by which, once an event is triggered, not all the information of the data packet, but parts of them are released to the communication network. As a result, communication network resources can be saved significantly. Third, some sufficient conditions on distributed networked set‐membership filtering are derived using a time‐varying convex optimisation approach. Moreover, based on an intersection method, a novel global estimation is proposed to integrate the local estimations by locating the intersection of all the local estimations within a volume‐minimal external ellipsoid. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed methods.
This paper presents a discrete event-triggered communication scheme for a class of networked Takagi-Sugeno (T-S) fuzzy systems. This scheme has two main features: i) whether or not the sampled state should be transmitted is determined by the current sampled state and the error between the current sampled state and the latest transmitted state, and ii) it is a discrete event-triggered communication scheme since the triggered conditions are measured and checked at the discrete sampling instant. Next, an asynchronous networked T-S fuzzy model is delicately constructed, which not only includes the state error, but also considers the non-uniform time scales in the networked T-S fuzzy model and the parallel distributed compensation fuzzy control rules. Then, using the Lyapunov-Krasovskii functional techniques, two sufficient conditions are derived for system analysis and synthesis, respectively. In particular, the derived stabilization criterion can provide a tradeoff to balance the required communication resources and the desired performance. Finally, a numerical example is given to show the effectiveness of the proposed method.
No abstract is provided for this article.
This paper is concerned with the distributed set-membership estimation for a discrete-time linear time-varying system over a resource-constrained wireless sensor network under the influence of unknown-but-bounded (UBB) process and measurement noise. Sensors collaborate among themselves by exchanging local measurements with only neighboring sensors in their sensing ranges. First, a new dynamic event-triggered transmission scheme (ETS) is developed to schedule the transmission of each sensor's local measurement. In contrast with the majority of existing static ETSs, the newly proposed dynamic ETS can result in larger average interevent times and thus less totally released data packets. Second, a criterion for designing desired event-triggered set-membership estimators is derived such that the system's true state always resides in each sensor's bounding ellipsoidal estimation set regardless of the simultaneous presence of UBB process and measurement noise. Third, a recursive convex optimization algorithm is presented to determine optimal ellipsoids as well as the estimator gain parameters and the event triggering weighting matrix parameter. Furthermore, the proposed dynamic ETS is applied to address the distributed set-membership estimation problem for a discrete-time linear time-varying system with a nonlinearity satisfying a sector constraint. Finally, an illustrative example is given to show the effectiveness and advantage of the developed approach.
This paper investigates event-triggered distributed control of networked large-scale systems under simultaneous consideration of network dynamics. Based on an information dispatching middleware, a framework of networked distributed large-scale systems is established. In terms of the middleware, the information selection module is developed to regulate the transmission of the sampled data by means of a novel event-triggered scheme. In the congestion avoidance module, a real-time scheduling strategy is proposed such that the released sampled output measurement data is transmitted within the allowable transmission network-induced delay. By employing Lyapunov-Krasovskii functional theory, sufficient conditions are derived such that the large-scale distributed system can achieve a prescribed H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> performance. Then the suitable distributed controllers and network congestion controllers can be co-designed provided that a set of linear matrix inequalities is feasible. Finally, an example is given to illustrate the merits and effectiveness of the proposed method.
This note is concerned with the event-triggered L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> control for a sampled-data control system. A novel event-triggered transmission scheme is first proposed to determine whether or not the sampled-data should be transmitted. Under this scheme, the sampled-data transmission should be executed only when a threshold is violated, which means that less sampled-data is transmitted. This scheme does not require any special hardware for continuous measurement. Then, the sampled-data control system is modeled as a sampled-data error dependent system. A stability criterion is derived by constructing a novel Lyapunov-Krasovskii functional which fully utilizes the sawtooth structure characteristic of an artificial delay. Based on this stability criterion, a sufficient condition on the existence of a state feedback controller is given. A co-design algorithm is provided to obtain the parameters of the event-triggered transmission scheme and the controller gain simultaneously. Finally, an inverted pendulum example is given to show the effectiveness of the event-triggered transmission scheme and the co-design algorithm.
This paper is concerned with event-triggered control of discrete-time systems with or without input saturation. First, an accumulative-error-based event-trigger
The stability problem for systems with distributed delay is considered using discretized Lyapunov functional. The coefficients associated with the distributed delay are assumed to be piecewise constant, and the discretization mesh may be non-uniform. The resulting stability criteria are written in the form of linear matrix inequality. Numerical examples are also provided to illustrate the effectiveness of the method. The basic idea can be extended to a more general setting with more involved formulation.
In this paper, an efficient loop filter is proposed to restore the decoded frame for HEVC. The loop filtering problem is modeled as an inverse problem and solved by maximum a posteriori estimation. By modeling non-local block similarity into the MRF prior, the proposed filter can be efficiently derived by solving an optimization problem. Both temporal and spatial adaptivity of the filter are considered during the implementation. Experimental results show that up to 5.6% bit rate reduction can be achieved by the proposed loop filter when compared with HEVC reference software HM13.0.
