The paper presents a generic modeling tool for networks of continuous flow models (CFMs). The elemental building block, called the basic CFM, can be used in the modeling, simulation and sample path analysis of a large class of flow networks. Under certain conditions it constitutes a discrete event dynamic system (DEDS); for simulation thereof there exists a Lindley-like equation. Following the presentation of the basic CFM as a general modeling device, the paper discusses some continuity properties of the attendant flow processes, and points out the possible unbiasedness of LPA for various performance measures.
{"title":"Continuous flow models: modeling, simulation and continuity properties","authors":"Y. Wardi, B. Melamed","doi":"10.1109/CDC.1999.832743","DOIUrl":"https://doi.org/10.1109/CDC.1999.832743","url":null,"abstract":"The paper presents a generic modeling tool for networks of continuous flow models (CFMs). The elemental building block, called the basic CFM, can be used in the modeling, simulation and sample path analysis of a large class of flow networks. Under certain conditions it constitutes a discrete event dynamic system (DEDS); for simulation thereof there exists a Lindley-like equation. Following the presentation of the basic CFM as a general modeling device, the paper discusses some continuity properties of the attendant flow processes, and points out the possible unbiasedness of LPA for various performance measures.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125385831","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}
Studies the supervisory control problem of nondeterministic discrete event systems with driven events in the setting of masked prioritized synchronous composition (MPSC). MPSC was extended from prioritized synchronous composition (PSC) by Kumar and Heymann in order to permit systems interaction with their environment via interface masks. In their paper they solved the supervisory control problem under the assumption that the set of driven events is empty. In this paper the above assumption is removed. We first solve the supervisor synthesis problem for controlling the plant behavior as observed at the interface level, and then derive a necessary and sufficient condition for the existence of a supervisor for controlling the plant behavior as observed at the plant level. We establish a link between MPSC and PSC by showing that a supervisory control problem in the setting of MPSC can be transferred to a supervisory control problem in the setting of PSC under certain conditions. The results of this paper can also be used to derive the main result of Heymann and Lin (1998) which first showed that the supervisory control problem in the nondeterministic setting can be reduced to one in the deterministic setting.
{"title":"Supervisory control of nondeterministic discrete event systems with driven events via masked prioritized synchronization","authors":"S. Jiang, R. Kumar","doi":"10.1109/CDC.1999.831249","DOIUrl":"https://doi.org/10.1109/CDC.1999.831249","url":null,"abstract":"Studies the supervisory control problem of nondeterministic discrete event systems with driven events in the setting of masked prioritized synchronous composition (MPSC). MPSC was extended from prioritized synchronous composition (PSC) by Kumar and Heymann in order to permit systems interaction with their environment via interface masks. In their paper they solved the supervisory control problem under the assumption that the set of driven events is empty. In this paper the above assumption is removed. We first solve the supervisor synthesis problem for controlling the plant behavior as observed at the interface level, and then derive a necessary and sufficient condition for the existence of a supervisor for controlling the plant behavior as observed at the plant level. We establish a link between MPSC and PSC by showing that a supervisory control problem in the setting of MPSC can be transferred to a supervisory control problem in the setting of PSC under certain conditions. The results of this paper can also be used to derive the main result of Heymann and Lin (1998) which first showed that the supervisory control problem in the nondeterministic setting can be reduced to one in the deterministic setting.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125392877","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}
Computational methods are proposed for stability analysis of sampled-data feedback systems with integral quadratic constraint (IQC)-characterized perturbations. It is shown that, for a given IQ, one can exactly evaluate that the IQC guarantees the closed-loop stability or not by computing the L/sub 2/-induced norm of a certain sampled-data system. An approximated search method is also proposed based on the fast-hold signals, which leads to an LMI.
{"title":"Computational aspects of IQC-based stability analysis for sampled-data feedback systems","authors":"H. Fujioka, K. Morimura","doi":"10.1109/CDC.1999.827854","DOIUrl":"https://doi.org/10.1109/CDC.1999.827854","url":null,"abstract":"Computational methods are proposed for stability analysis of sampled-data feedback systems with integral quadratic constraint (IQC)-characterized perturbations. It is shown that, for a given IQ, one can exactly evaluate that the IQC guarantees the closed-loop stability or not by computing the L/sub 2/-induced norm of a certain sampled-data system. An approximated search method is also proposed based on the fast-hold signals, which leads to an LMI.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125424317","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}
Deals with the combined pole placement sensitivity function shaping method for the design of robust digital controllers. A controller parameterization has previously been presented which allows us to simultaneously achieve pole placement and sensitivity function shaping using convex optimization. The purpose of this paper is to explore the possibilities to extend these results to a set of plant models by overbounding this set with ellipses.
{"title":"Pole placement with sensitivity function shaping for a set of models via convex optimization","authors":"J. Langer, I. D. Landau, A. Rantzer","doi":"10.1109/CDC.1999.830153","DOIUrl":"https://doi.org/10.1109/CDC.1999.830153","url":null,"abstract":"Deals with the combined pole placement sensitivity function shaping method for the design of robust digital controllers. A controller parameterization has previously been presented which allows us to simultaneously achieve pole placement and sensitivity function shaping using convex optimization. The purpose of this paper is to explore the possibilities to extend these results to a set of plant models by overbounding this set with ellipses.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125558516","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}
R. Martínez-Guerra, J. De León‐Morales, O. Huerta-Guevara
An observer-based controller strategy for a synchronous generator is proposed. Our controller actually achieves both stability and tracking by linearizing the tracking error. Simulation results are given when this scheme is applied to a mathematical model describing the behavior of a synchronous generator.
{"title":"Observer-based controller for a synchronous generator","authors":"R. Martínez-Guerra, J. De León‐Morales, O. Huerta-Guevara","doi":"10.1109/CDC.1999.833275","DOIUrl":"https://doi.org/10.1109/CDC.1999.833275","url":null,"abstract":"An observer-based controller strategy for a synchronous generator is proposed. Our controller actually achieves both stability and tracking by linearizing the tracking error. Simulation results are given when this scheme is applied to a mathematical model describing the behavior of a synchronous generator.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125584577","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}
Consider two-person zero-sum communicating stochastic games with finite state and finite action spaces under the long-run average payoff criterion. A communicating game is irreducible on a restricted strategy space where every pair of action is taken with positive probability. The proposed approach applies Hoffman and Karp's (1996) algorithm for irreducible games successively over a sequence of restricted strategy spaces that gets larger until an /spl epsiv/-optimal stationary policy pair is obtained for any /spl epsiv/>0. This algorithm is convergent for the games that have optimal strategies with a value independent of the initial state.
{"title":"Undiscounted two-person zero-sum communicating stochastic games","authors":"M. Baykal-Gursoy, Z. Avsar","doi":"10.1109/CDC.1999.832844","DOIUrl":"https://doi.org/10.1109/CDC.1999.832844","url":null,"abstract":"Consider two-person zero-sum communicating stochastic games with finite state and finite action spaces under the long-run average payoff criterion. A communicating game is irreducible on a restricted strategy space where every pair of action is taken with positive probability. The proposed approach applies Hoffman and Karp's (1996) algorithm for irreducible games successively over a sequence of restricted strategy spaces that gets larger until an /spl epsiv/-optimal stationary policy pair is obtained for any /spl epsiv/>0. This algorithm is convergent for the games that have optimal strategies with a value independent of the initial state.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115563005","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}
Semiconductor manufacturing requires repetitive use of several similar processing operations. Owing to economic considerations, these expensive machines are always shared among many products or a product at different stages of its manufacturing process. The machines require setups between the production of different products or different entries of the same product. Since a product may enter a machine several times for processing, the manufacturing system is often called a re-entrant shop. We consider the problem of reducing mean and variance of the cycle time in semiconductor manufacturing environments. Manufacturing systems are usually controlled in two major ways. In the first, a release policy specifies when new lots are to be released into the system. Whereas in the second, a scheduling policy controls the lots already in the system. It decides which lot is to be processed next at each machine, when it becomes available for processing. A bulk of previous research on the control of manufacturing systems focuses on the control of bottleneck machines. Performance measures of a manufacturing system depends on the ways in which the conflicts are resolved between products competing for the machines. Lu et al. (1994) develop a class of scheduling policies for systems where there is no machine setup required when switching products. We deal with a more general situation in which the machines require setups. We introduce scheduling policies incorporating setups, since the policies developed in the literature for systems requiring no setups are found to perform poorly for systems requiring considerable setups.
{"title":"Efficient setup/dispatching policies in a semiconductor manufacturing facility","authors":"S. Sethi, K. Chu, Houmin Yan","doi":"10.1109/CDC.1999.830142","DOIUrl":"https://doi.org/10.1109/CDC.1999.830142","url":null,"abstract":"Semiconductor manufacturing requires repetitive use of several similar processing operations. Owing to economic considerations, these expensive machines are always shared among many products or a product at different stages of its manufacturing process. The machines require setups between the production of different products or different entries of the same product. Since a product may enter a machine several times for processing, the manufacturing system is often called a re-entrant shop. We consider the problem of reducing mean and variance of the cycle time in semiconductor manufacturing environments. Manufacturing systems are usually controlled in two major ways. In the first, a release policy specifies when new lots are to be released into the system. Whereas in the second, a scheduling policy controls the lots already in the system. It decides which lot is to be processed next at each machine, when it becomes available for processing. A bulk of previous research on the control of manufacturing systems focuses on the control of bottleneck machines. Performance measures of a manufacturing system depends on the ways in which the conflicts are resolved between products competing for the machines. Lu et al. (1994) develop a class of scheduling policies for systems where there is no machine setup required when switching products. We deal with a more general situation in which the machines require setups. We introduce scheduling policies incorporating setups, since the policies developed in the literature for systems requiring no setups are found to perform poorly for systems requiring considerable setups.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243381","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 control systems for which we know two stabilizing controllers. The former is "optimal" but local, the latter is global. We look for a uniting control law providing a globally stabilizing locally optimal controller. We study several solutions based on continuous, discontinuous, hybrid, time varying controllers. One criterion of selection of a controller is the robustness of the global asymptotic stability to vanishing measurement noise. This leads us in particular to consider a kind of generalization of Krasovskii solutions for hybrid systems.
{"title":"Uniting local and global controllers","authors":"C. Prieur, L. Praly","doi":"10.1109/CDC.1999.830096","DOIUrl":"https://doi.org/10.1109/CDC.1999.830096","url":null,"abstract":"We consider control systems for which we know two stabilizing controllers. The former is \"optimal\" but local, the latter is global. We look for a uniting control law providing a globally stabilizing locally optimal controller. We study several solutions based on continuous, discontinuous, hybrid, time varying controllers. One criterion of selection of a controller is the robustness of the global asymptotic stability to vanishing measurement noise. This leads us in particular to consider a kind of generalization of Krasovskii solutions for hybrid systems.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116574688","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 this paper, a novel approach for integrated fault detection, diagnosis and reconfigurable control systems design in the discrete-time stochastic domain is proposed. The scheme is based on a two-stage adaptive Kalman filter for simultaneous state and fault parameter estimation, statistical decisions for fault detection, diagnosis and activation of controller reconfiguration. Using the information provided by the fault detection and diagnosis scheme, the reconfigurable controller is designed automatically using an eigenstructure assignment technique. To eliminate the steady-state tracking error, a feedforward reconfigurable control law is also incorporated. The proposed approach has been evaluated using two examples. The effectiveness and superiority of the proposed approach have been demonstrated in comparison with existing reconfigurable controllers which are based on linear quadratic regulator and other eigenstructure assignment techniques.
{"title":"Design of integrated fault detection, diagnosis and reconfigurable control systems","authors":"Youmin Zhang, Jin Jiang","doi":"10.1109/CDC.1999.827909","DOIUrl":"https://doi.org/10.1109/CDC.1999.827909","url":null,"abstract":"In this paper, a novel approach for integrated fault detection, diagnosis and reconfigurable control systems design in the discrete-time stochastic domain is proposed. The scheme is based on a two-stage adaptive Kalman filter for simultaneous state and fault parameter estimation, statistical decisions for fault detection, diagnosis and activation of controller reconfiguration. Using the information provided by the fault detection and diagnosis scheme, the reconfigurable controller is designed automatically using an eigenstructure assignment technique. To eliminate the steady-state tracking error, a feedforward reconfigurable control law is also incorporated. The proposed approach has been evaluated using two examples. The effectiveness and superiority of the proposed approach have been demonstrated in comparison with existing reconfigurable controllers which are based on linear quadratic regulator and other eigenstructure assignment techniques.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122785459","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}
Develops a framework for averaging functional differential equations (FDEs) with two time scales. Averaging is performed on the fast time system, while slow time is 'frozen.' This creates an averaged equation which is slowly time-varying, hence the terminology of partial averaging. We show that solutions of the original FDE and its corresponding partially averaged equation remain close on arbitrarily long but finite time intervals. Next, assuming that the partially averaged system has an exponentially stable equilibrium point and that we restrict our interest to initial conditions that lie in the domain of exponential stability, the finite-time averaging results are extended to infinite time. In the special case of pointwise delays, exponential stability of the averaged system can be related to the frozen-time eigenvalues of its linearization.
{"title":"Partial averaging of functional differential equations","authors":"B. Lehman, S. Weibel","doi":"10.1109/CDC.1999.833282","DOIUrl":"https://doi.org/10.1109/CDC.1999.833282","url":null,"abstract":"Develops a framework for averaging functional differential equations (FDEs) with two time scales. Averaging is performed on the fast time system, while slow time is 'frozen.' This creates an averaged equation which is slowly time-varying, hence the terminology of partial averaging. We show that solutions of the original FDE and its corresponding partially averaged equation remain close on arbitrarily long but finite time intervals. Next, assuming that the partially averaged system has an exponentially stable equilibrium point and that we restrict our interest to initial conditions that lie in the domain of exponential stability, the finite-time averaging results are extended to infinite time. In the special case of pointwise delays, exponential stability of the averaged system can be related to the frozen-time eigenvalues of its linearization.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"433 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122472554","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
扫码关注我们
求助内容：
应助结果提醒方式：