853 research outputs found

    Reliably-stabilizing piecewise-affine neural network controllers

    Full text link
    A common problem affecting neural network (NN) approximations of model predictive control (MPC) policies is the lack of analytical tools to assess the stability of the closed-loop system under the action of the NN-based controller. We present a general procedure to quantify the performance of such a controller, or to design minimum complexity NNs with rectified linear units (ReLUs) that preserve the desirable properties of a given MPC scheme. By quantifying the approximation error between NN-based and MPC-based state-to-input mappings, we first establish suitable conditions involving two key quantities, the worst-case error and the Lipschitz constant, guaranteeing the stability of the closed-loop system. We then develop an offline, mixed-integer optimization-based method to compute those quantities exactly. Together these techniques provide conditions sufficient to certify the stability and performance of a ReLU-based approximation of an MPC control law

    Approximate explicit constrained linear model predictive control via orthogonal search tree

    Full text link

    Predictive Reduced Order Modeling of Chaotic Multi-scale Problems Using Adaptively Sampled Projections

    Full text link
    An adaptive projection-based reduced-order model (ROM) formulation is presented for model-order reduction of problems featuring chaotic and convection-dominant physics. An efficient method is formulated to adapt the basis at every time-step of the on-line execution to account for the unresolved dynamics. The adaptive ROM is formulated in a Least-Squares setting using a variable transformation to promote stability and robustness. An efficient strategy is developed to incorporate non-local information in the basis adaptation, significantly enhancing the predictive capabilities of the resulting ROMs. A detailed analysis of the computational complexity is presented, and validated. The adaptive ROM formulation is shown to require negligible offline training and naturally enables both future-state and parametric predictions. The formulation is evaluated on representative reacting flow benchmark problems, demonstrating that the ROMs are capable of providing efficient and accurate predictions including those involving significant changes in dynamics due to parametric variations, and transient phenomena. A key contribution of this work is the development and demonstration of a comprehensive ROM formulation that targets predictive capability in chaotic, multi-scale, and transport-dominated problems

    On optimal mission planning for conventional and electric heavy duty vehicles

    Get PDF
    Ever-growing energy consumption and CO2 emissions due to the increase in road transport are major challenges that attract international attention, especially policy makers, logistic service providers and customers considering environmental, ecological and economic issues. Other negative side-effects caused by the growth of the road transport are the extensive economic and social costs because of traffic congestion. Thus, there is a strong motivation to investigate possible ways of improving transport efficiency aiming at achieving a sustainable transport, e.g. by finding the best compromise between resource consumption and logistics performance. The transport efficiency can be improved by optimal planning of the transport mission, which can be interpreted as optimising mission start and/or finish time, and velocity profile of the driving vehicle. This thesis proposes a bi-layer mission planner for long look-ahead horizons stretched up to hundreds of kilometers. The mission planner consists of logistics planner as its top level and eco-driving supervisor as its bottom level. The logistics planner aims at optimising the mission start and/or finish time by optimising energy consumption and travel time, subject to road and traffic information, e.g. legal and dynamic speed limits. The eco-driving supervisor computes the velocity profile of the driving vehicle by optimising the energy consumption and penalising driver discomfort. To do so, an online-capable algorithm has been formulated in MPC framework, subject to road and traffic information, and the pre-optimised mission start and/or finish time. This algorithm is computationally efficient and enables the driving vehicle to adapt and optimally respond to predicted disturbances within a short amount of time. The mission planner has been applied to conventional and fully-electric powertrains. It is observed that total travel timeis reduced up to 5.5 % by optimising the mission start time, when keeping anaverage cruising speed of about 75 km/h. Also, compared to standard cruise control, the energy savings of using this algorithm is up to 11.6 %

    Advanced multiparametric optimization and control studies for anaesthesia

    Get PDF
    Anaesthesia is a reversible pharmacological state of the patient where hypnosis, analgesia and muscle relaxation are guaranteed and maintained throughout the surgery. Analgesics block the sensation of pain; hypnotics produce unconsciousness, while muscle relaxants prevent unwanted movement of muscle tone. Controlling the depth of anaesthesia is a very challenging task, as one has to deal with nonlinearity, inter- and intra-patient variability, multivariable characteristics, variable time delays, dynamics dependent on the hypnotic agent, model analysis variability, agent and stability issues. The modelling and automatic control of anaesthesia is believed to (i) benefit the safety of the patient undergoing surgery as side-effects may be reduced by optimizing the drug infusion rates, and (ii) support anaesthetists during critical situations by automating the drug delivery systems. In this work we have developed several advanced explicit/multi-parametric model predictive (mp-MPC) control strategies for the control of depth of anaesthesia. State estimation techniques are developed and used simultaneously with mp-MPC strategies to estimate the state of each individual patient, in an attempt to overcome the challenges of inter- and intra- patient variability, and deal with possible unmeasurable noisy outputs. Strategies to deal with the nonlinearity have been also developed including local linearization, exact linearization as well as a piece-wise linearization of the Hill curve leading to a hybrid formulation of the patient model and thereby the development of multiparametric hybrid model predictive control methodology. To deal with the inter- and intra- patient variability, as well as the noise on the process output, several robust techniques and a multiparametric moving horizon estimation technique have been design and implemented. All the studies described in the thesis are performed on clinical data for a set of 12 patients who underwent general anaesthesia.Open Acces

    Learning High-Level Policies for Model Predictive Control

    Full text link
    The combination of policy search and deep neural networks holds the promise of automating a variety of decision-making tasks. Model Predictive Control~(MPC) provides robust solutions to robot control tasks by making use of a dynamical model of the system and solving an optimization problem online over a short planning horizon. In this work, we leverage probabilistic decision-making approaches and the generalization capability of artificial neural networks to the powerful online optimization by learning a deep high-level policy for the MPC~(High-MPC). Conditioning on robot's local observations, the trained neural network policy is capable of adaptively selecting high-level decision variables for the low-level MPC controller, which then generates optimal control commands for the robot. First, we formulate the search of high-level decision variables for MPC as a policy search problem, specifically, a probabilistic inference problem. The problem can be solved in a closed-form solution. Second, we propose a self-supervised learning algorithm for learning a neural network high-level policy, which is useful for online hyperparameter adaptations in highly dynamic environments. We demonstrate the importance of incorporating the online adaption into autonomous robots by using the proposed method to solve a challenging control problem, where the task is to control a simulated quadrotor to fly through a swinging gate. We show that our approach can handle situations that are difficult for standard MPC

    Robust model predictive control: robust control invariant sets and efficient implementation

    Get PDF
    Robust model predictive control (RMPC) is widely used in industry. However, the online computational burden of this algorithm restricts its development and application to systems with relatively slow dynamics. We investigate this problem in this thesis with the overall aim of reducing the online computational burden and improving the online efficiency. In RMPC schemes, robust control invariant (RCI) sets are vitally important in dealing with constraints and providing stability. They can be used as terminal (invariant) sets in RMPC schemes to reduce the online computational burden and ensure stability simultaneously. To this end, we present a novel algorithm for the computation of full-complexity polytopic RCI sets, and the corresponding feedback control law, for linear discrete-time systems subject to output and initial state constraints, performance bounds, and bounded additive disturbances. Two types of uncertainty, structured norm-bounded and polytopic uncertainty, are considered. These algorithms are then extended to deal with systems subject to asymmetric initial state and output constraints. Furthermore, the concept of RCI sets can be extended to invariant tubes, which are fundamental elements in tube based RMPC scheme. The online computational burden of tube based RMPC schemes is largely reduced to the same level as model predictive control for nominal systems. However, it is important that the constraint tightening that is needed is not excessive, otherwise the performance of the MPC design may deteriorate, and there may even not exist a feasible control law. Here, the algorithms we proposed for RCI set approximations are extended and applied to the problem of reducing the constraint tightening in tube based RMPC schemes. In order to ameliorate the computational complexity of the online RMPC algorithms, we propose an online-offline RMPC method, where a causal state feedback structure on the controller is considered. In order to improve the efficiency of the online computation, we calculate the state feedback gain offline using a semi-definite program (SDP). Then we propose a novel method to compute the control perturbation component online. The online optimization problem is derived using Farkas' Theorem, and then approximated by a quadratic program (QP) to reduce the online computational burden. A further approximation is made to derive a simplified online optimization problem, which results in a large reduction in the number of variables. Numerical examples are provided that demonstrate the advantages of all our proposed algorithms over current schemes.Open Acces

    Optimal control of controllable switched systems

    Get PDF
    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (p. 83-85).Many of the existing techniques for controlling switched systems either require the solution to a complex optimization problem or significant sacrifices to either stability or performance to offer practical controllers. In [13], it is shown that stabilizing, practical controllers with meaningful performance guarantees can be constructed for a specific class of hybrid systems by parameterizing the controller actions by a finite set. We extend this approach to the control of controllable switched systems by constraining the switching portion of the control input and fixing the feedback controller for each subsystem. We show that, under reasonable assumptions, the resulting system is guaranteed to converge to the target while providing meaningful performance. We apply our approach to the direct-injection stratified charge (DISC) engine and compare the results to that of a model predictive controller designed for the same application.by Michael David Rinehart.S.M
    • …
    corecore