{"title":"A two-level control coordination in interconnected power systems","authors":"M. Ilic, F.K. Mak","doi":"10.1109/CDC.1989.70133","DOIUrl":"https://doi.org/10.1109/CDC.1989.70133","url":null,"abstract":"A general class of nonlinear models unifying dynamical systems is defined. The class of nonlinear models of interest here could represent many large-scale network-type systems. An example is given from electric power systems to show that typical models used for such systems belong to the general class of nonlinear systems defined. A two-level control design is proposed for a specific subcategory of this class, in which the number of controls is the same as the number of subsystems. Although an extension of the proposed results to the class for which this assumption is not satisfied is hard, it could be shown that even the subcategory studied here is very important in practice. A state coordinate transformation required for feedback linearizing control on the primary level is discussed.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"111 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":"132677857","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 the asymptotic optimality of a heuristic mapping algorithm","authors":"R. Lee, K. Pattipati, P. Luh","doi":"10.1109/CDC.1989.70242","DOIUrl":"https://doi.org/10.1109/CDC.1989.70242","url":null,"abstract":"The mapping of large-scale resource allocation algorithms onto parallel computing architectures is considered. The mapping problem is viewed as one of assigning the nodes of a finite directed acyclic task graph representing the logical and data dependencies among the tasks constituting the algorithm on to the nodes of a finite undirected processor graph denoting the parallel computing architecture so that the completion time of the algorithm is minimized. Two algorithms for solving the mapping problem are presented. The first algorithm is a two-stage heuristic that determines the order of task allocation on the basis of the critical path method and then uses the greedy method to determine the task allocation. The second algorithm uses the idea of pairwise exchange on task allocation order to improve the performance of the greedy heuristic. Extensive computational experiments on hundreds of random graphs show that the heuristic algorithm provides optimal solutions when the ratio of computation time to communication time is very large or very small, and that the pairwise exchange algorithm provides uniformly good mapping for all values of the ratio. The asymptotic optimality of the greedy heuristic algorithm for fork-join task structures is established.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"19 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":"132689339","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":"Ergodic theory of stochastic decision free Petri nets","authors":"F. Baccelli","doi":"10.1109/CDC.1989.70402","DOIUrl":"https://doi.org/10.1109/CDC.1989.70402","url":null,"abstract":"The class of decision-free Petri nets under stochastic timing assumptions, also known as stochastic event graphs, is considered. Under the assumption that the variables used for the timing of an event graph form stationary and ergodic sequences of random variables, use is made of an associated stochastic recursive equation in order to construct the event graph's stationary and ergodic regime. In particular, the conditions under which the existence of this regime is guaranteed are determined.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"89 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":"133116258","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":"Generating edges of D-stable polynomials","authors":"A. Fam","doi":"10.1109/CDC.1989.70574","DOIUrl":"https://doi.org/10.1109/CDC.1989.70574","url":null,"abstract":"It is shown that if a polynomial P is D-stable, where D is convex and contains the origin, then all convex linear combinations of P and its normalized derivative, zP'/n, are also D-stable. It is also shown that convex linear combinations of the logarithmic derivatives of a D-stable polynomial with a convex D have both their poles and zeros in D. Both theorems provide an example of how to generate edges and polytopes of D-stable polynomials and rational functions from a given finite set of D-stable polynomials.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"8 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":"131446645","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 new interpretation of the LQG/LTR technique using optimal projection equations","authors":"R. Paschall, P. Maybeck","doi":"10.1109/CDC.1989.70163","DOIUrl":"https://doi.org/10.1109/CDC.1989.70163","url":null,"abstract":"It is demonstrated that the LQR/LTR (linear quadratic Gaussian/loop transfer recovery) technique can be viewed as a way to achieve robustness even under the constraint of a reduced-order controller, even though one is not necessarily recovering a desired transfer function asymptotically. The optimal projection equation (OPE) approach gives an expanded view of LQG/LTR technique when the order of the controller is intentionally less than the order of the system design model. Also, the OPE approach allows other forms for Omega , which may give more flexibility as to how the system perturbations are modeled, to be chosen.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"15 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":"127840962","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":"Conditions for stability of feedback systems under sensor failures","authors":"A. Gundes, M. Kabuli","doi":"10.1109/CDC.1989.70435","DOIUrl":"https://doi.org/10.1109/CDC.1989.70435","url":null,"abstract":"An examination is made of the closed-loop stability of the unity-feedback system under two classes of sensor connection failures. The actuator-failure case is similar and omitted for brevity. If there exist compensators that R/sub U/-stabilize the given plant for all failures in these classes, where R/sub U/ denotes a ring of proper scalar rational functions, then the denominator matrices of coprime factorizations of the plant must satisfy certain conditions. A set of compensators that R/sub U/-stabilize a class of multi-input, multi-output plants under sensor failures is found.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"11 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":"115451234","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 robustness approach to adaptive filtering","authors":"G. Yin, Y.M. Zhu","doi":"10.1109/CDC.1989.70651","DOIUrl":"https://doi.org/10.1109/CDC.1989.70651","url":null,"abstract":"The robustness of adaptive filtering algorithms is considered. the main effort has been devoted to obtaining reasonably good upper bounds for the iterates when the law of large numbers is only approximately valid. Asymptotic order estimates for the absolute deviation of the iterates are obtained, and an almost sure convergence result is proved. Comments are made regarding the corresponding algorithm with randomly varying truncations.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"112 2 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":"115544711","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 modelling of segmented mirrors mounted on flexible supporting structures","authors":"E. Barbieri","doi":"10.1109/CDC.1989.70208","DOIUrl":"https://doi.org/10.1109/CDC.1989.70208","url":null,"abstract":"The main goals of this research are to formulate a frequency-matching problem as an exact inverse eigenvalue problem for Jacobi matrices, obtain a state-space representation of the mirror/cell structure, and design decentralized controllers for the push-pull mirror actuators. The interconnected mass-spring model used provides an exact match to the frequency distribution of the mirror/cell structure, and the algorithm does not involve any trial and error procedure. Preliminary results indicate that the model exhibits a decentralized structural characterization, which can be exploited to design local controllers for next-neighbor disturbance rejection.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"31 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":"115582183","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":"Adaptive identification and control of dynamical systems using neural networks","authors":"K. Narendra, K. Parthasarathy","doi":"10.1109/CDC.1989.70448","DOIUrl":"https://doi.org/10.1109/CDC.1989.70448","url":null,"abstract":"In recent years, multilayer neural networks and recurrent networks have emerged as important components for representing nonlinear transformations and have proved particularly successful in pattern recognition and optimization problems. The authors explore methods for incorporating such networks in adaptive systems for the identification and control of complex nonlinear dynamical systems.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"20 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":"114751780","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":"Digital controller design for the pitch axis of the F-14 using an H/sup infinity / method","authors":"J.-S. Yang, W. Levine","doi":"10.1109/CDC.1989.70589","DOIUrl":"https://doi.org/10.1109/CDC.1989.70589","url":null,"abstract":"An H/sup infinity /-based control system design procedure is developed to produce a controller in which the closed-loop system is designed, using H/sup infinity / controller in which the closed-loop system is designed, using H/sup infinity / methods similar to those of H. Kwakernaak (1986), to be robust with respect to both disturbance rejection and insensitivity to parameter variations. The H/sup infinity / design approach is coupled with multicriterion optimization to design a pitch-axis controller for the F-14 aircraft, (a version of a benchmark problem). The authors design a discrete-time controller even though the benchmark is in continuous time. The benchmark, while specifying gain and phase margins, does not specify the expected ranges for the parameters of the plant. Estimates have been obtained of the reasonable ranges of parameter variations, which are checked against the design. The precompensator is used to shape the output response so as to cause the entire system to achieve the desired performance. The robustness of the angle-of-attack response under large parameter variations is examined. A satisfactory design has not yet been obtained. However, these intermediate results are thought to be of value in demonstrating the difficulty of the problem and the thought processes involved in trying to use H/sup infinity / methods to solve a realistic design problem.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"84 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":"114859061","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}