{"title":"Discussion on: Adaptive Field-oriented Control of Synchronous Motors with Damping Windings","authors":"R. Dhaouadi","doi":"10.3166/ejc.14.196-200","DOIUrl":"https://doi.org/10.3166/ejc.14.196-200","url":null,"abstract":"","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82841031","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 by Liu and Qiu is concerned with the decentralized supervisory control problem for fuzzy discrete event systems (FDESs) with partial and fuzzy observations. On the one hand, this work is a natural continuation of the authors’ paper [8] in which the centralized control under fuzzy observations was discussed; on the other hand, it is a good extension and complement to some related results in [1]. In terms of the decentralized supervisory control, the key point of divergence between the paper and [1] is that the former allows observations to be fuzzy. The fuzziness of observations, originally suggested by Lin and Ying in [4,5], seems an interesting feature of FDESs and desires formal study. In addition to introducing several necessary definitions, the main technical contributions of the paper are a decentralized supervisory control theorem and a computing approach to verifying the fuzzy coobservability condition in this theorem. The theorem shows that there exist non-blocking local fuzzy supervisors if and only if the fuzzy language to be synthesized is fuzzy controllable, fuzzy co-observable, and closed. Determining the existence of local fuzzy supervisors appeals to methods for checking the fuzzy controllability and the fuzzy co-observability. The paper develops a feasible way to test the fuzzy coobservability condition, since another method for checking the fuzzy controllability condition has already been introduced in [7]. Such a way is highly dependent on the max-min fuzzy automaton modeling of FDESs. More explicitly, it is the max-min operator in the model that makes the number of all states reachable from any state in a system finite, which clearly facilitates the use of computing tree.
{"title":"Discussion on: Decentralized Supervisory Control of Fuzzy Discrete Event Systems","authors":"Yongzhi Cao","doi":"10.3166/ejc.14.244-246","DOIUrl":"https://doi.org/10.3166/ejc.14.244-246","url":null,"abstract":"The paper by Liu and Qiu is concerned with the decentralized supervisory control problem for fuzzy discrete event systems (FDESs) with partial and fuzzy observations. On the one hand, this work is a natural continuation of the authors’ paper [8] in which the centralized control under fuzzy observations was discussed; on the other hand, it is a good extension and complement to some related results in [1]. In terms of the decentralized supervisory control, the key point of divergence between the paper and [1] is that the former allows observations to be fuzzy. The fuzziness of observations, originally suggested by Lin and Ying in [4,5], seems an interesting feature of FDESs and desires formal study. In addition to introducing several necessary definitions, the main technical contributions of the paper are a decentralized supervisory control theorem and a computing approach to verifying the fuzzy coobservability condition in this theorem. The theorem shows that there exist non-blocking local fuzzy supervisors if and only if the fuzzy language to be synthesized is fuzzy controllable, fuzzy co-observable, and closed. Determining the existence of local fuzzy supervisors appeals to methods for checking the fuzzy controllability and the fuzzy co-observability. The paper develops a feasible way to test the fuzzy coobservability condition, since another method for checking the fuzzy controllability condition has already been introduced in [7]. Such a way is highly dependent on the max-min fuzzy automaton modeling of FDESs. More explicitly, it is the max-min operator in the model that makes the number of all states reachable from any state in a system finite, which clearly facilitates the use of computing tree.","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84423961","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}
This criterion theoretically requires the integration of the system equations until infinity. A possible way to overcome this impossible investigation is the approximation through an integration over a sufficiently long time interval as proposed in [1]. In the discussed paper the authors developed a criterion imposing that the system is averagely normcontractive over a finite time interval. This criterion judges an investigated system as stable if
{"title":"Discussion on: Almost Sure Stability of Stochastic Linear Systems with Ergodic Parameters","authors":"T. Most, H. Ishii, Xiaojun Geng","doi":"10.3166/ejc.14.124-130","DOIUrl":"https://doi.org/10.3166/ejc.14.124-130","url":null,"abstract":"This criterion theoretically requires the integration of the system equations until infinity. A possible way to overcome this impossible investigation is the approximation through an integration over a sufficiently long time interval as proposed in [1]. In the discussed paper the authors developed a criterion imposing that the system is averagely normcontractive over a finite time interval. This criterion judges an investigated system as stable if","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85578379","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":"Discussion on: \"Adaptive Control Design and Experiments for LAAS \"Helicopter\" Benchmark","authors":"R. Lozano, J. Escareño","doi":"10.3166/ejc.14.340-341","DOIUrl":"https://doi.org/10.3166/ejc.14.340-341","url":null,"abstract":"","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85558394","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 Arnoldi and Lanczos algorithms, which belong to the class of Krylov subspace methods, are increasingly used for model reduction of large-scale systems. The standard versions of the algorithms tend to create reduced order models that poorly approximate low frequency dynamics. Rational Arnoldi and Lanczos algorithms produce reduced models that approximate dynamics at various frequencies. This paper tackles the issue of developing simple Arnoldi and Lanczos equations for the rational case. This allows a simple error analysis to be carried out for both algorithms and permits the development of computationally efficient model reduction algorithms, where the frequencies at which the dynamics are to be matched can be updated adaptively.
{"title":"Adaptive Rational Interpolation: Arnoldi and Lanczos-like Equations","authors":"Michalis Frangos, I. Jaimoukha","doi":"10.3166/ejc.14.342354","DOIUrl":"https://doi.org/10.3166/ejc.14.342354","url":null,"abstract":"The Arnoldi and Lanczos algorithms, which belong to the class of Krylov subspace methods, are increasingly used for model reduction of large-scale systems. The standard versions of the algorithms tend to create reduced order models that poorly approximate low frequency dynamics. Rational Arnoldi and Lanczos algorithms produce reduced models that approximate dynamics at various frequencies. This paper tackles the issue of developing simple Arnoldi and Lanczos equations for the rational case. This allows a simple error analysis to be carried out for both algorithms and permits the development of computationally efficient model reduction algorithms, where the frequencies at which the dynamics are to be matched can be updated adaptively.","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87179356","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":"Discussion on: \"Hybrid Parameter-varying Model Predictive Control for Autonomous Vehicle Steering'. Reply by the Authors","authors":"J. Asgari, F. Borrelli, H. E. Tseng, R. Rajamani","doi":"10.3166/ejc.14.432-436","DOIUrl":"https://doi.org/10.3166/ejc.14.432-436","url":null,"abstract":"","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75100222","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":"Discussion on: \"Digital Control of Interferometric Metrology Lines\"","authors":"M. Basso, D. Materassi","doi":"10.3166/ejc.13.416-418","DOIUrl":"https://doi.org/10.3166/ejc.13.416-418","url":null,"abstract":"","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88431548","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":"Discussion on: \"Stabilization of Networked Control System with Time Delays and Data-packet Losses\"","authors":"A. Çela, Mohamed El Mongi Ben Gaid, C. Ionete","doi":"10.3166/ejc.13.351-355","DOIUrl":"https://doi.org/10.3166/ejc.13.351-355","url":null,"abstract":"","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90612227","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}
Charles Poussot-Vassal, Z. Szabó, P. Gáspár, J. Bokor
{"title":"Discussion on: Combining Slip and Deceleration Control for Brake-by-wire Control Systems: A Sliding-mode Approach","authors":"Charles Poussot-Vassal, Z. Szabó, P. Gáspár, J. Bokor","doi":"10.3166/ejc.13.612-617","DOIUrl":"https://doi.org/10.3166/ejc.13.612-617","url":null,"abstract":"","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74873930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We analyze and solve various problems of security, information assurance and trust in dynamic wireless networks. These include detection and defense against attacks, detection of propagating viruses, evaluation of intrusion systems, attacks at the physical, MAC and routing protocols, trust establishment-dynamicsmanagement. We demonstrate persistently that systems and control models and methodologies provide new and powerful techniques to analyze these problems. We describe the use of distributed change detection methods and algorithms for intrusion detection and the use of non-cooperative games for the detection and defense against attacks at all layers. We demonstrate how Bayesian decision theory can be used to evaluate intrusion detection systems and we resolve some key problems in this area. We use game theoretic methods again to develop robust protocols against attacks, including Byzantine ones. We provide an in-depth investigation of trust establishment and computation in such networks. We describe various methods for distributed trust evaluation and the associated trust (and mistrust) ‘spreading’ dynamics. We investigate rules and policies that establish ‘trust-connected’ networks using only local interactions, and find the parameters (e.g. topology type) that speed up or slow down this transition. We describe and explain the phase transition phenomena that we have found in these evolutions. We model the interactions among agents as cooperative games and show that trust can encourage agents to collaborate. This leads us to a fundamental analytical technique, constrained coalitional games, that can be used to evaluate tradeoffs in collaborative networks in various areas: communications, sensors, economics, sociology, biology. We also describe a model for trust evaluation that uses pairwise iterated graph games between the agents to create a ‘trust reputation’ with evolution coupled to the game dynamics. Finally we present a new modeling framework for trust metric evaluation as linear iterations over ordered semirings. This allows us to formulate problems of resilience of trust metrics and trust evaluation to attacks.
{"title":"Security and Trust for Wireless Autonomic Networks","authors":"J. Baras","doi":"10.3166/ejc.13.105-133","DOIUrl":"https://doi.org/10.3166/ejc.13.105-133","url":null,"abstract":"We analyze and solve various problems of security, information assurance and trust in dynamic wireless networks. These include detection and defense against attacks, detection of propagating viruses, evaluation of intrusion systems, attacks at the physical, MAC and routing protocols, trust establishment-dynamicsmanagement. We demonstrate persistently that systems and control models and methodologies provide new and powerful techniques to analyze these problems. We describe the use of distributed change detection methods and algorithms for intrusion detection and the use of non-cooperative games for the detection and defense against attacks at all layers. We demonstrate how Bayesian decision theory can be used to evaluate intrusion detection systems and we resolve some key problems in this area. We use game theoretic methods again to develop robust protocols against attacks, including Byzantine ones. We provide an in-depth investigation of trust establishment and computation in such networks. We describe various methods for distributed trust evaluation and the associated trust (and mistrust) ‘spreading’ dynamics. We investigate rules and policies that establish ‘trust-connected’ networks using only local interactions, and find the parameters (e.g. topology type) that speed up or slow down this transition. We describe and explain the phase transition phenomena that we have found in these evolutions. We model the interactions among agents as cooperative games and show that trust can encourage agents to collaborate. This leads us to a fundamental analytical technique, constrained coalitional games, that can be used to evaluate tradeoffs in collaborative networks in various areas: communications, sensors, economics, sociology, biology. We also describe a model for trust evaluation that uses pairwise iterated graph games between the agents to create a ‘trust reputation’ with evolution coupled to the game dynamics. Finally we present a new modeling framework for trust metric evaluation as linear iterations over ordered semirings. This allows us to formulate problems of resilience of trust metrics and trust evaluation to attacks.","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79101882","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
扫码关注我们
求助内容：
应助结果提醒方式：