轴流泵出口环量变化规律与几何参数一体化最优设计方法

最近十几年来,叶轮机械最优设计取得了很大进展。作为其最优设计系统的一个典型环节,叶片泵的设计优化得到了重视。近年来,我国开始探索采用变轴面速度、变环量流型进行轴流泵水力设计,并讨论环量分布规律的优化问题。文献针对不同的目标函数,分别求解叶轮直径及出口环量分布规律最佳值,这等于把一个完整的问题分解了,并不一定能保证     

少烟推进剂配方优化设计

本文报道了关于降低固体火箭发动机喷气羽烟对微波、激光制导信号的干扰和衰减的研究成果——一种少烟HTPB推进剂。它具有低压点火性能良好,燃烧稳定,能提高排气羽烟对微波和激光透过率三倍以上。     

极大代数及其在离散事件动态系统中的应用

在人类社会活动中,有许多活动属于离散事件或离散事件动态系统。在极大代数意义下,这类系统可用线性系统的理论和方法建立数学模型、求解状态方程,讨论可控性、可观性,以及实现系统运行的优化设计。     

化学反应驱动热机的功率优化

本文基于一级和二级化学反应动力学理论,讨论化学反应驱动有限热容热源内可逆卡诺热机系统的功率优化问题,得到了一些新的结果。     

野战防空C3I系统的目标指示雷达测量误差对目标火力分配的影响

以某野战防空Ｃ３Ｉ系统为背景,针对目标雷达的测量误差对系统目标火力分配的影响进行了分析,在系统分别配置警１７雷达和３８７雷达的情况下,通过仿真给出目标落入武器单元火力范围的最大概率和概率分布曲线图,提出系统建模应考虑的一些因素,为大系统的性能分析和总体建模奠定了基础     

A COMPLEX OF TWO OPTIMIZATION IDEAS IN OPTICAL AUTOMATIC DESIGN

ＡＣＯＭＰＬＥＸＯＦＴＷＯＯＰＴＩＭＩＺＡＴＩＯＮＩＤＥＡＳＩＮＯＰＴＩＣＡＬＡＵＴＯＭＡＴＩＣＤＥＳＩＧＮＷａｎｇＹｏｎｇｚｈｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＰｈｙｓｉｃｓ,ＮＵＤＴ,Ｃｈａｎｇｓｈａ,４１００７３）Ａｂｓｔｒａｃｔ：...     

交互式增广加权范数法及其应用

本文提出利用增广加权范数把多目标优化问题转化为标量优化问题,证明了转化后的问题与原问题完全等价,同时给出了目标函数值与权系数的关系,建立了以目标函数值作为交互媒介的多目标优化方法,最后给出了应用该方法的一个实例。     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

液压驱动型四足机器人对角小跑步态本体水平位置控制方法

为了对对角小跑中四足机器人本体的水平位置进行控制,建立基于沿支撑线方向运动分解的机器人近似动力学模型,将本体和对角支撑腿简化为一个七连杆结构和一个线性倒立摆,并且基于线性倒立摆解析模型提出摆动腿落足点位置计算方法,进而实现对本体水平位置的控制。针对液压作动器伸缩速度受限的问题,利用单腿冗余关节将关节角速度优化问题转化为标准二次型规划问题,通过设计二次型规划问题解法,降低对摆动腿关节角速度的需求,并且避免了传统伪逆方法可能产生的腿部奇异位型。仿真和实验结果表明:该方法能够实现在关节角速度受限的情况下,有效跟踪本体水平位置的期望轨迹。     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017