ℓasso MPC: Smart regulation of over-actuated systems

In this paper, a novel MPC strategy is proposed, and referred to as asso MPC. The new paradigm features an 1-regularised least squares loss function, in which the control error variance competes with the sum of input channels magnitude (or slew rate) over the whole horizon length. This cost choice is motivated by the successful development of LASSO theory in signal processing and machine learning. In the latter fields, sum-of-norms regularisation have shown a strong capability to provide robust and sparse solutions for system identification and feature selection. In this paper, a discrete-time dual-mode asso MPC is formulated, and its stability is proven by application of standard MPC arguments. The controller is then tested for the problem of ship course keeping and roll reduction with rudder and fins, in a directional stochastic sea. Simulations show the asso MPC to inherit positive features from its corresponding regressor: extreme reduction of decision variables' magnitude, namely, actuators' magnitude (or variations), with a finite energy error, being particularly promising for over-actuated systems. © 2012 AACC American Automatic Control Council).

Optimal constraint tightening policies for robust variable horizon model predictive control

This paper develops a technique for improving the region of attraction of a robust variable horizon model predictive controller. It considers a constrained discrete-time linear system acted upon by a bounded, but unknown time-varying state disturbance. Using constraint tightening for robustness, it is shown how the tightening policy, parameterised as direct feedback on the disturbance, can be optimised to increase the volume of an inner approximation to the controller's true region of attraction. Numerical examples demonstrate the benefits of the policy in increasing region of attraction volume and decreasing the maximum prediction horizon length. © 2012 IEEE.

Modelling and control of nonlinear systems using Gaussian processes with partial model information

Gaussian processes are gaining increasing popularity among the control community, in particular for the modelling of discrete time state space systems. However, it has not been clear how to incorporate model information, in the form of known state relationships, when using a Gaussian process as a predictive model. An obvious example of known prior information is position and velocity related states. Incorporation of such information would be beneficial both computationally and for faster dynamics learning. This paper introduces a method of achieving this, yielding faster dynamics learning and a reduction in computational effort from O(Dn2) to O((D - F)n2) in the prediction stage for a system with D states, F known state relationships and n observations. The effectiveness of the method is demonstrated through its inclusion in the PILCO learning algorithm with application to the swing-up and balance of a torque-limited pendulum and the balancing of a robotic unicycle in simulation. © 2012 IEEE.

An experimental study on engine dynamics model based in-cylinder pressure estimation

The information provided by the in-cylinder pressure signal is of great importance for modern engine management systems. The obtained information is implemented to improve the control and diagnostics of the combustion process in order to meet the stringent emission regulations and to improve vehicle reliability and drivability. The work presented in this paper covers the experimental study and proposes a comprehensive and practical solution for the estimation of the in-cylinder pressure from the crankshaft speed fluctuation. Also, the paper emphasizes the feasibility and practicality aspects of the estimation techniques, for the real-time online application. In this study an engine dynamics model based estimation method is proposed. A discrete-time transformed form of a rigid-body crankshaft dynamics model is constructed based on the kinetic energy theorem, as the basis expression for total torque estimation. The major difficulties, including load torque estimation and separation of pressure profile from adjacent-firing cylinders, are addressed in this work and solutions to each problem are given respectively. The experimental results conducted on a multi-cylinder diesel engine have shown that the proposed method successfully estimate a more accurate cylinder pressure over a wider range of crankshaft angles. Copyright © 2012 SAE International.

Consensus under general convexity

A method is proposed to characterize contraction of a set through orthogonal projections. For discrete-time multi-agent systems, quantitative estimates of convergence (to a consensus) rate are provided by means of contracting convex sets. Required convexity for the sets that should include the values that the transition maps of agents take is considered in a more general sense than that of Euclidean geometry. © 2007 IEEE.

Quantitative convergence analysis of multi-agent systems

We introduce a characterization of contraction for bounded convex sets. For discrete-time multi-agent systems we provide an explicit upperbound on the rate of convergence to a consensus under the assumptions of contractiveness and (weak) connectedness (across an interval.) Convergence is shown to be exponential when either the system or the function characterizing the contraction is linear. Copyright © 2007 IFAC.

Predicting the response of structures to transient shock loading.

This work concerns the prediction of the response of an uncertain structure to a load of short duration. Assuming an ensemble of structures with small random variations about a nominal form, a mean impulse response can be found using only the modal density of the structure. The mean impulse response turns out to be the same as the response of an infinite structure: the response is calculated by taking into account the direct field only, without reflections. Considering the short duration of an impulsive loading, the approach is reasonable before the effect of the reverberant field becomes important. The convolution between the mean impulse response and the shock loading is solved in discrete time to calculate the response at the driving point and at remote points. Experimental and numerical examples are presented to validate the theory presented for simple structures such as beams, plates, and cylinders.

网络控制系统稳定性的图理论

针对具有有界时延和数据包丢失的网络控制系统,提出了一种新的稳定性判据.基于Lyapunov方法和图论理论,给出非线性离散和连续网络控制系统渐近稳定的充分条件,获得保持这两类系统稳定的最大允许时延界,得到控制器设计方法.并且,利用区间矩阵的谱特征,给出网络控制系统区间稳定的充分条件.设计算法,获得比例积分反馈控制器增益.算例表明所提方法的有效性。

