冲激SAR成像的分辨率估计

后向投影 (BP)算法是一种被广泛应用于冲激SAR的成像算法。当冲激SAR的发射信号是某一类冲激信号时 ,根据冲激SAR成像的特点 ,推导出BP算法的方位分辨率与成像积累角、信号中心频率的关系。仿真结果表明 ,在相当范围内 ,估计公式都是准确的     

基于数据场的作战单元价值评估模型

作战单元价值是目标选择的重要依据。根据作战单元在作战体系中的效用和影响,提出作战单元的属性价值和级联价值及其量化方法,利用层次分析法和数据场理论,分别评估作战单元的属性价值和级联价值,建立作战单元价值评估模型,并进行仿真分析,验证该评估模型的有效性。     

欠驱动无人艇自适应滑模航迹跟踪控制

为便于航迹跟踪控制器设计和分析,引入坐标变换,建立典型的欠驱动无人艇数学模型;建立以航迹上自由点为原点的Serret-Frenet坐标系,实现对航迹跟踪误差变量的描述;通过将航迹参数的更新律作为一附加控制输入,实现了无人艇航迹跟踪控制系统由欠驱动向全驱动控制的转变,并利用改进视线导引算法实现了对无人艇位置的跟踪控制;考虑海流等外界扰动的影响,采用滑模自适应技术分别设计了无人艇航向和航速控制算法,实现了对航向角、纵向速度跟踪误差的镇定;基于李雅普诺夫理论和级联系统理论证明了航迹跟踪控制系统的一致半全局指数和一致全局渐进稳定性。仿真结果表明:所提出的控制算法可在一定程度上处理海流等外界扰动,跟踪效果良好,并且克服了角速度持续激励问题,能够同时实现对直线和曲线航迹的跟踪。     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

双频去相关单历元动态解算整周模糊度研究

针对GPS实时动态精密相对定位应用背景,提出一种整周模糊度实时求解方法。采用宽巷组合载波相位双差、伪距双差观测信息建立观测模型;对浮点模糊度协方差阵进行一次Cholesky分解,构造了浮点转换矩阵,使浮点模糊度完全去相关;推导确定整周模糊度的搜索空间;利用最小残差平方和搜索准则,确定单历元整周模糊度,并用OVT检验方法,对不同历元得到的整周模糊度进行一致性检验。结果表明,观测量误差均方差取值对整周模糊度搜索空间和成功率有较大影响,附加OVT检验的双频去相关单历元动态解算整周模糊度方法正确可行。     

基于竞赛图的海上编队协同作战冲突排序方法

海上编队协同作战中的冲突消解顺序问题能影响编队作战效能。为了确定冲突消解的顺序问题,采用基于综合集成权重的竞赛图方法来表示多种冲突的有序关系,定量化给出了各冲突严重程度的排序结论,不仅为指挥员的决策提供了依据,而且提出了一种有序替代具体数值的定量化分析方法。结果证明,该方法简单、有效。     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

求最大数目不相交多约束QoS路由的一种新方法

针对多约束QoS路由问题中从资源点到目的点的最大数目的不相交路由,文章给出了一种基于罚函数与整数规划的求满足QoS约束的最大数目的互不相交路由算法。该算法利用了路由模型的结构特性,使整数规划问题转化为线性规划问题,初步的算例表明算法是有效的。     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

机载叶簇穿透超宽带SAR系统关键指标设计

对影响叶簇穿透超宽带SAR系统性能的三个最主要的技术参量 (工作频率、极化形式和分辨率 )进行了深入系统的分析 ,其结论性意见对超宽带雷达系统顶层设计有实用参考价值