Asymptotic Recovery for Discrete-Time Systems

An asymptotic recovery design procedure is proposed for square, discrete-time, linear, time-invariant multivariable systems, which allows a state-feedback design to be approximately recovered by a dynamic output feedback scheme. Both the case of negligible processing time (compared to the sampling interval) and of significant processing time are discussed. In the former case, it is possible to obtain perfect. © 1985 IEEE.

Mode control in vertical-cavity surface-emitting lasers by post-processing using focused ion-beaih etching

Single-mode emission is achieved in previously multimode gain-guided vertical-cavity surface-emitting lasers (VCSEL's) by localized modification of the mirror reflectivity using focused ion-beam etching. Reflectivity engineering is also demonstrated to suppress transverse mode emission in an oxide-confined device, reducing the spectral width from 1.2 nm to less than 0.5 nm.

ℓ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).

Designing and testing an advanced pneumatic braking system for heavy vehicles

Heavy goods vehicles exhibit poor braking performance in emergency situations when compared to other vehicles. Part of the problem is caused by sluggish pneumatic brake actuators, which limit the control bandwidth of their antilock braking systems. In addition, heuristic control algorithms are used that do not achieve the maximum braking force throughout the stop. In this article, a novel braking system is introduced for pneumatically braked heavy goods vehicles. The conventional brake actuators are improved by placing high-bandwidth, binary-actuated valves directly on the brake chambers. A made-for-purpose valve is described. It achieves a switching delay of 3-4 ms in tests, which is an order of magnitude faster than solenoids in conventional anti-lock braking systems. The heuristic braking control algorithms are replaced with a wheel slip regulator based on sliding mode control. The combined actuator and slip controller are shown to reduce stopping distances on smooth and rough, high friction (μ = 0.9) surfaces by 10% and 27% respectively in hardware-in-the-loop tests compared with conventional ABS. On smooth and rough, low friction (μ = 0.2) surfaces, stopping distances are reduced by 23% and 25%, respectively. Moreover, the overall air reservoir size required on a heavy goods vehicle is governed by its air usage during an anti-lock braking stop on a low friction, smooth surface. The 37% reduction in air usage observed in hardware-in-the-loop tests on this surface therefore represents the potential reduction in reservoir size that could be achieved by the new system. © 2012 IMechE.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Robust predictive control with feasible contingencies for fault tolerance

This paper introduces the notion of M-step robust fault tolerance for discrete-time systems where finite-time completion of a control manoeuvre is desired. It considers a scenario with two distinct objectives; a primary and secondary target are specified as sets to be reached in finite-time, whilst satisfying operating constraints on the states and inputs. The primary target is switched to the secondary target when a fault affects the system. As it is unknown when or if the fault will occur, the trajectory to the primary target is constrained to ensure reachability of the secondary target within M steps. A variable-horizon linear MPC formulation is developed to illustrate the concept. The formulation is then extended to provide robustness to bounded disturbances by use of tightened constraints. Simulations demonstrate the efficacy of the controller formulation on a double-integrator model. © 2011 IFAC.

Decentralised minimal-time dynamic consensus

This paper considers a group of agents that aim to reach an agreement on individually received time-varying signals by local communication. In contrast to static network averaging problem, the consensus considered in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents tracking the average of their reference inputs asymptotically. We propose a minimal-time dynamic consensus algorithm, which only utilises a minimal number of local observations of a randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically as suggested by Olshevsky and Tsitsiklis. © 2012 AACC American Automatic Control Council).

An investigation of the effects of pneumatic actuator design on slip control for heavy vehicles

Progress in reducing actuator delays in pneumatic brake systems is opening the door for advanced anti-lock braking algorithms to be used on heavy goods vehicles. However, little has been published on slip controllers for air-braked heavy vehicles, or the effects of slow pneumatic actuation on their design and performance. This paper introduces a sliding mode slip controller for air-braked heavy vehicles. The effects of pneumatic actuator delays and flow rates on stopping performance and air (energy) consumption are presented through vehicle simulations. Finally, the simulations are validated with experiments using a hardware-in-the-loop rig. It is shown that for each wheel, pneumatic valves with delays smaller than 3ms and orifice diameters around 8mm provide the best performance. © 2013 Copyright Taylor and Francis Group, LLC.

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.