快速解命中的一种改进算法

基于对火控系统命中函数的考察,提出了一种将简单迭代法、改进迭代法和快速迭代法相结合的改进算法。仿真结果表明,该方法能明显提高解算精度,减小计算量,缩短迭代时间。     

基于组合牛顿迭代法的改进IEKF及其在UNGM中的应用

从高斯-牛顿迭代的角度对迭代扩展卡尔曼滤波(IEKF)进行分析,提出了一种基于组合牛顿迭代法的改进IEKF算法。该算法通过实时判断每次迭代对状态的逼近程度,采用加权平均的方法确定新的迭代值,继而采用卡尔曼滤波框架对状态进行量测更新。新算法较传统的IEKF具有精度高以及对初值不敏感的优点。实例仿真验证了该算法的有效性。     

基于TOA预测的非同步照射辐射源定位算法

针对现有基于TDOA的定位算法难以适应辐射源信号非同步到达的实时定位问题,提出了一种基于TOA预测的非同步照射辐射源定位算法。该算法采用脉冲样本图外推法通过各站接收的短时脉冲列计算TDOA序列(TDOAs),并通过牛顿迭代法实现对辐射源位置的初步估计。对新到达的脉冲采用脉冲样本图外推法进行TOA预测,判别脉冲属性,进而获得新的TDOA测量值,然后采用扩展卡尔曼滤波算法实现对辐射源位置的实时更新。仿真分析表明:该算法解决了非同步照射引起的难以计算TDOA的问题,并增强了处理的实时性。     

结合多层快速多极和ILUT预处理算法分析复杂目标的电磁特性

分层快速多极算法(MLFMM)和ILUT预处理算法被结合来分析电大尺寸目标的电磁散射和辐射特性。采用矩量法求解电磁场积分方程,最终须要求解一线性方程组。分层快速多极算法被用来加速用迭代法求解线性方程组时的矩阵向量乘积的运算。ILUT预处理算法被用来降低方程组系数矩阵的条件数,加快迭代法的收敛速度。计算实例表明了该方法的通用性和高效性。     

弹道导弹基本诸元的快速装订算法研究

应用牛顿迭代法实现了弹道导弹基本诸元的快速装订。推导了根据落点偏差求飞行程序角和发射方位角的牛顿迭代公式，设计了迭代算法，并给出了实际算例。考虑到迭代算法收敛速度与所给的迭代初值有一定的关系，提出了预先准备简易射表采用反插值算法为牛顿迭代法准备初值的方法，经计算表明可以大大减少迭代次数，从而实现标准弹道的快速设计。     

一种改进的整周模糊度去相关算法

目前LAMBDA算法中常用的2种去相关算法为逆整数乔里斯基算法和迭代法算法,这2种去相关算法在运算处理过程会出现病态的变换矩阵,影响去相关程度且降低了去相关的成功率。因此提出了一种改进去相关算法并进行了算法性能分析,通过从矩阵条件数和相关数对3种算法进行了仿真比较。结果表明,改进算法去相关处理效果得到明显改善。     

基于AKF的AUV对接回收组合导航研究

针对自主水下机器人(Autonomous Underwater Vehicle,AUV)在回收过程中的组合导航精度问题,提出了一种改进的高斯距离迭代法及改进的自适应卡尔曼滤波算法(Adaptive Kalman Filter,AKF).基于AUV回收对接系统,研究并建立了针对惯导SINS、超短基线USBL、多普勒计程仪DVL和深度计的基于斜距的组合导航模型.通过对SINS/USBL/DVL/深度计组合导航量测信息误差特性分析,设计了改进的基于斜距的SINS/USBL/DVL/深度计组合导航模型;针对该模型突出的滤波发散问题,设计了基于滤波收敛性判据和强跟踪滤波思想改进的AKF滤波算法进行有机融合.仿真结果表明,此研究使实际AUV系统具有更高的滤波精度和可靠性.     

纯方位系统TMA非线性最小二乘法——理论数学模型与常规算法

