Pub Date : 2011-10-13DOI: 10.1109/CCA.2011.6044422
F. Hunt, V. Marbukh, Yi Wang
In this paper we study a model of joint congestion control and routing in a ring network of sources with a single destination at the center (Figure 2). A utility maximization problem subject to routing constraints is posed and equations for its solution are presented. The distribution of traffic on routes available to a source is subject to an entropy constraint that controls the path diversity or degree of robustness of the allocation. Thus the utility/stability issue can be addressed directly and quantitatively in a way that differs from previous work on multiroute NUM problems. The dynamics of the model equations will be analyzed in the case of a constant route allocation defined by the allocation distribution entropy for a source. Motivated by earlier work on a two link network, the dynamics of the mean route costs for each source in the ring network are studied by deriving a continuous time approximation of the equations they satisfy. The equilibrium solutions of this approximation are used to greatly simplify the analysis of the model equations and the solution of the original optimization problem. We conclude with a discussion of the tradeoff between utility and path diversity (robustness) for two contrasting assignment of link capacities. Given a homogeneous assignment of capacities the network behaves like a two link model (Fig 1), while a heterogeneous assignment produces utilities displaying different tradeoffs for different sources.
{"title":"A mathematical model of joint congestion control and routing in multisource networks","authors":"F. Hunt, V. Marbukh, Yi Wang","doi":"10.1109/CCA.2011.6044422","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044422","url":null,"abstract":"In this paper we study a model of joint congestion control and routing in a ring network of sources with a single destination at the center (Figure 2). A utility maximization problem subject to routing constraints is posed and equations for its solution are presented. The distribution of traffic on routes available to a source is subject to an entropy constraint that controls the path diversity or degree of robustness of the allocation. Thus the utility/stability issue can be addressed directly and quantitatively in a way that differs from previous work on multiroute NUM problems. The dynamics of the model equations will be analyzed in the case of a constant route allocation defined by the allocation distribution entropy for a source. Motivated by earlier work on a two link network, the dynamics of the mean route costs for each source in the ring network are studied by deriving a continuous time approximation of the equations they satisfy. The equilibrium solutions of this approximation are used to greatly simplify the analysis of the model equations and the solution of the original optimization problem. We conclude with a discussion of the tradeoff between utility and path diversity (robustness) for two contrasting assignment of link capacities. Given a homogeneous assignment of capacities the network behaves like a two link model (Fig 1), while a heterogeneous assignment produces utilities displaying different tradeoffs for different sources.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121601145","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044483
V. T. Minh, A. Aziz
This paper develops a mathematical model for a hybrid vehicle in parallel configuration and real-time control schemes with model predictive controller for this model. The model predictive control with soften constraints is used to control the output torques among the components and the speeds of each shafts in order to have fast and smooth clutch engagements for the driving comfort. Comprehensive simulations conducted in Matlab/simulink R2009a have shown that the model predictive control schemes can provide real-time optimal control actions subject to input and output constraints.
{"title":"Real-time control schemes for hybrid vehicle","authors":"V. T. Minh, A. Aziz","doi":"10.1109/CCA.2011.6044483","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044483","url":null,"abstract":"This paper develops a mathematical model for a hybrid vehicle in parallel configuration and real-time control schemes with model predictive controller for this model. The model predictive control with soften constraints is used to control the output torques among the components and the speeds of each shafts in order to have fast and smooth clutch engagements for the driving comfort. Comprehensive simulations conducted in Matlab/simulink R2009a have shown that the model predictive control schemes can provide real-time optimal control actions subject to input and output constraints.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131370062","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044438
G. Ambrosino, G. Tommasi, S. Galeani, A. Pironti, G. Varano, L. Zaccarian
In this paper we propose a solution to the input saturation avoidance problem in the JET tokamak shape control by illustrating its capabilities to enforce coil currents selections that tend to move away from the saturation limits within the allowable degrees of freedom. The proposed solution revisits the dynamic allocation scheme first proposed in [10] for input redundant plants and generalized in [6] and [9] for not input redundant ones. In particular we propose a different scheme for the input allocation, more suitable within a set-point regulation setting, and prove its convergence properties. We also present simulation results to assess the steady-state and transient performances obtained with the novel scheme, as compared to the previous approaches.
{"title":"On dynamic input allocation for set-point regulation of the JET tokamak plasma shape","authors":"G. Ambrosino, G. Tommasi, S. Galeani, A. Pironti, G. Varano, L. Zaccarian","doi":"10.1109/CCA.2011.6044438","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044438","url":null,"abstract":"In this paper we propose a solution to the input saturation avoidance problem in the JET tokamak shape control by illustrating its capabilities to enforce coil currents selections that tend to move away from the saturation limits within the allowable degrees of freedom. The proposed solution revisits the dynamic allocation scheme first proposed in [10] for input redundant plants and generalized in [6] and [9] for not input redundant ones. In particular we propose a different scheme for the input allocation, more suitable within a set-point regulation setting, and prove its convergence properties. We also present simulation results to assess the steady-state and transient performances obtained with the novel scheme, as compared to the previous approaches.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132214555","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044510
M. Soorki, H. Talebi, S. Nikravesh
This paper presents a new strategy for obstacle avoidance in mobile robots leader-follower formation. The key feature of the algorithm is that the system is robust against absolute acceleration of both leader and obstacle. On the other hand the angular velocity constraint of leader and obstacle is eliminated in the proposed leader-obstacle formation. The formation controller is composed of a feedback linearization part and a sliding mode compensator. Similar structure is used for both leader-follower and leader-obstacle formation. The proposed controller generates the commanded acceleration for the follower robot and makes the formation control system robust against the unmeasured acceleration of the leader robot and obstacle. Simulation results are presented to show the validity of the proposed methodology.
{"title":"A robust leader-obstacle formation control","authors":"M. Soorki, H. Talebi, S. Nikravesh","doi":"10.1109/CCA.2011.6044510","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044510","url":null,"abstract":"This paper presents a new strategy for obstacle avoidance in mobile robots leader-follower formation. The key feature of the algorithm is that the system is robust against absolute acceleration of both leader and obstacle. On the other hand the angular velocity constraint of leader and obstacle is eliminated in the proposed leader-obstacle formation. The formation controller is composed of a feedback linearization part and a sliding mode compensator. Similar structure is used for both leader-follower and leader-obstacle formation. The proposed controller generates the commanded acceleration for the follower robot and makes the formation control system robust against the unmeasured acceleration of the leader robot and obstacle. Simulation results are presented to show the validity of the proposed methodology.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130026657","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044387
J. Butterworth, L. Pao, D. Abramovitch
We evaluate the performance of a dual-adaptive feedforward control architecture applied to the raster scan of a piezo-based positioning system. In previous work [1], we introduced the adaptive-delay algorithm that improved the tracking performance of the feedforward plant-injection architecture. The key benefit of the adaptive-delay algorithm is the adaptation calculation that does not require knowledge of plant parameters. In [1], the algorithm uses model-inverse-based feedforward control to increase raster-tracking bandwidth. It is well known that model-inverse-based feedforward control designs can perform poorly in the presence of large model variation or uncertainty. System identification methods reveal that the frequency response of our piezoscanner includes a large amount of variation as the user requests various operating points within the stage's range. As a result, tracking performance degrades as we vary from the conditions with which the model was identified. To correct for this, we combined the adaptive-delay algorithm with partial-parameter adaptation that updates critically variant parameters. This partnership of adaptive feedforward controllers improved experimental tracking results and robustness to model uncertainties.
{"title":"Dual-adaptive feedforward control for raster tracking with applications to AFMs","authors":"J. Butterworth, L. Pao, D. Abramovitch","doi":"10.1109/CCA.2011.6044387","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044387","url":null,"abstract":"We evaluate the performance of a dual-adaptive feedforward control architecture applied to the raster scan of a piezo-based positioning system. In previous work [1], we introduced the adaptive-delay algorithm that improved the tracking performance of the feedforward plant-injection architecture. The key benefit of the adaptive-delay algorithm is the adaptation calculation that does not require knowledge of plant parameters. In [1], the algorithm uses model-inverse-based feedforward control to increase raster-tracking bandwidth. It is well known that model-inverse-based feedforward control designs can perform poorly in the presence of large model variation or uncertainty. System identification methods reveal that the frequency response of our piezoscanner includes a large amount of variation as the user requests various operating points within the stage's range. As a result, tracking performance degrades as we vary from the conditions with which the model was identified. To correct for this, we combined the adaptive-delay algorithm with partial-parameter adaptation that updates critically variant parameters. This partnership of adaptive feedforward controllers improved experimental tracking results and robustness to model uncertainties.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130282784","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044389
Gary R. Halligan, Balaje T. Thumati, S. Jagannathan
In this paper, a novel fault diagnostics and prediction (FDP) scheme is introduced by using artificial immune system (AIS) as an online approximator for a class of nonlinear discrete-time systems. Traditionally, AIS is considered as an offline tool for fault detection (FD). However, in this paper, AIS is utilized as an online approximator in discrete-time (OLAD) along with a robust adaptive term in the proposed fault diagnostics observer. Using the fact that the system outputs are alone measurable, an output residual is determined by comparing the observer and system outputs and a fault is detected if this output residual exceeds a predefined threshold. Upon detection, the OLADs are initiated to learn the unknown fault dynamics while the robust adaptive term ensure asymptotic convergence of the output residual for a state fault whereas a bounded result for an output fault. Additionally, for prognostics purposes, the parameter update law for AIS is used to estimate the time-to-failure (TTF). Finally, the performance of the proposed FDP scheme is demonstrated experimentally on an axial piston pump test-bed for two failure modes.
{"title":"Artificial immune system-based diagnostics and prognostics scheme and its experimental verification","authors":"Gary R. Halligan, Balaje T. Thumati, S. Jagannathan","doi":"10.1109/CCA.2011.6044389","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044389","url":null,"abstract":"In this paper, a novel fault diagnostics and prediction (FDP) scheme is introduced by using artificial immune system (AIS) as an online approximator for a class of nonlinear discrete-time systems. Traditionally, AIS is considered as an offline tool for fault detection (FD). However, in this paper, AIS is utilized as an online approximator in discrete-time (OLAD) along with a robust adaptive term in the proposed fault diagnostics observer. Using the fact that the system outputs are alone measurable, an output residual is determined by comparing the observer and system outputs and a fault is detected if this output residual exceeds a predefined threshold. Upon detection, the OLADs are initiated to learn the unknown fault dynamics while the robust adaptive term ensure asymptotic convergence of the output residual for a state fault whereas a bounded result for an output fault. Additionally, for prognostics purposes, the parameter update law for AIS is used to estimate the time-to-failure (TTF). Finally, the performance of the proposed FDP scheme is demonstrated experimentally on an axial piston pump test-bed for two failure modes.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132834417","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044459
Y. Kovalyshen
A simple analytical model of bit whirl is presented. The model takes into account the history-dependent boundary conditions at the bit-rock interface. We show that the geometry of the bit can be lumped into only three parameters. Depending on the value of these parameters the system can be stable or undergo forward or backward whirl.
{"title":"Simple model of whirl","authors":"Y. Kovalyshen","doi":"10.1109/CCA.2011.6044459","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044459","url":null,"abstract":"A simple analytical model of bit whirl is presented. The model takes into account the history-dependent boundary conditions at the bit-rock interface. We show that the geometry of the bit can be lumped into only three parameters. Depending on the value of these parameters the system can be stable or undergo forward or backward whirl.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133075991","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044372
H. Nourzadeh, J. McInroy
This paper presents a planning algorithm suitable whenever n objects must be collectively characterized by m observers and their relative motions are known a priori. This situation arises in Space Situational Awareness (SSA) problems due to the fixed orbits of spacecraft, and also occurs in several other aerospace and manufacturing environments. The new algorithm is a synthesis of two standard methods used to solve combinatorial optimization problems arising from various large-scale constrained active sensor planning applications. The algorithm allows constituent techniques to operate in domains where they perform better. Both constituent methods, Integer Linear Programming (ILP) Relaxation and a Batch-Greedy algorithm, are elaborated in detail. A very powerful feature of the overall approach is that an upper bound on the gap between the found sub-optimal solution and the unknown optimal solution is available. The ILP-relaxation algorithm provides an optimal but physically unrealizable solution, so if realizable performance approaches that of the ILP-relaxation solution, then the sub-optimal solution is very nearly optimal. A visual inspection problem for SSA, which lies in the strongly NP-hard class, is considered and it has been shown that the mixed method yields very nearly optimal solutions in polynomial time. Simulation results confirm the effectiveness of the proposed planning method on different orbits, including Low Earth and geosynchronous orbits.
{"title":"Planning the visual measurement of n moving objects by m moving cameras, given their relative trajectories","authors":"H. Nourzadeh, J. McInroy","doi":"10.1109/CCA.2011.6044372","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044372","url":null,"abstract":"This paper presents a planning algorithm suitable whenever n objects must be collectively characterized by m observers and their relative motions are known a priori. This situation arises in Space Situational Awareness (SSA) problems due to the fixed orbits of spacecraft, and also occurs in several other aerospace and manufacturing environments. The new algorithm is a synthesis of two standard methods used to solve combinatorial optimization problems arising from various large-scale constrained active sensor planning applications. The algorithm allows constituent techniques to operate in domains where they perform better. Both constituent methods, Integer Linear Programming (ILP) Relaxation and a Batch-Greedy algorithm, are elaborated in detail. A very powerful feature of the overall approach is that an upper bound on the gap between the found sub-optimal solution and the unknown optimal solution is available. The ILP-relaxation algorithm provides an optimal but physically unrealizable solution, so if realizable performance approaches that of the ILP-relaxation solution, then the sub-optimal solution is very nearly optimal. A visual inspection problem for SSA, which lies in the strongly NP-hard class, is considered and it has been shown that the mixed method yields very nearly optimal solutions in polynomial time. Simulation results confirm the effectiveness of the proposed planning method on different orbits, including Low Earth and geosynchronous orbits.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127864683","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044371
W. Wehner, Chao Xu, E. Schuster, D. Moreau, D. Mazon, M. Walker, D. Humphreys, Y. In
First-principle predictive tokamak plasma models based on flux averaged transport equations often yield complex expressions not suitable for real time control implementations. Addition of turbulent transport phenomena further encumbers these models with transport coefficients that must be determined experimentally and the interdependences between parameters must be accounted for with ad hoc assumptions. As an alternative to first principle modeling, data-driven modeling techniques involving system identification have the potential to obtain practical, low complexity, dynamic models without the need for ad hoc assumptions. This paper considers the evolution of the toroidal rotation profile in response to the heating and current drive (H&CD) systems. Experiments are conducted during plasma current flattop, in which the actuators are modulated in open-loop to obtain data for the model identification. The rotation profile is discretized in the spatial coordinate by Galerkin projection. Then a linear state space model is generated by the prediction error method (PEM) to relate the rotation profile to the actuators according to a least squares fit. An optimal tracking controller is proposed to regulate the rotation profile to a desired reference trajectory.
{"title":"Data-driven modeling and feedback tracking control of the toroidal rotation profile for advanced tokamak scenarios in DIII-D","authors":"W. Wehner, Chao Xu, E. Schuster, D. Moreau, D. Mazon, M. Walker, D. Humphreys, Y. In","doi":"10.1109/CCA.2011.6044371","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044371","url":null,"abstract":"First-principle predictive tokamak plasma models based on flux averaged transport equations often yield complex expressions not suitable for real time control implementations. Addition of turbulent transport phenomena further encumbers these models with transport coefficients that must be determined experimentally and the interdependences between parameters must be accounted for with ad hoc assumptions. As an alternative to first principle modeling, data-driven modeling techniques involving system identification have the potential to obtain practical, low complexity, dynamic models without the need for ad hoc assumptions. This paper considers the evolution of the toroidal rotation profile in response to the heating and current drive (H&CD) systems. Experiments are conducted during plasma current flattop, in which the actuators are modulated in open-loop to obtain data for the model identification. The rotation profile is discretized in the spatial coordinate by Galerkin projection. Then a linear state space model is generated by the prediction error method (PEM) to relate the rotation profile to the actuators according to a least squares fit. An optimal tracking controller is proposed to regulate the rotation profile to a desired reference trajectory.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114905296","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 : 2011-10-13DOI: 10.1109/CCA.2011.6044490
N. Deelen, A. Jokić, P. V. D. Bosch, R. M. Hermans
With the expected increase in penetration level of wind turbine generators in the near future, it will be necessary for them to participate in power network frequency control. In this paper we exploit the inertia of wind turbine generators using model predictive control (MPC). In this way wind turbines can actively contribute to primary control. Safe operation is possible because MPC explicitly takes safety constraints into account. In a case study a nonlinear model of a power network is balanced by exploiting the inertial response of wind turbine generators. We have considered both centralized MPC and a decentralized MPC implementation, and have shown their efficiency in counteracting deviations in generation and demand introduced either by unpredictable exogenous disturbances, or by imbalanced transients during market rescheduling processes. The obtained results demonstrate the potential of wind turbine inertia exploitation in contributing to the challenging task of balancing future power networks.
{"title":"Exploiting inertia of wind turbines in power network frequency control: A model predictive control approach","authors":"N. Deelen, A. Jokić, P. V. D. Bosch, R. M. Hermans","doi":"10.1109/CCA.2011.6044490","DOIUrl":"https://doi.org/10.1109/CCA.2011.6044490","url":null,"abstract":"With the expected increase in penetration level of wind turbine generators in the near future, it will be necessary for them to participate in power network frequency control. In this paper we exploit the inertia of wind turbine generators using model predictive control (MPC). In this way wind turbines can actively contribute to primary control. Safe operation is possible because MPC explicitly takes safety constraints into account. In a case study a nonlinear model of a power network is balanced by exploiting the inertial response of wind turbine generators. We have considered both centralized MPC and a decentralized MPC implementation, and have shown their efficiency in counteracting deviations in generation and demand introduced either by unpredictable exogenous disturbances, or by imbalanced transients during market rescheduling processes. The obtained results demonstrate the potential of wind turbine inertia exploitation in contributing to the challenging task of balancing future power networks.","PeriodicalId":208713,"journal":{"name":"2011 IEEE International Conference on Control Applications (CCA)","volume":"17 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850438","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
扫码关注我们
求助内容：
应助结果提醒方式：