2,016 research outputs found

    Formal Proofs for Nonlinear Optimization

    Get PDF
    We present a formally verified global optimization framework. Given a semialgebraic or transcendental function ff and a compact semialgebraic domain KK, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of ff over KK. This method allows to bound in a modular way some of the constituents of ff by suprema of quadratic forms with a well chosen curvature. Thus, we reduce the initial goal to a hierarchy of semialgebraic optimization problems, solved by sums of squares relaxations. Our implementation tool interleaves semialgebraic approximations with sums of squares witnesses to form certificates. It is interfaced with Coq and thus benefits from the trusted arithmetic available inside the proof assistant. This feature is used to produce, from the certificates, both valid underestimators and lower bounds for each approximated constituent. The application range for such a tool is widespread; for instance Hales' proof of Kepler's conjecture yields thousands of multivariate transcendental inequalities. We illustrate the performance of our formal framework on some of these inequalities as well as on examples from the global optimization literature.Comment: 24 pages, 2 figures, 3 table

    Variance-constrained H∞ filtering for a class of nonlinear time-varying systems with multiple missing measurements: The finite-horizon case

    Get PDF
    Copyright [2010] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper is concerned with the robust H ∞ finite-horizon filtering problem for a class of uncertain nonlinear discrete time-varying stochastic systems with multiple missing measurements and error variance constraints. All the system parameters are time-varying and the uncertainty enters into the state matrix. The measurement missing phenomenon occurs in a random way, and the missing probability for each sensor is governed by an individual random variable satisfying a certain probabilistic distribution in the interval . The stochastic nonlinearities under consideration here are described by statistical means which can cover several classes of well-studied nonlinearities. Sufficient conditions are derived for a finite-horizon filter to satisfy both the estimation error variance constraints and the prescribed H ∞ performance requirement. These conditions are expressed in terms of the feasibility of a series of recursive linear matrix inequalities (RLMIs). Simulation results demonstrate the effectiveness of the developed filter design scheme.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. by Grant GR/S27658/01, the Royal Society of the U.K., National Natural Science Foundation of China by Grants 60825303 and 60834003, National 973 Project of China by Grant 2009CB320600, Fok Ying Tung Education Foundation by Grant 111064, the Youth Science Fund of Heilongjiang Province of China by Grant QC2009C63, and by the Alexander von Humboldt Foundation of Germany

    Stability and Performance Verification of Optimization-based Controllers

    Get PDF
    This paper presents a method to verify closed-loop properties of optimization-based controllers for deterministic and stochastic constrained polynomial discrete-time dynamical systems. The closed-loop properties amenable to the proposed technique include global and local stability, performance with respect to a given cost function (both in a deterministic and stochastic setting) and the L2\mathcal{L}_2 gain. The method applies to a wide range of practical control problems: For instance, a dynamical controller (e.g., a PID) plus input saturation, model predictive control with state estimation, inexact model and soft constraints, or a general optimization-based controller where the underlying problem is solved with a fixed number of iterations of a first-order method are all amenable to the proposed approach. The approach is based on the observation that the control input generated by an optimization-based controller satisfies the associated Karush-Kuhn-Tucker (KKT) conditions which, provided all data is polynomial, are a system of polynomial equalities and inequalities. The closed-loop properties can then be analyzed using sum-of-squares (SOS) programming

    PID and PID-like controller design by pole assignment within D-stable regions

    Get PDF
    This paper presents a new PID and PID-like controller design method that permits the designer to control the desired dynamic performance of a closed-loop system by first specifying a set of desired D-stable regions in the complex plane and then running a numerical optimisation algorithm to find the controller parameters such that all the roots of the closed-loop system are within the specified regions. This method can be used for stable and unstable plants with high order degree, for plants with time delay, for controller with more than three design parameters, and for various controller configurations. It also allows a unified treatment of the controller design for both continuous and discrete systems. Examples and comparative simulation results are pro-vided to illustrate its merit

    A New Approach to Linear/Nonlinear Distributed Fusion Estimation Problem

    Full text link
    Disturbance noises are always bounded in a practical system, while fusion estimation is to best utilize multiple sensor data containing noises for the purpose of estimating a quantity--a parameter or process. However, few results are focused on the information fusion estimation problem under bounded noises. In this paper, we study the distributed fusion estimation problem for linear time-varying systems and nonlinear systems with bounded noises, where the addressed noises do not provide any statistical information, and are unknown but bounded. When considering linear time-varying fusion systems with bounded noises, a new local Kalman-like estimator is designed such that the square error of the estimator is bounded as time goes to \infty. A novel constructive method is proposed to find an upper bound of fusion estimation error, then a convex optimization problem on the design of an optimal weighting fusion criterion is established in terms of linear matrix inequalities, which can be solved by standard software packages. Furthermore, according to the design method of linear time-varying fusion systems, each local nonlinear estimator is derived for nonlinear systems with bounded noises by using Taylor series expansion, and a corresponding distributed fusion criterion is obtained by solving a convex optimization problem. Finally, target tracking system and localization of a mobile robot are given to show the advantages and effectiveness of the proposed methods.Comment: 9 pages, 3 figure

    Variance-constrained filtering for uncertain stochastic systems with missing measurements

    Get PDF
    Copyright [2003] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this note, we consider a new filtering problem for linear uncertain discrete-time stochastic systems with missing measurements. The parameter uncertainties are allowed to be norm-bounded and enter into the state matrix. The system measurements may be unavailable (i.e., missing data) at any sample time, and the probability of the occurrence of missing data is assumed to be known. The purpose of this problem is to design a linear filter such that, for all admissible parameter uncertainties and all possible incomplete observations, the error state of the filtering process is mean square bounded, and the steady-state variance of the estimation error of each state is not more than the individual prescribed upper bound. It is shown that, the addressed filtering problem can effectively be solved in terms of the solutions of a couple of algebraic Riccati-like inequalities or linear matrix inequalities. The explicit expression of the desired robust filters is parameterized, and an illustrative numerical example is provided to demonstrate the usefulness and flexibility of the proposed design approach

    On design of robust fault detection filter in finite-frequency domain with regional pole assignment

    Get PDF
    This brief is concerned with the fault detection (FD) filter design problem for an uncertain linear discrete-time system in the finite-frequency domain with regional pole assignment. An optimized FD filter is designed such that: 1) the FD dynamics is quadratically D-stable; 2) the effect from the exogenous disturbance on the residual is attenuated with respect to a minimized H∞-norm; and 3) the sensitivity of the residual to the fault is enhanced by means of a maximized H--norm. With the aid of the generalized Kalman-Yakubovich-Popov lemma, the mixed H--/H∞ performance and the D-stability requirement are guaranteed by solving a convex optimization problem. An iterative algorithm for designing the desired FD filter is proposed by evaluating the threshold on the generated residual function. A simulation result is exploited to illustrate the effectiveness of the proposed design technique.This work was supported in part by the Deanship of Scientific Research (DSR) at King Abdulaziz University in Saudi Arabia under Grant 16-135- 35-HiCi, the National Natural Science Foundation of China under Grants 61134009 and 61203139, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

    H∞ fuzzy control for systems with repeated scalar nonlinearities and random packet losses

    Get PDF
    Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper is concerned with the H∞ fuzzy control problem for a class of systems with repeated scalar nonlinearities and random packet losses. A modified Takagi-Sugeno (T-S) fuzzy model is proposed in which the consequent parts are composed of a set of discrete-time state equations containing a repeated scalar nonlinearity. Such a model can describe some well-known nonlinear systems such as recurrent neural networks. The measurement transmission between the plant and controller is assumed to be imperfect and a stochastic variable satisfying the Bernoulli random binary distribution is utilized to represent the phenomenon of random packet losses. Attention is focused on the analysis and design of H∞ fuzzy controllers with the same repeated scalar nonlinearities such that the closed-loop T-S fuzzy control system is stochastically stable and preserves a guaranteed H∞ performance. Sufficient conditions are obtained for the existence of admissible controllers, and the cone complementarity linearization procedure is employed to cast the controller design problem into a sequential minimization one subject to linear matrix inequalities, which can be readily solved by using standard numerical software. Two examples are given to illustrate the effectiveness of the proposed design method
    corecore