| 1. |
- Akcay, H., et al.
(författare)
-
On the choice of norms in system identification
- 1996
-
Ingår i: IEEE Transactions on Automatic Control. - Linköping : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286. ; 41:9, s. 1367-1372
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we discuss smooth and sensitive norms for prediction error system identification when the disturbances are magnitude bounded. Formal conditions for sensitive norms, which give an order of magnitude faster convergence of the parameter estimate variance, are developed. However, it also is shown that the parameter estimate variance convergence rate of sensitive norms is arbitrarily bad for certain distributions. A necessary condition for a norm to be statistically robust with respect to the family F(C) of distributions with support [-C, C] for some arbitrary C > 0 is that its second derivative does not vanish on the support. A direct consequence of this observation is that the quadratic norm is statistically robust among all ℓp-norms, p ≀ 2 < ∞ for F(C). ©1996 IEEE.
|
|
| 2. |
- Benveniste, Albert, et al.
(författare)
-
Meeting the Challenge of Computer Science in the Industrial Applications of Control: An Introductory Discussion to the Special Issue
- 1993
-
Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286. ; 38:7, s. 1004-1010
-
Tidskriftsartikel (refereegranskat)abstract
- The motivations, objectives, and results of the project tilted Facing the Challenge of Computer Science in the Industrial Applications of Control, which was launched by the IEEE Control Systems Society and the IFAC Committee on Theory, are presented. Potential alternatives for reducing costs in control industries at those points where they are most significant, control paradigms beyond traditional control science, and the ways in which control engineering should be taught are reviewed
|
|
| 3. |
|
|
| 4. |
- Bernhardsson, Bo, et al.
(författare)
-
On the notion of strong stabilizability
- 1990
-
Ingår i: IEEE Transactions on Automatic Control. - 0018-9286. ; AC-35:8, s. 927-929
-
Tidskriftsartikel (refereegranskat)
|
|
| 5. |
- Böling, Jari M., et al.
(författare)
-
On control relevant criteria in H∞ identification
- 1998
-
Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286 .- 1558-2523. ; 43:5, s. 694-700
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes a technique for using control relevant criteria in H∞ identification. The work reported here has its background in a desire to understand the closed-loop versus open-loop issue in control relevant identification. The proposed technique has some features in common with the iterative closed-loop Schrama scheme, but is constructed so as to be able to obtain control relevant reduced complexity models also directly from open-loop data (for stable systems). It is demonstrated that the proposed technique solves, with the initial open-loop data only, the examples treated earlier in the literature using the iterative closed-loop Schrama scheme.
|
|
| 6. |
- Carlemalm, Catharina, et al.
(författare)
-
Algorithms for time delay estimation using a low complexity exhaustive search
- 1999
-
Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286 .- 1558-2523. ; 44:5, s. 1031-1037
-
Tidskriftsartikel (refereegranskat)abstract
- This paper addresses the problem of time-delay estimation. Two new algorithms for time-delay estimation are developed and analyzed. The suggested methods combine an exhaustive search with a low complexity. Consequently, the problems with local minima of gradient search algorithms are avoided. The receiver operating characteristics (ROC) are computed, and together with simulation results these verify the performance of the estimation schemes.
|
|
| 7. |
|
|
| 8. |
- Forssell, Urban, et al.
(författare)
-
An Alternative Motivation for the Indirect Approach to Closed-Loop Identification
- 1999
-
Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286 .- 1558-2523. ; 44:11, s. 2206-2209
-
Tidskriftsartikel (refereegranskat)abstract
- Direct prediction error identification of systems operating in closed loop may lead to biased results due to the correlation between the input and the output noise. The authors study this error, what factors affect it, and how it may be avoided. In particular, the role of the noise model is discussed and the authors show how the noise model should be parameterized to avoid the bias. Apart from giving important insights into the properties of the direct method, this provides a nonstandard motivation for the indirect method.
|
|
| 9. |
- Gunnarsson, Svante
(författare)
-
On Some Asymptotic Uncertainty Bounds in Recursive Least Squares Identification
- 1993
-
Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286 .- 1558-2523. ; 38:11, s. 1685-1688
-
Tidskriftsartikel (refereegranskat)abstract
- This note deals with the performance of the recursive least squares algorithm when it is applied to problems where the measured signal is corrupted by bounded noise. Using ideas from bounding ellipsoid algorithms we derive an asymptotic expression for the bound on the uncertainty of the parameter estimate for a simple choice of design variables. This bound is also transformed to a bound on the uncertainty of the transfer function estimate.
|
|
| 10. |
- Guo, Lei, et al.
(författare)
-
Exponential Stability of General Tracking Algorithms
- 1995
-
Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286 .- 1558-2523. ; 40:8, s. 1376-1387
-
Tidskriftsartikel (refereegranskat)abstract
- Tracking and adaptation algorithms are, from a formal point of view, nonlinear systems which depend on stochastic variables in a fairly complicated way. The analysis of such algorithms is thus quite complicated. A first step is to establish the exponential stability of these systems. This is of interest in its own right and a prerequisite for the practical use of the algorithm. It is also a necessary starting point to analyze the performance in terms of tracking and adaptation because that is how close the estimated parameters are to the time-varying true ones. In this paper we establish some general conditions for the exponential stability of a wide and common class of tracking algorithms. This includes least mean squares, recursive least squares, and Kalman filter based adaptation algorithms. We show how stability of an averaged (linear and deterministic) equation and stability of the actual algorithm are linked to each other under weak conditions on the involved stochastic processes. We also give explicit conditions for exponential stability of the most common algorithms. The tracking performance of the algorithms is studied in a companion paper.
|
|
