共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
3.
4.
5.
同时含有状态和输入时滞系统的滑模控制 总被引:6,自引:0,他引:6
研究同时舍状态和输入时滞的系统交结构控制问题,基于LMI,给出了存在滑动模态的时滞相关的充分条件,利用LMI的解,得到了两种不同的滑动模态和控制器的设计方法,所提出的方法简单量行,具有较小的保守性,可进一步推广到多时滞和不确定时滞系统。 相似文献
6.
具有时滞的Lurie型控制系统绝对稳定的时滞相关准则 总被引:15,自引:0,他引:15
研究了具有时滞的Lurie型控制系统的绝对稳定性,利用矩阵不等式的方法出了系统绝对稳定的时滞相关准则,与现有的结果相比,具有较小的保守性。 相似文献
7.
8.
中立型变时滞系统的鲁棒稳定性 总被引:1,自引:0,他引:1
考虑不确定中立型变时滞系统的鲁棒稳定性问题. 首先, 引入新的变量来代替系统的不确定性; 然后, 通过构造一般形式的Lyapunov-Krasovskii泛函、使用积分不等式并引入自由矩阵, 得到了基于线性矩阵不等式的系统稳定性判据. 该结论与中立型时滞, 离散时滞及其导数均相关, 具有较小的保守性. 最后, 通过仿真算例说明了所得到的结论在保守性上优于现存的结果以及中立型时滞, 离散时滞及其导数三者之间的关系. 相似文献
9.
10.
11.
长城是中华民族的象征,是人类历史上最伟大的建筑工程之一。基于高分辨率遥感数据“SPOT-5”和DEM数据,首先运用微分几何方法提取高亮度线性地物信息,然后根据长城特殊的地形地貌特征,运用GIS水文学方法提取出山脊线,并在山脊线周围做一个几米的缓冲区,将高亮度线性地物信息和山脊线缓冲区进行叠加分析,比较准确地提取出了长城信息,并进行提取精度的评估。 相似文献
12.
Arno Linnemann 《Systems & Control Letters》1999,36(2):1762
A necessary and sufficient condition for linear exponential sums to be dense in
is derived. Under this condition a Ritz approximation converges, which has been proposed to solve linear control problems. State-space representations of orthonormal basis functions for multivariable systems are given. 相似文献
13.
M. Lintner 《Computing》2004,72(3-4):293-323
A class of matrices (-matrices) has recently been introduced by Hackbusch for approximating large and fully populated matrices arising from FEM and BEM applications. These matrices are data-sparse and allow approximate matrix operations of almost linear complexity. In the present paper, we choose a special class of -matrices that provides a good approximation to the inverse of the discrete 2D Laplacian. For these 2D -matrices we study the blockwise recursive schemes for block triangular linear systems of equations and the Cholesky and LDLT factorization in an approximate arithmetic of almost linear complexity. Using the LDLT factorization we compute eigenpairs of the discrete 2D Laplacian in -matrix arithmetic by means of a so-called simultaneous iteration for computing invariant subspaces of non-Hermitian matrices due to Stewart. We apply the -matrix techniques to approximate the solutions of the high-frequency 2D wave equation for smooth initial data and the 2D heat equation for arbitrary initial data by spectral decomposition of the discrete 2D Laplacian in, up to logarithmic factors, optimal complexity. 相似文献
14.
Zhongwei Yu Huitang Chen Peng-Yung Woo 《Journal of Intelligent and Robotic Systems》2004,40(2):183-206
A new approach to the design of a gain scheduled output feedback controller based on linear time-invariant (LTI) controller interpolation that preserves H
performance without a varying-parameter rate feedback is proposed. After the controller design is translated into parameterized linear matrix inequalities about parameter matrices based on a parameter-dependent Lyapunov function, the sufficient condition is given for the partition of the varying-parameter set based on the concept of H
performance covering. The varying-parameter set is thus partitioned into sufficiently small subsets. After the constant matrices are found for each of the subsets, the required continuous parameter matrices are obtained by using interpolation. The proposed controller overcomes the drawback that the gain scheduled controller may not be found by using the existing gain scheduled linear parameter varying (LPV) controller synthesis. Moreover, the varying-parameter rate feedback is eliminated and the conservatism of the controller design is reduced by means of limiting the upper bound of the varying-parameter rate. Simulation and experiment results prove the effectiveness of the proposed controller. 相似文献
15.
Chvátal-Gomory cuts are among the most well-known classes of cutting planes for general integer linear programs (ILPs). In
case the constraint multipliers are either 0 or
, such cuts are known as
-cuts. It has been proven by Caprara and Fischetti (Math. Program. 74:221–235, 1996) that separation of
-cuts is
-hard.
In this paper, we study ways to separate
-cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The
core of the preprocessing builds a Gaussian elimination-like procedure. To separate the most violated
-cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the
algorithmic framework.
Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation
is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation
times of state-of-the-art ILP-solvers. 相似文献
16.
I. I. Bosikova 《Cybernetics and Systems Analysis》2001,37(4):610-614
A finite-difference approach to the solution of systems of linear algebraic equations with two-dimensional -matrices of a special form is considered. Recursive relations are obtained for computing the elements of an arbitrary row of the matrix of a given system, and formulas are proposed for determination of solutions of the system. 相似文献
17.
Magdi S. Mahmoud Author Vitae 《Automatica》2004,40(3):501-510
This paper provides complete results on the stability behavior of a class of uncertain dynamical systems with jumping parameters and functional time-delays. The jumping parameters are modeled as a continuous-time, discrete-state Markov process. The parametric uncertainties are norm-bounded appearing in all system matrices and the delay factor depends on the mode of operation. Notions of weak and strong stochastic stability for the jumping system are developed depending on the available information using a prescribed -performance. Memoryless and delayed-state feedback are considered to guarantee the closed-loop stability. All the results are cast into linear matrix inequalities format. A numerical example is given to illustrate the developed results. 相似文献
18.
Dong-Ju Lee Se-June Park Ki-Suk Woo No-Cheol Park Young-Pil Park 《Microsystem Technologies》2005,11(7):470-477
Recent advancements in mobile devices have fueled a requirement for information storage systems with characteristics such as subminiature size, low cost, and minimum power consumption. Small optical disk drives could provide a good solution, because their storage media is cheaper than those of hard disk drives or flash memories. In this study, we design and analysis a linear voice coil motor (VCM) types actuator for the coarse and fine tracking motions and a two-wire spring types actuator for a fine focusing motion in order to apply them to small-sized optical disk drives of high data capacity. And, we make the mathematical model of a two-wire spring types actuator and find proper conditions to suppress the tilt motion of the lens holder for various focusing offset positions without sacrificing the sensitivity. Based on them, we design and modify the magnetic circuit and the structural part. Finally, we verify that the designed actuator had the proper dynamic characteristics and that it could be used in small optical disk drives by simulations and experiments. 相似文献
19.
It is a survey of recent extensions and new applications for the classical D-decomposition technique. We investigate the structure of the parameter space decomposition into root invariant regions for single-input single-output systems linear depending on the parameters. The D-decomposition for uncertain polynomials is considered as well as the problem of describing all stabilizing controllers of the certain structure (for instance, PID-controllers) that satisfy given H ∞-criterion. It is shown that the D-decomposition technique can be naturally linked with M-Δ framework (a general scheme for analysis of uncertain systems) and it is applicable for describing feasible sets for linear matrix inequalities. The problem of robust synthesis for linear systems can be also treated via D-decomposition technique. 相似文献
20.
M. Ç. P⊂nar 《Computing》2004,72(3-4):365-384
We review and extend previous work on the approximation of the linear 1 estimator by the Huber M-estimator based on the algorithms proposed by Clark and Osborne [7], and Madsen and Nielsen [12]. Although the Madsen-Nielsen algorithm is a promising one, it is guaranteed to terminate finitely under certain assumptions. We describe a variant of the Madsen-Nielsen algorithm to compute the 1 estimator from the Huber M-estimator in a finite number of steps without any restrictive steps nor assumptions. Summary computational results are given. 相似文献