{"title":"Bounded error flowpipe computation of parameterized linear systems","authors":"Ratan Lal, P. Prabhakar","doi":"10.1109/EMSOFT.2015.7318279","DOIUrl":null,"url":null,"abstract":"We consider the problem of computing a bounded error approximation of the solution over a bounded time [0,T], of a parameterized linear system, x(t) = Ax(t), where A is constrained by a compact polyhedron Ω. Our method consists of sampling the time domain [0,T] as well as the parameter space Ω and constructing a continuous piecewise bilinear function which interpolates the solution of the parameterized system at these sample points. More precisely, given an ε > 0, we compute a sampling interval δ > 0, such that the piecewise bilinear function obtained from the sample points is within ε of the original trajectory. We present experimental results which suggest that our method is scalable.","PeriodicalId":297297,"journal":{"name":"2015 International Conference on Embedded Software (EMSOFT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Embedded Software (EMSOFT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMSOFT.2015.7318279","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24
Abstract
We consider the problem of computing a bounded error approximation of the solution over a bounded time [0,T], of a parameterized linear system, x(t) = Ax(t), where A is constrained by a compact polyhedron Ω. Our method consists of sampling the time domain [0,T] as well as the parameter space Ω and constructing a continuous piecewise bilinear function which interpolates the solution of the parameterized system at these sample points. More precisely, given an ε > 0, we compute a sampling interval δ > 0, such that the piecewise bilinear function obtained from the sample points is within ε of the original trajectory. We present experimental results which suggest that our method is scalable.