307 research outputs found
Robust peak-to-peak gain analysis using integral quadratic constraints
This work provides a framework to compute an upper bound on the robust peak-to-peak gain of discrete-time uncertain linear systems using integral quadratic constraints (IQCs). Such bounds are of particular interest in the computation of reachable sets and the ℓ1-norm, as well as when safety-critical constraints need to be satisfied pointwise in time. The use of ρ-hard IQCs with a terminal cost enables us to deal with a wide variety of uncertainty classes, for example, we provide ρ-hard IQCs with a terminal cost for the class of parametric uncertainties. This approach unifies, generalizes, and significantly improves state-of-the-art methods, which is also demonstrated in a numerical example
Efficient Approaches for Enclosing the United Solution Set of the Interval Generalized Sylvester Matrix Equation
In this work, we investigate the interval generalized Sylvester matrix
equation and develop some
techniques for obtaining outer estimations for the so-called united solution
set of this interval system. First, we propose a modified variant of the
Krawczyk operator which causes reducing computational complexity to cubic,
compared to Kronecker product form. We then propose an iterative technique for
enclosing the solution set. These approaches are based on spectral
decompositions of the midpoints of , , and
and in both of them we suppose that the midpoints of and
are simultaneously diagonalizable as well as for the midpoints of
the matrices and . Some numerical experiments are given to
illustrate the performance of the proposed methods
Maximum Hands-Off Control: A Paradigm of Control Effort Minimization
In this paper, we propose a new paradigm of control, called a maximum
hands-off control. A hands-off control is defined as a control that has a short
support per unit time. The maximum hands-off control is the minimum support (or
sparsest) per unit time among all controls that achieve control objectives. For
finite horizon control, we show the equivalence between the maximum hands-off
control and L1-optimal control under a uniqueness assumption called normality.
This result rationalizes the use of L1 optimality in computing a maximum
hands-off control. We also propose an L1/L2-optimal control to obtain a smooth
hands-off control. Furthermore, we give a self-triggered feedback control
algorithm for linear time-invariant systems, which achieves a given sparsity
rate and practical stability in the case of plant disturbances. An example is
included to illustrate the effectiveness of the proposed control.Comment: IEEE Transactions on Automatic Control, 2015 (to appear
Connections Between Adaptive Control and Optimization in Machine Learning
This paper demonstrates many immediate connections between adaptive control
and optimization methods commonly employed in machine learning. Starting from
common output error formulations, similarities in update law modifications are
examined. Concepts in stability, performance, and learning, common to both
fields are then discussed. Building on the similarities in update laws and
common concepts, new intersections and opportunities for improved algorithm
analysis are provided. In particular, a specific problem related to higher
order learning is solved through insights obtained from these intersections.Comment: 18 page
The M33 Synoptic Stellar Survey. II. Mira Variables
We present the discovery of 1847 Mira candidates in the Local Group galaxy
M33 using a novel semi-parametric periodogram technique coupled with a Random
Forest classifier. The algorithms were applied to ~2.4x10^5 I-band light curves
previously obtained by the M33 Synoptic Stellar Survey. We derive preliminary
Period-Luminosity relations at optical, near- & mid-infrared wavelengths and
compare them to the corresponding relations in the Large Magellanic Cloud.Comment: Includes small corrections to match the published versio
- …