129 research outputs found

    Filtering and fault detection for nonlinear systems with polynomial approximation

    Get PDF
    This paper is concerned with polynomial filtering and fault detection problems for a class of nonlinear systems subject to additive noises and faults. The nonlinear functions are approximated with polynomials of a chosen degree. Different from the traditional methods, the approximation errors are not discarded but formulated as low-order polynomial terms with norm-bounded coefficients. The aim of the filtering problem is to design a least squares filter for the formulated nonlinear system with uncertain polynomials, and an upper bound of the filtering error covariance is found and subsequently minimized at each time step. The desired filter gain is obtained by recursively solving a set of Riccati-like matrix equations, and the filter design algorithm is therefore applicable for online computation. Based on the established filter design scheme, the fault detection problem is further investigated where the main focus is on the determination of the threshold on the residual. Due to the nonlinear and time-varying nature of the system under consideration, a novel threshold is determined that accounts for the noise intensity and the approximation errors, and sufficient conditions are established to guarantee the fault detectability for the proposed fault detection scheme. Comparative simulations are exploited to illustrate that the proposed filtering strategy achieves better estimation accuracy than the conventional polynomial extended Kalman filtering approach. The effectiveness of the associated fault detection scheme is also demonstrated.The National Natural Science Foundation of China under grants 61490701, 61210012, 61290324, and 61273156, and Jiangsu Provincial Key Laboratory of E-business at Nanjing University of Finance and Economics of China under Grant JSEB201301

    Distributed H-infinity filtering for polynomial nonlinear stochastic systems in sensor networks

    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.In this paper, the distributed H1 filtering problem is addressed for a class of polynomial nonlinear stochastic systems in sensor networks. For a Lyapunov function candidate whose entries are polynomials, we calculate its first- and second-order derivatives in order to facilitate the use of Itos differential role. Then, a sufficient condition for the existence of a feasible solution to the addressed distributed H1 filtering problem is derived in terms of parameter-dependent linear matrix inequalities (PDLMIs). For computational convenience, these PDLMIs are further converted into a set of sums of squares (SOSs) that can be solved effectively by using the semidefinite programming technique. Finally, a numerical simulation example is provided to demonstrate the effectiveness and applicability of the proposed design approach.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the National 973 Program of China under Grant 2009CB320600, the National Natural Science Foundation of China under Grant 60974030 and the Alexander von Humboldt Foundation of Germany

    On Matching, and Even Rectifying, Dynamical Systems through Koopman Operator Eigenfunctions

    Full text link
    Matching dynamical systems, through different forms of conjugacies and equivalences, has long been a fundamental concept, and a powerful tool, in the study and classification of nonlinear dynamic behavior (e.g. through normal forms). In this paper we will argue that the use of the Koopman operator and its spectrum is particularly well suited for this endeavor, both in theory, but also especially in view of recent data-driven algorithm developments. We believe, and document through illustrative examples, that this can nontrivially extend the use and applicability of the Koopman spectral theoretical and computational machinery beyond modeling and prediction, towards what can be considered as a systematic discovery of "Cole-Hopf-type" transformations for dynamics.Comment: 34 pages, 10 figure

    Quantum Computing for Fusion Energy Science Applications

    Full text link
    This is a review of recent research exploring and extending present-day quantum computing capabilities for fusion energy science applications. We begin with a brief tutorial on both ideal and open quantum dynamics, universal quantum computation, and quantum algorithms. Then, we explore the topic of using quantum computers to simulate both linear and nonlinear dynamics in greater detail. Because quantum computers can only efficiently perform linear operations on the quantum state, it is challenging to perform nonlinear operations that are generically required to describe the nonlinear differential equations of interest. In this work, we extend previous results on embedding nonlinear systems within linear systems by explicitly deriving the connection between the Koopman evolution operator, the Perron-Frobenius evolution operator, and the Koopman-von Neumann evolution (KvN) operator. We also explicitly derive the connection between the Koopman and Carleman approaches to embedding. Extension of the KvN framework to the complex-analytic setting relevant to Carleman embedding, and the proof that different choices of complex analytic reproducing kernel Hilbert spaces depend on the choice of Hilbert space metric are covered in the appendices. Finally, we conclude with a review of recent quantum hardware implementations of algorithms on present-day quantum hardware platforms that may one day be accelerated through Hamiltonian simulation. We discuss the simulation of toy models of wave-particle interactions through the simulation of quantum maps and of wave-wave interactions important in nonlinear plasma dynamics.Comment: 42 pages; 12 figures; invited paper at the 2021-2022 International Sherwood Fusion Theory Conferenc
    corecore