基于小波配点法的空间机械臂关节轨迹规划

针对平面型空间机械臂关节轨迹优化问题,提出一种基于小波配点法的数值算法。该算法在区间样条小波函数及其导数算法的基础上,对状态变量与控制变量在小波配点上作离散化处理,然后将原最优控制问题转化为以小波系数为优化参数的非线性规划问题,利用非线性规划算法求解该问题得到原问题的解。算法可充分利用小波具有非线性逼近的优点,提高计算精度和效率。对典型问题进行数值仿真,结果表明该算法对空间机械臂关节轨迹优化问题是有效的。     

线性规划问题新解——改进大M法

借鉴两阶段法的求解思路,在用单纯形法求解线性规划问题时,对大M法进行改进,提出一种新的算法.这种改进后的算法可以有效克服原来两种算法的不足,既能降低理解难度,又能提高算法的效率,保证算法的全局收敛性.     

参数化滤波器逼近问题的全局最优算法

基于Lipschitz下界估值和分枝定界技术,给出了一维参数化小波滤波器逼近问题的全局最优算法。由于充分利用了滤波器逼近问题的特点,本方法将原来的Lipschitz算法的线性收敛速率提高为二次收敛速率。     

基于BP人工神经网络的GPS/SINS组合导航算法

基于扩展Kalman滤波的GPS/SINS组合导航算法,需要对原始的非线性连续系统模型进行线性化和离散化处理,要求系统噪声和测量噪声为零均值的高斯白噪声,且易于出现滤波器发散。BP人工神经网络无需对所求解的问题建模,能够很好地逼近系统非线性特性,获得较高精度的导航定位信息;还具有计算过程稳定,不涉及矩阵求逆,不需要迭代逼近,以及容易实现并行处理等优点。设计适用于GPS/SINS组合导航系统的BP网络模型,并在标准的BP算法基础上,采用共轭梯度法改进网络训练速度及精度。最后,通过仿真算例说明BP网络方法用于GPS/SINS组合导航计算的可行性。     

线性规划的一种并行修正松弛算法

对求解线性规划问题的松弛算法进行了修正,在此基础上提出了一种基于cluster结构的并行算法,分析了算法的性能;基于曙光3000大规模并行计算机,给出了算法用于求解线性规划问题实例的实验结果.理论分析和实验结果表明,修正算法改进了松弛算法的实际性能,同时具有较好的并行性和稳定性,可用于求解此类大规模科学与工程规划问题的高性能计算.     

基于量子粒子群算法的判断矩阵一致性修正

对层次分析法中判断矩阵一致性调整存在的问题进行了分析。把原始判断矩阵认为是理想矩阵受干扰后形成的构造偏差矩阵,在达到基本一致性阈值的前提下使偏差矩阵修改量最小,建立了判断矩阵一致性修正的非线性规划模型。针对遗传模拟退火法收敛结果陷入局部最优的问题,设计了量子粒子群算法求解非线性规划,并和文献的算法进行对比,最后给出算例结果证明该优化算法更简单有效。     

高炮射击提前点的解法研究

针对高炮射击解提前点方法进行的研究,在图解法的基础上,运用解方程的思想,提出了精度更高的“系数调整法”、“图解逼近法”和“一元四次方程法”。较好地解决对匀速运动目标命中问题的求解,“图解逼近法”具有单方向收敛的优点。“一元四次方程法”可直接用消元法求解,不需循环。解法与迭代法比较,具有计算精度高、速度快,计算步骤、时间固定,在火控系统计算和修正等方面有重要的实用价值。     

求解非线性规划的小生境遗传模拟退火算法

提出了用小生境遗传模拟退火算法求解带复杂约束的非线性规划问题。首先分析了遗传算法＂早熟＂收敛以及局部搜索能力弱的不足,由此引入小生境以增加种群多样性,并抑制＂早熟＂收敛现象,同时引入模拟退火算法以增强局部搜索能力,改进进化后期收敛速度慢的不足,最后结合典型非线性规划算例验证了混合算法的效率、精度和可靠性。     

强跟踪扩展卡尔曼滤波及其在捷联惯导初始对准中的应用

针对在模型失配和观测噪声干扰情况下常规滤波器出现精度下降甚至是发散的问题,提出了基于自适应多重渐消因子的改进方法,即通过计算新息序列协方差的估计值确定多重渐消因子,提高当前观测量对滤波器的修正作用。仿真及实测实验结果表明:该算法可以有效抑制滤波发散,同时保证其快速收敛以及高精度估计。     

再入目标质阻比估计算法研究

再入段目标识别的核心问题是快速高精度地估计出目标的质阻比。针对再入过程的非线性问题,重点研究了样条卡尔曼滤波器、扩展卡尔曼滤波器和一种基于"无损传输"的扩展卡尔曼滤波器,仿真实验从质阻比的估计精度和收敛速度以及计算量等方面比较了各滤波算法的性能。仿真结果表明基于无损传输的扩展卡尔曼滤波器的估计精度最高,收敛速度最快。     

