不确定广义线性时变系统的鲁棒稳定和二次稳定

针对不确定广义线性时变系统,采用矩阵不等式的分析方法,提出不确定广义线性时变系统鲁棒稳定和二次稳定的概念.建立该类系统的矩阵不等式,将该类系统的鲁棒控制问题转化为求解矩阵不等式问题,得到该类系统鲁棒稳定和二次稳定的充分必要条件,并给出一种状态反馈鲁棒镇定控制器的设计方法.最后,通过数值算例表明了所提出方法的可行性.     

一类线性时变不确定周期奇异系统的鲁棒镇定

讨论了一类线性时变不确定周期广义系统的鲁棒镇定问题．基于线性时变不确定周期广义系统的鲁棒稳定的概念, 提出鲁棒稳定的充分必要条件, 并基于对偶系统的等价性得到鲁棒镇定的充分必要条件. 通过引入自由矩阵, 所得结果表示为线性矩阵不等式, 验证过程更简单、可靠.     

参数不确定广义大系统的分散鲁棒镇定控制

应用线性矩阵不等式(LMI)方法研究了参数不确定广义大系统的分散鲁棒镇定控制问题，系统中不确定项具有数值界，可不满足匹配条件．基干不确定项的表达形式，给出了存在分散鲁棒控制器的LMI条件．仿真例子表明，LMI方法求解简单、便干应用。     

一类不确定线性时滞系统的输出反馈鲁棒镇定

研究一类不确定线性时滞系统的输出反馈鲁棒镇定问题,其中不确定性不必满足匹配条件。以二次Lyapunov泛函保证系统的渐近稳定性,利用线性矩阵不等式给出了系统可以利用动态输出反馈鲁棒镇定的充分条件。当此条件成立时,基于线性矩阵不等式的解构造了全阶动态输出反馈镇定控制器。     

不确定时滞系统的鲁棒绝对稳定性研究

基于Lyapunov稳定性理论，采用线性矩阵不等式处理方法，研究具有参数不确定性的时滞系统鲁棒绝对稳定性问题．导出了用线性矩阵不等式系统可行性描述的系统鲁棒绝对稳定的滞后依赖型条件，据此可计算出最大的允许时滞界．通过求解一组线性矩阵不等式，给出使得闭环系统鲁棒绝对稳定的无记忆状态反馈控制律设计方法。     

一类结构不确定性的离散时滞大系统的分散镇定

研究了一类离散时滞大系统的时滞相关鲁棒分散镇定问题, 系统的不确定与标称系统具有结构相似性. 通过构造性的差分格式, 将时滞相关鲁棒分散镇定控制器的存在条件转化为一列线性矩阵不等式的可行解问题. 提出了控制时滞及控制器的时滞鲁棒性概念, 在获得分散镇定控制器的同时给出了鲁棒时滞上界的求解, 因此比现有文献的结果更具有实际应用价值.     

广义不确定系统鲁棒稳定性及鲁棒镇定的矩阵不等式方法

考虑广义不确定系统的鲁棒稳定性及鲁棒镇定问题.提出了广义不确定系统'广义二 次稳定'及'广义二次可镇定'的概念,利用矩阵不等式,分别得到了所考虑广义不确定系统广义 二次稳定及广义二次可镇定的充要条件,而且,使广义不确定系统鲁棒镇定的状态反馈控制律 的设计可通过求解一给定的矩阵不等式而得到.     

非线性不确定随机多重时滞系统的鲁棒H_∞控制

研究一类非线性不确定随机多重时滞系统的鲁棒 H∞ 控制问题。运用线性矩阵不等式方法 ,导出了满足系统随机鲁棒稳定的充分条件 ,提出实现系统在一定概率意义下干扰衰减鲁棒镇定的鲁棒无记忆控制器设计方法     

不确定广义系统鲁棒镇定控制器的设计

讨论了线性定常广义系统的稳定性, 给出了这种系统H_∞ 范数形式的稳定性判据, 在此基础上, 利用线性矩阵不等式 (LMI)方法讨论了含有不确定参数的线性广义控制系统的鲁棒镇定问题, 并相应地给出了鲁棒镇定控制器的设计.     

不确定广义时滞系统的鲁棒稳定方法研究

研究一类带有时滞不确定广义系统的鲁棒渐近稳定问题．利用Lyapunov稳定性定理和线性矩阵不等式工具，得到了广义系统正则、鲁棒渐近稳定的时滞相关充分条件．为了降低所得结果的保守性，避免了采用系统模型变换和利用矩阵不等式方法．进一步，建立一个具有线性矩阵不等式约束的凸优化问题，利用Matlab软件中的LMI工具箱求解，得到保证广义系统鲁棒渐近稳定的最大可允许时滞上界．仿真示例表明了该方法的有效性．     

具有干扰输入的不确定奇异系统的有限时间控制器设计

The concept of finite-time stability for linear singular system isinduced in this paper. Finite-time control problem is considered for linear singular systems with time-varying parametricuncertainties and exogenous disturbances. The disturbance satisfies a dynamical system with parametric uncertainties. Asufficient condition is presented for robust finite-ime stabilization via state feedback. The condition is translated to a feasibility problem involving restricted linear matrix inequalities (LMIs). A detailed solving method is proposed for the restricted linear matrix inequalities. Finally, an example is given to show the validity of the results.     

