• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IFAC PapersOnLine >Bounds on set exit times of affine systems, using Linear Matrix Inequalities ?
【24h】

Bounds on set exit times of affine systems, using Linear Matrix Inequalities ?

机译：使用线性矩阵Inequality的设置出口时的界限 ？

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can easily compute the trajectories between two successive switches as the solution of an affine ODE. Each switching time can be seen as a positive real root of an analytic function, thereby allowing for efficient computation by using root finding algorithms. These algorithms require a finite interval, within which to search for the switching time. In this paper, we study the problem of computing upper bounds on such switching times, and we restrict our attention to stable time-invariant affine systems. We provide semi-definite programming models to compute upper bounds on the time taken by the trajectories of an affine ODE to exit a set described as the intersection of a few generalized ellipsoids. Through numerical experiments, we show that the resulting bounds are tighter than bounds reported before, while requiring only a modest increase in computation time.
机译：有效计算切换仿射系统的轨迹的可能性，如果对于任何此类混合系统，我们可以设法有效地计算切换时间的序列。一旦计算了切换时间，我们就可以轻松计算两个连续交换机之间的轨迹作为仿射ode的解决方案。每个切换时间可以被视为分析功能的正实根，从而允许通过使用根发现算法有效计算。这些算法需要有限的间隔，在其内进行搜索切换时间。在本文中，我们研究了在这种切换时间计算上限的问题，并限制了我们对稳定的时间不变仿射系统的关注。我们提供半定编程模型来计算由仿射竞争的轨迹所花费的仿射器的轨迹以退出描述为几个广义椭圆体的交叉点的设置。通过数值实验，我们表明所得界限比以前报告的界限更紧，同时只需要一个适度的计算时间增加。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号