期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
一种基于优先级的卫星成像任务快速规划流程 被引量:2
1
作者 李海玲 党琦 《载人航天》 CSCD 北大核心 2018年第6期821-826,共6页
针对现有卫星成像任务规划算法模型复杂、计算量大、难以满足快速成像任务规划需求的问题,对成像任务规划中的各个过程进行了分析和分解,讨论了点目标可见预报算法及任务规划过程,建立了星历和星下点计算模型,给出了基于目标的重要程度... 针对现有卫星成像任务规划算法模型复杂、计算量大、难以满足快速成像任务规划需求的问题,对成像任务规划中的各个过程进行了分析和分解,讨论了点目标可见预报算法及任务规划过程,建立了星历和星下点计算模型,给出了基于目标的重要程度和紧急程度的成像任务优先级确定方法,通过分析无侧摆和有侧摆卫星任务规划的特点,设计了一种基于观测目标优先级的成像任务规划流程,能够通过分布式或并行计算,实现成像任务快速规划。 展开更多
关键词 成像任务规划 蚁群算法 遗传算法 0/1背包算法
下载PDF
A New Searching Strategy for the Lost Plane Based on RBF Neural Network Model and Global Optimization Model
2
作者 Yiqing YU 《International Journal of Technology Management》 2015年第4期126-128,共3页
In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF n... In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power. 展开更多
关键词 the trajectory of floats RBF neural network model Global optimization model 0-1 knapsack problem improved geneticalgorithm
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部