首页> 外文会议>Chinese Control Conference >A Simple Sufficient Criterion of the Global Controllability for a Class of Planar Polynomial Systems
【24h】

A Simple Sufficient Criterion of the Global Controllability for a Class of Planar Polynomial Systems

机译:一类平面多项式系统的全局可控性的简单充分标准

获取原文

摘要

Since the global controllability of planar nonlinear systems was completely solved and the necessary and sufficient condition was obtained, it has been certainly worth finding a feasible algorithm to check up on the condition. However, the condition is too complicated to be verified generally, which limits its application largely. This paper will investigate a sufficient condition with less computational complexity for the global controllability of planar polynomial systems. Based on the degree of criterion function of planar systems on control curves and mathematics mechanization method, we present a simple sufficient criterion algorithm for the global controllability of a class of planar polynomial systems. All conditions are imposed on the structure of the system only. Finally, we give some examples to show the application of our results.
机译:由于完全解决了平面非线性系统的全局可控性,并且获得了必要和充分的条件,因此肯定值得寻找可行的算法来检查条件。然而,通常通常过于复杂的条件,通常在很大程度上限制其应用。本文将探讨具有较少计算复杂性的足够条件,以实现平面多项式系统的全局可控性。基于平面系统对控制曲线和数学机械化方法的标准功能,我们介绍了一类平面多项式系统的全局可控性的简单充分标准算法。所有条件都仅对系统的结构施加。最后,我们提供了一些示例来显示我们的结果的应用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号