舰载对陆巡航导弹规划航路点间距离的计算分析

针对舰载对陆巡航导弹在实际飞行中,其航迹需要参考近似大地线的航线,在充分考虑导弹由海对陆的航路规划过程基础上,提出了易于编程、精度有所改进的空间两点间大地距离的计算方法.该方法在考虑高程的地球椭球模型参数的求取基础上,利用Bowring反解公式重新推导了顾及高程的空间航路点间的计算公式.相关算例表明,该方法提高了导弹规...     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

机器人集群路径规划技术研究现状

受社会型生物群体行为启发,群体智能得到日益广泛的关注,机器人集群作为群体智能的重要承载者得到了大量研发和广泛应用.机器人集群路径规划技术作为一项核心关键技术也得到快速发展.为此全面深入地调研了机器人集群路径规划的技术发展现状,创新性地归纳了适用于不同集群规模、可扩展性要求、通信需求以及算法要求的集群规划基础计算架构,包...     

面向卫星的在轨服务任务规划方法

针对空间在轨服务日趋成熟以及在轨服务现实需求增长的背景,以在轨服务航天器为研究对象,研究面向卫星的在轨服务任务规划问题,探讨如何合理安排与调配在轨服务资源。将问题分解为在轨服务资源分配和在轨服务路径规划两层,并建立双层优化数学模型。设计在轨服务任务规划算法求解问题,包括基于多种群并行进化的混沌遗传算法和基于全局坐标转换的NSGA-Ⅱ+GSDE算法,并通过仿真结果对比分析,验证算法的可行性和有效性。     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019     

武警部队快速机动中最优路径的实现

紧急条件下武警部队快速机动最优路径,是一个多目标多约束随机动态交通网络寻优问题。在分析交通网络拓扑化特点及最短路模型前提下,着重研究道路通行能力带给复杂公路网络道路寻优问题的影响,并结合GIS系统利用改进的Dijkstra算法求解。     

利用矩阵求极大相容类的一种方法

寻找相容关系的极大相容类和简单图的极大完全子图,在解决二元关系与数据挖掘和管理决策中的具体问题时有重要作用。利用相容关系的极大相容类与简单图的极大完全子图之间的对应关系,对极大完全子图的路径长度进行分析,得到了关于极大完全子图路径长度的一个定理。并根据该定理构造了一个用矩阵的路径长度搜索简单图的极大完全子图的方法,进而利用该方法找出了对应相容关系的极大相容类。     

基于k短路径的兵力机动路线优化方法

由于传统Dijkstra算法只能求解最优路径,结合兵力机动路线选择的需要,将求解k短路径的实用算法引入到兵力机动路线优化问题中,给出了算法的数据结构和步骤。在道路权重的确定上,提出将路程、通行能力和安全性三项指标相结合的思想,并给出了综合权重的计算方法。仿真实验表明所提方法具有较强的实用性。     

图论最短路径问题在消防选址中的应用

最短路径问题是图论解决的典型实际问题之一,可用来解决管路铺设、线路安装、厂区布局和设备更新等实际问题。介绍了图论最短路径问题及其算法,并应用图论最短路径问题的分析方法,解决城市消防站的选址问题。     

基于几何算法的水下航行器路径规划

在分析水下航行器路径规划影响因素及主要障碍物特点的基础上,提出了一种基于几何算法的水下航行器路径规划算法,并采用该算法对障碍物进行建模和路径规划研究,解决了水下航行器航经多障碍物海区的路径规划问题.最后,通过仿真试验验证了该算法的准确性与可行性.