1,914 research outputs found

    Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey

    Get PDF
    This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

    Hidden attractors in fundamental problems and engineering models

    Full text link
    Recently a concept of self-excited and hidden attractors was suggested: an attractor is called a self-excited attractor if its basin of attraction overlaps with neighborhood of an equilibrium, otherwise it is called a hidden attractor. For example, hidden attractors are attractors in systems with no equilibria or with only one stable equilibrium (a special case of multistability and coexistence of attractors). While coexisting self-excited attractors can be found using the standard computational procedure, there is no standard way of predicting the existence or coexistence of hidden attractors in a system. In this plenary survey lecture the concept of self-excited and hidden attractors is discussed, and various corresponding examples of self-excited and hidden attractors are considered

    Parameter Identification in a Probabilistic Setting

    Get PDF
    Parameter identification problems are formulated in a probabilistic language, where the randomness reflects the uncertainty about the knowledge of the true values. This setting allows conceptually easily to incorporate new information, e.g. through a measurement, by connecting it to Bayes's theorem. The unknown quantity is modelled as a (may be high-dimensional) random variable. Such a description has two constituents, the measurable function and the measure. One group of methods is identified as updating the measure, the other group changes the measurable function. We connect both groups with the relatively recent methods of functional approximation of stochastic problems, and introduce especially in combination with the second group of methods a new procedure which does not need any sampling, hence works completely deterministically. It also seems to be the fastest and more reliable when compared with other methods. We show by example that it also works for highly nonlinear non-smooth problems with non-Gaussian measures.Comment: 29 pages, 16 figure

    Parameter Estimation via Conditional Expectation --- A Bayesian Inversion

    Get PDF
    When a mathematical or computational model is used to analyse some system, it is usual that some parameters resp.\ functions or fields in the model are not known, and hence uncertain. These parametric quantities are then identified by actual observations of the response of the real system. In a probabilistic setting, Bayes's theory is the proper mathematical background for this identification process. The possibility of being able to compute a conditional expectation turns out to be crucial for this purpose. We show how this theoretical background can be used in an actual numerical procedure, and shortly discuss various numerical approximations

    Motion Planning of Uncertain Ordinary Differential Equation Systems

    Get PDF
    This work presents a novel motion planning framework, rooted in nonlinear programming theory, that treats uncertain fully and under-actuated dynamical systems described by ordinary differential equations. Uncertainty in multibody dynamical systems comes from various sources, such as: system parameters, initial conditions, sensor and actuator noise, and external forcing. Treatment of uncertainty in design is of paramount practical importance because all real-life systems are affected by it, and poor robustness and suboptimal performance result if it’s not accounted for in a given design. In this work uncertainties are modeled using Generalized Polynomial Chaos and are solved quantitatively using a least-square collocation method. The computational efficiency of this approach enables the inclusion of uncertainty statistics in the nonlinear programming optimization process. As such, the proposed framework allows the user to pose, and answer, new design questions related to uncertain dynamical systems. Specifically, the new framework is explained in the context of forward, inverse, and hybrid dynamics formulations. The forward dynamics formulation, applicable to both fully and under-actuated systems, prescribes deterministic actuator inputs which yield uncertain state trajectories. The inverse dynamics formulation is the dual to the forward dynamic, and is only applicable to fully-actuated systems; deterministic state trajectories are prescribed and yield uncertain actuator inputs. The inverse dynamics formulation is more computationally efficient as it requires only algebraic evaluations and completely avoids numerical integration. Finally, the hybrid dynamics formulation is applicable to under-actuated systems where it leverages the benefits of inverse dynamics for actuated joints and forward dynamics for unactuated joints; it prescribes actuated state and unactuated input trajectories which yield uncertain unactuated states and actuated inputs. The benefits of the ability to quantify uncertainty when planning the motion of multibody dynamic systems are illustrated through several case-studies. The resulting designs determine optimal motion plans—subject to deterministic and statistical constraints—for all possible systems within the probability space

    Probability-guaranteed set-membership state estimation for polynomially uncertain linear time-invariant systems

    Get PDF
    2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting /republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksConventional deterministic set-membership (SM) estimation is limited to unknown-but-bounded uncertainties. In order to exploit distributional information of probabilistic uncertainties, a probability-guaranteed SM state estimation approach is proposed for uncertain linear time-invariant systems. This approach takes into account polynomial dependence on probabilistic uncertain parameters as well as additive stochastic noises. The purpose is to compute, at each time instant, a bounded set that contains the actual state with a guaranteed probability. The proposed approach relies on the extended form of an observer representation over a sliding window. For the offline observer synthesis, a polynomial-chaos-based method is proposed to minimize the averaged H2 estimation performance with respect to probabilistic uncertain parameters. It explicitly accounts for the polynomial uncertainty structure, whilst most literature relies on conservative affine or polytopic overbounding. Online state estimation restructures the extended observer form, and constructs a Gaussian mixture model to approximate the state distribution. This enables computationally efficient ellipsoidal calculus to derive SM estimates with a predefined confidence level. The proposed approach preserves time invariance of the uncertain parameters and fully exploits the polynomial uncertainty structure, to achieve tighter SM bounds. This improvement is illustrated by a numerical example with a comparison to a deterministic zonotopic method.Peer ReviewedPostprint (author's final draft

    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
    corecore