559 research outputs found
Multiple Loop Self-Triggered Model Predictive Control for Network Scheduling and Control
We present an algorithm for controlling and scheduling multiple linear
time-invariant processes on a shared bandwidth limited communication network
using adaptive sampling intervals. The controller is centralized and computes
at every sampling instant not only the new control command for a process, but
also decides the time interval to wait until taking the next sample. The
approach relies on model predictive control ideas, where the cost function
penalizes the state and control effort as well as the time interval until the
next sample is taken. The latter is introduced in order to generate an adaptive
sampling scheme for the overall system such that the sampling time increases as
the norm of the system state goes to zero. The paper presents a method for
synthesizing such a predictive controller and gives explicit sufficient
conditions for when it is stabilizing. Further explicit conditions are given
which guarantee conflict free transmissions on the network. It is shown that
the optimization problem may be solved off-line and that the controller can be
implemented as a lookup table of state feedback gains. Simulation studies which
compare the proposed algorithm to periodic sampling illustrate potential
performance gains.Comment: Accepted for publication in IEEE Transactions on Control Systems
Technolog
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
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
Cost Function based Event Triggered Model Predictive Controllers - Application to Big Data Cloud Services
International audienceHigh rate cluster reconfigurations is a costly issue in Big Data Cloud services. Current control solutions manage to scale the cluster according to the workload, however they do not try to minimize the number of system reconfigurations. Event-based control is known to reduce the number of control updates typically by waiting for the system states to degrade below a given threshold before reacting. However, computer science systems often have exogenous inputs (such as clients connections) with delayed impacts that can enable to anticipate states degradation. In this paper, a novel event-triggered approach is proposed. This triggering mechanism relies on a Model Predictive Controller and is defined upon the value of the optimal cost function instead of the state or output error. This controller reduces the number of control changes, in the normal operation mode, through constraints in the MPC formulation but also assures a very reactive behavior to changes of exogenous inputs. This novel control approach is evaluated using a model validated on a real Big Data system. The controller efficiently scales the cluster according to specifications, meanwhile reducing its reconfigurations
Self-Triggered Stochastic MPC for Linear Systems With Disturbances
In this letter, we present a self-triggering mechanism for stochastic model predictive control (SMPC) of discrete-time linear systems subject to probabilistic constraints, where the controller and the plant are connected by a shared communication network. The proposed triggering mechanism requires that only one control input is allowed to be transmitted through the network at each triggering instant which is then applied to the plant for several steps afterward. By doing so, communication is effectively reduced both in terms of frequency and total amount. We establish the theoretical result for recursive feasibility in the light of proper reformulation of constraints on the nominal system trajectories, and also provide stability analysis for the proposed self-triggered SMPC. A numerical example illustrates the efficiency of the proposed scheme in reducing the communication as well as ensuring meeting the probabilistic constraints
- …