自适应反步滑模控制在火箭炮伺服系统中应用

针对实际系统运行过程中所存在的转动惯量和负载力矩变化大等各种不确定因素,提出了一种新型的自适应反步滑模位置控制器(ABSMC)。首先对于模型中的不确定参数,采用自适应鲁棒算法进行有效估计,通过对模型的等价变换和选择适当的Lyapunov函数,最终给出系统的自适应控制器和不确定参数自适应律的设计方法。仿真和实验结果表明,该控制器能够有效抑制抖振,系统跟踪误差小,跟踪性能好,对参数摄动及外界负载扰动具有较强的鲁棒性。     

自适应模糊滑模在火箭炮位置伺服系统中的应用

针对多管火箭炮交流位置伺服系统转动惯量和负载力矩变化大的特性,设计了自适应模糊滑模位置控制器.用模糊控制逼近理想滑模控制,设计切换控制补偿逼近误差,自适应控制调节模糊参数和切换控制的不确定上界.为了保证系统渐进稳定和可控,根据李亚普函数导出自适应率.仿真结果表明该控制策略不仅保证了系统的静、动态特性,而且对负载扰动和系统参数摄动具有较强的鲁棒性.     

坦克炮控伺服系统未知摩擦的自适应补偿控制

摩擦的存在导致坦克炮控系统出现低速爬行等现象,使系统性能变差。针对该系统,提出未知摩擦的自适应补偿控制。更具一般性的未知摩擦及系统的参数不确定性使得对摩擦的自适应补偿变的非常困难。在控制器设计中,通过精确估计摩擦及系统中的未知参数、观测摩擦内动态对其进行补偿,从而避免了由于简单地把摩擦看成外界扰动进行补偿所造成的系统性能的损失。同时全面考虑了系统的不确定性和外界扰动,使得控制器有较强的抗干扰性。     

磁浮列车悬浮控制器的电流环分析与优化设计

电流环是磁浮列车悬浮控制器的重要子系统。在分析PI型电流环及最速电流环的控制特点的基础上,设计了一种次速电流环控制器,它具有调节速度快、抗信号扰动能力强、对对象参数不敏感等优点。仿真表明次速电流环的调节速度和最速电流环相当,但在系统中存在干扰信号时,抖动会明显减小。实验表明,次速电流环调试方便,能结合悬浮控制子系统很好地完成悬浮任务。     

基于自适应积分滑模的无人机编队控制器设计

针对一类受有界干扰影响的无人机编队系统控制器设计问题,基于自适应积分滑模控制框架,提出了一种新型的无人机编队控制器设计方法.通过引入自适应律对扰动上界进行估计,并在控制器中消除了扰动的影响,通过Lyapnov方法对所提出闭环系统的稳定性进行了仿真及分析.仿真结果表明,本文所提出的控制器在保证系统具有一定鲁棒性的前提下完...     

利用模糊逻辑控制实现不确定Hénon映射的同步

针对带不确定项和外界扰动的Hénon映射,利用模糊逻辑控制理论和Lyapunov稳定性定理对模糊控制器进行了设计,实现了驱动系统和响应系统的渐进同步。为了克服试凑整定方法获取隶属度函数和模糊规则的局限性,利用误差系统的Lyapunov稳定性条件直接构造模糊规则,使得所设计的控制器具有鲁棒性。仿真结果验证了该方法的有效性和实用性。     

坦克炮控系统自适应滑模鲁棒控制

坦克炮控系统是一类非线性和不确定性的复杂控制对象,针对其结构摄动和外界扰动输入不确定因素未知的问题,提出一种坦克炮控系统自适应滑模鲁棒控制方法。该控制律在保证系统闭环稳定的前提下在线对结构摄动和外界扰动输入不确定因素的界进行估计。滑模控制器保证了系统快速跟踪性能,在不牺牲系统鲁棒性的同时达到削弱抖振的目的。仿真结果表明该设计方法优于经典设计,而且结构简单,易于设计,为炮控系统实际设计提供了一种可行的新方法。     

考虑不确定参数及外部扰动数字液压缸非线性鲁棒位置跟踪控制

