期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Global stabilisation for a class of uncertain non-linear systems:a novel non-recursive design framework
1
作者 Chuanlin Zhang Jun Yang Changyun Wen 《Journal of Control and Decision》 EI 2017年第2期57-69,共13页
In this paper,a novel global non-recursive stabilisation design framework is addressed for a class of inherent non-linear systems with the presence of system uncertainties and external nonvanishing disturbances.By vir... In this paper,a novel global non-recursive stabilisation design framework is addressed for a class of inherent non-linear systems with the presence of system uncertainties and external nonvanishing disturbances.By virtue of the facility that the weighted homogeneity brings into the system synthesis procedure,a non-recursive design method is proposed to yield a globally effectiveness robust controller with its expression following a quasi-linear manner.By proceeding with a rigorous non-recursive stability analysis framework,which covers both global asymptotical and finite-time convergence cases,the common recursively treated derivative items in backsteppingbased methods are totally avoided.Inspired by the homogeneous domination technique,a scaling gain performed as a bandwidth factor is introduced into the original system and hence the robustness of the controlled system can be adjusted to meet the practical performance requirements.A numerical example and its control performance simulations are given to illustrate the effectiveness and simplicity of the proposed controller design framework. 展开更多
关键词 Non-linear systems non-recursive design homogeneous system theory finite-time control
原文传递
A Non-Recursive Algorithm Computing Set Expressions
2
作者 练林 张一立 唐常杰 《Journal of Computer Science & Technology》 SCIE EI 1988年第4期310-316,共7页
This paper concerns set expressions satisfying some constraints. Although algorithms processing expressions (for every kind) have been proposed in compilers, almost all of them use stacks and recursions, and adopt com... This paper concerns set expressions satisfying some constraints. Although algorithms processing expressions (for every kind) have been proposed in compilers, almost all of them use stacks and recursions, and adopt complicated parsing techniques. However, the simplification of set expressions can be done easily by its special characteristics. In this paper, we propose linear, nonrecursive, and thus efficient algorithms simplifying set expressions. The method can be well used in proposition calculus. 展开更多
关键词 RES A non-recursive Algorithm Computing Set Expressions
全文增补中
上一页 1 下一页 到第
使用帮助 返回顶部