{"title":"Iterative identification method for linear continuous-time systems","authors":"M. Campi, T. Sugie, F. Sakai","doi":"10.1109/TAC.2008.929371","DOIUrl":"https://doi.org/10.1109/TAC.2008.929371","url":null,"abstract":"This paper presents a novel approach to identification of continuous-time systems directly from the sampled I/O data based on trial iterations. The method achieves identification through ILC (iterative learning control) concepts in the presence of heavy measurement noise. The robustness against measurement noise is achieved through (i) projection of continuous-time I/O signals onto a finite dimensional parameter space and (ii) Kalman filter type noise reduction. In addition, an alternative simpler method is given with some robustness analysis. Its effectiveness is demonstrated through numerical examples for a non-minimum phase plant","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130538942","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":"Behaviors Defined by Rational Functions","authors":"J. Willems, Y. Yamamoto","doi":"10.1109/CDC.2006.377773","DOIUrl":"https://doi.org/10.1109/CDC.2006.377773","url":null,"abstract":"In this article behaviors defined by `differential equations' involving matrices of rational functions are introduced. Conditions in terms of controllability and stabilizability for the existence of rational representations that are prime over various rings are derived","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124781378","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 fault tolerant control strategy for linear systems subject to a class of faults","authors":"M. Corradini, A. Manni, G. Orlando, G. Parlangeli","doi":"10.23919/ECC.2007.7068447","DOIUrl":"https://doi.org/10.23919/ECC.2007.7068447","url":null,"abstract":"This paper proposes a fault tolerant control strategy for failures belonging to a class of functions. To this purpose a robust sliding mode controller has been designed ensuring the robust boundedness of system trajectories. The controlled system is proved to have a complete fault tolerance to such faults, being passive for soft faults and active for severe faults. Theoretical results have been validated by simulation","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132958173","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":"Robust Stability/Performance Analysis for Linear Time-Invariant Polynomially Parameter-Dependent Systems using Polynomially Parameter-Dependent Lyapunov Functions","authors":"M. Sato, D. Peaucelle","doi":"10.9746/VE.SICETR1965.43.472","DOIUrl":"https://doi.org/10.9746/VE.SICETR1965.43.472","url":null,"abstract":"This paper addresses robust stability, H2 performance, and Hinfin performance analysis for linear time-invariant parameter-dependent (LTIPD) systems using parameter-dependent Lyapunov functions (PDLFs). The state-space matrices of the LTIPD systems are set to be parameter-dependent in negative as well as positive power series with respect to parameters, and PDLFs are also set to be parameter-dependent in negative as well as positive power series with respect to parameters. Our results are derived using \"slack variables\" and restricting them to be parameter-independent, therefore, they are only sufficient conditions for the original analysis problems. However, we demonstrate the effectiveness of our results with randomly generated numerical examples and several numerical examples which are borrowed from existing papers","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122105427","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":"Online Modification of Reference Trajectories for Multiple Robots With Collision Avoidance","authors":"K. Sakurama, K. Nakano","doi":"10.9746/VE.SICETR1965.43.1037","DOIUrl":"https://doi.org/10.9746/VE.SICETR1965.43.1037","url":null,"abstract":"This paper addresses online modification of reference trajectories for multiple robots with collision avoidance. First, a smooth mapping dependent on the relative distances between the robots is proposed to coordinate collision-free motion from given reference trajectories. The trajectories modified by the mapping make the robots avoid collisions with each other, and are smooth enough to be tracked by the robots. Moreover, when the reference trajectories are separated from each other, the mapping is identical and the modified trajectories remain unchanged from the original ones. Next, a value function is considered consisting of the distances between the original and modified reference trajectories. From the viewpoint of minimizing the value function, a way to choose design parameters for the mapping is specified. Finally, a simulation for three mobile robots demonstrates the effectiveness of the proposed method","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128822172","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":"Multi-Agent Task Assignment in the Bandit Framework","authors":"J. L. Ny, M. Dahleh, E. Feron","doi":"10.1109/CDC.2006.377612","DOIUrl":"https://doi.org/10.1109/CDC.2006.377612","url":null,"abstract":"We consider a task assignment problem for a fleet of UAVs in a surveillance/search mission. We formulate the problem as a restless bandits problem with switching costs and discounted rewards: there are TV sites to inspect, each one of them evolving as a Markov chain, with different transition probabilities if the site is inspected or not. The sites evolve independently of each other, there are transition costs c ij for moving between sites i and j isin {1,..., N}, rewards when visiting the sites, and we maximize a mixed objective function of these costs and rewards. This problem is known to be PSPACE-hard. We present a systematic method, inspired from the work of Bertsimas and Nino-Mora (2000) on restless bandits, for deriving a linear programming relaxation for such locally decomposable MDPs. The relaxation is computable in polynomial-time offline, provides a bound on the achievable performance, as well as an approximation of the cost-to-go which can be used online in conjunction with standard suboptimal stochastic control methods. In particular, the one-step lookahead policy based on this approximate cost-to-go reduces to computing the optimal value of a linear assignment problem of size N. We present numerical experiments, for which we assess the quality of the heuristics using the performance bound","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116290103","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":"Clinical data based optimal STI strategies for HIV: a reinforcement learning approach","authors":"D. Ernst, G. Stan, J. Gonçalves, L. Wehenkel","doi":"10.1109/CDC.2006.377527","DOIUrl":"https://doi.org/10.1109/CDC.2006.377527","url":null,"abstract":"This paper addresses the problem of computing optimal structured treatment interruption strategies for HIV infected patients. We show that reinforcement learning may be useful to extract such strategies directly from clinical data, without the need of an accurate mathematical model of HIV infection dynamics. To support our claims, we report simulation results obtained by running a recently proposed batch-mode reinforcement learning algorithm, known as fitted Q iteration, on numerically generated data","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123656951","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":"Reverse Search for Parametric Linear Programming","authors":"Colin N. Jones, J. Maciejowski","doi":"10.1109/CDC.2006.377799","DOIUrl":"https://doi.org/10.1109/CDC.2006.377799","url":null,"abstract":"This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so-called critical regions) and a constant space complexity. This is an improvement over the quadratic and linear computational and space complexities of current approaches. Current implementations of the proposed approach become faster than existing methods for large problems. Extensions of this method are proposed that make the computational requirements lower than those of existing approaches in all cases, while allowing for efficient parallelisation and bounded memory usage","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115679154","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":"Dynamic Controller of Switched Linear Systems : a Common Lyapunov Function Approach","authors":"S. Chaib, D. Boutat, A. Benali, F. Kratz","doi":"10.1109/CDC.2006.376905","DOIUrl":"https://doi.org/10.1109/CDC.2006.376905","url":null,"abstract":"This paper is devoted to the problem of design a dynamic controller of switched linear systems. In the first part of this paper, we give some remarks about the influences of switching signal on the asymptotic stability of switched systems. We give a practical example to generate a large class of switching signals. The second part is devoted to the switched dynamic controller design, based on a common Lyapunov function approach. A sufficient condition is formulated as an LMI problem for the switched controller design under arbitrary switching. A stabilizing switched controller with regional pole placements is also formulated as a convex problem, an LMI approach is used to derive the switched dynamic controller with performance limitations","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116451455","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 the Stability of Linear Delay-Differential Algebraic Systems: Exact Conditions via Matrix Pencil Solutions","authors":"S. Niculescu, Peilin Fu, Jie Chen","doi":"10.1109/CDC.2006.377823","DOIUrl":"https://doi.org/10.1109/CDC.2006.377823","url":null,"abstract":"In this paper we study the stability properties of a class of linear systems expressed by semi-explicit delay differential algebraic equations, that is a system of functional differential equations coupled with a system of (continuous-time) difference equations. We show that the stability analysis (delay-independent, delay-dependent, crossing characterization) in the commensurate delay case can be performed by computing the generalized eigenvalues of certain matrix pencils, which can be executed efficiently and with high precision. The results extend previously known work on retarded, neutral, and lossless propagation systems, and demonstrate that similar stability tests can be derived for such systems","PeriodicalId":308528,"journal":{"name":"Proceedings of the 45th IEEE Conference on Decision and Control","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124104809","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}