离散非线性时变凸多面体系统族的鲁棒正不变集

动态系统的状态约束和控制约束等问题可归结为状态空间中某些集合的正不变性.利用 混合单调分解方法研究离散非线性、时变凸多面体系统族的线性状态约束集合的鲁棒正不变性． 对由矩阵凸多面体和加性区间扰动描述的线性时变离散系统族,得到了鲁棒正不变集的充分必要 条件;对非线性系统族则得到有关充分条件.这些条件均由系统族的顶点表述,易于检验,同时给 出示例.     

基于多面体不变集的变终端约束集RMPC

针对一类状态和输入受约束的多胞不确定线性时变系统,提出了一种基于多面体不变集的变终端约束集鲁棒模型预测控制算法.首先采用基于状态反馈增益的多面体不变集计算方法,给出了一种新的控制不变集序列构造方法,然后以控制不变集序列的并集作为终端约束集,结合在线优化和增益切换,实施变终端约束集双模鲁棒预测控制.该算法不仅有效地扩大了...     

1种多面体描述的非线性预测控制器综合

针对工业过程中的非线性计算量大,实时性低等问题,提出了1种计算非线性预测控制的新方法。该方法将神经网络与线性微分包含(LDI)相结合对非线性系统建模,从而将非线性系统转换成多面体描述的线性时变系统。对于多面体描述系统的各个顶点构成的多个线性模型,在线求得不同状态下的控制器。最后通过证明多面体描述的线性系统的稳定性来保证原非线性的稳定性。通过仿真看出此算法在处理复杂系统的控制问题具有良好的控制效果。     

基于几何方法的约束线性系统控制快速算法

针对存在状态量和控制量约束的线性系统控制问题, 提出了新快速算法. 已有的处理上述约束系统控制问题的多面体方法和椭球方法在实际应用过程中分别存在计算繁琐和计算保守的问题. 在数学分析的基础上, 通过对上述算法的水平集计算过程的优化, 提出了一种计算简单的约束控制算法. 仿真结果表明, 这种算法计算简单, 且可以满足系统控制的要求.     

控制方向未知的全状态约束非线性系统的鲁棒自适应跟踪控制

针对一类控制方向未知的含有时变不确定参数和未知时变有界扰动的全状态约束非线性系统,本文提出了一种基于障碍Lyapunov函数的反步自适应控制方法.障碍Lyapunov函数保证了系统状态在运行过程中始终保持在约束区间内;Nussbaum型函数的引入解决了系统控制方向未知的问题;光滑投影算法确保了不确定时变参数的有界性.障碍Lyapunov函数、Nussbaum型函数及光滑投影算法与反步自适应方法的有效结合首次解决了控制方向未知的全状态约束非线性系统的跟踪控制问题.所设计的自适应鲁棒控制器能在满足状态约束的前提下确保闭环系统的所有信号有界.通过恰当地选取设计参数,系统的跟踪误差将收敛于0的任意小的邻域内.仿真结果表明了控制方案的可行性.     

线性参变过驱动系统鲁棒控制分配策略

针对一类具有不确定时变参量的线性参变(linear parameter-varying,LPV)过驱动系统的控制分配问题,考虑系统的不确定参量扰动和执行器物理约束,利用伪控指令分配误差和控制量误差的1--范数,建立了含有时变不确定因子的控制分配优化模型.根据鲁棒优化思想,采用矢量变换技术处理时变不确定因子,得到了一种基于有约束锥二次凸优化模型的鲁棒控制分配算法,实现对LPV过驱动系统伪控指令的在线优化分配.最后,对某4轮电动汽车时变二自由度转向过驱动控制系统的对比仿真实验表明,相比常规4WS和伪逆控制分配方法,本文的鲁棒控制分配算法有效地降低了系统参变量不确定扰动的影响,得到更合理的控制分配解,有效改善了车辆的操纵稳定性.     

一种调整多面体描述系统的非线性预测控制方法

常用的非线性预测控制算法先构造合适的多面体描述系统包裹原非线性系统,通过研究多面体描述系统的各个顶点系统的稳定性来保证原非线性系统的稳定性。在以前研究中,多面体描述系统保持不变,但事实上多面体描述系统与终端约束集密切相关。设计了一种根据终端约束椭圆集调整多面体描述系统的非线性预测控制方法,该方法能够有效地减小系统的控制性能指标,同时控制过程中的终端不变椭圆集及其内的反馈控制律具有离线指导作用。     

运用区间算法的约束非线性系统鲁棒模型预测控制

