Designing MPC controllers by reverse-engineering existing LTI controllers

This technical report presents a method for designing a constrained output-feedback model predictive controller (MPC) that behaves in the same way as an existing baseline stabilising linear time invariant output-feedback controller when constraints are inactive. The baseline controller is cast into an observer-compensator form and an inverse-optimal cost function is used as the basis of the MPC controller. The available degrees of design freedom are explored, and some guidelines provided for the selection of an appropriate observer-compensator realisation that will best allow exploitation of the constraint-handling and redundancy management capabilities of MPC. Consideration is given to output setpoint tracking, and the method is demonstrated with three different multivariable plants of varying complexity.

Fault-tolerant aspects of MPC

The architecture of model predictive control (MPC), with its explicit internal model and constrained optimization is presented. Since MPC relies on an explicit internal model, one can imagine dealing with failures by updating the internal model, and letting the on-line optimizer work out how to control the system in its new condition. This aspects rely on assumptions such that the nature of the fault can be located, and the model can be updated automatically. A standard form of MPC, with linear inequality constraints on inputs and outputs, linear internal model, and quadriatic cost function.

An experimental model of relay deployment planning tool for a wireless sensor network system to monitor civil engineering structures

It is essential to monitor deteriorated civil engineering structures cautiously to detect symptoms of their serious disruptions. A wireless sensor network can be an effective system for monitoring civil engineering structures. It is fast to deploy sensors especially in difficult-to-access areas, and it is extendable without any cable extensions. Since our target is to monitor deteriorations of civil engineering structures such as cracks at tunnel linings, most of the locations of sensors are known, and sensors are not required to move dynamically. Therefore, we focus on developing a deployment plan of a static network in order to reduce the value of a cost function such as initial installation cost and summation of communication distances of the network. The key issue of the deployment is the location of relays that forward sensing data from sensors to a data collection device called a gateway. In this paper, we propose a relay deployment-planning tool that can be used to design a wireless sensor network for monitoring civil engineering structures. For the planning tool, we formalize the model and implement a local search based algorithm to find a quasi-optimal solution. Our solution guarantees two routings from a sensor to a gateway, which can provide higher reliability of the network. We also show the application of our experimental tool to the actual environment in the London Underground.

Surface excavation with model predictive control

This paper describes the application of variable-horizon model predictive control to trajectory generation in surface excavation. A nonlinear dynamic model of a surface mining machine digging in oil sand is developed as a test platform. This model is then stabilised with an inner-loop controller before being linearised to generate a prediction model. The linear model is used to design a predictive controller for trajectory generation. A variable horizon formulation is augmented with extra terms in the cost function to allow more control over digging, whilst still preserving the guarantee of finite-time completion. Simulations show the generation of realistic trajectories, motivating new applications of variable horizon MPC for autonomy that go beyond the realm of vehicle path planning. ©2010 IEEE.

Verifying stability of approximate explicit MPC

Several authors have proposed algorithms for approximate explicit MPC [1],[2],[3]. These algorithms have in common that they develop a stability criterion for approximate explicit MPC that require the approximate cost function to be within a certain distance from the optimal cost function. In this paper, stability is instead ascertained by considering only the cost function of the approximate MPC. If a region of the state space is found where the cost function is not decreasing, this indicates that an improved approximation (to the optimal control) is required in that region. If the approximate cost function is decreasing everywhere, no further refinement of the approximate MPC is necessary, since stability is guaranteed. ©2009 IEEE.

Automatic object segmentation from calibrated images

This paper addresses the problem of automatically obtaining the object/background segmentation of a rigid 3D object observed in a set of images that have been calibrated for camera pose and intrinsics. Such segmentations can be used to obtain a shape representation of a potentially texture-less object by computing a visual hull. We propose an automatic approach where the object to be segmented is identified by the pose of the cameras instead of user input such as 2D bounding rectangles or brush-strokes. The key behind our method is a pairwise MRF framework that combines (a) foreground/background appearance models, (b) epipolar constraints and (c) weak stereo correspondence into a single segmentation cost function that can be efficiently solved by Graph-cuts. The segmentation thus obtained is further improved using silhouette coherency and then used to update the foreground/background appearance models which are fed into the next Graph-cut computation. These two steps are iterated until segmentation convergences. Our method can automatically provide a 3D surface representation even in texture-less scenes where MVS methods might fail. Furthermore, it confers improved performance in images where the object is not readily separable from the background in colour space, an area that previous segmentation approaches have found challenging. © 2011 IEEE.

Performance evaluation of multiplexed model predictive control for a large airliner in nominal and contingency scenarios

