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

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

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     

盲稀疏度下基于粒子滤波的稀疏信号重构

针对现有贪婪迭代类压缩感知重构算法对非高斯量测噪声抵抗性差的问题,提出一种盲稀疏度下基于粒子滤波的稀疏信号重构算法。该算法首先将鲁棒性更高的Huber损失函数替代常规的二次损失函数,用来增加对非高斯噪声的抵抗能力;并且引入粒子滤波实现对原始信号的最优估计,以削弱量测噪声的影响;最后在信号稀疏度未知的条件下,结合稀疏度自适应匹配追踪算法实现盲稀疏度下的原信号重构。理论分析和仿真结果表明,所提算法可以有效抵抗因非高斯噪声干扰或稀疏度未知导致的重构精度降低,且重构性能优于现有典型贪婪迭代类算法。     

基于果蝇优化算法的备件柜布局优化

备件车是保障维护其他装备正常运行的车辆,其备件柜的布局是否优化决定备件的更换速率,甚至影响整个系统的工作效率。针对备件柜的布局进行了深入研究,并通过计算实现了备件柜的布局分布。在备件柜的布局优化过程中运用了剩余矩形匹配的布局策略,并结合备件柜的布局特点对该算法进行了相应改进,使其更好地运用在本研究的布局问题中。同时运用果蝇优化算法来确定剩余矩形匹配权重的计算,在布局过程中将传统的布局策略和智能算法相结合以达到优化的目的。     

杠杆式抽筒子的动态特性研究及拓扑优化设计

针对杠杆式抽筒子工作时出现的断裂失效问题,以动力学和有限元理论为基础,分别进行抽筒子的动态特性研究和拓扑优化设计。得出其在抽筒过程中的动应力分布和危险区域,定性地确定出介质力学参数和工作参数的影响,获得了抽筒子的最佳材料布局和优化改进结构。优化前后抽筒子结构的对比仿真结果表明,改进结构能够使得应力集中危险区域仅为最大动应力降低10.6%的强撞击位置,其余部分均可转换为安全区域且结构刚度提升49%左右。所用方法有效可靠,为解决杠杆式抽筒子的断裂问题提供理论依据和技术手段。     

边缘化粒子概率假设密度滤波的多目标跟踪

针对复杂情况下的多目标跟踪问题,提出一种边缘化粒子概率假设密度滤波(MPF-PHD)方法。该方法首先将复杂情况下多个目标的状态向量分别提取出其中的非线性状态与线性状态。然后利用粒子概率假设密度滤波(PF-PHD)估计非线性状态,利用卡尔曼滤波(KF)估计线性状态,并把其中与非线性状态相关的线性状态估计用来优化非线性状态估计。通过对MPF-PHD方法与传统的PF-PHD方法仿真对比,验证了MPF-PHD方法有效解决了复杂情况下多目标跟踪的漏检问题,提高了多目标状态估计精度。     

基于对比度最优的VCO调频非线性误差估计与校正方法

针对VCO调频非线性误差的准确估计与校正问题,提出一种以一维距离像对比度最优为准则的自适应估计与校正方法。本方法建立引入温度变量的VCO频率特性模型,并据此估计出某一温度值对应的调频非线性误差,在对中频回波进行误差补偿和一维脉压后,以一维距离像的对比度最优作为迭代收敛准则,实现调频非线性误差的最优估计与校正。仿真和实测数据结果表明,该方法充分考虑了温度因素对VCO输出频率的影响,能够在不增加硬件复杂度的前提下,通过算法实现对调频非线性误差的估计、跟踪与补偿。与传统基于硬件电路进行估计或校正的方法相比,新方法无需由硬件组成闭环估计通道,且具有实时性强、运算量小、补偿精度高的优点,对于克服实际工程应用中VCO器件的参数漂移问题具有重要指导意义。     

有限时间热力学研究的一些进展

介绍近年来在不可逆热机理论、回热式燃气轮机循环分析、类热机装置分析和广义热力学优化理论研究中的一些进展 ,并简要阐述其发展方向 .