针对一类具有输入和状态约束的干扰有界非线性系统,提出了基于区间分析的约束非线性鲁棒模型预测控制,以降低计算量并扩大系统吸引域.首先,在集合运算的基础上,利用区间运算和函数区间扩展,给出了一种计算效能更好、保守性更低的非线性系统鲁棒一步集计算方法;其次,构造重叠的多面体控制不变集序列并以此计算约束非线性系统的鲁棒多步集,并通过设计基于集合的在线优化策略,提出了基于鲁棒一步集的单步优化非线性模型预测控制,有效降低了非线性优化的在线计算量;最后,仿真实例验证了算法的有效性.     

时变大滞后系统的模糊免疫PID控制

工业中的大多数生产系统都是时变和滞后系统。对于这类系统,普通的PID控制器难以获得满意的控制效果。而采用模糊PID控制能降低系统的超调量,提高系统的响应速度。为了提高模糊PID控制器的控制性能,将模糊参数自整定调节方法与免疫进化算法相结合,设计了一种模糊免疫参数自整定PID控制系统。对于时变大滞后系统,模糊免疫参数自整定PID控制能明显减小系统的超调量,加快系统的响应速度。     

一种预测控制方法及其仿真

针对现有预测控制方法的最优控制律的计算较为复杂的问题,提出了一种新的预测控制算法.与现有预测控制算法相比,该算法结构简单,计算量小,鲁棒性强.对算法在一个采样周期内控制律的求取进行了较详细说明.通过对线性和非线性系统的仿真,说明了该算法对线性系统能达到很好的预测控制效果,同时对时变、非线性系统也具有较好的适应性,并具有较强的抗干扰能力.对于快时变系统,该算法需要根据实际时变特性对相关系数加以调整,来达到较满意的效果.     

An efficient algorithm for optimal control of PWA systems with polyhedral performance indices

We present an algorithm for the computation of explicit optimal control laws for piecewise affine (PWA) systems with polyhedral performance indices. The algorithm is based on dynamic programming (DP) and represents an extension of ideas initially proposed in Kerrigan and Mayne [(2003). Optimal control of constrained, piecewise affine systems with bounded disturbances. In Proceedings of the 41st IEEE conference on decision and control, Las Vegas, Nevada, USA, December], and Baoti? et al. [(2003). A new algorithm for constrained finite time optimal control of hybrid systems with a linear performance index. In Proceedings of European control conference, Cambridge, UK, September]. Specifically, we show how to exploit the underlying geometric structure of the optimization problem in order to significantly improve the efficiency of the off-line computations. An extensive case study is provided, which clearly indicates that the algorithm proposed in this paper may be preferable to other schemes published in the literature.     

基于多步控制集的鲁棒预测控制器设计

针对有约束多胞不确定系统, 本文提出多步控制集的概念, 并将其作为终端集进而设计鲁棒预测控制器. 由于设计了一系列可变的反馈律, 鲁棒预测控制器可以得到更好的控制性能和更大的初始可行域. 另外, 利用多步控制集的特性, 本文提出了一种将预测控制器的在线计算量转移到离线完成的算法. 通过该算法, 可以有效地平衡鲁棒预测控制器的控制性能、在线计算量和初始可行域. 仿真算例验证了这些算法的有效性.     

Regulator problem for linear continuous-time systems withnonsymmetrical constrained control

The regulator problem is studied for linear continuous-time systems with nonsymmetrical constrained control. Necessary and sufficient conditions allowing the largest nonsymmetrical polyhedral positively invariant domain w.r.t. the system in the closed loop to be obtained are given. The case of symmetrical constrained control is obtained as a particular case     

Regulator problem for linear continuous-time delay systems withnonsymmetrical constrained control

The regulator problem is studied for linear continuous-time delay systems with nonsymmetrical constrained control. Necessary and sufficient conditions allowing the autors to obtain the largest nonsymmetrical polyhedral positively invariant with respect to (w.r.t.) the system in the closed loop are given, The case of symmetrical constrained control is obtained as a particular case     

主动队列管理的约束H_∞状态反馈控制方法

考虑Internet网络的时滞、物理量变化复杂、物理约束等因素,将主动队列管理问题(AQM)描述为约束系统的干扰抑制问题,运用约束H1控制理论设计AQM鲁棒控制器.首先将时变且不可准确测量的可用链路容量建模为已知名义常值加上未知时变干扰;同时考虑网络中存在的物理约束,利用双椭圆域方法将时域硬约束转化为一组LMI约束;最后通过求解LMI约束的优化问题得到状态反馈增益,解决网络拥塞控制系统的干扰抑制问题.同时与随机早期检测(RED)和PI算法的仿真结果比较显示,约束H1状态反馈控制器降低了链路容量的不确定性对系统动态特性的影响,提高了AQM算法的鲁棒性.     

