32,418 research outputs found

    On a nonlinear partial differential algebraic system arising in technical textile industry: Analysis and numerics

    Full text link
    In this paper we explore a numerical scheme for a nonlinear fourth order system of partial differential algebraic equations that describes the dynamics of slender inextensible elastica as they arise in the technical textile industry. Applying a semi-discretization in time, the resulting sequence of nonlinear elliptic systems with the algebraic constraint for the local length preservation is reformulated as constrained optimization problems in a Hilbert space setting that admit a solution at each time level. Stability and convergence of the scheme are proved. The numerical realization is based on a finite element discretization in space. The simulation results confirm the analytically predicted properties of the scheme.Comment: Abstract and introduction are partially rewritten. The numerical study in Section 4 is completely rewritte

    Dynamically Stable 3D Quadrupedal Walking with Multi-Domain Hybrid System Models and Virtual Constraint Controllers

    Get PDF
    Hybrid systems theory has become a powerful approach for designing feedback controllers that achieve dynamically stable bipedal locomotion, both formally and in practice. This paper presents an analytical framework 1) to address multi-domain hybrid models of quadruped robots with high degrees of freedom, and 2) to systematically design nonlinear controllers that asymptotically stabilize periodic orbits of these sophisticated models. A family of parameterized virtual constraint controllers is proposed for continuous-time domains of quadruped locomotion to regulate holonomic and nonholonomic outputs. The properties of the Poincare return map for the full-order and closed-loop hybrid system are studied to investigate the asymptotic stabilization problem of dynamic gaits. An iterative optimization algorithm involving linear and bilinear matrix inequalities is then employed to choose stabilizing virtual constraint parameters. The paper numerically evaluates the analytical results on a simulation model of an advanced 3D quadruped robot, called GR Vision 60, with 36 state variables and 12 control inputs. An optimal amble gait of the robot is designed utilizing the FROST toolkit. The power of the analytical framework is finally illustrated through designing a set of stabilizing virtual constraint controllers with 180 controller parameters.Comment: American Control Conference 201

    Robust mixed H-2/H∞ control for a class of nonlinear stochastic systems

    Get PDF
    The problem of mixed H2/H∞ control is considered for a class of uncertain discrete-time nonlinear stochastic systems. The nonlinearities are described by statistical means of the stochastic variables and the uncertainties are represented by deterministic norm-bounded parameter perturbations. The mixed H2/H∞ control problem is formulated in terms of the notion of exponentially mean-square quadratic stability and the characterisations of both the H2 control performance and the H∞ robustness performance. A new technique is developed to deal with the matrix trace terms arising from the stochastic nonlinearities and the well-known S-procedure is adopted to handle the deterministic uncertainities. A unified framework is established to solve the addressed mixed H2/H∞ control problem using a linear matrix inequality approach. Within such a framework, two additional optimisation problems are discussed, one is to optimise the H∞ robustness performance, and the other is to optimise the H2 control performance. An illustrative example is provided to demonstrate the effectiveness of the proposed method.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Nuffield Foundation of the UK under Grant NAL/00630/G and the Alexander von Humboldt Foundation of Germany, the National Natural Science Foundation of China under Grant 60474049 and the Fujian provincial Natural Science Foundation of China under Grant A0410012

    Simple Approximations of Semialgebraic Sets and their Applications to Control

    Full text link
    Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance the solution set of linear matrix inequalities or the Schur/Hurwitz stability domains. These sets often have very complicated shapes (non-convex, and even non-connected), which renders very difficult their manipulation. It is therefore of considerable importance to find simple-enough approximations of these sets, able to capture their main characteristics while maintaining a low level of complexity. For these reasons, in the past years several convex approximations, based for instance on hyperrect-angles, polytopes, or ellipsoids have been proposed. In this work, we move a step further, and propose possibly non-convex approximations , based on a small volume polynomial superlevel set of a single positive polynomial of given degree. We show how these sets can be easily approximated by minimizing the L1 norm of the polynomial over the semialgebraic set, subject to positivity constraints. Intuitively, this corresponds to the trace minimization heuristic commonly encounter in minimum volume ellipsoid problems. From a computational viewpoint, we design a hierarchy of linear matrix inequality problems to generate these approximations, and we provide theoretically rigorous convergence results, in the sense that the hierarchy of outer approximations converges in volume (or, equivalently, almost everywhere and almost uniformly) to the original set. Two main applications of the proposed approach are considered. The first one aims at reconstruction/approximation of sets from a finite number of samples. In the second one, we show how the concept of polynomial superlevel set can be used to generate samples uniformly distributed on a given semialgebraic set. The efficiency of the proposed approach is demonstrated by different numerical examples
    corecore