基于二次繁殖的自适应差分演化算法

分析了差分演化算法的基本原理,针对基本差分演化算法对控制参数选择敏感性强、算法后期收敛速度较慢等问题,提出了基于二次繁殖的自适应差分演化算法,并通过实验对改进算法的性能进行测试。实验结果表明,改进算法的性能优于基本差分演化算法和自适应差分演化算法。     

导弹最优制导律弹道仿真分析

根据导弹仿真数据,绘制可直观显示弹道特性的理想弹道曲线。给出了比例导引法的差分方程,建立了比例导引法的三维弹道仿真模型。在对比例导引法进行三维弹道仿真的基础上,分别对增量比例导引、基于二次型的最优制导律和考虑动态特性的二次型最优制导律进行了三维弹道仿真,绘制出了可直观显示弹道特性的理想弹道,计算了导弹与目标的遭遇时间,并对结果进行了比较分析。最后得出考虑弹体动态特性的二次型最优制导律具有最优性。     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

结构不确定线性时滞系统的无记忆鲁棒镇定

针对状态和控制均存在时滞的一类结构不确定线性时滞系统 ,讨论了鲁棒镇定问题 ,当不确定性参数满足有界性条件时 ,提出了一种无记忆线性状态反馈控制律 ,可保证闭环系统具有二次稳定性     

线性二次型及模型预测控制编队控制研究

多智能体集群作战是未来战场的重要形式.作为集群作战中的关键技术,编队控制有着广泛的应用.以编队控制律为研究目标,选择2种优化控制方法:线性二次型调节器(linear quadratic regulator,LQR)方法和模型预测控制(model predictive control,MPC)方法.针对圆形编队轨迹,采用...     

支持向量顺序回归机的线性规划算法

支持向量顺序回归机是标准支持向量分类机的一个推广,它是一个凸的二次规划问题。本文根据l1范数与l2范数等价关系和优化问题的对偶原理,把凸的二次规划转化成线性规划。由此提了支持向量顺序回归机的线性规划算法,进一步用数值实验验证了此算法的可行性和有效性。并与支持向量顺序回归机相比,它的运行时间缩短了,而且误差i不超过支持向量顺序回归机;     

瓦楞纸板同步剪切控制系统的设计与研制

介绍了微机控制瓦楞纸板同步剪切控制系统的设计研制。该系统由直流电机调速系统和单片微型计算机控制系统两大部分组成。直流调速系统采用线性二次型最优调节器方法设计,计算机控制系统采用单片微机双ＣＰＵ技术。它是一个大功率高精度机电控制系统,具有响应速度快,剪切精度高,可靠性好,操作方便的特点。     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一种基于导航点的航天器相对运动轨迹生成策略

针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.