首页> 外文期刊>European Journal of Control >Stabilisability and Stability for Explicit and lmplicit Polynomial Systems: A Symbolic Computation Approach`
【24h】

Stabilisability and Stability for Explicit and lmplicit Polynomial Systems: A Symbolic Computation Approach`

机译:显式和隐式多项式系统的稳定性和稳定性:一种符号计算方法

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

摘要

Stabilisability and stability for a large class of discrete-time polynomial systems can be decided using symbolic computation packages for quantifier elimination in the first order theory of real closed fields. A large class of constraints on states of the system and control inputs can be treated in the same way. Stabilily of a system can be checked by constructing a Lyapunov function, which is assumed to belong to a class of polynomial posilive definite functions. Moreover, we show that stability/ stabilisability can be decided directly from the zeta-dlta definition.
机译:可以使用符号计算包来确定大量离散时间多项式系统的稳定性和稳定性,以消除实数封闭域的一阶理论中的量词。可以用相同的方式处理对系统状态和控制输入的大量限制。可以通过构造Lyapunov函数来检查系统的稳定性,该函数假定属于一类多项式正定函数。此外,我们表明稳定性/稳定性可以直接从zeta-dlta定义中确定。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号