{"title":"Subspace identification of multivariable LPV systems: a novel approach","authors":"J. Wingerden, M. Verhaegen","doi":"10.1109/CACSD.2008.4627340","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627340","url":null,"abstract":"In this paper we present a novel algorithm to identify LPV systems with affine parameter dependence. Ideas from closed-loop LTI subspace identification are used to formulate the input-output behavior of an LPV system. From this input-output behavior the LPV equivalent of the Markov parameters can be estimated. We show that with this estimate the product between the observability matrix and state sequence can be reconstructed and an SVD can be used to estimate the state sequence and consequently the system matrices. The curse of dimensionality in subspace LPV identification will appear and the kernel method is proposed as a partial remedy. The working of the algorithm is illustrated with two simulation examples.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125483214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parallel Schur method for solving continuous-time algebraic Riccati equations","authors":"R. Granat, B. Kågström, D. Kressner","doi":"10.1109/CACSD.2008.4627344","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627344","url":null,"abstract":"Numerical algorithms for solving the continuous-time algebraic Riccati matrix equation on a distributed memory parallel computer are considered. In particular, it is shown that the Schur method, based on computing the stable invariant subspace of a Hamiltonian matrix, can be parallelized in an efficient and scalable way. Our implementation employs the state-of-the-art library ScaLAPACK as well as recently developed parallel methods for reordering the eigenvalues in a real Schur form. Some experimental results are presented, confirming the scalability of our implementation and comparing it with an existing implementation of the matrix sign iteration from the PLiCOC library.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114476293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparison of some Gramian based interaction measures","authors":"B. Halvarsson","doi":"10.1109/CACSD.2008.4627362","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627362","url":null,"abstract":"In this paper different interaction measures are reviewed and compared. In particular, the two Gramian based interaction measures the Hankel interaction index array (HIIA) and the participation matrix (PM) are considered. Moreover, motivations for incorporating the concept of output controllability in an interaction measure are given and a H2 norm based interaction measure is investigated.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115413037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Autotuning of PI+p controllers","authors":"A. Leva","doi":"10.1109/CACSD.2008.4627363","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627363","url":null,"abstract":"This manuscript is part of a long-term research, the aim of which is to establish methodologically grounded relationships between model- and relay-based tuning of industrial regulators, and to derive from those relationships some regulator synthesis procedures that couple the advantages of model-based methods to the simplicity and clarity of relay experiments. In this particular work, the addressed controller structure is the ldquoPI+prdquo, i.e., a PI controller augmented with an additional, stable pole. The advantages of using the combined model-relay-based approach on that structure are evidenced, and some simulation results are reported to back up the statement.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116371186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On some approaches to the autotuning of cascade controls","authors":"A. Leva, A. Marinelli","doi":"10.1109/CACSD.2008.4627348","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627348","url":null,"abstract":"Some approaches to the autotuning of cascade controls are comparatively analysed, based on a conveniently characterised test batch. The reported analysis results is some remarks and possible guidelines for the design of cascade autotuners. It is worth noting that the presented simulation study considers the ldquoidentification experimentrdquo as part of the autotuning procedure.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131550451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Nonparametric methods for the identification of linear parameter varying systems","authors":"K. Hsu, T. Vincent, K. Poolla","doi":"10.1109/CACSD.2008.4627343","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627343","url":null,"abstract":"In this paper, we consider the identification of linear parameter varying (LPV) systems. By taking a nonparametric approach, we do not impose a priori parameterizations on the model structure, nor is it assumed that a natural parameterization is suggested from an analytical understanding of the underlying process. In this case, it is shown that the LPV identification problem reduces to a closely related problem in nonlinear system identification. By referring to previous results, we offer a dispersion-based cost criterion and a sufficient condition on the exogenous parameter under which asymptotic convergence of the identified LPV system is assured almost surely.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134510135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Memory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations","authors":"D. Kressner","doi":"10.1109/CACSD.2008.4627370","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627370","url":null,"abstract":"This paper considers the solution of large-scale Lyapunov matrix equations of the form AX + XAT = -bbT . The Arnoldi method is a simple but sometimes ineffective approach to deal with such equations. One of its major drawbacks is excessive memory consumption caused by slow convergence. To overcome this disadvantage, we propose two-pass Krylov subspace methods, which only compute the solution of the compressed equation in the first pass. The second pass computes the product of the Krylov subspace basis with a low-rank approximation of this solution. For symmetric A, we employ the Lanczos method; for nonsymmetric A, we extend a recently developed restarted Arnoldi method for the approximation of matrix functions. Preliminary numerical experiments reveal that the resulting algorithms require significantly less memory at the expense of extra matrix-vector products.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new approach to the dynamic RGA analysis of uncertain systems","authors":"Miguel Castano Arranz, W. Birk","doi":"10.1109/CACSD.2008.4627372","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627372","url":null,"abstract":"This paper deals with DRGA analysis for uncertain systems. Uncertainties in a process model can be translated into uncertainties in the DRGA which might invalidate the decision on the variable paring in decentralized control. Bounds for the uncertainties in the DRGA of a multivariable process are derived for a given nominal process model with known uncertainty region. The resulting uncertainty region for the DRGA is used to assess the validity of decisions based on the nominal DRGA. The methodology for the computation of the bounds is currently restricted to the 2-by-2 case. Beside an explanatory example, a case study on a coal injection vessel is conducted and discussed.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123615426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of an adaptive Takagi-Sugeno fuzzy identification approach for interaction analysis of MIMO nonlinear systems","authors":"S. Gharibshaiyan, K. Salahshoor","doi":"10.1109/CACSD.2008.4627360","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627360","url":null,"abstract":"Obtaining an accurate quantitative dynamic model for most industrial processes is a challenging task due to the interaction between their multiple input-output variables. In this paper, a systematic approach is presented to identify a nonlinear multi-input multi-output process using an online adaptive Takagi-Sugeno (TS) fuzzy method in order to enable its interaction analysis. For this purpose, a relative gain array (RGA) measure is used to evaluate the interaction characteristic. A new development is presented to calculate the interaction measure around the local operating point of MIMO processes based on the most recent fuzzy rule-based identified process model. The performance of the proposed approach is demonstrated on a distillation column benchmark case study in the LV-configuration.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121070000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A randomized cutting plane scheme for convex optimization","authors":"F. Dabbene","doi":"10.1109/CACSD.2008.4627353","DOIUrl":"https://doi.org/10.1109/CACSD.2008.4627353","url":null,"abstract":"In this paper we consider the basic problem of minimizing a linear function over a convex set in an n-dimensional space. We present a randomized scheme based on an interior-point cutting plane (CP) algorithm. First, a formal analysis of the proposed method is carried out under the abstract assumption on the availability of a Uniform Generation Oracle. Under this assumption, a rigorous result is presented showing that the proposed algorithm has an expected rate of convergence that improves upon existing CP methods based on center of gravity. The practical implementation of the method using an hit and run generator is discussed in the second part of the paper.","PeriodicalId":424461,"journal":{"name":"2008 IEEE International Conference on Computer-Aided Control Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128395089","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}