航路规划中数字地图综合处理技术

以中远程反舰导弹航路规划为背景,研究了数字地图应用的相关处理技术。首先介绍了数字高程模型及其相应的处理技术,其次论述了对数字海图进行网格划分的基本原则,然后分析了计算地图上每个网格单元的代价MC(Map Cost)所需考虑的主要因素,最后给出由MC生成的最小代价BC(Best Cost)的方法,为下一步航路规划算法的实现奠定了基础。     

用于任务规划的航母编队防空威胁建模

建立正确的航母编队防空威胁模型是反航母任务规划成功的前提,在分析网络化条件下航母编队综合防空反导体系作战特点基础上,综合考虑反舰导弹性能、防空雷达网和编队防空火力威胁等因素,利用加权指数方法建立了网络化条件下航母编队综合防空网络威胁模型。仿真结果表明该模型能够体现航母网络化防空体系的真实情况,可以用于反航母任务规划。     

基于GP的计划生成方法

针对计划生成的计算复杂性和传统遗传算法在求解组合问题时的低效率,结合任务策略提出了一种基于遗传程序设计的计划生成方法。利用业务活动域的任务策略知识来指导遗传操作,减少了完全随机遗传操作造成的无效操作,并且在进化过程中使高阶模式和低阶模式获得共同的进化机会,提高了遗传算法的效率。     

装备保障信息资源规划框架设计

分析了我军装备保障信息资源的现状,找出了信息资源建设中存在的主要问题。针对我军装备保障实际,依据信息资源规划理论,提出了装备保障信息资源规划的总体方案框架及工程化方法。旨在为装备保障信息系统的开发打下基础,以促进装备保障信息化建设的进程。     

Robust capacity planning in semiconductor manufacturing

We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

舰艇编队导弹航路规划仿真系统设计与实现

通过分析火力分配、区域划分、航路规划三者的关系,提出了舰艇编队导弹航路规划三位一体战术决策的思想.设计了一个以此为背景,基于高层体系结构(HLA)的可扩展、开放式仿真体系结构.依据HLA/RTI规范,设计开发了仿真联邦的联邦/仿真对象模型.基于系统的离散事件仿真特征,采用事件调度的仿真策略,利用Petri网建立了系统的...     

基于激光雷达的移动机器人实时位姿估计算法

提出一种基于二维激光雷达的移动机器人实时位姿估计算法。该算法首先将环境数据聚类为不同的障碍物,然后利用障碍物的特征匹配来关联相邻2帧的障碍物,最后通过优化位置序列间的方向角实现机器人的位姿估计。与ICP（迭代最近点）算法对比验证表明：该算法与ICP具有相同数量级的位姿估计精度,且明显提高了计算效率。     

自动化电弧喷涂路径偏移间距的优化模型

基于电弧喷涂沉积丘的轮廓呈高斯分布的假设,并结合实验结果,建立了电弧喷涂沉积丘轮廓的数学模型,由此推导出了自动化喷涂过程中平行路径偏移间距这一重要参量的优化模型。该模型为合理规划自动化喷涂的路径提供了依据。