在考虑不确定参数及外部扰动的情况下为数字液压缸位置跟踪系统设计了一个非线性控制器。首先,建立了数字液压缸位置跟踪系统的非线性模型;然后,构造了一个李雅普诺夫函数及非线性控制器,推导了系统鲁棒稳定的充分条件,由此将非线性控制器的设计问题转化成为线性矩阵不等式的求解问题;最后,进行了仿真及实验验证。结果表明:所设计的控制器对于参数不确定性及外部扰动具有良好的鲁棒稳定性及更好的动态特性。     

动力翼伞风扰补偿高度控制方法

外界风场是影响翼伞高度跟踪精度的最主要扰动因素。针对该问题,建立了动力翼伞的八自由度模型,并在传统自抗扰控制的基础上,设计一种基于风场前馈补偿的改进抗扰控制器,对外界的风场干扰进行针对性补偿,实现翼伞系统的高度跟踪控制。在通过仿真实验对控制器进行初步验证的基础上,进行了翼伞系统的实际飞行实验。在实际飞行环境下,仿真中所调节的控制器参数可直接应用于实际飞行实验,翼伞系统的平均高度跟踪误差在2.5 m以内,证明所设计的控制器存在一定的实际应用价值。     

基于自抗扰控制的微型导弹导引控制一体化设计

针对微型导弹动力学参数具有不确定性以及在攻击目标的过程中系统存在未知扰动问题,应用自抗扰控制技术,在对导弹俯仰和偏航两个通道进行一体化建模的基础上,设计了一种能够对微型导弹系统的不确定参数和干扰进行实时估计并补偿的控制器。微型导弹在自抗扰控制器的作用下高效地完成了对机动目标的攻击。仿真结果表明,此控制器能够达到很好的控制效果且能有效地提高导弹的制导精度。     

基于免疫粒子群算法的自抗扰飞行控制器设计

提出了一种基于免疫粒子群优化算法的自抗扰大包线飞行控制器设计方法.针对传统的增益调参设计方法存在的工作量巨大与设计效率低的问题,利用自抗扰控制器进行大包线飞行控制器设计,并推导了适用于该方法的飞机非线性方程.由于自抗扰控制能够动态补偿对象模型的内扰和外扰,因此在很大的飞行区域内仅需一套控制器便可,从而避免了烦琐复杂的增益调参设计过程,并用免疫粒子群优化算法对自抗扰控制器参数进行了优化研究.仿真结果表明,所设计的自抗扰控制器具有优良的控制性能,并且控制器参数在较大的包线范围内不需要改变,从而简化了大包线飞行控制器设计.     

倾斜转弯高超声速飞行器滚动通道的自适应全局积分滑模控制

针对倾斜转弯高超声速飞行器滚动通道控制中初始误差大、系统参数不确定和干扰严重的问题,设计了一种自适应全局积分滑模控制方法.该方法在滑模控制参数中引入了自适应调节律来逼近系统参数摄动和干扰的上界,保证了整个控制过程中的滑模可达性,在此基础上,设计了一种基于全局积分滑模面的自适应滑模控制器,消除了稳态误差,同时大大削弱了系统参数不确定和干扰对系统的动态影响,并使系统在初始阶段就处于滑模态,解决了大的初始误差引起的超调问题.理论分析和仿真结果验证了本文所提方法的有效性.     

核动力折中稳态运行方案下稳压器压力控制的模糊控制器

运用模糊控制理论,针对稳压器压力控制的特点,为解决核动力装置折中稳态运行方案下低工况运行时一回路压力随负荷变化波动较大的问题,设计了压力模糊控制器。即利用模糊控制器实现稳压器压力调节系统工作参数的在线优化自整定,并以某核动力装置为对象进行了仿真实验。仿真结果表明,本控制器在对原系统不作大改动的前提下,能有效地抑制一回路压力波动,比原有调节系统具有好得多的调节品质。     

Reliability bounds for the NBUE distributions