Lexicographic perturbation for multiparametric linear programming with applications to control

Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (mpLPs) with a parameter in the cost, or equivalently the right-hand side of the constraints, and solved explicitly offline. Degeneracy occurs when the control input, or optimiser, is non-unique, which can cause chattering of the control input and overlap of the polyhedral regions of the explicit solution. This paper introduces a new and efficient approach to the computation of the solution to a degenerate mpLP with the parameter in the cost. Rather than solve the degenerate problem directly, we solve a lexicographically (symbolically) perturbed version of it that is guaranteed to be non-degenerate. We show that every optimal solution of the perturbed problem is an optimal solution to the original and that the perturbed solution is continuous, unique and defined over a set of non-overlapping polyhedral regions. Furthermore, we introduce a new method for computing the optimal solution in an adjacent region, which is very efficient in all cases and reduces to a single simplex pivot for non-degenerate regions. The proposed algorithm is particularly suited for the calculation of the explicit solution to a class of constrained optimal control problems, since it ensures that the control input is everywhere continuous and unique, thereby removing the danger of chattering in problems with linear costs. The algorithm is compared through example to existing proposals and a significant complexity improvement is demonstrated.     

Constrained regulation of linear discrete-time systems with time delay: Delay-dependent and delay-independent conditions

The regulator problem is studied for discrete-time delay systems with asymmetrical constrained control. Necessary and sufficient conditions allowing us to obtain the largest asymmetrical polyhedral positively invariant with respect to the system in the closed loop are given. The case of symmetrical constrained control is obtained as a particular case. The results obtained can be divided into two categories. The first concerns the delay-independent positively invariant conditions and the second is the delay-dependent conditions.     

Using hash tables to manage the time-storage complexity in a point location problem: Application to explicit model predictive control

The online computational burden of linear model predictive control (MPC) can be moved offline by using multi-parametric programming, so-called explicit MPC. The solution to the explicit MPC problem is a piecewise affine (PWA) state feedback function defined over a polyhedral subdivision of the set of feasible states. The online evaluation of such a control law needs to determine the polyhedral region in which the current state lies. This procedure is called point location; its computational complexity is challenging, and determines the minimum possible sampling time of the system. A new flexible algorithm is proposed which enables the designer to trade off between time and storage complexities. Utilizing the concept of hash tables and the associated hash functions, the proposed method solves an aggregated point location problem that overcomes prohibitive complexity growth with the number of polyhedral regions, while the storage–processing trade-off can be optimized via scaling parameters. The flexibility and power of this approach is supported by several numerical examples.     

Hybrid threshold strategy‐based adaptive tracking control for nonlinear stochastic systems with full‐state constraints

This article focuses on the adaptive tracking control problem for a class of interconnected nonlinear stochastic systems under full‐state constraints based on the hybrid threshold strategy. Different from the existing works, we propose a novel pre‐constrained tracking control algorithm to deal with the full‐state constraint problem. First, a novel nonlinear transformation function and a new coordinate transformation are developed to constrain state variables, which can directly cope with asymmetric state constraints. Second, the hybrid threshold strategy is constructed to provide a reasonable way in balancing system performance and communication constraints. By the use of dynamic surface control technique and neural network approximate technique, a smooth pre‐constrained tracking controller with adaptive laws is designed for the interconnected nonlinear stochastic systems. Moreover, based on the Lyapunov stability theory, it is proved that all state variables are successfully pre‐constrained within asymmetric boundaries. Finally, a simulation example is presented to verify the effectiveness of proposed control algorithm.     

Unconstrained and constrained stabilisation of bilinear discrete-time systems using polyhedral Lyapunov functions

The constrained and unconstrained stabilisation problem of discrete-time bilinear systems is investigated. Using polyhedral Lyapunov functions, conditions for a polyhedral set to be both positively invariant and domain of attraction for systems with second-order polynomial nonlinearities are first established. Then, systematic methods for the determination of stabilising linear feedback for both constrained and unconstrained bilinear systems are presented. Attention is drawn to the case where no linear control law rendering the pre-specified desired domain of attraction positively invariant exists. For this case, an approach guaranteeing the existence of a possibly suboptimal solution is established.