Pub Date : 1988-06-15DOI: 10.1109/ACC.1988.4173078
Zhang Jingxin, Lang Shijun
This paper is concerned with adaptive control of a class of multivariable nonlinear systems which can be characterized by a stochastic multivariable Hammerstein model whose linear part possesses an arbitrary interactor matrix. A simple suboptimal control law is derived which provides an efficient way to the control of the multivariable Hammerstein model systems whose linear part is not necessarily minimum phase. A direct adaptation scheme is presented to implement the control law and the global convergence of the algorithm is established.
{"title":"Adaptive Control of a Class of Multivariable Nonlinear Systems and Convergence Analysis","authors":"Zhang Jingxin, Lang Shijun","doi":"10.1109/ACC.1988.4173078","DOIUrl":"https://doi.org/10.1109/ACC.1988.4173078","url":null,"abstract":"This paper is concerned with adaptive control of a class of multivariable nonlinear systems which can be characterized by a stochastic multivariable Hammerstein model whose linear part possesses an arbitrary interactor matrix. A simple suboptimal control law is derived which provides an efficient way to the control of the multivariable Hammerstein model systems whose linear part is not necessarily minimum phase. A direct adaptation scheme is presented to implement the control law and the global convergence of the algorithm is established.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"51 1","pages":"2009-2014"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85747822","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}
Pub Date : 1988-06-15DOI: 10.23919/ACC.1988.4789757
A. Abutaleb
Pattern recognition techniques are applied to the problem of multiple target identification and tracking of (forward looking infrared) FLIR image sequences of missiles. The image is first thersholded, using an automatic thresholding technique, to yield a binary image. Clustering analysis is then performed and small clusters that represent noise are removed. Geometrical properties of each cluster are calclulated using the method of moments. Overlapping targets are identified using a newly derived moment that is sensitive to distortions in ellipse-like sahpes (missile shape). The number of targets is estimated as the number of nonoverlapping clusters, and their centroid is calculated in each frame. A record of each target is kept till it leaves the field of view. Simulation studies are presented and the results indicate that the proposed approach has good tracking performance.
{"title":"Image Tracking in Multitarget Enviornment","authors":"A. Abutaleb","doi":"10.23919/ACC.1988.4789757","DOIUrl":"https://doi.org/10.23919/ACC.1988.4789757","url":null,"abstract":"Pattern recognition techniques are applied to the problem of multiple target identification and tracking of (forward looking infrared) FLIR image sequences of missiles. The image is first thersholded, using an automatic thresholding technique, to yield a binary image. Clustering analysis is then performed and small clusters that represent noise are removed. Geometrical properties of each cluster are calclulated using the method of moments. Overlapping targets are identified using a newly derived moment that is sensitive to distortions in ellipse-like sahpes (missile shape). The number of targets is estimated as the number of nonoverlapping clusters, and their centroid is calculated in each frame. A record of each target is kept till it leaves the field of view. Simulation studies are presented and the results indicate that the proposed approach has good tracking performance.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"36 1","pages":"425-429"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88560497","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}
Pub Date : 1988-06-15DOI: 10.23919/ACC.1988.4790068
L. Xiaoping
In this paper, we present a kind of optimal incentive strategy for leader-follower games. Using this strategy, the leader will suffer the least losses in punishing deviation of the follower. We in details discuss a special class of static and dynamic leader-follower games in which the follower's decision is scalar and the cost functions of both leader and follower are quadratic and give the method of determining optimal incentive strategy. The sufficient conditions under which optimal incentive strategy exists are given and the optimal incentive strategies are derived. In order to illustrate the ideas and methods of the paper, a example is given.
{"title":"A Kind of Optimal Incentive Strategy for Leader-Follower Games","authors":"L. Xiaoping","doi":"10.23919/ACC.1988.4790068","DOIUrl":"https://doi.org/10.23919/ACC.1988.4790068","url":null,"abstract":"In this paper, we present a kind of optimal incentive strategy for leader-follower games. Using this strategy, the leader will suffer the least losses in punishing deviation of the follower. We in details discuss a special class of static and dynamic leader-follower games in which the follower's decision is scalar and the cost functions of both leader and follower are quadratic and give the method of determining optimal incentive strategy. The sufficient conditions under which optimal incentive strategy exists are given and the optimal incentive strategies are derived. In order to illustrate the ideas and methods of the paper, a example is given.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"13 1","pages":"2088-2089"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88751548","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}
Pub Date : 1988-06-15DOI: 10.23919/ACC.1988.4790103
D. Bullock
Some recent results in neural networks relevant to sensory-motor control problems are discussed. A common finding in biologically-oriented neural networks research is that many networks operate in parallel to ensure desired operating characteristics. Results on trajectory formation, sensory updating, and anticipatory compensation illustrate networks that are applicable in several performance domains (planned arm and speech movements, ballistic eye-movements) and that help explain data on several distinct but cooperative brain regions (frontal cortex, globus pallidus, cerebellum). In these systems whose fast dynamics are governed by slowly changing network transmission weights as well as by rapidly fluctuating external inputs, a major focus of research is how to ensure that short-term dynamics automatically regulate learning (transmission weight modification) in such a way that the system is guaranteed to develop along an adaptive trajectory.
{"title":"How Neural Networks Factor Problems of Sensory-Motor Control","authors":"D. Bullock","doi":"10.23919/ACC.1988.4790103","DOIUrl":"https://doi.org/10.23919/ACC.1988.4790103","url":null,"abstract":"Some recent results in neural networks relevant to sensory-motor control problems are discussed. A common finding in biologically-oriented neural networks research is that many networks operate in parallel to ensure desired operating characteristics. Results on trajectory formation, sensory updating, and anticipatory compensation illustrate networks that are applicable in several performance domains (planned arm and speech movements, ballistic eye-movements) and that help explain data on several distinct but cooperative brain regions (frontal cortex, globus pallidus, cerebellum). In these systems whose fast dynamics are governed by slowly changing network transmission weights as well as by rapidly fluctuating external inputs, a major focus of research is how to ensure that short-term dynamics automatically regulate learning (transmission weight modification) in such a way that the system is guaranteed to develop along an adaptive trajectory.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"55 1","pages":"2271-2275"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89039581","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}
Pub Date : 1988-06-15DOI: 10.23919/ACC.1988.4790008
C. McCullough, J. Birdwell, S. Lenhart
The common assumption in much of the literature that an asymptotically stable system will result in bounded covariance in the limit as t ¿ ¿ is disproved by a simple counter-example. Necessary and sufficient conditions for bounded covariance are given and proved.
{"title":"Necessary and Sufficient Conditions for Bounded Covariance in Linear Stochastic Systems","authors":"C. McCullough, J. Birdwell, S. Lenhart","doi":"10.23919/ACC.1988.4790008","DOIUrl":"https://doi.org/10.23919/ACC.1988.4790008","url":null,"abstract":"The common assumption in much of the literature that an asymptotically stable system will result in bounded covariance in the limit as t ¿ ¿ is disproved by a simple counter-example. Necessary and sufficient conditions for bounded covariance are given and proved.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"1 1","pages":"1755-1756"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85936677","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}
Pub Date : 1988-06-15DOI: 10.1109/ACC.1988.4173042
W. K. Tsai, G. Huang, J. Antonio, W. Tsai
A new gradient projection algorithm using iterative aggregation and disaggregation is proposed and analyzed for box-constrained minimization problems. In a variation of the distributed computation model, the algorithm is shown to converge. As an important application, we also show how the algorithm is applied to optimal routing in a large interconnected data communication network. The aggregation/disaggregation method proposed results in a multi-level hierarchical clustering of a large network, which fits naturally the hierarchical topological structure of large networks. A numerical simulation of a 52-node network shows that the serial version of the algorithm, has 35% saving of the computational time as compared to a path-formulated gradient projection code developed by Bertsekas, Gendron and Tsai, which is among the fastest existing programs for path-formulated optimal routing.
{"title":"Distributed Aggregation/Disaggregation Algorithms for Optimal Routing in Data Networks","authors":"W. K. Tsai, G. Huang, J. Antonio, W. Tsai","doi":"10.1109/ACC.1988.4173042","DOIUrl":"https://doi.org/10.1109/ACC.1988.4173042","url":null,"abstract":"A new gradient projection algorithm using iterative aggregation and disaggregation is proposed and analyzed for box-constrained minimization problems. In a variation of the distributed computation model, the algorithm is shown to converge. As an important application, we also show how the algorithm is applied to optimal routing in a large interconnected data communication network. The aggregation/disaggregation method proposed results in a multi-level hierarchical clustering of a large network, which fits naturally the hierarchical topological structure of large networks. A numerical simulation of a 52-node network shows that the serial version of the algorithm, has 35% saving of the computational time as compared to a path-formulated gradient projection code developed by Bertsekas, Gendron and Tsai, which is among the fastest existing programs for path-formulated optimal routing.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"15 1","pages":"1799-1804"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84715910","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}
Pub Date : 1988-06-15DOI: 10.23919/ACC.1988.4790013
D. Koditschek
This paper presents a strict, global Lyapunov function for the class of dissipative mechanical systems defined on a configurtion space which admits a trivial tangent bundle.
{"title":"Strict Global Lyapunov Functions for Mechanical Systems","authors":"D. Koditschek","doi":"10.23919/ACC.1988.4790013","DOIUrl":"https://doi.org/10.23919/ACC.1988.4790013","url":null,"abstract":"This paper presents a strict, global Lyapunov function for the class of dissipative mechanical systems defined on a configurtion space which admits a trivial tangent bundle.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"27 1","pages":"1770-1775"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84857494","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}
Pub Date : 1988-06-15DOI: 10.23919/ACC.1988.4789858
B. Lurie
The balanced bridge feedback (BBF) technique developed in communication engineering is applied to the multiloop pointing control priblem. Using colocated sensors, BBF decouples the motor loop from the mechanical plant and increases the feedback bandwidth in the motor and plant loops.
{"title":"Three Loop Balanced Bridge Feedback Pointing Control","authors":"B. Lurie","doi":"10.23919/ACC.1988.4789858","DOIUrl":"https://doi.org/10.23919/ACC.1988.4789858","url":null,"abstract":"The balanced bridge feedback (BBF) technique developed in communication engineering is applied to the multiloop pointing control priblem. Using colocated sensors, BBF decouples the motor loop from the mechanical plant and increases the feedback bandwidth in the motor and plant loops.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"3 1","pages":"941-949"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89185468","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}
Pub Date : 1988-06-15DOI: 10.23919/ACC.1988.4789806
M. F. Ellis, T. W. Taylor, K. Jensen
An on-line measurement scheme for the estimation of monomer conversion, initiator conversion, temperature, and the entire molecular weight distribution (MWD) in batch methyl methacrylate solution polymerization has been developed. The measurement scheme is based on an extended Kalman filter, a detailed polymerization model, and uses measurements of monomer conversion from a densitometer, temperature measurements, and MWD measurements from an on-line gel permeation chromatograph (GPC). The use of the measuring devices and the computer interfacing requirements are discussed. Experimental results are presented which illustrate the measurement scheme's ability to estimate bimodal MWD's.
{"title":"On-Line Estimation of Conversion and the Molecular Weight Distribution in Batch Methyl Methacrylate Solution Polymerization","authors":"M. F. Ellis, T. W. Taylor, K. Jensen","doi":"10.23919/ACC.1988.4789806","DOIUrl":"https://doi.org/10.23919/ACC.1988.4789806","url":null,"abstract":"An on-line measurement scheme for the estimation of monomer conversion, initiator conversion, temperature, and the entire molecular weight distribution (MWD) in batch methyl methacrylate solution polymerization has been developed. The measurement scheme is based on an extended Kalman filter, a detailed polymerization model, and uses measurements of monomer conversion from a densitometer, temperature measurements, and MWD measurements from an on-line gel permeation chromatograph (GPC). The use of the measuring devices and the computer interfacing requirements are discussed. Experimental results are presented which illustrate the measurement scheme's ability to estimate bimodal MWD's.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"81 1","pages":"684-688"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84278706","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}
Pub Date : 1988-06-15DOI: 10.1109/ACC.1988.4173079
S. Saleh, B. Barmish
Following Kharitonov's seminal theorem, a number of authors have developed criteria for analyzing the stability of a so-called polytope of polynomials. In this paper, we present a case study involving a polytope of polynomials carried out using the new results in [8]. More specifically, we consider a state space model describing a pair of coupled oscillators. Motivated by the fact that stability is guaranteed for small coupling, we consider the following question: How large can the off-diagonal interactions be before instabilty occurs? To this end, we use the new theory in [8] to generate bounds on the off-diagonal interactions under which stability is guaranteed. Our results indicate that these bounds increase as the frequency difference between the oscillators increases and as the damping increases.
{"title":"Robust Stability Analysis of Coupled Oscillators","authors":"S. Saleh, B. Barmish","doi":"10.1109/ACC.1988.4173079","DOIUrl":"https://doi.org/10.1109/ACC.1988.4173079","url":null,"abstract":"Following Kharitonov's seminal theorem, a number of authors have developed criteria for analyzing the stability of a so-called polytope of polynomials. In this paper, we present a case study involving a polytope of polynomials carried out using the new results in [8]. More specifically, we consider a state space model describing a pair of coupled oscillators. Motivated by the fact that stability is guaranteed for small coupling, we consider the following question: How large can the off-diagonal interactions be before instabilty occurs? To this end, we use the new theory in [8] to generate bounds on the off-diagonal interactions under which stability is guaranteed. Our results indicate that these bounds increase as the frequency difference between the oscillators increases and as the damping increases.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"25 1","pages":"2015-2018"},"PeriodicalIF":0.0,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87075031","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：