Control system synthesis through inductive learning of Boolean concepts

In control, learning is often used to identify a single controller satisfying a particular performance measure. In certain cases, however, it is desirable to identify the set of all controllers which ensure that the controlled plant satisfies a control property such as Lyapunov stability, robust stability, or robust performance. A set of procedures identifying such sets of admissible solutions can be devised using Boolean concept learning algorithms. This type of learning procedure is applicable to computational learning. The objective of this article is to provide some examples illustrating how Boolean concept learning can be used in control systems. The first example examined in this article uses concept learning to identify the set of stabilizing controllers for certain classes of linear time-invariant plants. Another example illustrates the use of concept learning in the identification of discrete event system (DES) controllers. >

[1]  Stephen P. Boyd,et al.  Structured and Simultaneous Lyapunov Functions for System Stability Problems , 1989 .

[2]  S. Bialas,et al.  Necessary and Sufficient Conditions for the Stability of Interval Matrices , 1983 .

[3]  M. Lemmon,et al.  Direct adaptive stabilization of linear systems using query-based protocols , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[4]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[5]  Donald A. Sofge,et al.  Handbook of Intelligent Control: Neural, Fuzzy, and Adaptive Approaches , 1992 .

[6]  Panos J. Antsaklis,et al.  An introduction to intelligent and autonomous control , 1993 .

[7]  Leslie G. Valiant,et al.  On the learnability of Boolean formulae , 1987, STOC.

[8]  P. Antsaklis,et al.  Inductive inference of logical DES controllers using the L* algorithm , 1995, Proceedings of 1995 American Control Conference - ACC'95.

[9]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[11]  S. Chung,et al.  Limited lookahead policies in supervisory control of discrete event systems , 1992 .

[12]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[13]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[14]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[15]  Vijay K. Garg,et al.  Transition uncertainty in discrete event systems , 1991, Proceedings of the 1991 IEEE International Symposium on Intelligent Control.

[16]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[17]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[18]  Stephen P. Boyd,et al.  Set-membership identification of systems with parametric and nonparametric uncertainty , 1992 .

[19]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[20]  Stephen P. Boyd,et al.  Identification of Systems with Parametric and Nonparametric Uncertainty , 1990, 1990 American Control Conference.

[21]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[22]  F. Girosi,et al.  Networks for approximation and learning , 1990, Proc. IEEE.

[23]  David Haussler,et al.  Proceedings of the fifth annual workshop on Computational learning theory , 1992, COLT 1992.