{"title":"Global uniqueness tests for H/sup /spl infin// optima","authors":"J. Helton, Marshall A. Whittlesey","doi":"10.1109/CDC.2000.911988","DOIUrl":"https://doi.org/10.1109/CDC.2000.911988","url":null,"abstract":"Optimization of sup norm type performance functions over the space of H/sup /spl infin// functions is central to the subject of H/sup /spl infin// design. Problems with a large amount of plant uncertainty are often highly nonconvex and therefore may have many solutions. In this article, even for highly nonconvex problems, we give a test one can perform, once a local optimum f* has been computed, to see if it is a global optimum. The uniqueness phenomena we discovered uses H/sup /spl infin// properties heavily and are considerably stronger than what occurs in other types of general optimization. One of the least intuitive properties of SISO control is that a (local) optimum for a carefully set up H/sup /spl infin// problem, even with large amounts of plant uncertainty, is unique. Such problems can be quite nonconvex so the fact is surprising. While the result is false in general for MIMO control, in this note we are describing MIMO situations where uniqueness holds. The setting in this paper is simultaneous (Pareto) optimization of several competing performances /spl Gamma//sub 1/,...,/spl Gamma//sub e/ and we obtain uniqueness results for its solutions.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"124 S172","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113972769","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":"An introduction to control and scheduling co-design","authors":"Karl-Erik Årzén, A. Cervin, J. Eker, L. Sha","doi":"10.1109/CDC.2001.914701","DOIUrl":"https://doi.org/10.1109/CDC.2001.914701","url":null,"abstract":"The paper presents the emerging field of integrated control and CPU-time scheduling, where more general scheduling models and methods that better suit the needs of control systems are developed. This creates possibilities for dynamic and flexible integrated control and scheduling frameworks, where the control design methodology takes the availability of computing resources into account during design and allows online trade-offs between control performance and computing resource utilization.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"17 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113978071","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":"Synthesis of hierarchical procedural controllers","authors":"R. Baird, M. Colantonio, S. Macchietto","doi":"10.1109/CDC.2000.912798","DOIUrl":"https://doi.org/10.1109/CDC.2000.912798","url":null,"abstract":"Introduces hierarchical procedural control theory. It builds on the properties of decomposition theory to provide a mechanism to tackle large scale problems in synthesising sequential controllers for discrete-event batch operations. The generic behaviour of all the controllers is modelled as a finite state machine, enabling them to be combined and operated in series and parallel by other sequential controllers in a hierarchical structure. An application to a clean in place process in a batch pilot plant is shown.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114719969","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":"Internet pricing: comparison and examples","authors":"Xi-Ren Cao, Hongxia Shen","doi":"10.1109/CDC.2000.914138","DOIUrl":"https://doi.org/10.1109/CDC.2000.914138","url":null,"abstract":"The central issue of Internet economics is pricing. Cao et al. studied the Internet pricing based on the leader-follower game, the cooperative game, and the two-person game theory. In this paper, we continue our study by comparing different pricing schemes with the above approaches. These schemes include Paris metro pricing (PMP) and pricing with priority. We show that PMP does not provide better social welfare thus does not provide better cooperative solutions. Numerical examples indicate that the leader-follower game leads to an optimal solution with the same price for both \"classes\" of users in PMP. This contradicts to the intention of the original design of the scheme.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124371218","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":"Stochastic approximation and transaction-level model for IP network design","authors":"Linhai He, J. Walrand","doi":"10.1109/CDC.2000.912135","DOIUrl":"https://doi.org/10.1109/CDC.2000.912135","url":null,"abstract":"We investigate the use of simulation and transaction level models for transmission control protocol (TCP) in Internet Protocol (IP) network design. More specifically, we focus on the transaction level dynamics of TCP and approximate it by max-min fair sharing. Based on this model, we formulate a network dimensioning problem as a nonlinear constrained optimization problem. The constraints and their gradients, which do not have analytical forms, are estimated through fluid simulation of the transaction-level model of TCP. The problem is solved by a gradient descent type of algorithm, with additional heuristics based techniques to improve its convergence. The performance of the proposed algorithm is evaluated through experimental studies on example networks. Results show that the methods are promising and can help the design of networks.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124525289","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":"Uniform invariance principle and synchronization. Robustness with respect to parameter variation","authors":"N. Bretas, L. Alberto","doi":"10.1109/CDC.2000.912359","DOIUrl":"https://doi.org/10.1109/CDC.2000.912359","url":null,"abstract":"The object of this work is to obtain uniform estimates, with respect to parameters, of the attractor and of the basin of attraction of a dynamical system and to apply these results to analyze the roughness of the synchronization of two subsystems. These estimates are obtained through an uniform version of the invariance principle of La Salle which is stated and proved in this work.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124539758","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 learning algorithm for Markov decision processes with adaptive state aggregation","authors":"J. Baras, V. Borkar","doi":"10.1109/CDC.2000.912220","DOIUrl":"https://doi.org/10.1109/CDC.2000.912220","url":null,"abstract":"We propose a simulation-based algorithm for learning good policies for a Markov decision process with unknown transition law, with aggregated states. The state aggregation itself can be adapted on a slower time scale by an auxiliary learning algorithm. Rigorous justifications are provided for both algorithms.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275524","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":"Control for bounded pseudo ARMAX stochastic systems via linear B-spline approximations","authors":"Hong Wang","doi":"10.1109/CDC.2000.912223","DOIUrl":"https://doi.org/10.1109/CDC.2000.912223","url":null,"abstract":"Following algorithms for the control of the shape of the output probability density function for general dynamic stochastic systems, this short paper presents the modelling and control algorithms for pseudo ARMAX systems, where different from all the existing ARMAX systems the considered system is subjected to any arbitrary bounded random input and the purpose of the control input design is to make the output probability density function of the system output as close as possible to a given distribution function. At first, the relationship between the input noise distribution and the output distribution is established. This is then followed by the description on the control algorithm design.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128029831","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 pathwise uniqueness for the Zakai filter equation","authors":"V. Lucic, A. Heunis","doi":"10.1109/CDC.2001.914571","DOIUrl":"https://doi.org/10.1109/CDC.2001.914571","url":null,"abstract":"We study a nonlinear filtering problem in which the signal to be estimated is conditioned by the observations. The main result establishes pathwise uniqueness for the unnormalized (Zakai) filter equation.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137393","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 relationship between finite state machine and causal network representations for discrete event system modeling: initial results","authors":"G. Provan, Yi-Liang Chen","doi":"10.1109/CDC.2000.912727","DOIUrl":"https://doi.org/10.1109/CDC.2000.912727","url":null,"abstract":"Shows the relationship between two discrete event system representations, finite state machines and causal networks. Finite state machine models have been used extensively for the supervisory control of logical (and timed, with some extension) discrete event systems. On the other hand, causal networks have been applied mainly to the diagnosis of discrete event systems. Advances in finite-state-machine based diagnosis and causal-network-based control have prompted an interest in understanding the relationship between these two representations. We describe initial findings concerning the mappings between these two representations for modeling synchronous system components, and discuss the implications of their relationships. We demonstrate the relationship using an example of a factory conveyor system.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128157319","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}