...
首页> 外文期刊>IEEE Transactions on Automatic Control >Tree-Based Algorithms for the Stability of Discrete-Time Switched Linear Systems Under Arbitrary and Constrained Switching
【24h】

Tree-Based Algorithms for the Stability of Discrete-Time Switched Linear Systems Under Arbitrary and Constrained Switching

机译:基于树的离散切换线性系统在任意约束切换下的稳定性算法

获取原文
获取原文并翻译 | 示例
           

摘要

We present a direct approach to study the stability of discrete-time switched linear systems that can be applied to arbitrary switching, as well as when switching is constrained by a switching automaton. We explore the tree of possible matrix products, by
机译:我们提出了一种直接的方法来研究离散时间切换线性系统的稳定性,该系统可以应用于任意切换,以及当切换受自动机约束时。我们通过以下方式探索可能的矩阵乘积的树

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号