Model predictive control allows systematic handling of physical and operational constraints through the use of constrained optimisation. It has also been shown to successfully exploit plant redundancy to maintain a level of control in scenarios when faults are present. Unfortunately, the computational complexity of each individual iteration of the algorithm to solve the optimisation problem scales cubically with the number of plant inputs, so the computational demands are high for large MIMO plants. Multiplexed MPC only calculates changes in a subset of the plant inputs at each sampling instant, thus reducing the complexity of the optimisation. This paper demonstrates the application of multiplexed model predictive control to a large transport airliner in a nominal and a contingency scenario. The performance is compared to that obtained with a conventional synchronous model predictive controller, designed using an equivalent cost function. © 2012 AACC American Automatic Control Council).

Consensus optimization on manifolds

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e., maximizing the consensus) or balance (i.e., minimizing the consensus) the agents; a convenient adaptation of the gradient algorithms is used when the communication graph is directed and time-varying. The cost function is linked to a specific centroid definition on manifolds, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds. The special orthogonal group SO (n) and the Grassmann manifold Grass (p, n) are treated as original examples. A link is also drawn with the many existing results on the circle. © 2009 Society for Industrial and Applied Mathematics.

Collective optimization over average quantities

This paper addresses the design of algorithms for the collective optimization of a cost function defined over average quantities in the presence of limited communication. We argue that several meaningful collective optimization problems can be formulated in this way. As an application of the proposed approach, we propose a novel algorithm that achieves synchronization or balancing in phase models of coupled oscillators under mild connectedness assumptions on the (possibly time-varying and unidirectional) communication graphs. © 2006 IEEE.

Continuous dynamical systems that realize discrete optimization on the hypercube

We study the problem of finding a local minimum of a multilinear function E over the discrete set {0,1}n. The search is achieved by a gradient-like system in [0,1]n with cost function E. Under mild restrictions on the metric, the stable attractors of the gradient-like system are shown to produce solutions of the problem, even when they are not in the vicinity of the discrete set {0,1}n. Moreover, the gradient-like system connects with interior point methods for linear programming and with the analog neural network studied by Vidyasagar (IEEE Trans. Automat. Control 40 (8) (1995) 1359), in the same context. © 2004 Elsevier B.V. All rights reserved.

Minimum maneuver time calculation using convex optimization

The problem of calculating the minimum lap or maneuver time of a nonlinear vehicle, which is linearized at each time step, is formulated as a convex optimization problem. The formulation provides an alternative to previously used quasi-steady-state analysis or nonlinear optimization. Key steps are: the use of model predictive control; expressing the minimum time problem as one of maximizing distance traveled along the track centerline; and linearizing the track and vehicle trajectories by expressing them as small displacements from a fixed reference. A consequence of linearizing the vehicle dynamics is that nonoptimal steering control action can be generated, but attention to the constraints and the cost function minimizes the effect. Optimal control actions and vehicle responses for a 90 deg bend are presented and compared to the nonconvex nonlinear programming solution. Copyright © 2013 by ASME.

Output disturbance rejection using parallel model predictive control

The solution time of the online optimization problems inherent to Model Predictive Control (MPC) can become a critical limitation when working in embedded systems. One proposed approach to reduce the solution time is to split the optimization problem into a number of reduced order problems, solve such reduced order problems in parallel and selecting the solution which minimises a global cost function. This approach is known as Parallel MPC. The potential capabilities of disturbance rejection are introduced using a simulation example. The algorithm is implemented in a linearised model of a Boeing 747-200 under nominal flight conditions and with an induced wind disturbance. Under significant output disturbances Parallel MPC provides a significant improvement in performance when compared to Multiplexed MPC (MMPC) and Linear Quadratic Synchronous MPC (SMPC). © 2013 IEEE.

Semantic transform: Weakly supervised semantic inference for relating visual attributes

Relative (comparative) attributes are promising for thematic ranking of visual entities, which also aids in recognition tasks. However, attribute rank learning often requires a substantial amount of relational supervision, which is highly tedious, and apparently impractical for real-world applications. In this paper, we introduce the Semantic Transform, which under minimal supervision, adaptively finds a semantic feature space along with a class ordering that is related in the best possible way. Such a semantic space is found for every attribute category. To relate the classes under weak supervision, the class ordering needs to be refined according to a cost function in an iterative procedure. This problem is ideally NP-hard, and we thus propose a constrained search tree formulation for the same. Driven by the adaptive semantic feature space representation, our model achieves the best results to date for all of the tasks of relative, absolute and zero-shot classification on two popular datasets. © 2013 IEEE.

Fixed-rank matrix factorizations and Riemannian low-rank optimization

Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.

Method for improving classification performance of neural network based on fuzzy input and network inversion

In order to effectively improve the classification performance of neural network, first architecture of fuzzy neural network with fuzzy input was proposed. Next a cost function of fuzzy outputs and non-fuzzy targets was defined. Then a learning algorithm from the cost function for adjusting weights was derived. And then the fuzzy neural network was inversed and fuzzified inversion algorithm was proposed. Finally, computer simulations on real-world pattern classification problems examine the effectives of the proposed approach. The experiment results show that the proposed approach has the merits of high learning efficiency, high classification accuracy and high generalization capability.