5,357 research outputs found
Adaptive cancelation of self-generated sensory signals in a whisking robot
Sensory signals are often caused by one's own active movements. This raises a problem of discriminating between self-generated sensory signals and signals generated by the external world. Such discrimination is of general importance for robotic systems, where operational robustness is dependent on the correct interpretation of sensory signals. Here, we investigate this problem in the context of a whiskered robot. The whisker sensory signal comprises two components: one due to contact with an object (externally generated) and another due to active movement of the whisker (self-generated). We propose a solution to this discrimination problem based on adaptive noise cancelation, where the robot learns to predict the sensory consequences of its own movements using an adaptive filter. The filter inputs (copy of motor commands) are transformed by Laguerre functions instead of the often-used tapped-delay line, which reduces model order and, therefore, computational complexity. Results from a contact-detection task demonstrate that false positives are significantly reduced using the proposed scheme
Towards Efficient Maximum Likelihood Estimation of LPV-SS Models
How to efficiently identify multiple-input multiple-output (MIMO) linear
parameter-varying (LPV) discrete-time state-space (SS) models with affine
dependence on the scheduling variable still remains an open question, as
identification methods proposed in the literature suffer heavily from the curse
of dimensionality and/or depend on over-restrictive approximations of the
measured signal behaviors. However, obtaining an SS model of the targeted
system is crucial for many LPV control synthesis methods, as these synthesis
tools are almost exclusively formulated for the aforementioned representation
of the system dynamics. Therefore, in this paper, we tackle the problem by
combining state-of-the-art LPV input-output (IO) identification methods with an
LPV-IO to LPV-SS realization scheme and a maximum likelihood refinement step.
The resulting modular LPV-SS identification approach achieves statical
efficiency with a relatively low computational load. The method contains the
following three steps: 1) estimation of the Markov coefficient sequence of the
underlying system using correlation analysis or Bayesian impulse response
estimation, then 2) LPV-SS realization of the estimated coefficients by using a
basis reduced Ho-Kalman method, and 3) refinement of the LPV-SS model estimate
from a maximum-likelihood point of view by a gradient-based or an
expectation-maximization optimization methodology. The effectiveness of the
full identification scheme is demonstrated by a Monte Carlo study where our
proposed method is compared to existing schemes for identifying a MIMO LPV
system
Identification of Stochastic Wiener Systems using Indirect Inference
We study identification of stochastic Wiener dynamic systems using so-called
indirect inference. The main idea is to first fit an auxiliary model to the
observed data and then in a second step, often by simulation, fit a more
structured model to the estimated auxiliary model. This two-step procedure can
be used when the direct maximum-likelihood estimate is difficult or intractable
to compute. One such example is the identification of stochastic Wiener
systems, i.e.,~linear dynamic systems with process noise where the output is
measured using a non-linear sensor with additive measurement noise. It is in
principle possible to evaluate the log-likelihood cost function using numerical
integration, but the corresponding optimization problem can be quite intricate.
This motivates studying consistent, but sub-optimal, identification methods for
stochastic Wiener systems. We will consider indirect inference using the best
linear approximation as an auxiliary model. We show that the key to obtain a
reliable estimate is to use uncertainty weighting when fitting the stochastic
Wiener model to the auxiliary model estimate. The main technical contribution
of this paper is the corresponding asymptotic variance analysis. A numerical
evaluation is presented based on a first-order finite impulse response system
with a cubic non-linearity, for which certain illustrative analytic properties
are derived.Comment: The 17th IFAC Symposium on System Identification, SYSID 2015,
Beijing, China, October 19-21, 201
On the Approximation of Toeplitz Operators for Nonparametric -norm Estimation
Given a stable SISO LTI system , we investigate the problem of estimating
the -norm of , denoted , when is only
accessible via noisy observations. Wahlberg et al. recently proposed a
nonparametric algorithm based on the power method for estimating the top
eigenvalue of a matrix. In particular, by applying a clever time-reversal
trick, Wahlberg et al. implement the power method on the top left
corner of the Toeplitz (convolution) operator associated with . In
this paper, we prove sharp non-asymptotic bounds on the necessary length
needed so that is an -additive approximation of
. Furthermore, in the process of demonstrating the sharpness of
our bounds, we construct a simple family of finite impulse response (FIR)
filters where the number of timesteps needed for the power method is
arbitrarily worse than the number of timesteps needed for parametric FIR
identification via least-squares to achieve the same -additive
approximation
A new kernel-based approach to system identification with quantized output data
In this paper we introduce a novel method for linear system identification
with quantized output data. We model the impulse response as a zero-mean
Gaussian process whose covariance (kernel) is given by the recently proposed
stable spline kernel, which encodes information on regularity and exponential
stability. This serves as a starting point to cast our system identification
problem into a Bayesian framework. We employ Markov Chain Monte Carlo methods
to provide an estimate of the system. In particular, we design two methods
based on the so-called Gibbs sampler that allow also to estimate the kernel
hyperparameters by marginal likelihood maximization via the
expectation-maximization method. Numerical simulations show the effectiveness
of the proposed scheme, as compared to the state-of-the-art kernel-based
methods when these are employed in system identification with quantized data.Comment: 10 pages, 4 figure
On algebraic time-derivative estimation and deadbeat state reconstruction
This note places into perspective the so-called algebraic time-derivative
estimation method recently introduced by Fliess and co-authors with standard
results from linear state-space theory for control systems. In particular, it
is shown that the algebraic method can in a sense be seen as a special case of
deadbeat state estimation based on the reconstructibility Gramian of the
considered system.Comment: Maple-supplements available at
https://www.tu-ilmenau.de/regelungstechnik/mitarbeiter/johann-reger
- …