A problem of practical importance in the design of message-switched data-communication networks is that of optimal capacity assignment. The problem consists of specifying the capacity for each link in a network in order to minimize the average message delay subject to a constraint on the total capacity available for assignment. This problem, and its dual in which the total capacity is minimized subject to an average message delay constraint, have been treated in detail in [1-3]. In this short paper, we consider a version of the dual problem in which the minimization is subject to a set of one or more end-to-end average message delay constraints. The motivation for this work stems from the fact that satisfaction of an average message delay constraint may not always provide an acceptable delay for certain source-destination pairs. This would, in general, be the case for communication between nodes which are widely separated in terms of the number of links that messages must traverse from one node to the other.
{"title":"Optimal capacity assignment in message-switched networks subject to end-to-end constraints","authors":"J. Meditch","doi":"10.1109/CDC.1980.272035","DOIUrl":"https://doi.org/10.1109/CDC.1980.272035","url":null,"abstract":"A problem of practical importance in the design of message-switched data-communication networks is that of optimal capacity assignment. The problem consists of specifying the capacity for each link in a network in order to minimize the average message delay subject to a constraint on the total capacity available for assignment. This problem, and its dual in which the total capacity is minimized subject to an average message delay constraint, have been treated in detail in [1-3]. In this short paper, we consider a version of the dual problem in which the minimization is subject to a set of one or more end-to-end average message delay constraints. The motivation for this work stems from the fact that satisfaction of an average message delay constraint may not always provide an acceptable delay for certain source-destination pairs. This would, in general, be the case for communication between nodes which are widely separated in terms of the number of links that messages must traverse from one node to the other.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"77 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":"121686311","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}
The present research has sought to understand human information-processing and task selection procedures in a dynamic multi-task environment. The approach has been to assimilate the results of a joint experimental and analytic program into a normative dynamic decision model(DDM) for predicting human task sequencing performance. To this end, a general multi-task paradigm was developed that retains the essential features of task selection in a manageable, yet manipulative, context. Via this framework, we have studied the effects of length of opportunity window, task values, and processing times on the human decision-making processes.
{"title":"\"A model for real-time human decision-making in a multi-task environment\"","authors":"K. Pattipati, D. Kleinman, A. Ephrath","doi":"10.1109/CDC.1980.271830","DOIUrl":"https://doi.org/10.1109/CDC.1980.271830","url":null,"abstract":"The present research has sought to understand human information-processing and task selection procedures in a dynamic multi-task environment. The approach has been to assimilate the results of a joint experimental and analytic program into a normative dynamic decision model(DDM) for predicting human task sequencing performance. To this end, a general multi-task paradigm was developed that retains the essential features of task selection in a manageable, yet manipulative, context. Via this framework, we have studied the effects of length of opportunity window, task values, and processing times on the human decision-making processes.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"216 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":"121725262","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}
A way to model systems with abruptly changing dynamics is suggested. The parameters of the system are described as realizations of a finite-state Markov chain. It is further discussed how to perform recursive parameter identification for this type of system. A crucial part in the identification algorithm is to estimate the present state of the Markov chain. The effects of some typical rules to do this estimation are examined. Also a procedure which reduces the need for a priori information is given.
{"title":"An approach to recursive identification of abruptly changing systems","authors":"M. Millnert","doi":"10.1109/CDC.1980.271957","DOIUrl":"https://doi.org/10.1109/CDC.1980.271957","url":null,"abstract":"A way to model systems with abruptly changing dynamics is suggested. The parameters of the system are described as realizations of a finite-state Markov chain. It is further discussed how to perform recursive parameter identification for this type of system. A crucial part in the identification algorithm is to estimate the present state of the Markov chain. The effects of some typical rules to do this estimation are examined. Also a procedure which reduces the need for a priori information is given.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"114 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":"121386432","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}
We consider the estimation of the unknown order of the autoregressive (AR) model obeyed by a finite time series of length N given only that it obeys a finite order AR model. We derive a family of consistent schemes for estimating the unknown order. We give explicit upperbounds for the probability of error of the decision rules.
{"title":"Consistent estimation of the order of autoregressive models","authors":"R. Kashyap","doi":"10.1109/CDC.1980.271948","DOIUrl":"https://doi.org/10.1109/CDC.1980.271948","url":null,"abstract":"We consider the estimation of the unknown order of the autoregressive (AR) model obeyed by a finite time series of length N given only that it obeys a finite order AR model. We derive a family of consistent schemes for estimating the unknown order. We give explicit upperbounds for the probability of error of the decision rules.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"27 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":"125385881","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}
The purpose of this paper is to introduce the gain and phase margin as measures of robustness of suboptimal linear-quadratic regulators. It will be shown that the suboptimal control retains the infinite gain margin of the corresponding optimal system, but that the phase margin and gain reduction tolerance depend on the degree of suboptimality of the nominal optimal control law. This establishes the degree of suboptimality as an index of both the system performance regarding the optimality criterion and the robustness to plant parameter uncertainties and distortions of the optimal control law. It will also be shown that the suboptimal closed-loop systems remain stable despite insertion of memoryless nonlinear gains inside individual feedback loops, thus raising further the confidence in suboptimal designs of linear-quadratic regulators.
{"title":"Robustness of suboptimal control: Gain and phase margin","authors":"M. Sezer, D. Siljak","doi":"10.1109/CDC.1980.271927","DOIUrl":"https://doi.org/10.1109/CDC.1980.271927","url":null,"abstract":"The purpose of this paper is to introduce the gain and phase margin as measures of robustness of suboptimal linear-quadratic regulators. It will be shown that the suboptimal control retains the infinite gain margin of the corresponding optimal system, but that the phase margin and gain reduction tolerance depend on the degree of suboptimality of the nominal optimal control law. This establishes the degree of suboptimality as an index of both the system performance regarding the optimality criterion and the robustness to plant parameter uncertainties and distortions of the optimal control law. It will also be shown that the suboptimal closed-loop systems remain stable despite insertion of memoryless nonlinear gains inside individual feedback loops, thus raising further the confidence in suboptimal designs of linear-quadratic regulators.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"37 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":"125594407","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}
Military command control is described as a process for ultimately controlling a geographic area. Some of the requirements of this process are identified and models of it suitable for developing analytic procedures are presented. Two examples which highlight possible system trade-offs are discussed. The differences in system and environmental parameters in different military scenarios are pointed out, and some promising avenues for future investigation are proposed.
{"title":"Command control as a process","authors":"J. Lawson","doi":"10.1109/CDC.1980.272008","DOIUrl":"https://doi.org/10.1109/CDC.1980.272008","url":null,"abstract":"Military command control is described as a process for ultimately controlling a geographic area. Some of the requirements of this process are identified and models of it suitable for developing analytic procedures are presented. Two examples which highlight possible system trade-offs are discussed. The differences in system and environmental parameters in different military scenarios are pointed out, and some promising avenues for future investigation are proposed.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"1 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":"130114635","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":"Stabilizability and controllability of distributed bilinear control systems: Progress report","authors":"M. Slemrod","doi":"10.1109/CDC.1980.271911","DOIUrl":"https://doi.org/10.1109/CDC.1980.271911","url":null,"abstract":"","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"2278 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":"130260281","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}
The design problem of choosing a set of parameters so that inequality constraints are satisfied for a specified variation of parameter values about their nominal value, is considered. Such problems occur when systems must be synthesized from components whose values are only known to a certain tolerance. Simple algorithms exist for such problems when the constraints are convex. This paper presents an algorithm which is valid for the non-convex case, The algorithm utilizes concepts employed by Eaves and Zangwill in their generalized cutting plane algorithms.
{"title":"A cut map algorithm for design problems with parameter tolerances","authors":"D. Mayne, E. Polak, A. Voreadis","doi":"10.1109/CDC.1980.272014","DOIUrl":"https://doi.org/10.1109/CDC.1980.272014","url":null,"abstract":"The design problem of choosing a set of parameters so that inequality constraints are satisfied for a specified variation of parameter values about their nominal value, is considered. Such problems occur when systems must be synthesized from components whose values are only known to a certain tolerance. Simple algorithms exist for such problems when the constraints are convex. This paper presents an algorithm which is valid for the non-convex case, The algorithm utilizes concepts employed by Eaves and Zangwill in their generalized cutting plane algorithms.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"1 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":"129541138","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}
The purpose of this paper is to discuss, in an informal way, some of the challenging research opportunities that arise in the analysis and synthesis of Command, Control, and Communications (C3) systems. It is concluded that significant advances in the theory of distributed decision theory under dynamic uncertainty are necessary to properly understand and synthesize complex military C3 systems, and to advance the state-of-the-art.
{"title":"System theoretic challenges and research opportunities in military C3 systems","authors":"M. Athans","doi":"10.1109/CDC.1980.272010","DOIUrl":"https://doi.org/10.1109/CDC.1980.272010","url":null,"abstract":"The purpose of this paper is to discuss, in an informal way, some of the challenging research opportunities that arise in the analysis and synthesis of Command, Control, and Communications (C3) systems. It is concluded that significant advances in the theory of distributed decision theory under dynamic uncertainty are necessary to properly understand and synthesize complex military C3 systems, and to advance the state-of-the-art.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"22 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":"131357558","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 discusses the development and evaluation of an adaptive filter for predicting tank motion during the time-of-flight of a projectile. Tank accelerations are assumed to be the output of stationary Markov processes. The parameters of these models are determined by a combination of spectral analysis and maximum likelihood identification using tank tracks obtained under tactical conditions. The determination of model parameters and structure provides a case study of several complimentary features of different types of identification procedures. The various motion models corresponding to different tanks and tests were examined for their similarities and a reduced set of four models was chosen. These four models were used in a parallel bank of extended Kalman filters as an adaptive tracking filter. The filter with the greatest likelihood function at the time of firing was assumed to have the best motion model and thus its state vector was used to determine the lead offset of the gun. A Monte Carlo evaluation of hit probability was made for the adaptive filter and for conventional first-order prediction. The results demonstrate the superiority of the adaptive filter. The final phase of this effort involves the implementation of the adaptive filter on a microprocessor.
{"title":"Development and evaluation of an adaptive algorithm for predicting tank motion","authors":"B. Gibbs, D. Porter","doi":"10.1109/CDC.1980.271858","DOIUrl":"https://doi.org/10.1109/CDC.1980.271858","url":null,"abstract":"This paper discusses the development and evaluation of an adaptive filter for predicting tank motion during the time-of-flight of a projectile. Tank accelerations are assumed to be the output of stationary Markov processes. The parameters of these models are determined by a combination of spectral analysis and maximum likelihood identification using tank tracks obtained under tactical conditions. The determination of model parameters and structure provides a case study of several complimentary features of different types of identification procedures. The various motion models corresponding to different tanks and tests were examined for their similarities and a reduced set of four models was chosen. These four models were used in a parallel bank of extended Kalman filters as an adaptive tracking filter. The filter with the greatest likelihood function at the time of firing was assumed to have the best motion model and thus its state vector was used to determine the lead offset of the gun. A Monte Carlo evaluation of hit probability was made for the adaptive filter and for conventional first-order prediction. The results demonstrate the superiority of the adaptive filter. The final phase of this effort involves the implementation of the adaptive filter on a microprocessor.","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":"128949914","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
扫码关注我们
求助内容：
应助结果提醒方式：