Pub Date : 2006-06-14DOI: 10.1109/ACC.2006.1656596
R. Ortega, E. García-Canseco, R. Griñó, A. Stankovic
The main contribution of this paper is identifying the key role played by cyclo-dissipativity in the solution of the power factor compensation problem for electrical circuits. Namely, we prove that a necessary condition for a (shunt) compensator to improve the power transfer is that the overall system satisfies a given cyclo-dissipativity property, which naturally leads to a formulation of the compensation problem as one of cyclo-dissipasivation. Cyclo-dissipative systems exhibit a net absorption of (abstract) energy only along closed paths, while a dissipative system cannot create energy for all trajectories, henceforth, this concept generalizes the one of passivation
{"title":"A cyclo-dissipativity condition for power factor improvement in electrical circuits","authors":"R. Ortega, E. García-Canseco, R. Griñó, A. Stankovic","doi":"10.1109/ACC.2006.1656596","DOIUrl":"https://doi.org/10.1109/ACC.2006.1656596","url":null,"abstract":"The main contribution of this paper is identifying the key role played by cyclo-dissipativity in the solution of the power factor compensation problem for electrical circuits. Namely, we prove that a necessary condition for a (shunt) compensator to improve the power transfer is that the overall system satisfies a given cyclo-dissipativity property, which naturally leads to a formulation of the compensation problem as one of cyclo-dissipasivation. Cyclo-dissipative systems exhibit a net absorption of (abstract) energy only along closed paths, while a dissipative system cannot create energy for all trajectories, henceforth, this concept generalizes the one of passivation","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"79 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121015046","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 : 2006-06-14DOI: 10.1109/ACC.2006.1655464
H. Ko, G. Dumont, J. Jatskevich, A. Moshref
As the penetration of wind energy and the size of modern wind farms continue to increase, the voltage control at a specified remote location becomes increasingly important for stable and reliable operation of electric grid. This paper presents a new voltage control scheme that is based on the linear quadratic regulator (LQR) controller formulated as a linear matrix inequality (LMI) problem. The main advantage of using the LMI-based approach is that it is readily applicable for robust tuning considering a range of operating conditions. A candidate wind farm site on Vancouver Island, Canada, is considered. The proposed controller and its design methodology are shown to be very effective for the systems with multiple wind turbines as well as readily applicable to larger wind farms of different configurations
{"title":"A new LMI representation of LQR based voltage control of grid-connected wind farm","authors":"H. Ko, G. Dumont, J. Jatskevich, A. Moshref","doi":"10.1109/ACC.2006.1655464","DOIUrl":"https://doi.org/10.1109/ACC.2006.1655464","url":null,"abstract":"As the penetration of wind energy and the size of modern wind farms continue to increase, the voltage control at a specified remote location becomes increasingly important for stable and reliable operation of electric grid. This paper presents a new voltage control scheme that is based on the linear quadratic regulator (LQR) controller formulated as a linear matrix inequality (LMI) problem. The main advantage of using the LMI-based approach is that it is readily applicable for robust tuning considering a range of operating conditions. A candidate wind farm site on Vancouver Island, Canada, is considered. The proposed controller and its design methodology are shown to be very effective for the systems with multiple wind turbines as well as readily applicable to larger wind farms of different configurations","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127147881","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 : 2006-06-14DOI: 10.1109/ACC.2006.1655483
M. Wassink, O. Bosgra, S. Koekebakker
The functioning of inkjet printheads is severely hampered by the fact that an ink channel cannot be actuated without exciting the fluid-mechanics in neighboring channels. This phenomenon is referred to as cross-talk. As a result, droplet properties vary when actuating an array of channels. This paper presents an approach based on lifted MIMO ILC with which input wave forms are designed that minimize the effects of cross-talk such that the droplet speed variations are reduced considerably. This paper shows the modeling required for ILC, the design of the ILC controller in the lifted setting, and the experimental implementation
{"title":"Minimization of cross-talk for an inkjet printhead using MIMO ILC","authors":"M. Wassink, O. Bosgra, S. Koekebakker","doi":"10.1109/ACC.2006.1655483","DOIUrl":"https://doi.org/10.1109/ACC.2006.1655483","url":null,"abstract":"The functioning of inkjet printheads is severely hampered by the fact that an ink channel cannot be actuated without exciting the fluid-mechanics in neighboring channels. This phenomenon is referred to as cross-talk. As a result, droplet properties vary when actuating an array of channels. This paper presents an approach based on lifted MIMO ILC with which input wave forms are designed that minimize the effects of cross-talk such that the droplet speed variations are reduced considerably. This paper shows the modeling required for ILC, the design of the ILC controller in the lifted setting, and the experimental implementation","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127177727","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 : 2006-06-14DOI: 10.1109/ACC.2006.1656516
Dimos V. Dimarogonas, K. Kyriakopoulos
In this contribution, a feedback control strategy that drives a system of multiple nonholonomic kinematic unicycles to agreement is introduced. Each agent is assigned with a specific subset of the rest of the team, called the agent's communication set, that includes the agents with which it can communicate in order to achieve the desired objective. The proposed nonholonomic control law is discontinuous and time-invariant and tools from nonsmooth stability theory and graph theory are used to check the stability of the overall system. Similarly to the linear case, the convergence of the multi-agent system relies on the connectivity of the communication graph that represents the inter-agent communication topology
{"title":"On the state agreement problem for multiple unicycles","authors":"Dimos V. Dimarogonas, K. Kyriakopoulos","doi":"10.1109/ACC.2006.1656516","DOIUrl":"https://doi.org/10.1109/ACC.2006.1656516","url":null,"abstract":"In this contribution, a feedback control strategy that drives a system of multiple nonholonomic kinematic unicycles to agreement is introduced. Each agent is assigned with a specific subset of the rest of the team, called the agent's communication set, that includes the agents with which it can communicate in order to achieve the desired objective. The proposed nonholonomic control law is discontinuous and time-invariant and tools from nonsmooth stability theory and graph theory are used to check the stability of the overall system. Similarly to the linear case, the convergence of the multi-agent system relies on the connectivity of the communication graph that represents the inter-agent communication topology","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127260934","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 : 2006-06-14DOI: 10.1109/ACC.2006.1657175
Guoqing Yan, F. Hanson
An alternative option pricing model is proposed, in which the stock prices follow a diffusion model with square root stochastic volatility and a jump model with log-uniformly distributed jump amplitudes in the stock price process. The stochastic-volatility follows a square-root and mean-reverting diffusion process. Fourier transforms are applied to solve the problem for risk-neutral European option pricing under this compound stochastic-volatility jump-diffusion (SVJD) process. Characteristic formulas and their inverses simplified by integration along better equivalent contours are given. The numerical implementation of pricing formulas is accomplished by both fast Fourier transforms (FFTs) and more highly accurate discrete Fourier transforms (DFTs) for verifying results and for different output
{"title":"Option pricing for a stochastic-volatility jump-diffusion model with log-uniform jump-amplitudes","authors":"Guoqing Yan, F. Hanson","doi":"10.1109/ACC.2006.1657175","DOIUrl":"https://doi.org/10.1109/ACC.2006.1657175","url":null,"abstract":"An alternative option pricing model is proposed, in which the stock prices follow a diffusion model with square root stochastic volatility and a jump model with log-uniformly distributed jump amplitudes in the stock price process. The stochastic-volatility follows a square-root and mean-reverting diffusion process. Fourier transforms are applied to solve the problem for risk-neutral European option pricing under this compound stochastic-volatility jump-diffusion (SVJD) process. Characteristic formulas and their inverses simplified by integration along better equivalent contours are given. The numerical implementation of pricing formulas is accomplished by both fast Fourier transforms (FFTs) and more highly accurate discrete Fourier transforms (DFTs) for verifying results and for different output","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127517542","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 : 2006-06-14DOI: 10.1109/ACC.2006.1655387
D. Bruijnen, R. V. D. Molengraft, T. Heeren, A. Draad, M. Steinbuch
First findings are presented of an absolute position sensor for active alignment of printheads with respect to the printer frame over a distance of one meter. A string is stretched along the guidance serving as an absolute reference. The developed sensor measures the position of the printhead relative to this string. It is cheap and it is robust for temperature variations in the order of tens of degrees. The target accuracy is 1 mum over a range of about 2 mm. Although only one measurement direction is of interest for the application, it can actually be used as a 2D sensor. If an extra sensor is added to the same string, a 4D sensor can be created
{"title":"Design of a printhead alignment sensor for a temperature varying environment","authors":"D. Bruijnen, R. V. D. Molengraft, T. Heeren, A. Draad, M. Steinbuch","doi":"10.1109/ACC.2006.1655387","DOIUrl":"https://doi.org/10.1109/ACC.2006.1655387","url":null,"abstract":"First findings are presented of an absolute position sensor for active alignment of printheads with respect to the printer frame over a distance of one meter. A string is stretched along the guidance serving as an absolute reference. The developed sensor measures the position of the printhead relative to this string. It is cheap and it is robust for temperature variations in the order of tens of degrees. The target accuracy is 1 mum over a range of about 2 mm. Although only one measurement direction is of interest for the application, it can actually be used as a 2D sensor. If an extra sensor is added to the same string, a 4D sensor can be created","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124914777","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 : 2006-06-14DOI: 10.1109/ACC.2006.1655378
F. Tyan
In this paper, the expression of capture region of the general ideal proportional navigation (GIPN) missile guidance law is determined by a powerful classifier, least square support vector machine (LSSVM). To reduce the computational burden, an approximation of the Gaussian radial basis function is adopted to obtain the corresponding nonlinear feature mapping function. Through numerous numerical examples, it shows that the proposed technique is adequate for the determination of capture region. All the analysis of the relative dynamics between missile and target are performed in a line of sight (LOS) fixed natural coordinate. To have the capture region ready for LSSVM, all the state variables are transformed into the modified polar variables form. In addition, to reduce the number of independent variables, these modified polar variables are further non-dimensionalized. For simplicity, we assume that target's input acceleration is subject to independent saturation, while missile's input acceleration is subject to magnitude saturation
{"title":"Capture regions of GIPN guidance laws: a least square SVM approach","authors":"F. Tyan","doi":"10.1109/ACC.2006.1655378","DOIUrl":"https://doi.org/10.1109/ACC.2006.1655378","url":null,"abstract":"In this paper, the expression of capture region of the general ideal proportional navigation (GIPN) missile guidance law is determined by a powerful classifier, least square support vector machine (LSSVM). To reduce the computational burden, an approximation of the Gaussian radial basis function is adopted to obtain the corresponding nonlinear feature mapping function. Through numerous numerical examples, it shows that the proposed technique is adequate for the determination of capture region. All the analysis of the relative dynamics between missile and target are performed in a line of sight (LOS) fixed natural coordinate. To have the capture region ready for LSSVM, all the state variables are transformed into the modified polar variables form. In addition, to reduce the number of independent variables, these modified polar variables are further non-dimensionalized. For simplicity, we assume that target's input acceleration is subject to independent saturation, while missile's input acceleration is subject to magnitude saturation","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125114513","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 : 2006-06-14DOI: 10.1109/ACC.2006.1657275
K. Krishnanand, Debasish Ghose
We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper
{"title":"Theoretical foundations for multiple rendezvous of glowworm-inspired mobile agents with variable local-decision domains","authors":"K. Krishnanand, Debasish Ghose","doi":"10.1109/ACC.2006.1657275","DOIUrl":"https://doi.org/10.1109/ACC.2006.1657275","url":null,"abstract":"We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125856081","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 paper deals with the finite horizon Hinfin white noise smoothing problem for a linear time-varying discrete-time system. A new approach termed as re-organized innovation sequence is presented to derive the fixed-lag smoother. With the new approach, it is clearly shown that the central white noise smoother in an Hinfin setting is the same as that in an H2 setting associated with one self-constructed stochastic state-space model. The solution to the H infin white noise smoother is given in terms of solutions to Riccati equations with the same order as the original system
{"title":"H/spl infin/ White-noise Fixed-lag Smoothing for Discrete-time Systems","authors":"Xiaohong Lu, Huanshui Zhang, Wei Wang, Chenghui Zhang","doi":"10.1109/ACC.2006.1657424","DOIUrl":"https://doi.org/10.1109/ACC.2006.1657424","url":null,"abstract":"The paper deals with the finite horizon Hinfin white noise smoothing problem for a linear time-varying discrete-time system. A new approach termed as re-organized innovation sequence is presented to derive the fixed-lag smoother. With the new approach, it is clearly shown that the central white noise smoother in an Hinfin setting is the same as that in an H2 setting associated with one self-constructed stochastic state-space model. The solution to the H infin white noise smoother is given in terms of solutions to Riccati equations with the same order as the original system","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125873490","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 : 2006-06-14DOI: 10.1109/ACC.2006.1657300
A. Khalak, J. Tierno
In this paper, we discuss the problem of determining performance metrics for preemptive condition-based maintenance, also referred to as prognostic health maintenance (PHM). This performance is tightly coupled to the properties of the logistics supply chain. Further, the optimal supply chain design is, in fact, sensitive to the capabilities of the PHM system. We formulate this joint optimization problem, which can be shown to be equivalent to a shortest path problem (SPP). The properties of the solution elucidate the design tradeoffs in using damage prediction technologies in the overall health management solution
{"title":"Influence of prognostic health management on logistic supply chain","authors":"A. Khalak, J. Tierno","doi":"10.1109/ACC.2006.1657300","DOIUrl":"https://doi.org/10.1109/ACC.2006.1657300","url":null,"abstract":"In this paper, we discuss the problem of determining performance metrics for preemptive condition-based maintenance, also referred to as prognostic health maintenance (PHM). This performance is tightly coupled to the properties of the logistics supply chain. Further, the optimal supply chain design is, in fact, sensitive to the capabilities of the PHM system. We formulate this joint optimization problem, which can be shown to be equivalent to a shortest path problem (SPP). The properties of the solution elucidate the design tradeoffs in using damage prediction technologies in the overall health management solution","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125955647","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
扫码关注我们
求助内容：
应助结果提醒方式：