Pub Date : 2019-12-01DOI: 10.1109/ICC47138.2019.9123211
M. Irshad, Ahmad Ali
Inverse response processes have unusual dynamic behavior and when process time delay is included, controller design becomes a challenging task. In the present work, robust PI/PID controllers based on Internal Model Control (IMC) theory have been designed for first and second order plus time delay inverse response processes. The single tuning parameter has been optimized using particle swarm optimization to get optimal controller settings. Proposed tuning rules yield good servo and regulatory responses for the nominal condition as compared to reported methods. Also, the proposed method exhibits good robust control performance with less control effort for model-mismatch cases.
{"title":"IMC based optimal PI/PID tuning rules for inverse response plus time delay processes","authors":"M. Irshad, Ahmad Ali","doi":"10.1109/ICC47138.2019.9123211","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123211","url":null,"abstract":"Inverse response processes have unusual dynamic behavior and when process time delay is included, controller design becomes a challenging task. In the present work, robust PI/PID controllers based on Internal Model Control (IMC) theory have been designed for first and second order plus time delay inverse response processes. The single tuning parameter has been optimized using particle swarm optimization to get optimal controller settings. Proposed tuning rules yield good servo and regulatory responses for the nominal condition as compared to reported methods. Also, the proposed method exhibits good robust control performance with less control effort for model-mismatch cases.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129902875","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123222
L. A. Prashanth, K. Jagannathan, R. Kolla
Traditional multi-armed bandit problems are geared towards finding the arm with the highest expected value – an objective that is risk-neutral. In several practical applications, e.g., finance, a risk-sensitive objective is to control the worst-case losses and Conditional Value-at-Risk (CVaR) is a popular risk measure for modeling the aforementioned objective. We consider the CVaR optimization problem in a best-arm identification framework under a fixed budget. First, we derive a novel two-sided concentration bound for a well-known CVaR estimator using empirical distribution function, assuming that the underlying distribution is unbounded, but light-tailed. This bound may be of independent interest. Second, we adapt the well-known successive rejects algorithm to incorporate a CVaRbased criterion and derive an upper-bound on the probability of incorrect identification of our proposed algorithm.
{"title":"CVaR-sensitive bandits: The light-tailed case","authors":"L. A. Prashanth, K. Jagannathan, R. Kolla","doi":"10.1109/ICC47138.2019.9123222","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123222","url":null,"abstract":"Traditional multi-armed bandit problems are geared towards finding the arm with the highest expected value – an objective that is risk-neutral. In several practical applications, e.g., finance, a risk-sensitive objective is to control the worst-case losses and Conditional Value-at-Risk (CVaR) is a popular risk measure for modeling the aforementioned objective. We consider the CVaR optimization problem in a best-arm identification framework under a fixed budget. First, we derive a novel two-sided concentration bound for a well-known CVaR estimator using empirical distribution function, assuming that the underlying distribution is unbounded, but light-tailed. This bound may be of independent interest. Second, we adapt the well-known successive rejects algorithm to incorporate a CVaRbased criterion and derive an upper-bound on the probability of incorrect identification of our proposed algorithm.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125389223","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123181
Danish Rafiq, M. A. Bazaz
This paper presents a comprehensive scheme to improve the offline as well as online computational time to simulate Burgers’ Equation. A reduced order approximation of the Full Order Model (FOM) is obtained using Non-Linear Moment Matching (NLMM) scheme. The expensive simulation of the underlying nonlinear Sylvester Partial Differential Equation (PDE) is reduced to a system of nonlinear algebraic equations by proper step-by-step simplifications. This reduces the offline computational cost of generating the orthonormal basis vectors substantially. Discrete Empirical Interpolation (DEIM) is used to further reduce the complexity of the underlying nonlinearity which improves the online computation time in solving the reduced system. Reduced Order Model (ROM) thus derived is compared with Proper Orthogonal Decomposition (POD) for different test inputs.
{"title":"A Comprehensive Scheme for Fast Simulation of Burgers’ Equation","authors":"Danish Rafiq, M. A. Bazaz","doi":"10.1109/ICC47138.2019.9123181","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123181","url":null,"abstract":"This paper presents a comprehensive scheme to improve the offline as well as online computational time to simulate Burgers’ Equation. A reduced order approximation of the Full Order Model (FOM) is obtained using Non-Linear Moment Matching (NLMM) scheme. The expensive simulation of the underlying nonlinear Sylvester Partial Differential Equation (PDE) is reduced to a system of nonlinear algebraic equations by proper step-by-step simplifications. This reduces the offline computational cost of generating the orthonormal basis vectors substantially. Discrete Empirical Interpolation (DEIM) is used to further reduce the complexity of the underlying nonlinearity which improves the online computation time in solving the reduced system. Reduced Order Model (ROM) thus derived is compared with Proper Orthogonal Decomposition (POD) for different test inputs.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126451717","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123225
T. Singh, Wilm Decré, J. Swevers, G. Pipeleers
This article presents two approaches to simultaneously select optimal locations of sensors and actuators and design of a $mathcal{H}_{infty}$ dynamic output feedback controller. The first approach discussed in this paper is based on an iterative reweighted $ell_{1}$ norm regularization, an heuristic approach. The second approach converts the combined design into mixed boolean semi-definite programming optimization problem (MBSDP). A branch and bound (BNB) algorithm is adopted to solve this convex optimization problem to give a global optimal solution in terms of selection and control design. The two approaches are compared with an exhaustive search in terms of optimality and is applied to a vibration rejection control design of a composite plate.
{"title":"Concurrent design of an active vibration feedback controller and actuator/sensor selection for a composite plate","authors":"T. Singh, Wilm Decré, J. Swevers, G. Pipeleers","doi":"10.1109/ICC47138.2019.9123225","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123225","url":null,"abstract":"This article presents two approaches to simultaneously select optimal locations of sensors and actuators and design of a $mathcal{H}_{infty}$ dynamic output feedback controller. The first approach discussed in this paper is based on an iterative reweighted $ell_{1}$ norm regularization, an heuristic approach. The second approach converts the combined design into mixed boolean semi-definite programming optimization problem (MBSDP). A branch and bound (BNB) algorithm is adopted to solve this convex optimization problem to give a global optimal solution in terms of selection and control design. The two approaches are compared with an exhaustive search in terms of optimality and is applied to a vibration rejection control design of a composite plate.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126011193","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123176
Rashmi Ugarakhod, Serena Abraham, K. George
Neuro-controllers that are applicable to a wider range of dynamical systems are the focus of this paper. The proposed controllers are inversion-based wherein the inverse of the dynamical system is modelled using a feedforward neural network with a single hidden layer and trained with the online sequential learning algorithm. We demonstrate that the proposed controller is applicable to both single- and twolink robot manipulators, and is able to handle flexible joints and unmodelled dynamics.
{"title":"An Inversion-Based Neuro-Controller for Robot Manipulators","authors":"Rashmi Ugarakhod, Serena Abraham, K. George","doi":"10.1109/ICC47138.2019.9123176","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123176","url":null,"abstract":"Neuro-controllers that are applicable to a wider range of dynamical systems are the focus of this paper. The proposed controllers are inversion-based wherein the inverse of the dynamical system is modelled using a feedforward neural network with a single hidden layer and trained with the online sequential learning algorithm. We demonstrate that the proposed controller is applicable to both single- and twolink robot manipulators, and is able to handle flexible joints and unmodelled dynamics.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120829","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123190
Siddhartha Ganguly, M. K. Bera, P. Roy
This paper presents the design of robust tracking and model following (RTMF) controller based on multivariable super-twisting algorithm (MSTA) for a class of uncertain multi-input multi-output (MIMO) linear-time invariant (LTI) systems. The desired behavior of the uncertain plant is achieved by defining a model with ideal response characteristics, and a controller based on MSTA is designed so that the asymptotic convergence of error between the output of the plant and model can be guaranteed. To ensure the good transient response while tracking without overshoot, a model has been developed based on non-overshooting control technique. The robust super-twisting sliding mode controller helps to achieve the desired system performance by following this model response faithfully, rejecting the disturbance with a continuous control. Finally, this strategy has been validated through numerical simulation considering a MIMO quadruple tank process (QTP). The simulated results are presented to illustrate the effectiveness of the proposed RTMF controller.
{"title":"Robust Non-overshooting Tracking and Model Following Controller using Multi-variable Super-twisting Algorithm","authors":"Siddhartha Ganguly, M. K. Bera, P. Roy","doi":"10.1109/ICC47138.2019.9123190","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123190","url":null,"abstract":"This paper presents the design of robust tracking and model following (RTMF) controller based on multivariable super-twisting algorithm (MSTA) for a class of uncertain multi-input multi-output (MIMO) linear-time invariant (LTI) systems. The desired behavior of the uncertain plant is achieved by defining a model with ideal response characteristics, and a controller based on MSTA is designed so that the asymptotic convergence of error between the output of the plant and model can be guaranteed. To ensure the good transient response while tracking without overshoot, a model has been developed based on non-overshooting control technique. The robust super-twisting sliding mode controller helps to achieve the desired system performance by following this model response faithfully, rejecting the disturbance with a continuous control. Finally, this strategy has been validated through numerical simulation considering a MIMO quadruple tank process (QTP). The simulated results are presented to illustrate the effectiveness of the proposed RTMF controller.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"2304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130312786","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123201
P. Lathasree, A. Pashilkar, N. Sundararajan
This paper presents the application of the recently developed Generic Flight Controller design approach by the authors for a delta canard fighter aircraft referred to Aero Data Model in Research Environment (ADMIRE). The generic flight controller developed for high performance fixed wing aircrafts uses the good features of nonlinear dynamic inversion with time scale separation, control allocation and integrator backstepping with the major advantage that the whole design cycle can be carried out quickly. The results obtained for ADMIRE using generic flight controller results have been compared with those obtained from the ADMIRE controller taken from literature. The quick adoption of generic flight controller to ADMIRE has been demonstrated along with encouraging results.
本文介绍了作者新近开发的通用飞行控制器设计方法——研究环境中的航空数据模型(Aero Data Model in Research Environment，简称:仰慕)在某型三角鸭式战斗机上的应用。针对高性能固定翼飞机开发的通用飞行控制器，利用了非线性动态反演、时间尺度分离、控制分配和积分器反演等优点，其主要优点是可以快速完成整个设计周期。用通用飞行控制器的仿真结果与文献中采用的仿真结果进行了比较。通用飞行控制器的快速采用已被证明与令人鼓舞的结果。
{"title":"Application of Generic Flight Controller Design Approach for A Delta Canard Fighter Aircraft -ADMIRE","authors":"P. Lathasree, A. Pashilkar, N. Sundararajan","doi":"10.1109/ICC47138.2019.9123201","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123201","url":null,"abstract":"This paper presents the application of the recently developed Generic Flight Controller design approach by the authors for a delta canard fighter aircraft referred to Aero Data Model in Research Environment (ADMIRE). The generic flight controller developed for high performance fixed wing aircrafts uses the good features of nonlinear dynamic inversion with time scale separation, control allocation and integrator backstepping with the major advantage that the whole design cycle can be carried out quickly. The results obtained for ADMIRE using generic flight controller results have been compared with those obtained from the ADMIRE controller taken from literature. The quick adoption of generic flight controller to ADMIRE has been demonstrated along with encouraging results.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128012287","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123232
Rudrashis Majumder, Rakesh R. Warier, Debasish Ghose
Allocation of limited resources in a fair manner is essential after a natural disaster, especially if multiple emergencies occur at the same time. In this paper, a resource allocation methodology is proposed based on a two-player, non-cooperative, strategic form game where the crisis events, assumed to occur at different locations, are considered as the players. The objective is to obtain an optimal strategy for the individual players which leads to an effective allocation of an indivisible resource when the availability of the resource is insufficient to satisfy the need of all the players of the game. Each player incurs a cost for demanding resources based on a non-monetary cost function which is used to generate the game matrices. The cost function is formulated such that collective good and fair sharing are incentivised. It is shown that at least one pure strategy Nash equilibrium (PSNE) always exists for the formulated game. A desirable resource allocation strategy is obtained from PSNEs by applying the concepts of payoff and risk dominance.
{"title":"Game Theory-Based Allocation of Critical Resources during Natural Disasters","authors":"Rudrashis Majumder, Rakesh R. Warier, Debasish Ghose","doi":"10.1109/ICC47138.2019.9123232","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123232","url":null,"abstract":"Allocation of limited resources in a fair manner is essential after a natural disaster, especially if multiple emergencies occur at the same time. In this paper, a resource allocation methodology is proposed based on a two-player, non-cooperative, strategic form game where the crisis events, assumed to occur at different locations, are considered as the players. The objective is to obtain an optimal strategy for the individual players which leads to an effective allocation of an indivisible resource when the availability of the resource is insufficient to satisfy the need of all the players of the game. Each player incurs a cost for demanding resources based on a non-monetary cost function which is used to generate the game matrices. The cost function is formulated such that collective good and fair sharing are incentivised. It is shown that at least one pure strategy Nash equilibrium (PSNE) always exists for the formulated game. A desirable resource allocation strategy is obtained from PSNEs by applying the concepts of payoff and risk dominance.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133958570","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123193
Shantanu Prasad Butnwal, M. Vidyasagar
The matrix completion problem is the following: Suppose a matrix X is unknown except for an upper bound r on its rank. By sampling various entries of X, is it possible to “complete” the remaining entries and recover X exactly? There are two popular approaches to choosing the entries to be sampled. The first approach is to select these entries at random (either with or without replacement). The second approach is to choose the entries to be sampled in a deterministic fashion; this is the approach studied here. We show that if the entries to be sampled correspond to the edges of a so-called Ramanujan graph (defined below), then the measured matrix is in some sense an “optimal” approximation of the unknown matrix. This naturally raises the question of constructing such Ramanujan graphs. It turns out that there are very few explicit constructions of Ramanujan graphs. In this paper, we review the known methods and analyze their suitability for solving the matrix completion problem. The preceding discussion applies to the completion of square matrices. If one is interested in completing rectangular matrices, then it becomes necessary to choose the sample set to correspond to the edges of a Ramanujan bigraph. Until now, there has not been a single explicit construction of a Ramanujan bigraph. Two such constructions are given here. When specialized to the case of square matrices, our construction generates a new family of Ramanujan graphs.
{"title":"Some Observations about Ramanujan Graphs With Applications to Matrix Completion","authors":"Shantanu Prasad Butnwal, M. Vidyasagar","doi":"10.1109/ICC47138.2019.9123193","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123193","url":null,"abstract":"The matrix completion problem is the following: Suppose a matrix X is unknown except for an upper bound r on its rank. By sampling various entries of X, is it possible to “complete” the remaining entries and recover X exactly? There are two popular approaches to choosing the entries to be sampled. The first approach is to select these entries at random (either with or without replacement). The second approach is to choose the entries to be sampled in a deterministic fashion; this is the approach studied here. We show that if the entries to be sampled correspond to the edges of a so-called Ramanujan graph (defined below), then the measured matrix is in some sense an “optimal” approximation of the unknown matrix. This naturally raises the question of constructing such Ramanujan graphs. It turns out that there are very few explicit constructions of Ramanujan graphs. In this paper, we review the known methods and analyze their suitability for solving the matrix completion problem. The preceding discussion applies to the completion of square matrices. If one is interested in completing rectangular matrices, then it becomes necessary to choose the sample set to correspond to the edges of a Ramanujan bigraph. Until now, there has not been a single explicit construction of a Ramanujan bigraph. Two such constructions are given here. When specialized to the case of square matrices, our construction generates a new family of Ramanujan graphs.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130755893","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 : 2019-12-01DOI: 10.1109/ICC47138.2019.9123186
Subhash Chand Yogi, L. Behera
This paper proposes a novel switched system based control strategy to neutralize cyber enabled switching attacks on smart grids. The focus of this work revolves around demonstrating the immunity of the smart grid against attacks involving the intruder trying to switch the load that is connected to one or more generators on the grid. The work utilizes the concept of Common Lyapunov function (CLF) to maintain the transient stability under any arbitrary switching attack. The stability of the switched system is assessed using Lyapunov’s stability theory and the condition for system stability is obtained in terms of sum of square (SOS) constraints. The CLF and control gain are simultaneously estimated in the proposed approach. The effectiveness of the proposed control strategy is evaluated using numerical simulations, against coordinated switching attacks. It can be observed that the proposed scheme is able to maintain stable grid operation even in the presence of a cyber intrusion.
{"title":"A Control Strategy for the Prevention of Cyber-Physical Switching Attacks on Smart Grids","authors":"Subhash Chand Yogi, L. Behera","doi":"10.1109/ICC47138.2019.9123186","DOIUrl":"https://doi.org/10.1109/ICC47138.2019.9123186","url":null,"abstract":"This paper proposes a novel switched system based control strategy to neutralize cyber enabled switching attacks on smart grids. The focus of this work revolves around demonstrating the immunity of the smart grid against attacks involving the intruder trying to switch the load that is connected to one or more generators on the grid. The work utilizes the concept of Common Lyapunov function (CLF) to maintain the transient stability under any arbitrary switching attack. The stability of the switched system is assessed using Lyapunov’s stability theory and the condition for system stability is obtained in terms of sum of square (SOS) constraints. The CLF and control gain are simultaneously estimated in the proposed approach. The effectiveness of the proposed control strategy is evaluated using numerical simulations, against coordinated switching attacks. It can be observed that the proposed scheme is able to maintain stable grid operation even in the presence of a cyber intrusion.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116491406","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
扫码关注我们
求助内容：
应助结果提醒方式：