CN104317305A - Preflight flight path confirmation method towards complex battleground menaces - Google Patents

Preflight flight path confirmation method towards complex battleground menaces Download PDF

Info

Publication number
CN104317305A
CN104317305A CN201410575003.8A CN201410575003A CN104317305A CN 104317305 A CN104317305 A CN 104317305A CN 201410575003 A CN201410575003 A CN 201410575003A CN 104317305 A CN104317305 A CN 104317305A
Authority
CN
China
Prior art keywords
flight path
flight
menaces
battleground
district
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201410575003.8A
Other languages
Chinese (zh)
Other versions
CN104317305B (en
Inventor
孙峥皓
杨玉生
阎岩
张尧
岑小锋
邓志均
毕永涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Launch Vehicle Technology CALT
Original Assignee
China Academy of Launch Vehicle Technology CALT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Academy of Launch Vehicle Technology CALT filed Critical China Academy of Launch Vehicle Technology CALT
Priority to CN201410575003.8A priority Critical patent/CN104317305B/en
Publication of CN104317305A publication Critical patent/CN104317305A/en
Application granted granted Critical
Publication of CN104317305B publication Critical patent/CN104317305B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Traffic Control Systems (AREA)

Abstract

Disclosed is a preflight flight path confirmation method towards complex battleground menaces. The preflight flight path confirmation method towards the complex battleground menaces aims at achieving effective evading of a jump glide type trans-aerosphere vehicle for the complex battleground menaces, uses a calculation method based on spherical geometry to judge a relative position between the trans-aerosphere vehicle and a menace area, and intuitively displays the battleground menaces and a flight path of the trans-aerosphere vehicle. The preflight flight path confirmation method towards the complex battleground menaces achieves fast solving of a multiple constraint flight path planning problem by building a flight path planning object function and using a flight path iteration mechanism based on multiple algorithm adaptation optimization. The preflight flight path confirmation method towards the complex battleground menaces can plan out an optimal flight path strong in survival ability, high in defense penetration efficiency and high in striking speed by comprehensively considering battlefield environment constraints and flight performance constraints before launch of the trans-aerosphere vehicle, enables the trans-aerosphere vehicle to have ability of quickly striking a time sensitive target and evading the menaces in flight, and lays a foundation for generation of systematic fighting ability of the jump glide type trans-aerosphere vehicle.

Description

A kind of threaten towards complicated battlefield penetrate front flight path defining method
Technical field
The invention belongs to control field, relate to the defining method that front flight path penetrated by a kind of aircraft.
Background technology
IT-based warfare is the inexorable trend of information age war development.Network in Information Times system covers the scope expanding day on region of war, and real-time, the concertedness of operation constantly strengthen.The patterns such as effect operation, non-contact fighting, asymmetric war, long distance raid war, depth precision strike, cooperation and Integrative Joint Operations Simulation substantially increase fighting efficiency.Mission planning plays extremely important effect in IT-based warfare, and its application level decides level and the ability of information-based operation in very large meaning.
Since the eighties in 20th century, countries in the world have carried out the research work of aircraft mission planning technology one after another, and mission planning problem progressively comes into one's own in fields such as control science, air science, information sciences.Researchist is on the basis of the various planing method of research, by multi-disciplinary intersection and in conjunction with artificial intelligence, decision theory and modeling and optimization technology, solve a series of representative mission planning problem, and develop multiple-task planning system (Mission Planning System, MPS).
Trajectory planning is the basic problem of aircraft mission planning, its essence is in comprehensive consideration of flight vehicle time of arrival, oil consumption, threat and can under the prerequisite of the factor such as flight range, for aircraft cooks up optimum or satisfied flight track, to ensure to complete aerial mission satisfactorily and to come back to the base safely.Trajectory planning technology has been widely used in the navigational system of aircraft, surface ship, surface car and robot etc.
The U.S. is the country carrying out trajectory planning technical research the earliest.At first, USAF relies special aeronautical laboratory in order to alleviate the work load of pilot, improve the survivability of validity and the aircraft of executing the task, utilize experience and the achievement of civil aircraft flight management system, four-dimension navigation and energy management technology are used for the flight management of fighter plane, propose the concept of tactical flight management system.The core of tactical flight management system is Track Pick-up and track following, and its prerequisite is the generation of optimal trajectory, i.e. trajectory planning.At present, the task grouping of U.S. army's development develops into the third generation, and continues towards raising the efficiency and reducing the aspect development such as system cost.Other countries have also carried out corresponding trajectory planning technical research, and Britain has successively developed " pathfinder " 2000 task grouping and advanced mission planning device, and France has also carried out the development of three sequence of tasks planning systems.
Current trajectory planning technology has had Preliminary Applications on the weapon platform such as unmanned plane, cruise missile.Common path planning method threatens during district in process and is simplified by model, only considers the threaten estimate in two dimensional surface, namely supposes that aircraft altitude is constant, threat district is thought of as the round region in this plane.And for possessing the new aircraft of endoatmosphere jump glide, because it has the maneuvering flight on a large scale of transverse and longitudinal in flight course, the singularity of its trajectory form determines threatening the traditional treatment method in district no longer applicable.In addition, classic method is considered less to the constraint condition in aerocraft real flight course, causes the result of trajectory planning often to have larger deviation with actual conditions.
Summary of the invention
The technical matters that the present invention solves is: overcome the deficiencies in the prior art, provide a kind of gliding type Step atmospheric layers vehicle that jumps face complicated battlefield threaten under quick flight path defining method, can before vehicle launch, by the solid modelling to threat source, battlefield, propose and threaten with enemy, penetraton probability, flight time, the trajectory planning target function model of the multiparameters such as motor-driven number of times, battlefield surroundings constraint and flight performance constraint can considered, find out a viability strong, penetraton probability is high, the optimal trajectory that blow speed is fast, make flying instrument for rapid strike time critical target and the ability of evading threat in-flight.
Technical solution of the present invention is: a kind of threaten towards complicated battlefield penetrate front flight path defining method, comprise the steps:
(1) obtaining the launching site longitude and latitude of aircraft when launching, the longitude and latitude at impact point place, threatening the longitude and latitude of district center point, and threaten the radius in district;
(2) according to the condition that step (1) provides, determine that the flight track of an aircraft is as initial flight path;
(3) initial flight path is carried out segmentation, then with the initial flight path after segmentation for starting condition, minimum for target with the value of the cost function C of flight path performance, adopt trajectory planning searching algorithm to carry out Iterative, determine the optimum flight track of aircraft;
The cost function C of described flight path performance is expressed as:
C = Σ i = 1 n ( w 1 f TAi + w 2 P i + w 3 T i + w 4 A i )
In formula, i=1,2 ... n is track segmentation; f tAi, P i, T i, A ibe respectively the enemy's threat on i-th section of track segmentation, penetraton probability, flight time and motor-driven number of times nondimensionalization represent, w 1~ w 4for threatening with enemy, penetraton probability, flight time and the corresponding weight coefficient of motor-driven number of times, meet w 1+ w 2+ w 3+ w 4=1;
f TAi = &Sigma; j = 1 m P j , P j = &beta; j C i / ( S CDj ) 4 S CDj < R j 0 S CDj > R j
β jfor multiplier factor, the β when not receiving jth threat early warning information j=1, otherwise β j>1, j=1,2 ... m is threat district quantity relevant on i-th section of track segmentation, R jfor jth threatens the radius in district, S cDjfor threatening district center point to make the great circle arc length perpendicular to orthodrome to the orthodrome between launching site and impact point from jth, described orthodrome is that the earth's core is crossed in the center of circle, and radius is the circular arc of earth radius; C ibe the target function value of i-th section of track segmentation, P ispan between 0 to 1, the penetraton probability of aircraft is higher, P ivalue is larger, T ispan in level second, A ivalue is between 0 to 10, and motor-driven number of times is more, A ivalue is larger.
Described trajectory planning searching algorithm includes but not limited to the pseudo-spectrometry of direct shooting method, Gauss, adaptive Gauss pseudo-spectrometry, sparse A* algorithm, particle swarm optimization, simulated annealing or genetic algorithm.
The present invention's advantage is compared with prior art:
(1) the inventive method is based on the Computing Principle of spherical geometry, propose the three-dimensional modeling method for the source of threat, and give flight track and the decision method threatening district's relative position, thus compensate for the deficiency in prior art, threaten estimate being simplified to plane treatment, make flight track and threaten the judgement of zone position relation closer to true operation, accuracy is higher;
(2) the inventive method proposes the trajectory planning objective function defining method considering enemy's threat, penetraton probability, flight time, motor-driven number of times, above-mentioned parameter has been carried out dimensionless statement, to solve in prior art and only consider to threaten district, do not consider that aircraft is hidden to threaten in district's process and may occur increasing the flight time, too much cause the problems such as fault due to motor-driven number of times.Above-mentioned quadrinomial parameter considers by the inventive method, defines the trajectory planning of various dimensions, makes the result precision of planning higher, and the condition contained is wider, more fights close to true.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the inventive method;
Fig. 2 is the illustraton of model that the present invention threatens district;
Fig. 3 is that the present invention threatens district and track points position relationship schematic diagram.
Embodiment
As shown in Figure 1, be the process flow diagram of the inventive method, concrete steps are as follows:
(1) before vehicle launch, first determine the initiation parameter of outside input, initialized object is for the enforcement of method prepares.Initiation parameter comprises " launching site longitude and latitude ", " impact point longitude and latitude ", " threatening district center point longitude and latitude " and " threatening district's radius ";
(2) set up threat section model, and determine whether flight path leaps the decision criteria threatening district.
There are two kinds of situations with threatening the relative position in district in flight track, namely flight track only threatens district and flight track to cross threat district.Concrete determining step is: calculate the distance threatening any point place orthodrome on district center point to flight path, and judge itself and the relation threatening district's radius, as arc length is greater than radius, namely flight path only threatens district, if arc length is less than radius, namely flight path crosses threat district.
Threaten section model schematic diagram as indicated with 2, according to initial input parameter, aircraft initial point is P 0, its longitude and latitude is respectively θ 0, φ 0, distal point is P f, its longitude and latitude is respectively θ f, φ f, arctic point is P n, use A frepresent initial point P 0to distal point P fthe angle of orthodrome (center of circle is the earth's core, and radius is earth radius) and initial point direct north, with direct north be benchmark clockwise for just, 0≤A f<2 π, represents initial point P with σ 0to distal point P forthodrome, S farc length corresponding to σ.
By the spherical triangle P in Fig. 2 0p np fcan obtain:
cos ( &pi; 2 - &phi; f ) = cos ( &pi; 2 - &phi; 0 ) cos S f + sin ( &pi; 2 - &phi; 0 ) sin S f cos A f - - - ( 1 )
sin &Delta;&theta; sin S f = sin A f sin ( &pi; 2 - &phi; f ) - - - ( 2 )
Then can be obtained by formula (1) and formula (2):
cos A f = sin &phi; f - sin &phi; 0 cos S f cos &phi; 0 sin S f - - - ( 3 )
sin A f = cos &phi; f - sin &Delta;&theta; sin S f - - - ( 4 )
Therefore association type (3) and formula (4) can obtain:
A f = arccos ( sin &phi; f - sin &phi; 0 cos S f cos &phi; 0 sin S f ) sin A f &GreaterEqual; 0 A f = 2 &pi; - arccos ( sin &phi; f - sin &phi; 0 cos S f cos &phi; 0 sin S f ) sin A f < 0 - - - ( 5 )
Due to A fgenerally all between 0 ~ π, so direct negate cosine, the longitude and latitude of current point be on the occasion of or negative value above formula all set up.
Make Δ θ=θ f0, can be obtained by formula (5):
cos S f = cos ( &pi; 2 - &phi; f ) cos ( &pi; 2 - &phi; 0 ) + sin ( &pi; 2 - &phi; f ) sin ( &pi; 2 - &phi; 0 ) cos &Delta;&theta; - - - ( 6 )
Then have:
S f=arccos(sinφ fsinφ 0+cosφ fcosφ 0cosΔθ) (7)
As shown in Figure 3, C (L c, B c) point is the central point in threat source, its radius is R, and some D was that C point makes arc P 0p fvertical line and the intersection point of arc, if its coordinate is (L d, B d), the terrestrial coordinate of known C, D, can obtain S by formula (7) cDif, S cDbe greater than R, illustrate that D point is outside threat district, namely flight track place circular arc crosses threat district, but flight track only threatens district; Otherwise illustrate that D point is within threat district, namely flight track crosses threat district.
(3) for the population parameter of different aircraft, set up trajectory planning target function model, the influence factor of each side is transformed according to respective standard, then obtains in the weight of overall target the dimensionless number characterizing flight path overall target according to each single index.
According to mission requirements, the influence factor of flight path performance mainly consider following some: enemy's threat, penetraton probability, flight time, motor-driven number of times.
For the ease of analyzing, divide whole flight track into some sections, then the cost function model of flight path performance can be expressed as:
C = &Sigma; i = 1 n ( w 1 f TAi + w 2 P i + w 3 T i + w 4 A i ) - - - ( 8 )
In formula, i=1,2 ... for track segmentation; f tAi, P i, T i, A ibe respectively enemy's threat on track segmentation, penetraton probability, flight time and motor-driven number of times nondimensionalization represent, w 1~ w 4for respective weight coefficient, meet:
w 1+w 2+w 3+w 4=1
In formula, f tAibe the threat index of i-th section of flight path section, its restriction aircraft is too not near with known ground based threats distance, makes aircraft as far as possible by threatening less region flight;
f TAi = &Sigma; j = 1 m P j , P j = &beta; j C i / ( S CDj ) 4 S CDj < R j 0 S CDj > R j
J=1,2 ... m is threat district quantity relevant on i-th section of track segmentation, R jfor jth threatens the radius in district, S cDjfor threatening district center point to make the great circle arc length perpendicular to orthodrome to the orthodrome between launching site and impact point, β from jth jbe a multiplier factor, the β when a jth threat does not receive early warning information j=1, otherwise β j>1, here C ifor segmentation flight path target function value, namely above-mentioned formula (8) is in the value of i section.P ibe the penetraton probability of i-th section of flight path section, characterize the probability that this section of flight path breaks through enemy missile system of defense, P iby aircraft characteristics determined, its span is between 0 to 1, and aircraft penetraton probability is higher here, and this value value is larger; T ibe the flight time of i-th section of flight path section, total flight time is fewer, and fighting efficiency is more excellent, and the flight time of different aircraft in segmentation flight path is different, and its span is in level second; A ibe the motor-driven number of times of i-th section of flight path section, the motor-driven number of times of aircraft is more, and failure rate is higher, therefore should select the flying method that motor-driven number of times is few here, A ivalue is usually between 0 to 10, and motor-driven number of times is more, and value is larger.
The evaluation of flight path performance is exactly in fact the consolidated statement value indicative solving every bar flight path, i.e. f under selection C minimum tAi, P i, T i, A ivalue.Here the process solved is actual is calculate a flight path with aircraft movements, kinetic model, then carry out route evaluation according to above-mentioned formula, obtain target function value, then use the continuous iteration of Path Planning below, last iteration goes out optimum C value, f in fact tAi, P i, T i, A iin most importantly still pass through f tAiinstead solve the track points D that flight path meets optimal trajectory, more all track points D are grouped together just have become optimal trajectory.
Because trajectory planning searching algorithm is various, need here to set up Path Planning database simultaneously, specifically comprise direct shooting method, the pseudo-spectrometry of Gauss, adaptive Gauss pseudo-spectrometry, sparse A* algorithm, particle swarm optimization, simulated annealing, genetic algorithm etc.
(4) judge whether to enter trajectory planning Iterative, resolve if start and enter step (5); If battlefield surroundings or target information change, need to re-enter initial information or constraint condition, reenter step (2);
(5) from algorithm data-base, iterative algorithm is selected, because the optimal trajectory of the present invention's generation is for aircraft initial binding, therefore should with reliability, rapidity, practicality for principle to the selection of algorithm, if the algorithm selected iteration cannot go out optimum solution in step (6), iterative algorithm can be reselected from residue algorithm;
(6) if algorithm convergence obtains optimum solution enter step (7); If iteration cannot restrain, reenter step (5);
(7) trajectory planning terminates.
The content be not described in detail in instructions of the present invention belongs to the known technology of those skilled in the art.

Claims (2)

1. what threaten towards complicated battlefield penetrates a front flight path defining method, it is characterized in that comprising the steps:
(1) obtaining the launching site longitude and latitude of aircraft when launching, the longitude and latitude at impact point place, threatening the longitude and latitude of district center point, and threaten the radius in district;
(2) according to the condition that step (1) provides, determine that the flight track of an aircraft is as initial flight path;
(3) initial flight path is carried out segmentation, then with the initial flight path after segmentation for starting condition, minimum for target with the value of the cost function C of flight path performance, adopt trajectory planning searching algorithm to carry out Iterative, determine the optimum flight track of aircraft;
The cost function C of described flight path performance is expressed as:
C = &Sigma; i = 1 n ( w 1 f TAi + w 2 P i + w 3 T i + w 4 A i )
In formula, i=1,2 ... n is track segmentation; f tAi, P i, T i, A ibe respectively the enemy's threat on i-th section of track segmentation, penetraton probability, flight time and motor-driven number of times nondimensionalization represent, w 1~ w 4for threatening with enemy, penetraton probability, flight time and the corresponding weight coefficient of motor-driven number of times, meet w 1+ w 2+ w 3+ w 4=1;
f TAi = &Sigma; j = 1 m P j , P j = &beta; j C i / ( S CDj ) 4 S CDj < R j 0 S CDj > R j
β jfor multiplier factor, the β when not receiving jth threat early warning information j=1, otherwise β j>1, j=1,2 ... m is threat district quantity relevant on i-th section of track segmentation, R jfor jth threatens the radius in district, S cDjfor threatening district center point to make the great circle arc length perpendicular to orthodrome to the orthodrome between launching site and impact point from jth, described orthodrome is that the earth's core is crossed in the center of circle, and radius is the circular arc of earth radius; C ibe the target function value of i-th section of track segmentation, P ispan between 0 to 1, the penetraton probability of aircraft is higher, P ivalue is larger, T ispan in level second, A ivalue is between 0 to 10, and motor-driven number of times is more, A ivalue is larger.
2. according to claim 1 a kind of threaten towards complicated battlefield penetrate front flight path defining method, it is characterized in that: described trajectory planning searching algorithm includes but not limited to the pseudo-spectrometry of direct shooting method, Gauss, adaptive Gauss pseudo-spectrometry, sparse A *algorithm, particle swarm optimization, simulated annealing or genetic algorithm.
CN201410575003.8A 2014-10-23 2014-10-23 A kind of front flight path of penetrating threatened towards complicated battlefield determines method Active CN104317305B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410575003.8A CN104317305B (en) 2014-10-23 2014-10-23 A kind of front flight path of penetrating threatened towards complicated battlefield determines method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410575003.8A CN104317305B (en) 2014-10-23 2014-10-23 A kind of front flight path of penetrating threatened towards complicated battlefield determines method

Publications (2)

Publication Number Publication Date
CN104317305A true CN104317305A (en) 2015-01-28
CN104317305B CN104317305B (en) 2017-04-05

Family

ID=52372547

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410575003.8A Active CN104317305B (en) 2014-10-23 2014-10-23 A kind of front flight path of penetrating threatened towards complicated battlefield determines method

Country Status (1)

Country Link
CN (1) CN104317305B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105469153A (en) * 2015-11-25 2016-04-06 中国电子科技集团公司第二十八研究所 Air situation sharing apparatus based on system ordering
CN105841703A (en) * 2016-03-15 2016-08-10 电子科技大学 Calculating method for optimal route of unmanned aerial vehicle used for positioning object in threat environment
CN105929847A (en) * 2016-06-24 2016-09-07 南京奇蛙智能科技有限公司 Unmanned aerial vehicle following waypoint reliability judging method
CN106021835A (en) * 2015-08-25 2016-10-12 中国运载火箭技术研究院 Flight path design method facing optimal reconnaissance
CN108089594A (en) * 2017-12-13 2018-05-29 王俊梅 A kind of unmanned plane visual dead angles turn to escape flight method
CN112148024A (en) * 2020-08-20 2020-12-29 中国人民解放军海军航空大学 Unmanned aerial vehicle real-time online flight path planning method based on self-adaptive pseudo-spectral method
CN112182501A (en) * 2020-08-21 2021-01-05 中国人民解放军93114部队 Method and device for calculating penetration probability of cruise missile
CN113536528A (en) * 2021-05-14 2021-10-22 中国人民解放军军事科学院评估论证研究中心 Early warning aircraft tactical behavior simulation method and system under non-convoy condition
CN116661496A (en) * 2023-05-31 2023-08-29 南京理工大学 Multi-patrol-missile collaborative track planning method based on intelligent algorithm

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101101650A (en) * 2007-07-02 2008-01-09 北京理工大学 Low altitude penetration missile three-dimensional route planning method
US20110029234A1 (en) * 2009-07-29 2011-02-03 Lockheed Martin Corporation Threat Analysis Toolkit
CN102436604A (en) * 2011-09-08 2012-05-02 哈尔滨工程大学 Multi-missile collaborative route calculation method based on multi-target evolution method
CN102880186A (en) * 2012-08-03 2013-01-16 北京理工大学 Flight path planning method based on sparse A* algorithm and genetic algorithm

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101101650A (en) * 2007-07-02 2008-01-09 北京理工大学 Low altitude penetration missile three-dimensional route planning method
US20110029234A1 (en) * 2009-07-29 2011-02-03 Lockheed Martin Corporation Threat Analysis Toolkit
CN102436604A (en) * 2011-09-08 2012-05-02 哈尔滨工程大学 Multi-missile collaborative route calculation method based on multi-target evolution method
CN102880186A (en) * 2012-08-03 2013-01-16 北京理工大学 Flight path planning method based on sparse A* algorithm and genetic algorithm

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
任鹏等: "有限干预下的UAV低空突防航迹规划", 《系统工程与电子技术》 *
周青等: "基于A*算法的无人机四维航迹规划研究", 《计算机仿真》 *
王新增等: "具有时间约束的无人机航迹规划方法", 《火力与指挥控制》 *
罗泉: "多威胁条件下对地攻击行动综合航迹规划与任务分配方法研究", 《中国优秀硕士学位论文全文数据库 工程科技II辑》 *

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106021835A (en) * 2015-08-25 2016-10-12 中国运载火箭技术研究院 Flight path design method facing optimal reconnaissance
CN106021835B (en) * 2015-08-25 2018-05-11 中国运载火箭技术研究院 A kind of flight path design method towards optimal scouting
CN105469153A (en) * 2015-11-25 2016-04-06 中国电子科技集团公司第二十八研究所 Air situation sharing apparatus based on system ordering
CN105469153B (en) * 2015-11-25 2019-05-21 中国电子科技集团公司第二十八研究所 A kind of air situation sharing means ordered based on system
CN105841703A (en) * 2016-03-15 2016-08-10 电子科技大学 Calculating method for optimal route of unmanned aerial vehicle used for positioning object in threat environment
CN105929847B (en) * 2016-06-24 2018-12-18 南京奇蛙智能科技有限公司 A kind of unmanned plane follows the judgment method of destination reliability
CN105929847A (en) * 2016-06-24 2016-09-07 南京奇蛙智能科技有限公司 Unmanned aerial vehicle following waypoint reliability judging method
CN108089594A (en) * 2017-12-13 2018-05-29 王俊梅 A kind of unmanned plane visual dead angles turn to escape flight method
CN108089594B (en) * 2017-12-13 2020-11-27 王俊梅 Unmanned aerial vehicle sight dead angle steering escape flight method
CN112148024A (en) * 2020-08-20 2020-12-29 中国人民解放军海军航空大学 Unmanned aerial vehicle real-time online flight path planning method based on self-adaptive pseudo-spectral method
CN112182501A (en) * 2020-08-21 2021-01-05 中国人民解放军93114部队 Method and device for calculating penetration probability of cruise missile
CN112182501B (en) * 2020-08-21 2023-11-17 中国人民解放军93114部队 Method and device for calculating burst prevention probability of cruise missile
CN113536528A (en) * 2021-05-14 2021-10-22 中国人民解放军军事科学院评估论证研究中心 Early warning aircraft tactical behavior simulation method and system under non-convoy condition
CN116661496A (en) * 2023-05-31 2023-08-29 南京理工大学 Multi-patrol-missile collaborative track planning method based on intelligent algorithm
CN116661496B (en) * 2023-05-31 2024-03-15 南京理工大学 Multi-patrol-missile collaborative track planning method based on intelligent algorithm

Also Published As

Publication number Publication date
CN104317305B (en) 2017-04-05

Similar Documents

Publication Publication Date Title
CN104317305A (en) Preflight flight path confirmation method towards complex battleground menaces
CN108563243B (en) Unmanned aerial vehicle track planning method based on improved RRT algorithm
CN110031004B (en) Static and dynamic path planning method for unmanned aerial vehicle based on digital map
CN103557867B (en) The collaborative path planning method of a kind of many UAV of three-dimensional based on sparse A* search
CN103245256B (en) Multi-missile cooperative attack guidance law designing method
CN102927851B (en) Terminal guidance method based on track on-line planning
CN107966156A (en) A kind of Design of Guidance Law method suitable for the vertical exhausting section of carrier rocket
CN110617818A (en) Unmanned aerial vehicle track generation method
CN103676944A (en) Unmanned aerial vehicle route planning method based on Dubins route and sparse A* searching
US20100264216A1 (en) Methods and apparatus for path planning for guided munitions
CN105427032A (en) Confrontation decision evaluation method for unmanned aerial vehicle
CN103713642A (en) Unmanned plane three dimensional route program method based on disturbed fluid dynamic system
Alkaher et al. Dynamic-escape-zone to avoid energy-bleeding coasting missile
CN104503471A (en) Terminal guidance method for maneuvering aircraft multi-terminal constraint backstepping sliding mode
CN112162567A (en) Avoidance guidance method suitable for online no-fly zone of aircraft
Shan Study on submarine path planning based on modified ant colony optimization algorithm
Liu et al. Voronoi diagram and GIS-based 3D path planning
Hao et al. A study on route planning of helicopter in low altitude area
Singh Air Power in Modern Warfare
Akdag et al. A comparative study on practical evasive maneuvers against proportional navigation missiles
Huang et al. Study on multi-path planning and tracking control of the UCAV based on evolutionary algorithm
Zhao-Pu et al. Study on release region of guided bombs based on multi-island genetic algorithm and quadratic programming
Li et al. Application of ant colony algorithm to air route planning in helicopter submarine searching
Dülgar A robust altitude control approach for sea skimming missiles
Downey et al. Design of experiments using response surface methods to optimize simulated reentry trajectories

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant