55,467 research outputs found

    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

    A fast Monte-Carlo method with a Reduced Basis of Control Variates applied to Uncertainty Propagation and Bayesian Estimation

    Get PDF
    The Reduced-Basis Control-Variate Monte-Carlo method was introduced recently in [S. Boyaval and T. Leli\`evre, CMS, 8 2010] as an improved Monte-Carlo method, for the fast estimation of many parametrized expected values at many parameter values. We provide here a more complete analysis of the method including precise error estimates and convergence results. We also numerically demonstrate that it can be useful to some parametrized frameworks in Uncertainty Quantification, in particular (i) the case where the parametrized expectation is a scalar output of the solution to a Partial Differential Equation (PDE) with stochastic coefficients (an Uncertainty Propagation problem), and (ii) the case where the parametrized expectation is the Bayesian estimator of a scalar output in a similar PDE context. Moreover, in each case, a PDE has to be solved many times for many values of its coefficients. This is costly and we also use a reduced basis of PDE solutions like in [S. Boyaval, C. Le Bris, Nguyen C., Y. Maday and T. Patera, CMAME, 198 2009]. This is the first combination of various Reduced-Basis ideas to our knowledge, here with a view to reducing as much as possible the computational cost of a simple approach to Uncertainty Quantification

    Global sensitivity analysis for the boundary control of an open channel

    Full text link
    The goal of this paper is to solve the global sensitivity analysis for a particular control problem. More precisely, the boundary control problem of an open-water channel is considered, where the boundary conditions are defined by the position of a down stream overflow gate and an upper stream underflow gate. The dynamics of the water depth and of the water velocity are described by the Shallow Water equations, taking into account the bottom and friction slopes. Since some physical parameters are unknown, a stabilizing boundary control is first computed for their nominal values, and then a sensitivity anal-ysis is performed to measure the impact of the uncertainty in the parameters on a given to-be-controlled output. The unknown physical parameters are de-scribed by some probability distribution functions. Numerical simulations are performed to measure the first-order and total sensitivity indices

    Guaranteed parameter estimation in nonlinear dynamic systems using improved bounding techniques

    Get PDF
    This paper is concerned with guaranteed parameter estimation in nonlinear dynamic systems in a context of bounded measurement error. The problem consists of finding - or approximating as closely as possible - the set of all possible parameter values such that the predicted outputs match the corresponding measurements within prescribed error bounds. An exhaustive search procedure is applied, whereby the parameter set is successively partitioned into smaller boxes and exclusion tests are performed to eliminate some of these boxes, until a prespecified threshold on the approximation level is met. Exclusion tests rely on the ability to bound the solution set of the dynamic system for a given parameter subset and the tightness of these bounds is therefore paramount. Equally important is the time required to compute the bounds, thereby defining a trade-off. It is the objective of this paper to investigate this trade-off by comparing various bounding techniques based on interval arithmetic, Taylor model arithmetic and ellipsoidal calculus. When applied to a simple case study, ellipsoidal and Taylor model approaches are found to reduce the number of iterations significantly compared to interval analysis, yet the overall computational time is only reduced for tight approximation levels due to the computational overhead. © 2013 EUCA
    • …
    corecore