1,116 research outputs found
Convex Optimization In Identification Of Stable Non-Linear State Space Models
A new framework for nonlinear system identification is presented in terms of
optimal fitting of stable nonlinear state space equations to input/output/state
data, with a performance objective defined as a measure of robustness of the
simulation error with respect to equation errors. Basic definitions and
analytical results are presented. The utility of the method is illustrated on a
simple simulation example as well as experimental recordings from a live
neuron.Comment: 9 pages, 2 figure, elaboration of same-title paper in 49th IEEE
Conference on Decision and Contro
Learning-based predictive control for linear systems: a unitary approach
A comprehensive approach addressing identification and control for
learningbased Model Predictive Control (MPC) for linear systems is presented.
The design technique yields a data-driven MPC law, based on a dataset collected
from the working plant. The method is indirect, i.e. it relies on a model
learning phase and a model-based control design one, devised in an integrated
manner. In the model learning phase, a twofold outcome is achieved: first,
different optimal p-steps ahead prediction models are obtained, to be used in
the MPC cost function; secondly, a perturbed state-space model is derived, to
be used for robust constraint satisfaction. Resorting to Set Membership
techniques, a characterization of the bounded model uncertainties is obtained,
which is a key feature for a successful application of the robust control
algorithm. In the control design phase, a robust MPC law is proposed, able to
track piece-wise constant reference signals, with guaranteed recursive
feasibility and convergence properties. The controller embeds multistep
predictors in the cost function, it ensures robust constraints satisfaction
thanks to the learnt uncertainty model, and it can deal with possibly
unfeasible reference values. The proposed approach is finally tested in a
numerical example
Evaluating the Impact of SDC on the GMRES Iterative Solver
Increasing parallelism and transistor density, along with increasingly
tighter energy and peak power constraints, may force exposure of occasionally
incorrect computation or storage to application codes. Silent data corruption
(SDC) will likely be infrequent, yet one SDC suffices to make numerical
algorithms like iterative linear solvers cease progress towards the correct
answer. Thus, we focus on resilience of the iterative linear solver GMRES to a
single transient SDC. We derive inexpensive checks to detect the effects of an
SDC in GMRES that work for a more general SDC model than presuming a bit flip.
Our experiments show that when GMRES is used as the inner solver of an
inner-outer iteration, it can "run through" SDC of almost any magnitude in the
computationally intensive orthogonalization phase. That is, it gets the right
answer using faulty data without any required roll back. Those SDCs which it
cannot run through, get caught by our detection scheme
Trajectory optimization for the Hevelius-lunar microsatellite mission
In this paper trajectory optimisation for the Hevelius mission is presented. The Hevelius-Lunar Microsatellite Mission - is a multilander mission to the dark side of the Moon, supported by a relay microsatellite, orbiting on a Halo orbit around L2. Three landers, with miniaturized payloads, are transported by a carrier from a LEO to the surface of the Moon, where they perform a semi-hard landing with an airbag system. This paper will present the trajectory optimisation process, focusing, in particular, on the approach employed for Δv manoeuvre optimization. An introduction to the existing methods for trajectory optimization will be presented, subsequently it will be described how these methods have been exploited and originally combined in the Hevelius mission analysis and design
Double Greedy Algorithms: Reduced Basis Methods for Transport Dominated Problems
The central objective of this paper is to develop reduced basis methods for
parameter dependent transport dominated problems that are rigorously proven to
exhibit rate-optimal performance when compared with the Kolmogorov -widths
of the solution sets. The central ingredient is the construction of
computationally feasible "tight" surrogates which in turn are based on deriving
a suitable well-conditioned variational formulation for the parameter dependent
problem. The theoretical results are illustrated by numerical experiments for
convection-diffusion and pure transport equations. In particular, the latter
example sheds some light on the smoothness of the dependence of the solutions
on the parameters
- …