In this paper, we study upper and lower bounds on the reliability in new better than used in expectation (NBUE) life distribution class with fixed first two moments. By a constructive proof, we determine the upper bounds on the reliability analytically in different regions and show that these bounds are sharp. For the lower bounds, similar results are obtained except in one region. For that region, a conjecture is given for further study. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 781–797, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10035     

A squared-euclidean distance location-allocation problem

This article is concerned with the analysis of a squared-Euclidean distance location-allocation problem with balanced transportation constraints, where the costs are directly proportional to distances and the amount shipped. The problem is shown to be equivalent to maximizing a convex quadratic function subject to transportation constraints. A branch-and-bound algorithm is developed that utilizes a specialized, tight, linear programming representation to compute strong upper bounds via a Lagrangian relaxation scheme. These bounds are shown to substantially dominate several other upper bounds that are derived using standard techniques as problem size increases. The special structure of the transportation constraints is used to derive a partitioning scheme, and this structure is further exploited to devise suitable logical tests that tighten the bounds implied by the branching restrictions on the transportation flows. The transportation structure is also used to generate additional cut-set inequalities based on a cycle prevention method which preserves a forest graph for any partial solution. Results of the computational experiments, and a discussion on possible extensions, are also presented.     

Combination setwise-Bonferroni-type bounds

We consider three classes of lower bounds to P(c) = P (X₁ ≤ c₁,…, X_n ≤ c); Bonferroni-type bounds, product-type bounds and setwise bounds. Setwise probability inequalities are shown to be a compromise between product-type and Bonferroni-type probability inequalities. Bonferroni-type inequalities always hold. Product-type inequalities require positive dependence conditions, but are superior to the Bonferroni-type and setwise bounds when these conditions are satisfied. Setwise inequalities require less stringent positive dependence bound conditions than the product-type bounds. Neither setwise nor Bonferroni-type bounds dominate the other. Optimized setwise bounds are developed. Results pertaining to the nesting of setwise bounds are obtained. Combination setwise-Bonferroni-type bounds are developed in which high dimensional setwise bounds are applied and second and third order Bonferroni-type bounds are applied within each subvector of the setwise bounds. These new combination bounds, which are applicable for associated random variables, are shown to be superior to Bonferroni-type and setwise bounds for moving averages and runs probabilities. Recently proposed upper bounds to P(c) are reviewed. The lower and upper bounds are tabulated for various classes of multivariate normal distributions with banded covariance matrices. The bounds are shown to be surprisingly accurate and are much easier to compute than the inclusion-exclusion bounds. A strategy for employing the bounds is developed. © 1996 John Wiley & Sons, Inc.     

多智能体信息一致性在机器人编队控制中的应用

对固定拓扑结构下多智能体有向网络一致性问题进行了研究,提出了一类协调控制器并证明了使多智能体网络在固定拓扑结构下取得全局渐进一致的充要条件,考虑到智能体之间通讯过程中存在的时延问题,给出了最大固定延时时间的紧凑上界,取得了满意效果,最后将信息一致性思想应用于多机器人的编队控制。结果表明,基于信息一致性的方法可成功应用于机器人编队控制。     

Optimal burn‐in procedure for periodically inspected systems

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we study burn‐in procedure for a system that is maintained under periodic inspection and perfect repair policy. Assuming that the underlying lifetime distribution of a system has an initially decreasing and/or eventually increasing failure rate function, we derive upper and lower bounds for the optimal burn‐in time, which maximizes the system availability. Furthermore, adopting an age replacement policy, we derive upper and lower bounds for the optimal age parameter of the replacement policy for each fixed burn‐in time and a uniform upper bound for the optimal burn‐in time given the age replacement policy. These results can be used to reduce the numerical work for determining both optimal burn‐in time and optimal replacement policy. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

非匹配摄动系统协方差矩阵的定界估计

基于Ｌｙａｐｕｎｏｖ 稳定性理论,在系统矩阵及噪声输入矩阵均存在非匹配摄动的一般情形下,研究随机系统稳态状态协方差的定界估计问题,通过求解两个代数Ｒｉｃｃａｔｉ方程,给出了该协方差矩阵上下界的估计式,并提供了一个说明性算例     

Probabilistic solution and bounds for serial inventory systems with discounted and average costs

We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007