声纳浮标均匀布放问题研究

针对声纳浮标的均匀布放问题,借鉴喷泉最优布放模型对此进行了研究。对声纳浮标的作用距离、平均场强、平均偏离强度进行建模,采用数值算法对正三角形阵的最优布放间隔进行了计算,并对其余两种阵型的计算方法进行了论述。经分析,认为正三角形、正四边形、正六边形是符合要求的三种基本阵型。所求得浮标间距能够满足工程上的要求,能够为反潜机的浮标布放提供决策依据。     

四种智能算法的比较研究

随着智能算法的研究深入,一些新的智能优化算法不断被提出,包括从遗传算法、蚁群算法、粒子群算法、人工鱼群算法等。这些算法都是从自然界的自然生物的特性启发而研究出来的,由于这些算法在求解时不依赖于梯度信息,因而特别适用于传统方法解决不了的大规模复杂问题。通过这些算法的介绍和分析,并通过测试函数测试了四种算法的收敛性、收敛速度和精度,评价了这些智能算法在求解函数优化问题的能力。最后对优化算法今后的发展方向进行了评述与展望。     

基于运载能力评估的固体运载火箭推力向量控制方案比较

从对运载能力影响角度开展固体运载火箭发动机推力向量控制系统比较分析研究。设计了三种采用不同发动机推力向量控制系统的多级固体运载火箭方案,将增广乘子法与共轭方向法相结合,对固体运载火箭上升段弹道进行了优化设计,给出运载能力评估结果。研究表明,起飞质量均为50 000kg,目标轨道均为300km太阳同步轨道时,采用栅格舵和侧喷流作为推力向量控制系统方案,比采用燃气舵和侧喷流作为推力向量控制系统方案,运载能力提高70kg,比各级固体发动机全部采用摆动喷管控制方案,运载能力提高115kg,为固体运载火箭总体方案论证提供理论依据。     

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     

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

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

地心甚高轨道星座构形协同捕获控制策略

针对地心甚高轨道星座构形协同捕获控制问题,基于虚拟编队方法设计了协同捕获控制策略,采用三脉冲燃耗最优轨迹规划算法对构形捕获轨迹进行协同规划;并且结合自适应全程积分滑模控制器对卫星各自转移轨迹进行跟踪控制。以10万km轨道高度的三星星座构形捕获为例进行仿真验证,仿真结果表明:该策略可以有效应用于地心甚高轨道星座构形捕获控制,能够在燃耗较少的情况下使星座中卫星同时到达各自的标称位置,同时具有较高的精度。     

海战场舰艇反潜作战的优化配置研究

针对海战场舰艇反潜作战行动的特点,为增大反潜作战能力进行优化配置。在建立数学模型的基础上,以舰艇搜索突击群有效搜索带宽度为主要因素以及其他诸如概率参数的相关要素对反潜搜索能力进行优化配置,从而获得最大反潜搜索能力和最佳作战行动效果。该方法可以较好地为海战场作战行动的模拟仿真和实际应用提供理论依据和决策参考。     

一种无缓冲的光互连网络的吞吐率性能分析及优化

针对当前高性能计算机光互连网络中存在的光缓冲不易实现的问题,提出了一种无缓冲的光互连网络结构BOIN,并在对网络结构进行建模和分析的基础上,研究了网络的吞吐率随不同的输入负载和网络规模而变化的规律,给出了在一定的互连总规模和输入负载下,网络实际吞吐率达到最大值时网络拓扑结构所必须满足的条件.最后用模拟实验证明了这一结果的正确性.     

Equilibrium customer strategies and social–profit maximization in the single‐server constant retrial queue

We consider the single‐server constant retrial queue with a Poisson arrival process and exponential service and retrial times. This system has not waiting space, so the customers that find the server busy are forced to abandon the system, but they can leave their contact details. Hence, after a service completion, the server seeks for a customer among those that have unsuccessfully applied for service but left their contact details, at a constant retrial rate. We assume that the arriving customers that find the server busy decide whether to leave their contact details or to balk based on a natural reward‐cost structure, which incorporates their desire for service as well as their unwillingness to wait. We examine the customers' behavior, and we identify the Nash equilibrium joining strategies. We also study the corresponding social and profit maximization problems. We consider separately the observable case where the customers get informed about the number of customers waiting for service and the unobservable case where they do not receive this information. Several extensions of the model are also discussed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011