电光与控制
電光與控製
전광여공제
ELECTRONICS OPTICS & CONTROL
2013年
10期
22-26,37
,共6页
董康生%曹林平%丁达理%刘鹤鸣%轩永波
董康生%曹林平%丁達理%劉鶴鳴%軒永波
동강생%조림평%정체리%류학명%헌영파
无人作战飞机%对地近距作战%轨迹规划%雷达规避%HP伪谱法
無人作戰飛機%對地近距作戰%軌跡規劃%雷達規避%HP偽譜法
무인작전비궤%대지근거작전%궤적규화%뢰체규피%HP위보법
UCAV%air-to-ground short range strike%trajectory planning%radar avoiding%HP pseudos-pectrum
研究了无人作战飞机( UCAV)自主对地攻击轨迹规划问题。首先,建立了考虑发动机燃油消耗、飞行约束和武器投射终端约束的多约束模型,研究了UCAV动态雷达威胁问题,建立了随姿态和距离变化的精确雷达探测概率模型;其次,详细分析了HP伪谱法基本理论及其求解最优控制问题策略,利用HP伪谱法并结合对地近距作战实战背景,分别以时间最短、威胁代价最小和定时飞行为目标函数进行雷达规避轨迹规划仿真研究,得到了期望的攻击轨迹并对3条轨迹进行了深入对比分析;最后,对仿真结果进行了精度分析,分析计算表明仿真误差在允许范围内,再次验证了方法的可行性。
研究瞭無人作戰飛機( UCAV)自主對地攻擊軌跡規劃問題。首先,建立瞭攷慮髮動機燃油消耗、飛行約束和武器投射終耑約束的多約束模型,研究瞭UCAV動態雷達威脅問題,建立瞭隨姿態和距離變化的精確雷達探測概率模型;其次,詳細分析瞭HP偽譜法基本理論及其求解最優控製問題策略,利用HP偽譜法併結閤對地近距作戰實戰揹景,分彆以時間最短、威脅代價最小和定時飛行為目標函數進行雷達規避軌跡規劃倣真研究,得到瞭期望的攻擊軌跡併對3條軌跡進行瞭深入對比分析;最後,對倣真結果進行瞭精度分析,分析計算錶明倣真誤差在允許範圍內,再次驗證瞭方法的可行性。
연구료무인작전비궤( UCAV)자주대지공격궤적규화문제。수선,건립료고필발동궤연유소모、비행약속화무기투사종단약속적다약속모형,연구료UCAV동태뢰체위협문제,건립료수자태화거리변화적정학뢰체탐측개솔모형;기차,상세분석료HP위보법기본이론급기구해최우공제문제책략,이용HP위보법병결합대지근거작전실전배경,분별이시간최단、위협대개최소화정시비행위목표함수진행뢰체규피궤적규화방진연구,득도료기망적공격궤적병대3조궤적진행료심입대비분석;최후,대방진결과진행료정도분석,분석계산표명방진오차재윤허범위내,재차험증료방법적가행성。
The automatic fight trajectory planning for the Uninhabited Combat Aerial Vehicle ( UCAV) in air-to-ground attacking was studied .Firstly,we established a multi-constraint model for UCAV by taking the thrust fuel consumption,flight constraint and weapon shooting terminal constraint into consideration,studied dynamic radar threats for UCAV,and built up a radar detection probability model changed with its posture and position .Then,we analyzed the HP pseudo-spectrum theory and strategy to solve optimal control problem,made simulations for radar-avoiding trajectory planning by taking the minimum time cost ( MT),lowest observable ( LO) probability and constant time ( CT) respectively as the objective function .Three expected trajectories were obtained and analyzed .Precision analysis was made to the simulation results,and the calculation results show that simulation error is kept in the allowed range ,which proves the feasibility of the proposed algorithm .