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

Event-triggered Pulse Control with Model Learning (if Necessary)

In networked control systems, communication is a shared and therefore scarce resource. Event-triggered control (ETC) can achieve high performance control with a significantly reduced amount of samples compared to classical, periodic control schemes. However, ETC methods usually rely on the availability of an accurate dynamics model, which is oftentimes not readily available. In this paper, we propose a novel event-triggered pulse control strategy that learns dynamics models if necessary. In addition to adapting to changing dynamics, the method also represents a suitable replacement for the integral part typically used in periodic control.Comment: Accepted final version to appear in: Proc. of the American Control Conference, 201

Event-based H∞ consensus control of multi-agent systems with relative output feedback: The finite-horizon case

In this technical note, the H∞ consensus control problem is investigated over a finite horizon for general discrete time-varying multi-agent systems subject to energy-bounded external disturbances. A decentralized estimation-based output feedback control protocol is put forward via the relative output measurements. A novel event-based mechanism is proposed for each intelligent agent to utilize the available information in order to decide when to broadcast messages and update control input. The aim of the problem addressed is to co-design the time-varying controller and estimator parameters such that the controlled multi-agent systems achieve consensus with a disturbance attenuation level γ over a finite horizon [0,T]. A constrained recursive Riccati difference equation approach is developed to derive the sufficient conditions under which the H∞ consensus performance is guaranteed in the framework of event-based scheme. Furthermore, the desired controller and estimator parameters can be iteratively computed by resorting to the Moore-Penrose pseudo inverse. Finally, the effectiveness of the developed event-based H∞ consensus control strategy is demonstrated in the numerical simulation

Stochastic Stability of Event-triggered Anytime Control

We investigate control of a non-linear process when communication and processing capabilities are limited. The sensor communicates with a controller node through an erasure channel which introduces i.i.d. packet dropouts. Processor availability for control is random and, at times, insufficient to calculate plant inputs. To make efficient use of communication and processing resources, the sensor only transmits when the plant state lies outside a bounded target set. Control calculations are triggered by the received data. If a plant state measurement is successfully received and while the processor is available for control, the algorithm recursively calculates a sequence of tentative plant inputs, which are stored in a buffer for potential future use. This safeguards for time-steps when the processor is unavailable for control. We derive sufficient conditions on system parameters for stochastic stability of the closed loop and illustrate performance gains through numerical studies.Comment: IEEE Transactions on Automatic Control, under revie

Scheduling of Event-Triggered Controllers on a Shared Network

We consider a system where a number of independent, time-triggered or event-triggered control loops are closed over a shared communication network. Each plant is described by a first-order linear stochastic system. In the event-triggered case, a sensor at each plant frequently samples the output but attempts to communicate only when the magnitude of the output is above a threshold. Once access to the network has been gained, the network is busy for T seconds (corresponding to the communication delay from sensor to actuator), after which the control action is applied to the plant. Using numerical methods, we compute the minimum-variance control performance under various common MAC-protocols, including TDMA, FDMA, and CSMA (with random, dynamic-priority, or static-priority access). The results show that event-triggered control under CSMA gives the best performance throughout

Stochastic Event-Based Control and Estimation

Digital controllers are traditionally implemented using periodic sampling, computation, and actuation events. As more control systems are implemented to share limited network and CPU bandwidth with other tasks, it is becoming increasingly attractive to use some form of event-based control instead, where precious events are used only when needed. Forms of event-based control have been used in practice for a very long time, but mostly in an ad-hoc way. Though optimal solutions to most event-based control problems are unknown, it should still be viable to compare performance between suggested approaches in a reasonable manner. This thesis investigates an event-based variation on the stochastic linear-quadratic (LQ) control problem, with a fixed cost per control event. The sporadic constraint of an enforced minimum inter-event time is introduced, yielding a mixed continuous-/discrete-time formulation. The quantitative trade-off between event rate and control performance is compared between periodic and sporadic control. Example problems for first-order plants are investigated, for a single control loop and for multiple loops closed over a shared medium. Path constraints are introduced to model and analyze higher-order event-based control systems. This component-based approach to stochastic hybrid systems allows to express continuous- and discrete-time dynamics, state and switching constraints, control laws, and stochastic disturbances in the same model. Sum-of-squares techniques are then used to find bounds on control objectives using convex semidefinite programming. The thesis also considers state estimation for discrete time linear stochastic systems from measurements with convex set uncertainty. The Bayesian observer is considered given log-concave process disturbances and measurement likelihoods. Strong log-concavity is introduced, and it is shown that the observer preserves log-concavity, and propagates strong log-concavity like inverse covariance in a Kalman filter. A recursive state estimator is developed for systems with both stochastic and set-bounded process and measurement noise terms. A time-varying linear filter gain is optimized using convex semidefinite programming and ellipsoidal over-approximation, given a relative weight on the two kinds of error

Event-Based Control and Estimation with Stochastic Disturbances

This thesis deals with event-based control and estimation strategies, motivated by certain bottlenecks in the control loop. Two kinds of implementation constraints are considered: closing one or several control loops over a data network, and sensors that report measurements only as intervals (e.g. with quantization). The proposed strategies depend critically on _events_, when a data packet is sent or when a change in the measurement signal is received. The value of events is that they communicate new information about stochastic process disturbances. A data network in the control loop imposes constraints on the event timing, modelled as a minimum time between packets. A thresholdbased control strategy is suggested and shown to be optimal for firstorder systems with impulse control. Different ways to find the optimal threshold are investigated for single and multiple control loops sharing one network. The major gain compared to linear time invariant (LTI) control is with a single loop a greatly reduced communication rate, which with multiple loops can be traded for a similarly reduced regulation error. With the bottleneck that sensors report only intervals, both the theoretical and practical control problems become more complex. We focus on the estimation problem, where the optimal solution is known but untractable. Two simplifications are explored to find a realistic state estimator: reformulation to a mixed stochastic/worst case scenario and joint maximum a posteriori estimation. The latter approach is simplified and evaluated experimentally on a moving cart with quantized position measurements controlled by a low-end microcontroller. The examples considered demonstrate that event-based control considerably outperforms LTI control, when the bottleneck addressed is a genuine performance constraint on the latter