首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于数据驱动的移动目标卫星任务规划
作者姓名:温 新  顾 玥
作者单位:北京航空航天大学 自动化科学与电气工程学院;上海航天控制技术研究所
基金项目:国家自然科学基金(61633003)
摘    要:卫星任务规划是卫星地球观测的重要前提。传统的卫星任务规划主要针对固定地面目标,不能满足日益复杂的任务需求。针对移动目标的卫星观测任务,提出了一种基于数据驱动的移动目标卫星任务规划方法。该方法在大量的移动目标数据的基础上,通过改进的长短期记忆神经网络算法预测了目标的未来轨迹和位置信息,并通过约束满足型遗传算法规划了基于预测算法结果的移动目标卫星观测任务。鉴于移动目标观测中约束和任务冲突的复杂性,约束满足型遗传算法以条件形式将约束嵌入到遗传算法中,并在算法中特别设计了冲突消除算子以解决任务冲突问题。仿真结果证明了该方法在解决移动目标卫星任务规划问题上具有优良的效率,并获得了很高的观测精度。

关 键 词:移动目标卫星观测  任务规划  改进的长短期记忆神经网络算法  约束满足型遗传算法

Satellite Mission Planning for Moving Targets Observation via Data Driven Approach
Authors:WEN Xin  GU Yue
Institution:School of Automation Science and Electrical Engineering, Beihang University; Shanghai Aerospace Control Technology Institute
Abstract:Satellite mission planning is an important premise for earth observation. Traditional satellite mission planning is mainly aimed at fixed ground targets, which cannot meet the increasingly complex mission requirements. This paper considers the moving target observation, and puts forward a method of satellite mission planning for moving target via data driven approach. Based on a large amount of moving target data, this method forecasts the future track and position information of the moving target through a modified long short-term memory networks algorithm, and proposes a constraint satisfaction genetic algorithm to plan the missions of moving target observation based on the results of prediction algorithm. In view of the complexity of the constraint and task conflict in the moving target observation, mission planning algorithm embeds the constraints into the genetic algorithm through conditional forms, and a conflict resolution operator is designed in mission planning algorithm to resolve task conflicts. The simulation results demonstrate the efficiency of the method to solve the mission planning and get higher observation accuracy.
Keywords:
点击此处可从《》浏览原始摘要信息
点击此处可从《》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号