对非线性最小二乘法应用于纯方位系统目标运动分析进行了综合评述,介绍了经典的非线性最小二乘法及几种常规算法:高斯—牛顿迭代法,麦夸脱迭代法,自适应非线性最小二乘法,给出了非线性最小二乘法对纯方位目标运动分析的四个数学模型:高度非线性模型,减弱非线性模型,再减弱非线性模型,再进一步减弱非线性模型。     

纯方位系统TMA非线性最小二乘法——理论数学模型与常规算法

对非线性最小二乘法应用于纯方位系统目标运动分析进行了综合评述,介绍了经典的非线性最小二乘法及几种常规算法：高斯—牛顿迭代法,麦夸脱迭代法,自适应非线性最小二乘法,给出了非线性最小二乘法对纯方位目标运动分析的四个数学模型：高度非线性模型,减弱非线性模型,再减弱非线性模型,再进一步减弱非线性模型。     

非线性最小二乘算法在双基地雷达目标定位中的应用

双基地雷达的目标定位解是一个非线性优化问题,引入了高斯-牛顿迭代法解非线性最小二乘方程组,为了提高迭代的收敛性和目标位置解的准确性,采用精度最高的一组测量子集单元解算出的定位解作为迭代初始值,并充分利用了所有的观测信息.仿真结果表明,采用该种算法迭代次数少,比简化加权最小二乘算法(SWLS)有更准确的目标定位解,从而使得整个受控区域内的定位精度有较大提高,定位性能得到优化和改善.     

基于最优分离矩阵循环迭代的盲源分离次序调整算法

文章针对盲源分离中输出信号帧与帧之间信号衔接顺序的不确定性问题,提出了最优分离矩阵循环迭代算法,将每帧信号分离时目标函数寻优所得分离矩阵作为下一帧循环的初始化矩阵进行迭代来分离信号。理论分析与计算机仿真表明:该算法能有效解决盲分离中信号次序的不确定性问题,具有较强的实际应用价值。     

嵌入遗传算法的顺轨干涉SAR海表流场反演新方法

顺轨干涉SAR海表流场探测技术研究对于实现流场探测的全球化、精细化具有重要作用。为了提高海表流场迭代收敛速度和参数反演精度,依据校正系数的参数特点构建适应度函数的约束关系,将校正系数设计问题转化为仿真干涉相位与实测干涉相位差和雷达、平台参数约束条件下的比例因子选择问题,进而设计遗传算法计算校正系数的技术方法,并嵌入海表流场迭代反演算法,从而构建一种反演新方法。星载SAR数据仿真实验结果表明:海表流向反演的均方根误差优于10.0°,海表流速的均方根误差优于0.1 m/s,这符合海表流场反演精度要求。改进的海表流场反演算法可减少2~3次迭代,有效提高了反演效率。研究对于提高顺轨干涉SAR海表流场探测的实效性和准确性具有重要意义。     

Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations

We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

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

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

Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Revenue maximization in two-station tandem queueing systems

We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis.     

Optimal production ramp-up in the smartphone manufacturing industry

Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up.     

An improved adaptive differential evolution algorithm for single unmanned aerial vehicle multitasking

Single unmanned aerial vehicle (UAV) multitasking plays an important role in multiple UAVs cooperative control, which is as well as the most complicated and hardest part. This paper establishes a three-dimensional topographical map, and an improved adaptive differential evolution (IADE) algorithm is proposed for single UAV multitasking. As an optimized problem, the efficiency of using standard differential evolution to obtain the global optimal solution is very low to avoid this problem. Therefore, the algorithm adopts the mutation factor and crossover factor into dynamic adaptive functions, which makes the crossover factor and variation factor can be adjusted with the number of population iteration and individual fitness value, letting the algorithm exploration and development more reasonable. The experimental results implicate that the IADE algorithm has better performance, higher convergence and efficiency to solve the multitasking problem compared with other algorithms.     

A new polynomial algorithm for maximum value flow with an efficient parallel implementation

A new algorithm is presented for finding maximal and maximum value flows in directed single-commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc.