Decentralized event-triggered control over wireless sensor/actuator networks

In recent years we have witnessed a move of the major industrial automation providers into the wireless domain. While most of these companies already offer wireless products for measurement and monitoring purposes, the ultimate goal is to be able to close feedback loops over wireless networks interconnecting sensors, computation devices, and actuators. In this paper we present a decentralized event-triggered implementation, over sensor/actuator networks, of centralized nonlinear controllers. Event-triggered control has been recently proposed as an alternative to the more traditional periodic execution of control tasks. In a typical event-triggered implementation, the control signals are kept constant until the violation of a condition on the state of the plant triggers the re-computation of the control signals. The possibility of reducing the number of re-computations, and thus of transmissions, while guaranteeing desired levels of performance makes event-triggered control very appealing in the context of sensor/actuator networks. In these systems the communication network is a shared resource and event-triggered implementations of control laws offer a flexible way to reduce network utilization. Moreover reducing the number of times that a feedback control law is executed implies a reduction in transmissions and thus a reduction in energy expenditures of battery powered wireless sensor nodes.Comment: 13 pages, 3 figures, journal submissio

On Lyapunov sampling for event-driven controllers

This paper investigates an event condition for event-driven controllers based on Lyapunov functions. Considering that constant values of a Lyapunov function define contour curves that form closed regions around the equilibrium point, in this paper we present a sampling mechanism that enforces job executions (sampling, control algorithm computation and actuation) each time the system trajectory reaches a given contour curve. By construction, the sequence of generated samples is stable in the discrete Lyapunov sense. However, in order to ensure that the system trajectory will tend to zero as time tends to infinity, it must be ensured that the sequence of samples is infinite. We provide conditions to ensure this property. The approach is illustrated by simulated examples.Peer ReviewedPostprint (published version

Sporadic Event-Based Control using Path Constraints and Moments

Control is traditionally applied using periodic sensing and actuation. In some applications, it is beneficial to use instead event based control, to communicate or make a change only when necessary. There are no known general closed form solutions to such event based control problems. We consider stationary event-based control problems with mixed continuous/discrete time dynamics and stochastic disturbances. The system is modelled by a set of path constraints, which are converted into constraints on trajectories’ moments up to some order N; upper and lower bounds on the control objective for any system that meets the constraints are derived using sum-of-squares techniques and convex semidefinite programming. Joint optimization of upper bound and controller parameters is non-convex in general; approaches to such controller optimization are investigated, including local optimization using bilinear matrix inequalities. Examples show that the bounds are significantly tighter than earlier results obtained using quadratic value functions

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

Adaptive sampling for linear state estimation

When a sensor has continuous measurements but sends occasional messages over a data network to a supervisor which estimates the state, the available packet rate fixes the achievable quality of state estimation. When such rate limits turn stringent, the sensor’s messaging policy should be designed anew. What are the good causal messaging policies ? What should message packets contain ? What is the lowest possible distortion in a causal estimate at the supervisor ? Is Delta sampling better than periodic sampling ? We answer these questions for a Markov state process under an idealized model of the network and the assumption of perfect state measurements at the sensor. If the state is a scalar, or a vector of low dimension, then we can ignore sample quantization. If in addition, we can ignore jitter in the transmission delays over the network, then our search for efficient messaging policies simplifies. Firstly, each message packet should contain the value of the state at that time. Thus a bound on the number of data packets becomes a bound on the number of state samples. Secondly, the remaining choice in messaging is entirely about the times when samples are taken. For a scalar, linear diffusion process, we study the problem of choosing the causal sampling times that will give the lowest aggregate squared error distortion. We stick to finite-horizons and impose a hard upper bound N on the number of allowed samples. We cast the design as a problem of choosing an optimal sequence of stopping times. We reduce this to a nested sequence of problems, each asking for a single optimal stopping time. Under an unproven but natural assumption about the least-square estimate at the supervisor, each of these single stopping problems are of standard form. The optimal stopping times are random times when the estimation error exceeds designed envelopes. For the case where the state is a Brownian motion, we give analytically: the shape of the optimal sampling envelopes, the shape of the envelopes under optimal Delta sampling, and their performances. Surprisingly, we find that Delta sampling performs badly. Hence, when the rate constraint is a hard limit on the number of samples over a finite horizon, we should should not use Delta sampling

Trends in vehicle motion control for automated driving on public roads

In this paper, we describe how vehicle systems and the vehicle motion control are affected by automated driving on public roads. We describe the redundancy needed for a road vehicle to meet certain safety goals. The concept of system safety as well as system solutions to fault tolerant actuation of steering and braking and the associated fault tolerant power supply is described. Notably restriction of the operational domain in case of reduced capability of the driving automation system is discussed. Further we consider path tracking, state estimation of vehicle motion control required for automated driving as well as an example of a minimum risk manoeuver and redundant steering by means of differential braking. The steering by differential braking could offer heterogeneous or dissimilar redundancy that complements the redundancy of described fault tolerant steering systems for driving automation equipped vehicles. Finally, the important topic of verification of driving automation systems is addressed