Output feedback gains for a linear-discrete stochastic control problem

For the finite-horizon linear-discrete quadratic stochastic control problem, the control is restricted to be a memoryless linear transformation of the measurement. The two-point boundary value problem that specifies the feedback gain matrices is derived, and an algorithm for solving it is given. An example is solved comparing the cost of the suboptimal control to the optimal control.     

A solution to the diagonalization problem by constantprecompensator and dynamic output feedback

A solution is presented for the problem of diagonalization (row-by-row decoupling). The problem is solved using a constant precompensator and a dynamic output feedback compensator of a p×m linear time-invariant system. The solvability condition is compact and concerns the dimension of a single subspace defined via the concepts of essential rows and static kernels associated with the transfer matrix. A characterization of the set of all solutions to the problem is also given. In solving this dynamic feedback problem, a complete solution to its state-feedback counterpart, namely, the restricted state-feedback problem of diagonalization, is also presented     

Optimal control of discrete-time linear fractional-order systems with multiplicative noise

A finite horizon linear quadratic (LQ) optimal control problem is studied for a class of discrete-time linear fractional systems (LFSs) affected by multiplicative, independent random perturbations. Based on the dynamic programming technique, two methods are proposed for solving this problem. The first one seems to be new and uses a linear, expanded-state model of the LFS. The LQ optimal control problem reduces to a similar one for stochastic linear systems and the solution is obtained by solving Riccati equations. The second method appeals to the principle of optimality and provides an algorithm for the computation of the optimal control and cost by using directly the fractional system. As expected, in both cases, the optimal control is a linear function in the state and can be computed by a computer program. A numerical example and comparative simulations of the optimal trajectory prove the effectiveness of the two methods. Some other simulations are obtained for different values of the fractional order.     

L 2-Gain analysis and control synthesis of uncertain discrete-time switched linear systems with time delay and actuator saturation

The problem of L ₂-gain analysis and control synthesis is studied for a class of uncertain discrete-time switched linear systems with time delay and saturating actuators by using the multiple Lyapunov functions method. With the state feedback controllers adopted beforehand, an analysis condition on disturbance tolerance is derived under which the operating state trajectory with zero initial condition will remain inside a bounded set in its proximity. Then with this condition at hand, the largest disturbance tolerance level is determined via the solution of a constrained optimisation problem. Then, a sufficient condition for the restricted L ₂-gain over the set of tolerable disturbances is derived. The smallest upper bound on the restricted L ₂-gain is also obtained by solving a constrained optimisation problem. Furthermore, when controller gain matrices are design variables, these optimisation problems are adjusted for solving the control design task. An illustrative numerical example is given to demonstrate the feasibility and effectiveness of the proposed method.     

奇异摄动时滞系统次优控制的Chebyshev多项式级数方法

研究奇异摄动时滞系统次优控制的近似设计问题.基于奇异摄动的快慢分解理论,将系统的最优控制问题转化为无时滞快子问题和线性时滞慢子问题;利用Chebyshev多项式级数方法将时滞慢子问题的近似求解问题转化为线性代数方程组的求解问题,进而得到原系统的次优控制律,该控制律由Chebyshev多项式级数的基向量表示.仿真算例表明了该方法的有效性.     

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously all processors from the same group. We consider two variants depending on whether preemptions are allowed at any fractional time points or only at integer time points. We reduce the former problem to solving a linear program in strongly polynomial time, while a restricted version of the second problem is solved by rounding techniques. Applications to course scheduling and hypergraph edge coloring are also discussed.     

Neural network technique for fuzzy multiobjective linear programming

Neural Network(NN) is well-known as one of powerful computing tools to solve optimization problems. Due to the massive computing unit-neurons and parallel mechanism of neural network approach we can solve the large-scale problem efficiently and optimal solution can be gotten. In this paper, we intoroduce improvement of the two-phase approach for solving fuzzy multiobjectve linear programming problem with both fuzzy objectives and constraints and we propose a new neural network technique for solving fuzzy multiobjective linear programming problems. The procedure and efficiency of this approach are shown with numerical simulations.     

多因素制约的迷宫问题最优解的求解算法

介绍迷宫问题及其最优解,引入多因素制约的迷宫问题。重点讨论多因素制约迷宫问题最优解的含义及基于广度优先搜索的求解算法,并通过两个实例分析如何基于广度优先搜索算法求解这类迷宫问题的最优解,并给出算法的伪代码。最后,进一步讨论和总结这类迷宫问题最优解的求解算法。     

求解单位等边三角形Packing问题的近似算法

多边形Packing问题不仅具有重要的理论意义，而且也有广阔的应用前景，由于该问题具有NP难度，且具有连续的性质，一般要事先对多边形的放置方位进行限制，例如不允许多边形旋转，然后再进行优化求得近似解，该文采用一种新的思路对多边形Packing问题的一个特例－单位等边三角形Packing问题进行了研究，提出了零自由度动作和零自由度放置策略的概念，并设计了一个近似求解算法－最小损伤法，复杂性分析和计算结果表明该算法是高效的，以此为基础，可能为多边形Packing问题找到类似的求解算法。