LADder form MOdeling (LADMO) is attracting an increasing amount of interest. The use of ladder forms (also referred to as lattice filters) is growing in the area of estimation, system identification, signal processing and related applications. While the advantages offered by ladder form implementations are by now quite well known, very little attention has been paid in the literature to the properties of the ladder forms from a system theoretic point of view.
{"title":"State-space structures of ladder canonical forms","authors":"M. Morf, D. L. Lee","doi":"10.1109/CDC.1980.271997","DOIUrl":"https://doi.org/10.1109/CDC.1980.271997","url":null,"abstract":"LADder form MOdeling (LADMO) is attracting an increasing amount of interest. The use of ladder forms (also referred to as lattice filters) is growing in the area of estimation, system identification, signal processing and related applications. While the advantages offered by ladder form implementations are by now quite well known, very little attention has been paid in the literature to the properties of the ladder forms from a system theoretic point of view.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132527232","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}
An approximate method of calculating the contributions of the gains in a feedback structure is produced. The discrete time, linear, quadratic state feedback problem is considered. By state and control augmentation dynamic compensators with fixed and tunable parameters including decentralized and hierarchal structures can, also, be handled. An example is used to illustrate the usefulness of the approach in selecting good simplified feedback structures and to verify the reasonableness of the assumptions.
{"title":"A method for selecting good feedback structures","authors":"J. Katzberg, H. Johnson","doi":"10.1109/CDC.1980.271805","DOIUrl":"https://doi.org/10.1109/CDC.1980.271805","url":null,"abstract":"An approximate method of calculating the contributions of the gains in a feedback structure is produced. The discrete time, linear, quadratic state feedback problem is considered. By state and control augmentation dynamic compensators with fixed and tunable parameters including decentralized and hierarchal structures can, also, be handled. An example is used to illustrate the usefulness of the approach in selecting good simplified feedback structures and to verify the reasonableness of the assumptions.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132942637","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}
Abstract : Two types of approximation techniques for parameter estimation of delay systems are described and compared. One involves state discretization only while the other entails simultaneous state and time discretization. (Author)
{"title":"Approximation techniques for parameter estimation in hereditary control systems","authors":"H. Banks, I. Rosen","doi":"10.1109/CDC.1980.271899","DOIUrl":"https://doi.org/10.1109/CDC.1980.271899","url":null,"abstract":"Abstract : Two types of approximation techniques for parameter estimation of delay systems are described and compared. One involves state discretization only while the other entails simultaneous state and time discretization. (Author)","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133336222","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}
This talk is an overview of adaptive quasistatic routing algorithms for communication network that are based on shortest path computations. We first consider single path algorithms such as the one currently operating on the ARPANET and highlights their advantages and inherent limitations. We then focus on an algorithm that allows multipath routing. During the algorithm each node maintains a list of paths along which it sends traffic to each destination together with a list of fractions of total traffic that are sent along these paths. At each iteration a minimum marginal delay path to each destination is computed and added to the current list if not already there. Simultaneously the corresponding fractions are updated in a way that reduces average delay per message. The algorithm is capable of employing second derivates of link delay functions thereby providing automatic scaling with respect to traffic input level. It can be implemented in both a distributed and centralized manner, and it can be shown to converge to an optimal routing at a linear rate.
{"title":"Routing algorithms based on shortest paths","authors":"D. Bertsekas","doi":"10.1109/CDC.1980.271870","DOIUrl":"https://doi.org/10.1109/CDC.1980.271870","url":null,"abstract":"This talk is an overview of adaptive quasistatic routing algorithms for communication network that are based on shortest path computations. We first consider single path algorithms such as the one currently operating on the ARPANET and highlights their advantages and inherent limitations. We then focus on an algorithm that allows multipath routing. During the algorithm each node maintains a list of paths along which it sends traffic to each destination together with a list of fractions of total traffic that are sent along these paths. At each iteration a minimum marginal delay path to each destination is computed and added to the current list if not already there. Simultaneously the corresponding fractions are updated in a way that reduces average delay per message. The algorithm is capable of employing second derivates of link delay functions thereby providing automatic scaling with respect to traffic input level. It can be implemented in both a distributed and centralized manner, and it can be shown to converge to an optimal routing at a linear rate.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128916584","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}
Large systems with special invariance properties appear in many engineering problems, e.g. solar arrays, cascades of reactors, flexible structures, etc. In this paper we are concerned with a class of such systems, exhibiting a linear lattice structure. Following some observations on the algebraic structure of such systems we focus on the analytic aspects of associated control problems. Our motivation for this exercise derives from problems of controlling seismic cables used in offshore oil exploration.
{"title":"Homogeneous interconnected systems: An example","authors":"M. El-Sayed, P. Krishnaprasad","doi":"10.1109/CDC.1980.271853","DOIUrl":"https://doi.org/10.1109/CDC.1980.271853","url":null,"abstract":"Large systems with special invariance properties appear in many engineering problems, e.g. solar arrays, cascades of reactors, flexible structures, etc. In this paper we are concerned with a class of such systems, exhibiting a linear lattice structure. Following some observations on the algebraic structure of such systems we focus on the analytic aspects of associated control problems. Our motivation for this exercise derives from problems of controlling seismic cables used in offshore oil exploration.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124138089","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}
Decentralized control schemes are considered for time-invariant, finite dimensional, linear systems with known state equations. It is assumed that the systems are reachable and observable at a fictitious centralized control station, and that there is strong connectivity between the decentralized control stations via the system where necessary. It is shown that whether or not there are decentralized fixed modes in the open-loop system, periodically varying feedback gains at all but one of the control stations permit the remaining control station to observe and control the system given knowledge of the control laws implemented at the other control stations. Certain time-invariant systems which cannot be stabilized by decentralized time-invariant controllers, namely those with unstable decentralized fixed modes, can thus be stabilized by decentralized time-varying controllers.
{"title":"Time-varying feedback laws for decentralized control","authors":"B. O. Anderson, J. Moore","doi":"10.1109/CDC.1980.271851","DOIUrl":"https://doi.org/10.1109/CDC.1980.271851","url":null,"abstract":"Decentralized control schemes are considered for time-invariant, finite dimensional, linear systems with known state equations. It is assumed that the systems are reachable and observable at a fictitious centralized control station, and that there is strong connectivity between the decentralized control stations via the system where necessary. It is shown that whether or not there are decentralized fixed modes in the open-loop system, periodically varying feedback gains at all but one of the control stations permit the remaining control station to observe and control the system given knowledge of the control laws implemented at the other control stations. Certain time-invariant systems which cannot be stabilized by decentralized time-invariant controllers, namely those with unstable decentralized fixed modes, can thus be stabilized by decentralized time-varying controllers.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114495772","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}
Using a transform representation, a state-affine realization theory for a Volterra series input-output map is presented. The approach involves the definition of certain shift operators on linear spaces associated with the transforms of the kernals in the Volterra series. The result is a realization algorithm that is extremely easy to implement. The approach also yields a theory of minimality, span-reachability, and observability for infinite degree state-affine systems.
{"title":"Shift operators and state-affine system theory","authors":"A. Frazho","doi":"10.1109/CDC.1980.271932","DOIUrl":"https://doi.org/10.1109/CDC.1980.271932","url":null,"abstract":"Using a transform representation, a state-affine realization theory for a Volterra series input-output map is presented. The approach involves the definition of certain shift operators on linear spaces associated with the transforms of the kernals in the Volterra series. The result is a realization algorithm that is extremely easy to implement. The approach also yields a theory of minimality, span-reachability, and observability for infinite degree state-affine systems.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116918781","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}
In traditional formulations of a decision problem the set of possible decision rules D is limited only by mathematical restrictions. However, research in human information processing and decision making has frequently indicated that the decision rules actually used by human decision makers are constrained by the decision maker's information processing limitations. In this paper the impact of some information processing constraints on a decision maker's performance is investigated.
{"title":"Performance of capacity constrained decision makers","authors":"J. Froyd, F. Bailey","doi":"10.1109/CDC.1980.271906","DOIUrl":"https://doi.org/10.1109/CDC.1980.271906","url":null,"abstract":"In traditional formulations of a decision problem the set of possible decision rules D is limited only by mathematical restrictions. However, research in human information processing and decision making has frequently indicated that the decision rules actually used by human decision makers are constrained by the decision maker's information processing limitations. In this paper the impact of some information processing constraints on a decision maker's performance is investigated.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121946197","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":"The ergodic theory of chaotic feedback systems","authors":"J. Baillieul, R. Brockett","doi":"10.1109/CDC.1980.272023","DOIUrl":"https://doi.org/10.1109/CDC.1980.272023","url":null,"abstract":"","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122010490","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}
This paper describes the development of a new, hierarchical, linguistic based, learning control structure for Complex systems. The complete system will be able to interact with a human operator in a limited natural language at the highest level of the hierarchy, but will be able to control detailed motions of some complex physical system at the lowest level of the hierarchy. Each level of the hierarchy is defined by a formal grammar which can generate exactly the class of admissible control actions at that level. A new linguistic structure, the linguistic decision schema, is proposed to specify the mapping between linguistic elements in adjacent levels. In the most general form, the decision schema incorporates a learning algorithm to obtain asymptotically optimal mappings for control under stochastic environments.
{"title":"On linguistic decision making devices","authors":"J. Graham, G. Saridis","doi":"10.1109/CDC.1980.272027","DOIUrl":"https://doi.org/10.1109/CDC.1980.272027","url":null,"abstract":"This paper describes the development of a new, hierarchical, linguistic based, learning control structure for Complex systems. The complete system will be able to interact with a human operator in a limited natural language at the highest level of the hierarchy, but will be able to control detailed motions of some complex physical system at the lowest level of the hierarchy. Each level of the hierarchy is defined by a formal grammar which can generate exactly the class of admissible control actions at that level. A new linguistic structure, the linguistic decision schema, is proposed to specify the mapping between linguistic elements in adjacent levels. In the most general form, the decision schema incorporates a learning algorithm to obtain asymptotically optimal mappings for control under stochastic environments.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122136016","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
扫码关注我们
求助内容：
应助结果提醒方式：