4,466 research outputs found
Recommended from our members
Identification of nonlinear interconnected systems
This thesis was submitted for the degree of Master of Philosophy and awarded by Brunel University.In this work we address the problem of identifying a discrete-time nonlinear system composed of a linear dynamical system connected to a static nonlinear component. We use linear fractional representation to provide a united framework for the identification of two classes of such systems. The first class consists of discrete-time systems consists of a linear time invariant system connected to a continuous nonlinear static component. The identification problem of estimating the unknown parameters of the linear system and simultaneously fitting a math order spline to the nonlinear data is addressed. A simple and tractable algorithm based on the separable least squares method is proposed for estimating the parameters of the linear
and the nonlinear components. We also provide a sufficient condition on data for consistency of the identification algorithm. Numerical examples illustrate the performance of the algorithm. Further, we examine a second class of systems that may involve a nonlinear static element of a more complex structure. The nonlinearity may not be continuous and is approximated by piecewise a±ne maps defined on different convex polyhedra, which are defined by linear
combinations of lagged inputs and outputs. An iterative identification procedure is proposed, which alternates the estimation of the linear and the nonlinear subsystems. Standard identification techniques are applied to the linear subsystem, whereas recently developed piecewise affine system identification techniques are employed for the estimation of the nonlinear component. Numerical examples show that the proposed procedure is able to successfully profit
from the knowledge of the interconnection structure, in comparison with a direct black box identification of the piecewise a±ne system.Funding was obtained as a Marie Curie Early Stage Researcher Training fellowship, under the NET-ACE project (MEST-CT-2004-6724)
Fitting Jump Models
We describe a new framework for fitting jump models to a sequence of data.
The key idea is to alternate between minimizing a loss function to fit multiple
model parameters, and minimizing a discrete loss function to determine which
set of model parameters is active at each data point. The framework is quite
general and encompasses popular classes of models, such as hidden Markov models
and piecewise affine models. The shape of the chosen loss functions to minimize
determine the shape of the resulting jump model.Comment: Accepted for publication in Automatic
Hybrid System Identification of Manual Tracking Submovements in Parkinson\u27s Disease
Seemingly smooth motions in manual tracking, (e.g., following a moving target with a joystick input) are actually sequences of submovements: short, open-loop motions that have been previously learned. In Parkinson\u27s disease, a neurodegenerative movement disorder, characterizations of motor performance can yield insight into underlying neurological mechanisms and therefore into potential treatment strategies. We focus on characterizing submovements through Hybrid System Identification, in which the dynamics of each submovement, the mode sequence and timing, and switching mechanisms are all unknown. We describe an initialization that provides a mode sequence and estimate of the dynamics of submovements, then apply hybrid optimization techniques based on embedding to solve a constrained nonlinear program. We also use the existing geometric approach for hybrid system identification to analyze our model and explain the deficits and advantages of each. These methods are applied to data gathered from subjects with Parkinson\u27s disease (on and off L-dopa medication) and from age-matched control subjects, and the results compared across groups demonstrating robust differences. Lastly, we develop a scheme to estimate the switching mechanism of the modeled hybrid system by using the principle of maximum margin separating hyperplane, which is a convex optimization problem, over the affine parameters describing the switching surface and provide a means o characterizing when too many or too few parameters are hypothesized to lie in the switching surface
Universal discrete-time reservoir computers with stochastic inputs and linear readouts using non-homogeneous state-affine systems
A new class of non-homogeneous state-affine systems is introduced for use in
reservoir computing. Sufficient conditions are identified that guarantee first,
that the associated reservoir computers with linear readouts are causal,
time-invariant, and satisfy the fading memory property and second, that a
subset of this class is universal in the category of fading memory filters with
stochastic almost surely uniformly bounded inputs. This means that any
discrete-time filter that satisfies the fading memory property with random
inputs of that type can be uniformly approximated by elements in the
non-homogeneous state-affine family.Comment: 41 page
- …