Abstract
This paper is based on the recent solution of two problems of control theory, which will be combined here to generate new approaches to H ∞/ℓ1 adaptive control, as well as to produce the rudiments of a general theory of adaptation and complexity-based or information-based learning.
The problems, which have been solved by the author and his co-workers, involve,
-
1.
optimally fast identification to reduce plant uncertainty (e.g., to a weighted ball of radius ∈ in H ∞/ℓ1);
-
2.
exact computation of feedback performance under large plant uncertainty (including such a ball).
By combining these two solutions and using frozen-time approximations to compute optimal feedbacks under time-varying data, we obtain control laws which conform to our definition of what the term “adaptive” should mean, and in fact are in a certain sense nearly optimally adaptive.
These results are concrete and lead to algorithms. However, they also provide a paradigm of a more general theory of adaptive control, which will be outlined. We propose definitions of the notions of machine adaptation and machine learning which are independent of the internal structure of, say, the controller in the case of a feedback system; and are independent of properties such as the presence or absence of nonlinearity, time-variation, or even feedback. Instead, they are based on external performance. They enable us to address such questions as: What should the term “adaptive” and “learning“ mean in the context of control? Is it possible to tell whether or not a black box is adaptive? Is adaptation synonymous with the presence of nonlinear feedback? More to the point, in design is it possible to determine beforehand whether it is necessary for a controller to adapt and learn in order to meet performance specifications, or is adaptation a matter of choice? We will claim that the answers are mostly positive.
Preview
Unable to display preview. Download preview PDF.
References
P. E. Caines, Linear Stochastic Systems, Wiley, 1988.
B. Francis, On Disturbance Attenuation with Plant Uncertainty, Workshop on New Perspectives in Industrial Control System Design, 1986.
G. Gu and P. P. Khargonekar, Linear and Non-Linear Algorithms for Identification in H ∞ With Error Bounds, IEEE Trans. Aut. contr., 1992, AC-37, 7, pp.953–963.
A. J. Helmicki and C. A. Jacobson and C. N. Nett, Control Oriented System Identification: A Worst-Case/Deterministic Approach in H ∞, IEEE Trans. Aut, Contr., AC-36, 1991, pp. 1163–1176.
L. Lin, L.Y. Wang and G. Zames, Uncertainty Principles and Identification n-Widths for LTI and Slowly Varying Systems, Proceedings of ACC 1992, pp. 296–300.
L. Lin and L.Y. Wang, “Time Complexity and Model Complexity of Fast Identification”, Proc. 32nd IEEE Conf. Dec. Control, pp.2099–2104.
P. M. Makila and J. R. Partington, Robust Approximation and Identification in H ∞, Proc. 1991 ACC.
J.G. Owen and G. Zames, Duality Theory of Robust Disturbance Attenuation, Automatica, Vol 29, 3, pp. 695–705, May 1993.
—, Adaptation in the Presence of Unstructured Uncertainty, Proc. 32nd. IEEE Conf. Dec. Control, 1993, pp. 2110–2114.
A. Pinkus, n-Widths in Approximation Theory, Springer-Verlag, 1985.
K. Poolla and A. Tikku, On the Time Complexity of Worst-Case System Identification, Preprint.
D. N. C. Tse and M. A. Dahleh and J. N. Tsitsiklis, Optimal Asymptotic Identification Under Bounded Disturbances, Proc. 1991 CDC, pp. 623–628.
L.Y. Wang and G. Zames, Local-Global Double Algebras for Slow H ∞ Adaptation: Part II-Optimization of Stable Plants, IEEE Trans.aut.contr, AC-36(2), 1991, pp. 143–151.
G. Zames, Feedback and Complexity, Plenary Lecture, Proc. 1976 CDC, Addenda, pp. 1–2.
—, On the Metric Complexity of Causal Linear Systems, ε-entropy and ε-dimension for Continuous time, IEEE Trans. Aut. Contr., AC-38, pp. 664–667, April 1979.
—, Feedback and Optimal Sensitivity: Model Reference Transformations, Seminorms, and Approximate Inverses, IEEE Trans. Automat. Control, AC-23 (1981), pp. 301–320.
—, Feedback, learning and complexity in H ∞, Plenary Lecture, 1985 Internat. Conf. Math. Th. Netw. Systems; repeated at 1989 ACC.
G. Zames, L. Lin, and L.Y. Wang, Fast Identification n-widths and Uncertainty Principles for LTI and Slowly Varying Systems, IEEE Trans. Automatic Control, AC-39, No. 9, Sept. 1994.
G. Zames and J.G. Owen, Duality Theory of MIMO Robust Disturbance Attenuation, IEEE Transactions on Automatic Control, Vol 38,5, May 1993, pp. 743–751.
—, A Note on Metric Dimension and Feedback in Discrete Time, IEEE Trans. Aut. Contr., AC-38, pp. 664–667, April 1993.
G. Zames and L.Y. Wang, Local-Global Double Algebras for Slow H ∞ Adaptation: Part I-Inversion and Stability, IEEE Trans.aut.contr, AC-36(2), 1991, pp. 130–142.
—, “What is an Adaptive System?”, Proc. 29th. IEEE Conf. Dec. Control, Vol. 5, Dec. 1990, pp. 2861–2864.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag London Limited
About this paper
Cite this paper
Zames, G. (1997). Towards a general complexity-based theory of identification and adaptive control. In: Stephen Morse, A. (eds) Control Using Logic-Based Switching. Lecture Notes in Control and Information Sciences, vol 222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036097
Download citation
DOI: https://doi.org/10.1007/BFb0036097
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76097-9
Online ISBN: 978-3-540-40943-4
eBook Packages: Springer Book Archive