{"title":"Adaptation and robustness in predictive control","authors":"R. Bitmead, M. Gevers, V. Wertz","doi":"10.1109/CDC.1989.70540","DOIUrl":"https://doi.org/10.1109/CDC.1989.70540","url":null,"abstract":"An explicit connection is made between the (nonadaptive) control law design stage of predictive adaptive control and techniques of linear-quadratic-Gaussian control with loop transfer recovery for robustness enhancement. The inherent controller design robustness of these methods is examined in terms of the nonadaptive closed-loop properties, that is of the class of open-loop perturbations to which the closed-loop system is robust, and of the effected input spectrum to the plant in closed loop. With this latter information, the authors then pose the question of to which plant model does the recursive least squares identification stage converge under this input. It is found that in many circumstances the identified model is precisely that which yields the best satisfaction of the previous robustness criterion for the control law. In this way, the authors demonstrate the robust interplay of the identifier and the controller in this class of adaptive control methods.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124438033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Envelopes, high-order optimality conditions and Lie brackets","authors":"H. J. Sussmann","doi":"10.1109/CDC.1989.70305","DOIUrl":"https://doi.org/10.1109/CDC.1989.70305","url":null,"abstract":"A generalization of the theory of envelopes of the classical calculus of variations to optimal control is described. This generalization extends the author's previous work (1986) in two ways. It allows the use of quasi-extremal trajectories, i.e. trajectories that satisfy all the conditions of the Pontryagin maximum principle except for the fact that the sign of the constant lambda /sub 0/ that appears in the Hamiltonian multiplying the Lagrangian is not restricted, and it makes it possible to prove nonoptimality of some 'abnormal' trajectories. The envelope technique is used to obtain an alternative proof of a theorem on the number of switchings of time-optimal bang-bang trajectories for two-vector-field systems in three dimensions.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124278236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Orthogonal state space decompositions with application to parallel filtering","authors":"I. Rhodes, R.A. Luenberger","doi":"10.1109/CDC.1989.70641","DOIUrl":"https://doi.org/10.1109/CDC.1989.70641","url":null,"abstract":"A necessary and sufficient condition is given for the state space to be decomposable into a direct sum of mutually orthogonal observability subspaces. Such a decomposition has important consequences for the numerical conditioning of the basis changes that are involved in the implementation of an observer or Kalman filter as a collection of parallel subsystems.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116771388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Toward a general power system voltage collapse model","authors":"H. Chiang, S. Rovnyak, J. Thorp, R. Thomas","doi":"10.1109/CDC.1989.70131","DOIUrl":"https://doi.org/10.1109/CDC.1989.70131","url":null,"abstract":"It is shown that the center manifold voltage collapse model encompasses many existing models for analyzing voltage collapse. It is then shown that the model can be extended to power systems with a slow increase in load demands both before and after a bifurcation.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116858248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Event-driven discontinuities for continuous-time systems","authors":"T. Seidman","doi":"10.1109/CDC.1989.70229","DOIUrl":"https://doi.org/10.1109/CDC.1989.70229","url":null,"abstract":"Consideration is given to systems for which the observed behavior can exhibit occasional discontinuous changes of mode in the course of normal (autonomous) evolution. This can occur by design, as in the case of modal control under feedback; as the result of involvement of discontinuous elements as relays; or as an effect of discretization or digital circuitry. Such system also arise in the modeling of natural systems (e.g. neural firing), where they can be regarded as being associated with unmodeled fast time scales. Each of these situations leads to a limit problem, for which the frameworks of the analyses are sketched.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127183691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computationally efficient adaptive control algorithms for Markov chains","authors":"A. Jalali, M. Ferguson","doi":"10.1109/CDC.1989.70344","DOIUrl":"https://doi.org/10.1109/CDC.1989.70344","url":null,"abstract":"Algorithms for adaptive control of unknown finite Markov chains are proposed. The algorithms consist of two parts: part one estimates the unknown parameters; part two computes the optimal policy. In this study the emphasis is on efficient online computation of the optimal policy. No a priori knowledge of the optimal policy is assumed. The optimal policy is computed recursively online. At each step a small amount of computation is required. At each transition of the chain, only the act corresponding to the present state of the chain is updated. The algorithms are easy to implement and converge to the optimal policy in finite time.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125159853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On supporting large-scale decentralized software engineering processes","authors":"P. Garg","doi":"10.1109/CDC.1989.70350","DOIUrl":"https://doi.org/10.1109/CDC.1989.70350","url":null,"abstract":"The life cycle of large-scale software systems requires the cooperative effort of teams of people over extended periods of time. Automated support for the communication and coordination involved in this cooperative effort requires the existence of an active information base through which all activities of the software life cycle can be mediated. The design of this active information base is presented in terms of an intelligent software hypertext system (Ishys) which: (1) supports a flexible and general-purpose model for information management (hypertext), and (2) can support various software life cycle models based on an agents-tasks-products perspective.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125867130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exponential decay for semilinear distributed systems with localized damping","authors":"E. Zuazua","doi":"10.1109/CDC.1989.70582","DOIUrl":"https://doi.org/10.1109/CDC.1989.70582","url":null,"abstract":"The author shows how multiplier techniques and unique continuation principles can be combined to prove exponential decay results for solutions of various semilinear evolution equations with a localized damping (i.e. a damping term that is effective only on a subregion of the domain where the equation holds). Both bounded and unbounded domains are considered.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125941359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A lower and upper bound for the gap metric","authors":"S.Q. Zhu, M. Hautus, C. Praagman","doi":"10.1109/CDC.1989.70591","DOIUrl":"https://doi.org/10.1109/CDC.1989.70591","url":null,"abstract":"A lower bound and an upper bound for the gap metric are presented. These bounds are sharp in the sense that there exist systems reaching the bounds. The lower bound is the H/sub infinity /-norm of a rational matrix, and the upper bound is the sum of the lower bound and the norm of a Hankel operator. Only coprime fractional representations over L/sub infinity /-matrices are needed to compute the lower bound. Two equivalent forms of the gap metric are presented, and using these it is shown that if the gap of two systems is smaller than 1, then the two directed gaps are the same. An L/sub infinity /-gap metric is introduced as a purely theoretical generalization of the ordinary gap metric. It turns out that the lower bound is the L/sub infinity /-gap metric.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126071830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adapting the rule-base","authors":"T. Fogarty","doi":"10.1109/CDC.1989.70220","DOIUrl":"https://doi.org/10.1109/CDC.1989.70220","url":null,"abstract":"A rule-based system for optimizing combustion in multiple-burner installations was built and tested on the furnace of a continuous annealing line for rolled steel. The furnace has only one firing level, and the rules were elicited from energy experts with this problem in mind. The system was then installed on a multiple-burner boiler in the steel industry, but it did not respond very fast to changes in the firing level of the boiler. One particular solution to this problem is to enter new rules into the rule base to deal with the changed situation. A more general solution is to build into the rule base a learning component to help it to cope with new situations. Promising results have been obtained with the genetic algorithm, which has proved to be robust in this noisy domain and suitable for learning control rules that give performance comparable to that of rules elicited from the experts. Experiments carried out on simulations of multiple-burner installations with two firing levels, using the genetic algorithm to learn the best actions for given situations, are described, and the results are discussed.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123589338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}