检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工业大学控制与仿真中心,哈尔滨150080
出 处:《宇航学报》2017年第2期131-142,共12页Journal of Astronautics
基 金:国家自然科学基金(61473099;61333001)
摘 要:针对单一寻的飞行器在具有探测干扰屏障的制导场景中难以精确探测目标的问题,提出一种新型分体式制导策略。该策略采用两个飞行器分别完成对目标的观测与拦截,二者通过合理的信息交互与轨迹配合,从而令拦截器能够间接获取高精度制导信息。首先对分体式制导策略进行数学描述,建立分体相对运动模型和探测模型;然后将拦截器与目标间相对运动状态估计的Cramer-Rao下界作为探测性能指标并进行理论分析,从而指出观测轨迹是提高目标探测性能的关键因素;进而综合考虑目标探测性能与观察器的燃料消耗,将观测轨迹设计问题描述成一个动态多目标优化问题,并给出一种分解优化算法以提高求解效率;最后,仿真飞行算例验证了分体式制导策略的有效性。To deal with the target detection problem in the complex interception engagement where some jamming barriers exist,a novel fractionated guidance strategy is presented. In this strategy,two flight vehicles are adopted to implement target observation and interception respectively,and high precision guidance information can be obtained indirectly via proper information fusion and trajectories design. The fractionated guidance engagement is described firstly in terms of mathematical models of relative motion and detection. Then the detection characters of fractionated guidance are analyzed in terms of the estimated Cramer-Rao low bound of the relative states between the interceptor and target. The analysis results show that the observation trajectory is of critical importance to the improvement of target detection.Furthermore,the observation trajectory design problem is formulized as a multi-object dynamic optimization problem with the tradeoff between the target detection accuracy and the observer 's fuel consumptions. To improve the numerical calculation efficiency of the problem,an optimization algorithm based on decomposition is introduced. Finally,the validness of the proposed fractionated guidance strategy is demonstrated by simulation results.
关 键 词:分体式飞行器 复杂探测环境 轨迹优化 CRAMER-RAO下界 多目标优化
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222