RTDX与Matlab实现基于DSP的FIR滤波器设计

介绍了一种RTDX与Matlab结合设计基于DSP的FIR数字滤波器的方法.在VB中调用Matlab进行指定特性FIR数字滤波器设计,获得各阶权系数,然后调用RTDX,实时地向目标硬件传递该系数,从而实现了基于DSP的FIR数字滤波器精确设计,提高了DSP算法软件的设计效率.并对TI的RTDX技术及使用方法作了相关介绍.     

基于Laguerre滤波的雷达通道均衡方法

传统雷达通道均衡采用自适应FIR滤波器作为均衡器,当理想脉冲响应序列很长时,其逼近效果不理想,计算量大。Laguerre滤波器兼具FIR和IIR结构的优点,通过在单位圆内固定一极点保证了系统的稳定,又因为引入了全通滤波环节,使其能够用较少的阶数逼近长脉冲序列响应。推导了Laguerre滤波器的自适应算法,并将其应用于雷达通道均衡中,仿真实验也证明了它与传统的FIR结构相比,用更少的系数获得了更优的对消比,达到了更好的均衡效果。     

A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables

A branch and bound algorithm is developed for a class of allocation problems in which some constraint coefficients depend on the values of certain of the decision variables. Were it not for these dependencies, the problems could be solved by linear programming. The algorithm is developed in terms of a strategic deployment problem in which it is desired to find a least-cost transportation fleet, subject to constraints on men/materiel requirements in the event of certain hypothesized contingencies. Among the transportation vehicles available for selection are aircraft which exhibit the characteristic that the amount of goods deliverable by an aircraft on a particular route in a given time period (called aircraft productivity and measured in kilotons/aircraft/month) depends on the ratio of type 1 to type 2 aircraft used on that particular route. A model is formulated in which these relationships are first approximated by piecewise linear functions. A branch and bound algorithm for solving the resultant nonlinear problem is then presented; the algorithm solves a sequence of linear programming problems. The algorithm is illustrated by a sample problem and comments concerning its practicality are made.     

An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems.     

求最大数目不相交多约束QoS路由的一种新方法

针对多约束QoS路由问题中从资源点到目的点的最大数目的不相交路由,文章给出了一种基于罚函数与整数规划的求满足QoS约束的最大数目的互不相交路由算法。该算法利用了路由模型的结构特性,使整数规划问题转化为线性规划问题,初步的算例表明算法是有效的。     

Bicriteria product design optimization: An efficient solution procedure using AND/OR trees

Competitive imperatives are causing manufacturing firms to consider multiple criteria when designing products. However, current methods to deal with multiple criteria in product design are ad hoc in nature. In this paper we present a systematic procedure to efficiently solve bicriteria product design optimization problems. We first present a modeling framework, the AND/OR tree, which permits a simplified representation of product design optimization problems. We then show how product design optimization problems on AND/OR trees can be framed as network design problems on a special graph—a directed series‐parallel graph. We develop an enumerative solution algorithm for the bicriteria problem that requires as a subroutine the solution of the parametric shortest path problem. Although this parametric problem is hard on general graphs, we show that it is polynomially solvable on the series‐parallel graph. As a result we develop an efficient solution algorithm for the product design optimization problem that does not require the use of complex and expensive linear/integer programming solvers. As a byproduct of the solution algorithm, sensitivity analysis for product design optimization is also efficiently performed under this framework. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 574–592, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10031     

目标选择优化模型及算法

提出了可用于大威力武器火力分配的目标选择优化模型及算法。内容包括：问题的数学描述、问题的等价变换与分解、问题求解的动态规划算法和不同算法的计算次数比较。     

A finite descent theory for linear programming,piecewise linear convex minimization,and the linear complementarity problem

A descent algorithm simultaneously capable of solving linear programming, piecewise linear convex minimization, and the linear complementarity problem is developed. Conditions are given under which a solution can be found in a finite number of iterations using the geometry of the problem. A computer algorithm is developed and test problems are solved by both this method and Lemke's algorithm. Current results indicate a decrease in the number of cells visited but an increase in the total number of pivots needed to solve the problem.     

多传感器任务分派的快速启发式规划新算法

在多目标多传感器管理中经常采用的线性规划算法中,随着传感器个数和目标个数的增加,计算量会爆炸式增长,使得跟踪系统不能实时计算,为此,根据传感器管理中线性规划的特点,提出了一种快速启发式算法,考虑组合中的传感器个数将组合的分配效用转化为权重,递推分配权重最大的组合,逐步减小组合和目标的个数.证明了权重最大的组合分派能实现组合中的传感器的最大效用.仿真结果表明该算法在与采用线性规划方法的跟踪精度相当的情况下,能有效地减小计算量.     

变量有界线性目标规划的对偶算法

本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。