16,172 research outputs found
Comparative evaluation of approaches in T.4.1-4.3 and working definition of adaptive module
The goal of this deliverable is two-fold: (1) to present and compare different approaches towards learning and encoding movements us- ing dynamical systems that have been developed by the AMARSi partners (in the past during the first 6 months of the project), and (2) to analyze their suitability to be used as adaptive modules, i.e. as building blocks for the complete architecture that will be devel- oped in the project. The document presents a total of eight approaches, in two groups: modules for discrete movements (i.e. with a clear goal where the movement stops) and for rhythmic movements (i.e. which exhibit periodicity). The basic formulation of each approach is presented together with some illustrative simulation results. Key character- istics such as the type of dynamical behavior, learning algorithm, generalization properties, stability analysis are then discussed for each approach. We then make a comparative analysis of the different approaches by comparing these characteristics and discussing their suitability for the AMARSi project
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
System Identification for Nonlinear Control Using Neural Networks
An approach to incorporating artificial neural networks in nonlinear, adaptive control systems is described. The controller contains three principal elements: a nonlinear inverse dynamic control law whose coefficients depend on a comprehensive model of the plant, a neural network that models system dynamics, and a state estimator whose outputs drive the control law and train the neural network. Attention is focused on the system identification task, which combines an extended Kalman filter with generalized spline function approximation. Continual learning is possible during normal operation, without taking the system off line for specialized training. Nonlinear inverse dynamic control requires smooth derivatives as well as function estimates, imposing stringent goals on the approximating technique
Fuzzy stability analysis of regenerative chatter in milling
During machining, unstable self-excited vibrations known as regenerative chatter can occur, causing excessive tool wear or failure, and a poor surface finish on the machined workpiece. Consequently it is desirable to predict, and hence avoid the onset of this instability. Regenerative chatter is a function of empirical cutting coefficients, and the structural dynamics of the machine-tool system. There can be significant uncertainties in the underlying parameters, so the predicted stability limits do not necessarily agree with those found in practice. In the present study, fuzzy arithmetic techniques are applied to the chatter stability problem. It is first shown that techniques based upon interval arithmetic are not suitable for this problem due to the issue of recursiveness. An implementation of fuzzy arithmetic is then developed based upon the work of Hanss and Klimke. The arithmetic is then applied to two techniques for predicting milling chatter stability: the classical approach of Altintas, and the time-finite element method of Mann. It is shown that for some cases careful programming can reduce the computational effort to acceptable levels. The problem of milling chatter uncertainty is then considered within the framework of Ben-Haim's information-gap theory. It is shown that the presented approach can be used to solve process design problems with robustness to the uncertain parameters. The fuzzy stability bounds are then compared to previously published data, to investigate how uncertainty propagation techniques can offer more insight into the accuracy of chatter predictions
LSTM Neural Networks: Input to State Stability and Probabilistic Safety Verification
The goal of this paper is to analyze Long Short Term Memory (LSTM) neural
networks from a dynamical system perspective. The classical recursive equations
describing the evolution of LSTM can be recast in state space form, resulting
in a time-invariant nonlinear dynamical system. A sufficient condition
guaranteeing the Input-to-State (ISS) stability property of this class of
systems is provided. The ISS property entails the boundedness of the output
reachable set of the LSTM. In light of this result, a novel approach for the
safety verification of the network, based on the Scenario Approach, is devised.
The proposed method is eventually tested on a pH neutralization process.Comment: Accepted for Learning for dynamics & control (L4DC) 202
- …