机器人机械手的离散时间学习控制

本文为机器人机械手提出了一种基于离散时间的重复学习控制法，这种学习控制法利用机器人动力学模型的部分知识，从它的特性和实用观点看，这种控制法比现有的其它学习控制法更有吸引力．本文还给出了学习控制法的收敛性证明和计算机仿真结果。

A Scheduling Algorithm for Flexible Manufacturing Cell

In this paper, a new scheduling algorithm for the flexible manufacturing cell is presented, which is a discrete time control method with fixed length control period combining with event interruption. At the flow control level we determine simultaneously the production mix and the proportion of parts to be processed through each route. The simulation results for a hypothetical manufacturing cell are presented.

城市交通中车队状态观测器的一种新算法

本文阐述了离散时间点过程理论,时变马尔科夫链及鞅差分序列在城市交通车队状态观测器中的应用。并在此基础上,改进了[5]中的估计算法。用本文提出的非线性最小方差估计算法,对提供的交通状态进行估计,所得结果比[5]中算法精度有明显提高。在大连市某交通干线计算机控制系统中初步应用,取得了令人满意的结果。

Reliable Cellular Automata with Self-Organization

In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information for more than a constant number of steps is nontrivial, even in an infinite automaton. Still, there is a solution in 2 dimensions, and this solution can be used to construct a simple 3-dimensional discrete-time universal fault-tolerant cellular automaton. This technique does not help much to solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3; computing in any dimension with non-synchronized transitions. Our more complex technique organizes the cells in blocks that perform a reliable simulation of a second (generalized) cellular automaton. The cells of the latter automaton are also organized in blocks, simulating even more reliably a third automaton, etc. Since all this (a possibly infinite hierarchy) is organized in "software", it must be under repair all the time from damage caused by errors. A large part of the problem is essentially self-stabilization recovering from a mess of arbitrary-size and content caused by the faults. The present paper constructs an asynchronous one-dimensional fault-tolerant cellular automaton, with the further feature of "self-organization". The latter means that unless a large amount of input information must be given, the initial configuration can be chosen to be periodical with a small period.

Estimation and Prediction of Evolving Color Distributions for Skin Segmentation Under Varying Illumination

A novel approach for real-time skin segmentation in video sequences is described. The approach enables reliable skin segmentation despite wide variation in illumination during tracking. An explicit second order Markov model is used to predict evolution of the skin color (HSV) histogram over time. Histograms are dynamically updated based on feedback from the current segmentation and based on predictions of the Markov model. The evolution of the skin color distribution at each frame is parameterized by translation, scaling and rotation in color space. Consequent changes in geometric parameterization of the distribution are propagated by warping and re-sampling the histogram. The parameters of the discrete-time dynamic Markov model are estimated using Maximum Likelihood Estimation, and also evolve over time. Quantitative evaluation of the method was conducted on labeled ground-truth video sequences taken from popular movies.

On the Impact of Low-Rate Attacks

Recent research have exposed new breeds of attacks that are capable of denying service or inflicting significant damage to TCP flows, without sustaining the attack traffic. Such attacks are often referred to as "low-rate" attacks and they stand in sharp contrast against traditional Denial of Service (DoS) attacks that can completely shut off TCP flows by flooding an Internet link. In this paper, we study the impact of these new breeds of attacks and the extent to which defense mechanisms are capable of mitigating the attack's impact. Through adopting a simple discrete-time model with a single TCP flow and a nonoblivious adversary, we were able to expose new variants of these low-rate attacks that could potentially have high attack potency per attack burst. Our analysis is focused towards worst-case scenarios, thus our results should be regarded as upper bounds on the impact of low-rate attacks rather than a real assessment under a specific attack scenario.

Gröbner basis techniques for certain problems in coding and systems theory

There is much common ground between the areas of coding theory and systems theory. Fitzpatrick has shown that a Göbner basis approach leads to efficient algorithms in the decoding of Reed-Solomon codes and in scalar interpolation and partial realization. This thesis simultaneously generalizes and simplifies that approach and presents applications to discrete-time modeling, multivariable interpolation and list decoding. Gröbner basis theory has come into its own in the context of software and algorithm development. By generalizing the concept of polynomial degree, term orders are provided for multivariable polynomial rings and free modules over polynomial rings. The orders are not, in general, unique and this adds, in no small way, to the power and flexibility of the technique. As well as being generating sets for ideals or modules, Gröbner bases always contain a element which is minimal with respect tot the corresponding term order. Central to this thesis is a general algorithm, valid for any term order, that produces a Gröbner basis for the solution module (or ideal) of elements satisfying a sequence of generalized congruences. These congruences, based on shifts and homomorphisms, are applicable to a wide variety of problems, including key equations and interpolations. At the core of the algorithm is an incremental step. Iterating this step lends a recursive/iterative character to the algorithm. As a consequence, not all of the input to the algorithm need be available from the start and different "paths" can be taken to reach the final solution. The existence of a suitable chain of modules satisfying the criteria of the incremental step is a prerequisite for applying the algorithm.