258 research outputs found
Stochastic MPC Design for a Two-Component Granulation Process
We address the issue of control of a stochastic two-component granulation
process in pharmaceutical applications through using Stochastic Model
Predictive Control (SMPC) and model reduction to obtain the desired particle
distribution. We first use the method of moments to reduce the governing
integro-differential equation down to a nonlinear ordinary differential
equation (ODE). This reduced-order model is employed in the SMPC formulation.
The probabilistic constraints in this formulation keep the variance of
particles' drug concentration in an admissible range. To solve the resulting
stochastic optimization problem, we first employ polynomial chaos expansion to
obtain the Probability Distribution Function (PDF) of the future state
variables using the uncertain variables' distributions. As a result, the
original stochastic optimization problem for a particulate system is converted
to a deterministic dynamic optimization. This approximation lessens the
computation burden of the controller and makes its real time application
possible.Comment: American control Conference, May, 201
A simple algorithm for stable order reduction of z-domain Laguerre models
International audienceDiscrete-time Laguerre series are a well known and efficient tool in system identification and modeling. This paper presents a simple solution for stable and accurate order reduction of systems described by a Laguerre model
Recommended from our members
Analysis and control of power systems using orthogonal expansions
In recent years, considerable attention has been focused on the application of
orthogonal expansions to system analysis, parameter identification, model reduction
and control system design. However, little research has been done in applying their
useful properties to Power System analysis and control. This research attempts to
make some inroads in applying the so called " orthogonal expansion approach " to
analysis and control of Power systems, especially the latter.
A set of orthogonal functions commonly called Walsh functions in system
science after it's discoverer J.L. Walsh [1923] have been successfully used for
parameter identification in the presence of severe nonlinearities. The classical optimal
control problem is applied to a synchronous machine infinite bus system via the
orthogonal expansion approach and a convenient method outlined for designing PID
controllers which can achieve prespecified closed loop response characteristics. The
latter is then applied for designing a dynamic series capacitor controller for a single
machine infinite bus system
Signal approximation using the bilinear transform
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (p. 117-118).This thesis explores the approximation properties of a unique basis expansion. The expansion implements a nonlinear frequency warping between a continuous-time signal and its discrete-time representation according to the bilinear transform. Since there is a one-to-one mapping between the continuous-time and discrete-time frequency axes, the bilinear representation avoids any frequency aliasing distortions. We devote the first portion of this thesis to some theoretical properties of the bilinear representation, including the analysis and synthesis networks as well as bounds on the basis functions. These properties are crucial when we further analyze the bilinear approximation performance. We also consider a modified version of the bilinear representation in which the continuous-time signal is segmented using a short-duration window. This segmentation procedure affords greater time resolution and, in certain cases, improves the overall approximation quality. In the second portion of this thesis, we evaluate the approximation performance of the bilinear representation in two different applications. The first is approximating instrumental music. We compare the bilinear representation to a discrete cosine transform based approximation technique. The second application is computing the inner product of two continuous-time signals for a binary detection problem. In this case, we compare the bilinear representation with Nyquist sampling.by Archana Venkataraman.M.Eng
Sparse Volterra and Polynomial Regression Models: Recoverability and Estimation
Volterra and polynomial regression models play a major role in nonlinear
system identification and inference tasks. Exciting applications ranging from
neuroscience to genome-wide association analysis build on these models with the
additional requirement of parsimony. This requirement has high interpretative
value, but unfortunately cannot be met by least-squares based or kernel
regression methods. To this end, compressed sampling (CS) approaches, already
successful in linear regression settings, can offer a viable alternative. The
viability of CS for sparse Volterra and polynomial models is the core theme of
this work. A common sparse regression task is initially posed for the two
models. Building on (weighted) Lasso-based schemes, an adaptive RLS-type
algorithm is developed for sparse polynomial regressions. The identifiability
of polynomial models is critically challenged by dimensionality. However,
following the CS principle, when these models are sparse, they could be
recovered by far fewer measurements. To quantify the sufficient number of
measurements for a given level of sparsity, restricted isometry properties
(RIP) are investigated in commonly met polynomial regression settings,
generalizing known results for their linear counterparts. The merits of the
novel (weighted) adaptive CS algorithms to sparse polynomial modeling are
verified through synthetic as well as real data tests for genotype-phenotype
analysis.Comment: 20 pages, to appear in IEEE Trans. on Signal Processin
- …