Search results for "State space"
showing 10 items of 49 documents
Stabilization and lx -gain analysis of switched positive systems with actuator saturation
2014
This paper is concerned with the problems of stability and l 1 -gain analysis for a class of switched positive systems with time-varying delays and actuator saturation. Firstly, a convex hull representation is used to describe the saturation behavior. By constructing a multiple co-positive Lyapunov functional, sufficient conditions are provided for the closed-loop system to be locally asymptotically stable at the origin of the state space under arbitrary switching. Then, the l 1 -gain performance analysis in the presence of actuator saturation is developed. Finally, two numerical examples are provided to demonstrate the effectiveness of the proposed method.
Optimal paths in weighted timed automata
2004
AbstractWe consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n(|δ(A)|+|wmax|)), where n is the number of clock…
Deciding reachability for planar multi-polynomial systems
1996
In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a finite number of (polyhedral) regions. To each of these regions is assigned some vector field which governs the dynamical behaviour of the system within this region. We prove the decidability of point to point and region to region reachability problems for planar hybrid systems for the case when trajectories within the regions can be described by polynomials of arbitrary degree.
Dynamic programming for 2-D discrete linear systems
1989
The authors calculate the optimal control of 2-D discrete linear systems using a dynamic programming method. It is assumed that the system is described with Roesser's state-space equations for which a 2-D sequence of inputs minimizing the given performance criterion is calculated. The method is particularly suitable for problems with bounded states and controls, although it can also be applied for unbounded cases. One numerical example is given. >
A state-space approach to mathematical modeling and parameters identification of vehicle frontal crash
2014
In this paper a state-space estimation procedure that relies on the time-domain analysis of input and output signals is used for mathematical modeling of vehicle frontal crash. The model is a double-spring–mass–damper system, whereby the front mass and real mass represent the chassis and the passenger compartment, respectively. It is observed that the dynamic crash of the model is closer to the dynamic crash from experimental when the mass of the chassis is greater than the mass of the passenger compartment. The dynamic crash depends on pole placement and the estimated parameters. It is noted that when the poles of the model are closer to zero, the dynamic crash of the model is far from the…
Parameter identification of induction motor model by means of State Space-Vector Model Output Error Minimization
2014
This paper proposes a technique for the off-line estimation of the electrical parameters of the equivalent circuit of an Induction Machines (IM), and focuses on the application of an algorithm based on the minimization of a suitable cost function involving the differences between the measured stator current direct (sD) and quadrature (sQ) components and the corresponding estimated by the IM state model. This method exploits an entire start-up transient of the IM to estimate all of the 4 electrical parameters of the machine (Rs, Ls, σLs, Tr). It proposes also a set of tests to be made in order to estimate the variation of the magnetic parameters of the IM versus the rotor magnetizing current…
A local linear black-box identification technique for power converters modeling
2009
In this paper, a black-box modeling technique for power electronic converters, also used in automotive environment is presented. The aim of this work is to provide a simple yet versatile and powerful tool to schematize complex electric devices in vehicular appliances, in order to fulfill the electromagnetic compatibility already during the project stage. By using input and output measured data, a composite local linear state space model is built up. Radial basis functions are used as weights for the local systems. The proposed approach is validated and applied in modeling a DC/DC converter for DC motors, a pulse width modulation inverter and a controlled rectifier.
Finding optimal finite biological sequences over finite alphabets: the OptiFin toolbox
2017
International audience; In this paper, we present a toolbox for a specific optimization problem that frequently arises in bioinformatics or genomics. In this specific optimisation problem, the state space is a set of words of specified length over a finite alphabet. To each word is associated a score. The overall objective is to find the words which have the lowest possible score. This type of general optimization problem is encountered in e.g 3D conformation optimisation for protein structure prediction, or largest core genes subset discovery based on best supported phylogenetic tree for a set of species. In order to solve this problem, we propose a toolbox that can be easily launched usin…
Multiscale Information Decomposition: Exact Computation for Multivariate Gaussian Processes
2017
Exploiting the theory of state space models, we derive the exact expressions of the information transfer, as well as redundant and synergistic transfer, for coupled Gaussian processes observed at multiple temporal scales. All of the terms, constituting the frameworks known as interaction information decomposition and partial information decomposition, can thus be analytically obtained for different time scales from the parameters of the VAR model that fits the processes. We report the application of the proposed methodology firstly to benchmark Gaussian systems, showing that this class of systems may generate patterns of information decomposition characterized by prevalently redundant or sy…
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
2020
AbstractIn model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubborn sets shows that a combination of several conditions on the reduction is sufficient to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a solution together with an updated correctness proof. Furthermore, we analyse in whi…