CN102819665B - Multi-aircraft based on prominent anti-mission requirements launches quantity and timing optimization method - Google Patents
Multi-aircraft based on prominent anti-mission requirements launches quantity and timing optimization method Download PDFInfo
- Publication number
- CN102819665B CN102819665B CN201210252512.8A CN201210252512A CN102819665B CN 102819665 B CN102819665 B CN 102819665B CN 201210252512 A CN201210252512 A CN 201210252512A CN 102819665 B CN102819665 B CN 102819665B
- Authority
- CN
- China
- Prior art keywords
- aircraft
- penetration
- distribution
- interception
- arrival time
- 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.)
- Expired - Fee Related
Links
Landscapes
- Traffic Control Systems (AREA)
Abstract
本发明提供一种基于突防任务要求的多飞行器发射数量与时序优化方法,解决突防概率条件下的最优发射数量与发射时序问题。第一步:建立多飞行器对拦截方拦截系统的影响模型,分析飞行器数量不同对拦截能力的影响;第二步:建立飞行器到达拦截区域时间分布模型;第三步:将飞行器数量作为变量引入到达时间分布,建立飞行器数量、到达时间与突防概率的函数表;第四步:根据指定的突防概率求解飞行器数量和飞行器到达时间分布参数:第五步:基于发射时序约束库反解出飞行器最优发射时序:根据最小飞行器数量,通过飞行器到达时间分布反解出飞行器的起飞时刻。The invention provides a multi-aircraft launch quantity and timing optimization method based on the requirements of the penetration mission, which solves the problem of the optimal launch quantity and launch timing under the condition of penetration probability. Step 1: Establish a model of the impact of multiple aircraft on the interception system of the intercepting party, and analyze the impact of different numbers of aircraft on the interception capability; Step 2: Establish a time distribution model for aircraft arriving at the interception area; Step 3: Introduce the number of aircraft as a variable into the arrival Time distribution, establish the function table of the number of aircraft, arrival time and penetration probability; Step 4: Solve the distribution parameters of the number of aircraft and aircraft arrival time according to the specified penetration probability; Step 5: Reversely solve the aircraft based on the launch timing constraint library Optimal launch timing: According to the minimum number of aircraft, the take-off time of the aircraft is deduced through the arrival time distribution of the aircraft.
Description
技术领域technical field
本发明涉及一种基于突防任务要求的多飞行器发射数量与时序优化方法,可广泛应用于对协同突防能力要求较高、成本较高的飞行器等的发射时序优化算法领域。The invention relates to a multi-aircraft launch quantity and timing optimization method based on the penetration task requirements, which can be widely used in the field of launch timing optimization algorithms for aircraft with high requirements for coordinated penetration capabilities and high costs.
背景技术Background technique
在多飞行器协同突防过程中,飞行器的数量影响着集群的协同突防能力。目前,已公开的文献表明,国内外在针对特定任务决策飞行器数量时经常使用饱和攻击的策略。采用数量的优势固然可以提高多飞行器的协同能力,然而一味的采用饱和攻击必然造成数量上的浪费,特别当飞行器的成本较高时,在满足突防任务要求的前提下确定多飞行器的最优发射数量和发射时序具有重要的研究意义和广泛的应用前景。In the process of multi-aircraft coordinated defense penetration, the number of aircraft affects the coordinated penetration ability of the swarm. At present, the published literature shows that the saturation attack strategy is often used when deciding the number of aircraft for a specific mission at home and abroad. Using the advantage of quantity can certainly improve the coordination ability of multi-aircraft, but blindly adopting saturation attack will inevitably lead to a waste of quantity, especially when the cost of aircraft is high, the optimal solution for multi-aircraft is determined on the premise of meeting the requirements of the penetration mission. The emission quantity and emission timing have important research significance and broad application prospects.
此外,部分文献考虑了满足某一特征指标下的飞行器发射数量问题,但在建立多飞行器协同模型时大多采用概率论基本原理,将多飞行器认为是独立事件,将飞行器的数量认为是独立重复事件的检验次数,这忽略了数量不同时飞行器之间的协同程度的不同,导致该概率模型不能准确描述数量对集群协同突防的影响,进而影响着多飞行器的协同决策与控制。In addition, some literatures consider the issue of the number of aircraft launched under a certain characteristic index, but most of them use the basic principles of probability theory when establishing a multi-aircraft collaborative model, considering multiple aircraft as independent events and the number of aircraft as independent repeated events This ignores the difference in the degree of coordination between aircraft when the number is different, so the probability model cannot accurately describe the impact of the number on the swarm's cooperative penetration, which in turn affects the collaborative decision-making and control of multiple aircraft.
发明内容Contents of the invention
本发明提供一种基于突防任务要求的多飞行器发射数量与时序优化方法,解决突防概率条件下的最优发射数量与发射时序问题。The invention provides a multi-aircraft launch quantity and timing optimization method based on the requirements of the penetration mission, which solves the problem of the optimal launch quantity and launch timing under the condition of penetration probability.
该基于突防任务要求的多飞行器发射数量与时序优化方法,包括以下步骤:The multi-aircraft launch quantity and timing optimization method based on the requirements of the penetration mission includes the following steps:
第一步:建立多飞行器对拦截方拦截系统的影响模型,分析飞行器数量不同对拦截能力的影响;Step 1: Establish a model of the impact of multiple aircraft on the interception system of the intercepting party, and analyze the impact of different numbers of aircraft on the interception capability;
第二步:选取泊松分布、正态分布、平均分布三种典型分布,认为多飞行器到达拦截区域的时间服从三种典型分布,将分布的参数作为变量,考虑时间因素对分布参数的影响,选取典型参数描述到达时间的分布,建立飞行器到达拦截区域时间分布模型;Step 2: Select three typical distributions: Poisson distribution, normal distribution, and average distribution. It is believed that the arrival time of multiple aircrafts in the interception area obeys three typical distributions. The parameters of the distribution are used as variables, and the influence of time factors on the distribution parameters is considered. Select typical parameters to describe the distribution of the arrival time, and establish the distribution model of the arrival time of the aircraft in the interception area;
第三步:将飞行器数量作为变量引入到达时间分布,建立飞行器数量、到达时间与突防概率的函数表;每个表中记录着服从某典型分布时飞行器数量与突防概率的对应关系;The third step: introduce the number of aircraft as a variable into the arrival time distribution, and establish a function table of the number of aircraft, arrival time, and penetration probability; each table records the corresponding relationship between the number of aircraft and the penetration probability when obeying a certain typical distribution;
第四步:根据指定的突防概率求解飞行器数量和飞行器到达时间分布参数:根据指定的突防概率指标,通过第三步中所述的函数表计算飞行器不同数量条件下的突防概率表达式,进而通过三种典型分布的比较,确定满足突防概率指标条件下的所需飞行器的最小数量,并记录此时飞行器到达时间服从的分布形式与参数;Step 4: Calculate the number of aircraft and aircraft arrival time distribution parameters according to the specified penetration probability: According to the specified penetration probability index, calculate the penetration probability expression under the condition of different numbers of aircraft through the function table described in the third step , and then through the comparison of three typical distributions, determine the minimum number of required aircraft under the condition of meeting the penetration probability index, and record the distribution form and parameters that the arrival time of the aircraft obeys at this time;
第五步:基于发射时序约束库反解出飞行器最优发射时序:根据飞行器的最小飞行器数量,通过飞行器到达时间分布反解出飞行器的起飞时刻。Step 5: Reverse solve the optimal launch timing of the aircraft based on the launch timing constraint library: According to the minimum number of aircraft of the aircraft, reverse the take-off time of the aircraft through the arrival time distribution of the aircraft.
在求解的过程中,通过建立飞行器起飞间隔时间最小来求解出同时满足该指标和发射时序约束的起飞时间与次序。In the process of solving, the take-off time and sequence that satisfy both the index and the launch timing constraints are solved by establishing the minimum take-off interval of the aircraft.
本发明的有益效果:Beneficial effects of the present invention:
本发明可广泛应用于无人飞行器的最小发射数量求解,在求解数量的基础上根据到达时间的分布求解出飞行器的最优发射时序。大大改善的饱和攻击时对发射数量的要求,使得以最优的发射数量满足指定突防概率的要求,明确了执行任务所需的最小数量,降低了发射的成本,提高了作战的效能。The present invention can be widely used in solving the minimum launch quantity of unmanned aerial vehicle, and on the basis of the solution quantity, the optimal launch timing of the aerial vehicle can be obtained according to the distribution of arrival time. The greatly improved requirements for the number of launches in saturation attacks enable the optimal number of launches to meet the requirements of the specified penetration probability, clarify the minimum number required to perform tasks, reduce the cost of launches, and improve combat effectiveness.
具体实施方式Detailed ways
设共有N个飞行器能够执行突防任务,每个飞行器单独执行突防任务的概率为P,突防概率指标要求为Pe,问题归纳为:分析多飞行器群协同突防概率,当协同突防概率大于Pe时,确定所需的飞行器最小发射数量Nl,并计算Nl个飞行器的发射时间与次序,根据时间因素、空间因素、数量因素、威胁程度因素对多飞行器协同突防的影响,设Assuming that there are a total of N aircraft capable of performing the defense penetration mission, the probability of each aircraft performing the defense penetration mission alone is P, and the penetration probability index requirement is P e . When the probability is greater than P e , determine the minimum launch number N l of aircraft required, and calculate the launch time and sequence of N l aircraft, according to the influence of time factors, space factors, quantity factors, and threat level factors on the coordinated penetration of multiple aircraft ,set up
a)时间因素对拦截方系统探测、识别、跟踪/测轨、拦截的影响ρt;a) The influence ρ t of the time factor on the detection, identification, tracking/orbit measurement and interception of the interceptor system;
ρt_ji=f1(ti,tj),其中,ti为第i个飞行器到达某一关键拦截点的时刻。ρ t_ji = f 1 (t i , t j ), where t i is the moment when the i-th aircraft arrives at a certain key interception point.
b)空间因素对拦截方系统探测、识别、跟踪/测轨、拦截的影响ρp b) The impact of space factors on the detection, identification, tracking/orbit measurement, and interception of the interceptor system ρ p
ρp_ji=f2(yi,yj),其中,yi为第i个飞行器的空间位置。ρ p_ji = f 2 (y i , y j ), where y i is the spatial position of the i-th aircraft.
c)数量因素对拦截方系统探测、识别、跟踪/测轨、拦截的影响ρN c) The impact of quantity factors on the detection, identification, tracking/orbit measurement and interception of the interceptor system ρ N
ρN_ji=f3(N),其中,N为飞行器数量。ρ N_ji = f 3 (N), where N is the number of aircraft.
d)威胁程度因素对拦截方系统探测、识别、跟踪/测轨、拦截的影响ρd d) The influence of threat degree factors on the detection, identification, tracking/orbit measurement and interception of the interceptor system ρ d
ρd_ji=f4(di,vi,dj,vj),其中,di为某一威胁判定时刻第i个飞行器与敌方待打击目标的距离,vi为某一威胁判定时刻第i个飞行器的速度。ρ d_ji = f 4 (d i , v i , d j , v j ), where d i is the distance between the i-th aircraft and the enemy target at a certain threat judgment time, and v i is a certain threat judgment time The speed of the i-th aircraft.
因此在集群协同突防的情况下,第i个飞行器的突防概率Pnew_i为:
本实施例以飞行器到达拦截区域时间按泊松分布为例,泊松分布的概率分布函数为当分布参数不同时,飞行器在同一时刻到达拦截区域的数量不同。而在同一时刻飞行器数量的不同影响着多飞行器的整体突防概率,因此多飞行器突防系统可描述为如下突防概率模型:Pswarm=g(λ,k,Pnew_i(k)),其中,λ为典型分布的参数,设共取m个典型分布参数,k为所需飞行器的数量,Pnew_i为在多飞行器协同突防的情况下,第i个飞行器的突防概率,其为飞行器数量k的函数。In this embodiment, the time when the aircraft arrives at the interception area is taken as an example according to the Poisson distribution, and the probability distribution function of the Poisson distribution is When the distribution parameters are different, the number of aircraft arriving at the interception area at the same time is different. However, the difference in the number of aircraft at the same time affects the overall penetration probability of multiple aircraft, so the multi-aircraft penetration system can be described as the following penetration probability model: P swarm = g(λ, k, P new_i (k)), where , λ is the parameter of the typical distribution, assume that a total of m typical distribution parameters are taken, k is the number of required aircraft, P new_i is the penetration probability of the i-th aircraft in the case of multi-aircraft cooperative penetration, which is the aircraft function of quantity k.
在已建立的突防概率模型基础上,以飞行器数量、典型分布的参数作为两个独立的变量,确定变量不同情况下的飞行器整体突防概率表达式,并建立概率二维变量表,如下表所示:On the basis of the established penetration probability model, the number of aircraft and the parameters of the typical distribution are used as two independent variables to determine the overall penetration probability expression of the aircraft under different variables, and establish a probability two-dimensional variable table, as shown in the following table Shown:
表1到达时间服从泊松分布时多飞行器协同突防概率表Table 1 The probability table of multi-aircraft cooperative penetration when the arrival time obeys the Poisson distribution
依上述方法分别建立飞行器到达拦截区域时间服从正态分布、平均分布时飞行器整体突防概率关于飞行器数量,典型分布参数的函数关系表达式,分析不同典型分布对于突防概率的影响。根据给定的突防概率指标,在三个典型分布突防概率二维表中寻找满足该指标要求的最小需用飞行器数量。设k=ka,λ=λb时的突防概率函数ga,b满足指标的要求,记录此时的飞行器数量ka,典型分布的形式和参数λb。According to the above method, the functional relationship expressions of the overall penetration probability of the aircraft with respect to the number of aircraft and the typical distribution parameters are established when the arrival time of the aircraft to the interception area obeys the normal distribution and the average distribution, and the influence of different typical distributions on the penetration probability is analyzed. According to the given penetration probability index, the minimum number of aircraft required to meet the requirements of the index is found in the three typical distribution penetration probability two-dimensional tables. Assuming k=k a , the penetration probability function g a,b when λ=λ b meets the requirements of the index, record the number of aircraft k a at this time, the form of the typical distribution and the parameter λ b .
在N个飞行器发射点中选取ka个发射点位,在发射点位确定之后每个飞行器的飞行时间即已确定,设每个飞行器的飞行时间为tfi,i=1,2,…,ka,,这个可以利用发射时序约束库来计算每个飞行器的最优发射时序,飞行器到达拦截区域时间分布满足F(λb),每个飞行器的发射时刻为tli,i=1,2,…,ka,可以建立如下数学问题:
优化问题:
Claims (3)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210252512.8A CN102819665B (en) | 2012-07-20 | 2012-07-20 | Multi-aircraft based on prominent anti-mission requirements launches quantity and timing optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210252512.8A CN102819665B (en) | 2012-07-20 | 2012-07-20 | Multi-aircraft based on prominent anti-mission requirements launches quantity and timing optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102819665A CN102819665A (en) | 2012-12-12 |
| CN102819665B true CN102819665B (en) | 2015-07-29 |
Family
ID=47303775
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210252512.8A Expired - Fee Related CN102819665B (en) | 2012-07-20 | 2012-07-20 | Multi-aircraft based on prominent anti-mission requirements launches quantity and timing optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102819665B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104391447A (en) * | 2014-12-03 | 2015-03-04 | 西北工业大学 | Optimal attack threshold value control algorithm for suicidal unmanned plane under interference of escort free-flight decoy |
| CN110516291B (en) * | 2019-07-12 | 2023-03-14 | 中国人民解放军63880部队 | Penetration analysis model suitable for multi-layer interception joint calculation |
| CN113968353A (en) * | 2020-07-22 | 2022-01-25 | 海鹰航空通用装备有限责任公司 | Unmanned aerial vehicle swarm launching control system and method |
| CN116186996B (en) * | 2022-12-26 | 2025-11-18 | 北京理工大学 | A method for designing the number of countermeasure devices in an unmanned aerial vehicle countermeasure system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1848148A (en) * | 2006-05-12 | 2006-10-18 | 孙玲 | Rapid Command and Control Method for Rapid and High Hit Rate Allocation of Battlefield Missile Firepower |
| CN102568248A (en) * | 2010-11-22 | 2012-07-11 | 通用电气航空系统有限责任公司 | Method and system for hold path computation to meet required hold departure time |
-
2012
- 2012-07-20 CN CN201210252512.8A patent/CN102819665B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1848148A (en) * | 2006-05-12 | 2006-10-18 | 孙玲 | Rapid Command and Control Method for Rapid and High Hit Rate Allocation of Battlefield Missile Firepower |
| CN102568248A (en) * | 2010-11-22 | 2012-07-11 | 通用电气航空系统有限责任公司 | Method and system for hold path computation to meet required hold departure time |
Non-Patent Citations (2)
| Title |
|---|
| Yu Jianqiao et al..Robust Gain-Scheduled Controller Design for Air Defense Missile.《Control Conference,2006》.2006,第713-718页. * |
| 弹道导弹突防策略进展;刘燕斌等;《导弹与航天运载技术》;20100430;第2010年卷(第2期);第18-23页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102819665A (en) | 2012-12-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101908097B (en) | Particle swarm optimization method for air combat decision | |
| CN103413186B (en) | A kind of multi-aircraft based on hybrid optimization algorithm works in coordination with target assignment method | |
| CN102819665B (en) | Multi-aircraft based on prominent anti-mission requirements launches quantity and timing optimization method | |
| CN108318032A (en) | A kind of unmanned aerial vehicle flight path Intelligent planning method considering Attack Defence | |
| CN103777640A (en) | Method for distributed control of centralized clustering formation of unmanned-plane cluster | |
| CN102819666B (en) | A kind of vehicle launch timing optimization method based on cooperative penetration | |
| CN105184092B (en) | A Cooperative Task Allocation Method for Multi-type UAVs under Resource Constraints | |
| CN107818219A (en) | A multi-missile cooperative trajectory planning method for defense penetration | |
| CN105278542A (en) | Counter-attack countermeasure optimal strategy method for multi-unmanned plane cooperative strike task | |
| CN110986680B (en) | Composite interception method for low-speed small targets in urban environment | |
| CN101893441A (en) | UAV Track Optimization Method Based on Deviation Maximization and Gray Relational Analysis | |
| CN111707267A (en) | A multi-UAV cooperative trajectory planning method | |
| CN115239204A (en) | A collaborative mission planning method for multi-platform unmanned aerial vehicle radio frequency system | |
| CN106681358A (en) | Centralized unmanned aerial vehicle formation distributing method and device | |
| CN114742264A (en) | Networked collaborative air defense task planning method and system for ship formation | |
| Zhang et al. | Penetration path planning of stealthy UAV based on improved sparse A-star algorithm | |
| CN119647631B (en) | Unmanned aerial vehicle intelligent decision-making method, system and storage medium based on reinforcement learning | |
| CN102819667B (en) | Timing optimization method is launched in aircraft concerted attack based on time-constrain storehouse | |
| CN118963383A (en) | A multi-aircraft cooperative guidance method and system considering no-fly zone avoidance | |
| CN116860395B (en) | A distributed hierarchical contract network firepower allocation method | |
| CN118605610A (en) | A method for UAV cooperative defense mission planning in complex electromagnetic environment | |
| Liu et al. | Trajectories planning for multiple UAVs by the cooperative and competitive PSO algorithm | |
| Lei et al. | Reseach on cooperative control of intelligent unmanned cluster system | |
| Li et al. | The constructing method of hierarchical decision-making model in air combat | |
| CN106996789A (en) | A route planning method for multi-airborne radar cooperative detection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150729 Termination date: 20170720 |