Case Bibo

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 39, NO. 10, OCTOBER 1994

2171

[4] P. R. Kumar and T. I. Seidman, "Dynamic instabilities and stabilization methods in distributed real time scheduling of manufacturing systems," IEEE Trans. Automat. Contr., vol. 35, pp. 289-298, 1990. [SI J. R. Perkins and P. R. Kumar, "Stable distributed real-time scheduling of flexible manufacturing/assembly/disassembly systems," I€€€ Trans. Automar. Conrr., vol. 34, pp. 139-148, 1989.

The following is a brief overview of the present work. In Section I1 we present some background material on coprime factorizations and the graph topology. In Section I11 we consider BIBO stable systems and the question of robustly convergent identification algorithms and input design. Section IV introduces ARX models for causal linear systems, and closed-loop identification is considered. Section V provides some error bounds for closed-loop identification in the framework of this paper. In Section VI we discuss briefly some generalizations to multivariable systems.

Worst-case Analysis of Identification-BIB0 Robustness for Closed-Loop Data

J. R. Partington and P. M. M&kila

Abstract-This paper deals with the worst-case analysis of identification of linear shift-invariant (possibly) infinite-dimensional systems. A necessary and sufficient input richness condition for the existence of robustly convergent identification algorithms in I' is given. A closedloop identification setting is studied to cover both stable and unstable (but BIBO stabilizable)systems. Identification (or modeling) error is then measured by distance functions which lead to the weakest convergence notions for systems such that closed-loop stability, in the sense of BIBO stability, is a robust property. Worst-case modeling error hounds in several distance functions are included.

1 . MATHEMATICAL 1 PRELIMINARIES

Let ( I p . 11 . [ I p ) (1 5 p 5 CO) denote the usual (real) sequence spaces. A linear discrete-time system is...