Airspace matching method and device for dual-model cooperative training

Through the airspace matching method of dual-aircraft model collaborative training, the takeoff multiple and flight time between the trainer are calculated, and combined with the number of airport stations and the performance parameters of the model, the problems of difficulty and time-consuming adjustment of airspace planning in the existing technology are solved, and the airspace is realized Maximize resource utilization and rapid adjustments to improve flight training efficiency.

CN118941003APending Publication Date: 2024-11-12CHINESE PEOPLES LIBERATION ARMY UNIT 92728
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410945135.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-15
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

It is difficult for the existing technology to quickly adjust aircraft training airspace planning to maximize resource utilization and improve efficiency, especially in emergencies, and the existing methods take a long time to re-plan.

Method used

The airspace matching method of dual-aircraft model collaborative training is adopted. By calculating the multiples and flight time of the training machine interval takeoff, searching for the small value of the balance time and the interval difference, combining the number of airport stations and aircraft performance parameters, it quickly determines that the maximum flight training is met. Efficient airspace planning scheme.

Benefits of technology

It realizes a rapid acquisition and maximizing the utilization of airspace resources, which can quickly adjust in emergencies, improve the utilization rate of flight training resources, and reduce computing redundancy, and has low hardware requirements.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118941003A_ABST
    Figure CN118941003A_ABST
Patent Text Reader

Abstract

The invention discloses an airspace matching method and device for dual-aircraft cooperative training, and belongs to the technical field of airspace planning and scheduling. The method comprises the following steps of: calculating interval take-off multiples of each training machine A and training machine B according to known conditions, loading corresponding wave times, searching at a preset step length, subtracting interval departure time from the maximum flight time of the training machine A to obtain balance time of the training machine A after the interval departure time is subtracted, and calculating the training machine B according to the balance time. Seeking the difference between the balance time and the interval of the training machine A and the smaller value between the balance time and the zero time, and multiplying the input airport station number by the in-place rate, the perfectness rate, the single-day single flight rack number and the wave number of each aircraft under the corresponding optimal interval starting time multiple to obtain the single-wave take-off rack number; and when the maximum take-off time a and the maximum take-off time b of the training machine A and the training machine B which can meet calculation are judged, obtaining a starting time sequence and an airspace number. According to the method, the utilization rate of flight training resources is improved, calculation redundancy is reduced, and the requirement for the hardware level of the device is low.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of airspace planning and scheduling, and specifically relates to an airspace matching method and device for dual-aircraft collaborative training. Background Art

[0002] Airspace planning for aircraft training needs to consider airspace type (dedicated airspace, shared airspace), training safety, training mission requirements, environmental factors, etc. It is a complex and critical task. At present, it mainly relies on managers to configure according to airport capacity and training tasks based on experience. Once the configuration is completed, it often remains unchanged for a long time, and it is difficult to maximize the use of airspace resources and training efficiency. At the same time, when encountering emergencies, such as partial restrictions on planned airspace, temporary increases or decreases in the number of stationed aircraft, etc., it is often difficult to quickly and flexibly adjust airspace planning according to actual conditions and needs. In addition, if the rationality of airspace planning needs to be regularly evaluated based on training effectiveness and safety, existing methods often take a long time to re-plan and are difficult to support. Summary of the invention

[0003] The purpose of the present invention is to provide an airspace matching method and device for dual-aircraft collaborative training, so as to quickly obtain an airspace planning scheme that can maximize the use of sortie waves and airspace resources.

[0004] To achieve the above object, the present invention adopts the following technical solution:

[0005] A first aspect of the present invention provides a spatial domain matching method for dual-aircraft collaborative training, the method comprising:

[0006] Step 101, obtaining the flight time of the day, the model performance parameters of the small wave training aircraft A and the large wave training aircraft B, so as to solve the maximum wave number, the low wave equilibrium waiting time and the interval departure time;

[0007] Step 102, calculate the multiples of the interval takeoffs of each training aircraft A and training aircraft B, obtain the balance time of training aircraft A after taking the remainder according to the maximum flight time and the interval departure time of training aircraft A, search with a predetermined step length according to the number of waves, and search for the smaller value of the difference between the balance time of training aircraft A and the interval and the difference between the balance time and the zero time, set to a+2b; where a is the takeoff or landing time of training aircraft A, and b is the takeoff or landing time of training aircraft B;

[0008] Step 103, obtaining the maximum available takeoff time of b according to the flight time and the interval departure time of the training aircraft B, and calculating the time of a, so as to obtain the maximum capacity of each airspace under different flight durations and aircraft performance parameters;

[0009] Step 104, based on the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves of each aircraft type under the optimal interval dispatch time multiple in step 102, obtain the number of take-offs in a single wave, and determine whether the maximum take-off times a and b of training aircraft A and training aircraft B calculated in step 102 can be met. If so, the number of airspaces corresponding to the dispatch sequence is given; otherwise, return to step 101 and re-enter the number of garrisons and aircraft type parameters.

[0010] In other examples, in step 102, the search interval is divided into two parts, the first search part is from the minimum value of the multiple period value to the critical value, and the second search part is from the critical value of the multiple period value to the maximum value.

[0011] In other examples, the multiple time period values ​​formed by the dispatch intervals of two aircraft models are arranged from large to small, and the difference between the maximum flight time of the aircraft model with a larger dispatch interval and the multiple value is calculated in sequence with a preset step size to determine whether the difference value is less than half of the dispatch interval. A critical dispatch interval time point is obtained through a binary search.

[0012] In other examples, when the absolute value of the difference between half of the sortie wave interval of training aircraft A and the modulo the landing time of training aircraft A is as small as possible, the modulo the take-off and landing waves of training aircraft B are simultaneously located between the sortie wave interval of training aircraft A and the landing time.

[0013] In other examples, for the first search part, the length of the multiple time period is subtracted from the remainder of the maximum flight time and the multiple time period to obtain the residual difference, and the length value of the residual difference is used to determine which of situation 4, situation 5, and situation 6 it belongs to; among them, when the landing period is judged to be at the very end on the right end, it belongs to situation 6; when the landing period of the aircraft with a larger flight time is judged to be in the middle of the take-off and landing period of the aircraft with a smaller flight time at the right end of the central axis, it belongs to situation 5; otherwise, it means that the landing period of the aircraft with a larger flight time is located in front of the take-off and landing period of the aircraft with a smaller flight time at the right end of the central axis, it belongs to situation 4.

[0014] In other examples, for the second multiple time period, the remainder of the maximum flight time and the multiple time period is subtracted from half of the length of the multiple time period to obtain the remainder difference, and according to the length value of the residual difference, it is determined which of situation 1, situation 2, and situation 3 it belongs to; among which, when it is determined that the landing period is at the very end on the right, it belongs to situation 3; when it is determined that the landing period of the aircraft with a larger flight time is in the middle of the take-off and landing period of the aircraft with a smaller flight time at the left end of the central axis, it belongs to situation 2; otherwise, it belongs to situation 1.

[0015] In other examples, the following constraints are set for situation 4: the three take-off and landing periods located on the right side of the central axis of the multiple period cannot exceed half of the multiple period, and the take-off period of the aircraft with a smaller flight time cannot exceed the difference between its maximum flight time and the sortie interval time;

[0016] For situation 5, the following constraints are set: the landing time plus the landing duration of the aircraft with a shorter flight time cannot exceed the landing time of the aircraft with a longer flight time. The calculation result is then assigned to the take-off time and take-off period of the aircraft with a shorter flight time.

[0017] The following constraints are set for situation 6: the landing time plus the landing duration of the aircraft with a smaller flight time cannot exceed half of the multiple period, and the calculated result is then assigned to the take-off time and take-off period of the aircraft with a smaller flight time.

[0018] In other examples, the following constraints are set for situation 1: the four take-off and landing periods on the left side of the central axis of the multiple period cannot exceed half of the multiple period, and the take-off period of the smaller aircraft cannot exceed the difference between its maximum flight time and the sortie interval time;

[0019] For situation 2, the following constraints are set: the landing time plus the landing duration of the aircraft with a shorter flight time cannot exceed the landing time of the aircraft with a longer flight time. The calculation result is then assigned to the take-off time and take-off period of the aircraft with a shorter flight time.

[0020] The following constraints are set for situation 3: the landing time plus the landing duration of the aircraft with a smaller flight time cannot exceed half of the multiple period, and the calculated result is then assigned to the take-off time and take-off period of the aircraft with a smaller flight time.

[0021] A second aspect of the present invention provides a spatial domain matching device for dual-aircraft collaborative training, the device comprising:

[0022] The first calculation module is used to obtain the flight time of the day and the model performance parameters of the training aircraft A and the training aircraft B to solve the maximum wave number, the low wave equilibrium waiting time and the interval departure time;

[0023] The search module is used to calculate the multiple of the interval takeoff of each training aircraft A and training aircraft B, obtain the balance time of training aircraft A after taking the remainder according to the maximum flight time and the interval departure time of training aircraft A, and search with a predetermined step length according to the number of waves, and search for the smaller value of the difference between the balance time of training aircraft A and the interval and the difference between the balance time and the zero time, which is set to a+2b; wherein a is the takeoff or landing time of training aircraft A, and b is the takeoff or landing time of training aircraft B;

[0024] The second calculation module obtains the maximum available takeoff time of b according to the flight time and the interval departure time of the training aircraft B, and calculates the time of a to obtain the maximum capacity of each airspace under different flight durations and aircraft performance parameters;

[0025] The airspace matching module is used to obtain the number of single-wave takeoffs based on the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves of each aircraft type under the corresponding optimal interval dispatch time multiples in the search module, and to determine whether the maximum take-off times a and b of training aircraft A and training aircraft B calculated in the search module can be met. If so, the airspace number corresponding to the dispatch sequence is given.

[0026] The present invention can quickly obtain the number of airspace matches that meet the maximum flight training efficiency based on conditions such as the number of airport garrisons and aircraft performance parameters. Especially in the event of an emergency, such as a change in the maximum flight time of an aircraft type, the airspace matching and flight training plans can be quickly changed, thereby improving the utilization rate of flight training resources.

[0027] In addition, the present invention reduces computational redundancy and has lower requirements on the hardware level of the device.

[0028] Further features and advantages of the present invention will become apparent from the following detailed description of exemplary embodiments of the present invention with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:

[0030] Figure 1 It is a schematic diagram of the execution flow of the present invention;

[0031] Figure 2 This is a schematic diagram of the deployment plan for training aircraft A and training aircraft B;

[0032] Figure 3 Search judgment diagram. DETAILED DESCRIPTION

[0033] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments.

[0034] The airspace division problem is to use the specific number of aircraft that need to be stationed at the airport as input conditions, and calculate the number of airspaces that need to be configured based on the number of sortie waves of each type of aircraft.

[0035] According to the training model of a certain airport, different types of aircraft are configured. In order to further increase the total number of aircraft stationed at the airport, seamless airspace training is required within a single day's flight time (for example, 12 hours). In order to ensure the highest utilization of airspace resources and runways and the largest wave of sorties, the pressure on command and coordination of the release / recovery of different aircraft types increases, and the airport dispatch sequence needs to be planned.

[0036] In order to solve the problem of airspace division for different sortie waves of two aircraft models, the dual-aircraft dispatching scheme of small-wave training aircraft A and large-wave training aircraft B for collaborative training is reasonably configured so that the take-off and landing time periods between them will not overlap, thus ensuring that the dispatching of various aircraft models at the airport is carried out in an orderly manner. However, as the number of aircraft models increases, their respective flight time limits and airspace training times are inconsistent. Therefore, the arranged maximum dispatching rules are very likely to conflict in take-off and landing time periods. In order to improve the security order, further planning is required. To this end, the present invention constructs a model of airspace combination for different sortie waves of two aircraft models (hereinafter referred to as the standard model), which makes each training aircraft strictly sorted according to the dispatching wave interval time in the dispatching rules:

[0037]

[0038] Among them, pp is the interval time between the dispatch of each wave of the i-th aircraft type, i = 1, 2; p is the airspace training time of each wave of the i-th aircraft type; d is the flight time of the i-th aircraft type to the airspace; Δyi is the standby time for the dispatch of the i-th aircraft type; is the take-off time of the jth wave of training aircraft B; is the return time of the jth wave of training machine B; mod represents the remainder calculation.

[0039] The above model indicates that the time of the jth return and landing of the large-wave training aircraft B is as much as possible greater than the j+1th take-off and dispatch time of the training aircraft B, and the absolute value of the difference between half of the dispatch wave interval time of the small-wave training aircraft A and the remainder of the landing time of the training aircraft A is as small as possible, and at the same time, the remainder of the take-off and landing wave of the training aircraft B is between the dispatch wave interval time and the landing time of the training aircraft A. At this time, the airspace quantity allocation is maximized.

[0040] Based on the above model, an embodiment of the present invention provides a spatial domain matching method for dual-machine collaborative training, such as Figure 1 As shown, the following steps are included:

[0041] Step 101, obtaining the flight time of the day, the model performance parameters of the training aircraft A and the training aircraft B, so as to solve the maximum wave number, the low wave equilibrium waiting time and the interval departure time;

[0042] Step 102, calculate the multiples of the interval takeoffs of each training aircraft A and training aircraft B, obtain the balance time of training aircraft A after taking the remainder according to the maximum flight time and the interval departure time of training aircraft A, search with a predetermined step length according to the number of waves, and search for the smaller value of the difference between the balance time of training aircraft A and the interval and the difference between the balance time and the zero time, set to a+2b; where a is the takeoff or landing time of training aircraft A, and b is the takeoff or landing time of training aircraft B;

[0043] As an example, when performing airspace configuration for training aircraft A and training aircraft B, first calculate the multiples of the takeoff intervals of each training aircraft A and training aircraft B, and load the corresponding wave numbers. Perform a search with a step size of 0.1, and subtract the interval departure time (e.g., 2.4 hours) from the maximum flight time of training aircraft A (e.g., 4 hours) to obtain the balance time of training aircraft A after taking the remainder (1.6 hours). Find the smaller value of the difference between the balance time of training aircraft A and the interval, and the difference between the balance time and zero time, and set it to a+2b. At this time, load the corresponding solved wave numbers, that is, in the smaller value time period, it can accommodate one takeoff time b of training aircraft B, one landing time b, and one landing or takeoff time a of training aircraft A.

[0044] Step 103, obtaining the maximum available takeoff time of b according to the flight time and the interval departure time of the training aircraft B, and calculating the time of a, so as to obtain the maximum capacity of each airspace under different flight durations and aircraft performance parameters;

[0045] As an example, based on the difference between the flight time of training aircraft B (e.g. 1.5 hours) and the interval departure time of training aircraft B (e.g. 1.2 hours), the maximum available take-off time of training aircraft Bb (e.g. 0.3 hours) is searched, and then the time of a is obtained by calculation. The length of the take-off period determines the number of airspaces, thereby obtaining the maximum capacity of each airspace under different flight durations and aircraft performance inputs.

[0046] Step 104, based on the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves of each aircraft type under the optimal interval dispatch time multiple in step 102, obtain the number of take-offs in a single wave, and determine whether the maximum take-off times a and b of training aircraft A and training aircraft B calculated in step 102 can be met. If so, the number of airspaces corresponding to the dispatch sequence is given; otherwise, return to step 101 and re-enter the number of garrisons and aircraft type parameters.

[0047] As an example, based on the input airport stationing quantity, multiply it by the presence rate, integrity rate, and the number of single-aircraft flights per day, and divide it by the number of waves of each aircraft type under the optimal interval dispatch time multiple in step 2, to obtain the number of takeoffs in a single wave, and determine whether it can meet the maximum takeoff time a and b of training aircraft A and training aircraft B calculated in step 2. If it can, a dispatching schedule is given, and the number of airspaces is given based on the dispatching schedule. Otherwise, re-enter the airport stationing quantity and related aircraft model parameters.

[0048] The following table is an example of maximizing the control margin under the model conditions:

[0049]

[0050]

[0051] From the table above, we can see that when the interval between the sorties of training aircraft A is 2.4 hours and the interval between the sorties of training aircraft B is 1.2 hours, the maximum control of b reaches its maximum value when a meets 12 minutes. As the interval between the sorties of training aircraft A and the multiple of the interval between the sorties of training aircraft B increase, the value of a increases significantly, but the value of b decreases significantly, and the number of sorties of training aircraft B is greatly reduced. Therefore, (2.4h, 1.2h) is selected from the relative integer items of the departure time points as the optimal option for the standard model.

[0052] After calculation, we can get the airspace number combinations where the sortie waves of training aircraft A and training aircraft B are 4 and 9 respectively. The wave sortie sequence of the optimal airspace planning is shown in the following table:

[0053] *Dispatching 4th and 9th waves Training Machine A Training Machine B Maximum airspace usage quota (rounded down) Space number combination 1 9 (18 minutes) 10 (15 minutes) 19 Space number combination 2 7.5 (15 minutes) 11 (16.5 minutes) 18.5 Space number combination 3 6 (12 minutes) 12 (18 minutes) 18 pcs Space number combination 4 4.5 (9 minutes) 13 (19.5 minutes) 17.5 Space number combination 5 3 (6 minutes) 14 (21 minutes) 17

[0054] According to the above analysis, combination 3 is selected, and a specific dispatch plan can be further obtained, including the specific departure time and order of each hour, such as the first batch of training aircraft A departs at 0h, the second batch of training aircraft B departs, and the dispatch or return status of each type of aircraft, such as the first wave of training aircraft A dispatches at 0h+12m, the fourth wave at 7h12m+12m, the third wave of training aircraft lands at 4h30m+18m, the ninth wave at 11h42m+18m, and so on. Figure 2 As shown in the figure, it can be seen that the training aircraft A and B take off and land at critical positions.

[0055] Embodiment 2:

[0056] For dual-aircraft flight, when the maximum flight time of each aircraft type changes, the adaptability of the above standard model will change. Although the change in the sortie interval time can be offset relatively due to the multiple relationship between the two aircraft types, the fundamental factor affecting the above model period planning lies in the maximum flight time of the aircraft type, including the following possible situations:

[0057] Scenario 1: The first wave of training aircraft A lands before the third wave of training aircraft B takes off;

[0058] Scenario 2: The first wave of training aircraft A lands after the third wave of training aircraft B takes off;

[0059] Scenario 3: The first wave of training aircraft A lands after the first wave of training aircraft B lands;

[0060] Scenario 4: The first wave of training aircraft A lands before the fourth wave of training aircraft B takes off;

[0061] Scenario 5: The first wave of training aircraft A lands after the fourth wave of training aircraft B takes off;

[0062] Scenario 6: The first wave of training aircraft A lands after the fourth wave of training aircraft B takes off.

[0063] For the above situation, it is necessary to adjust the dispatch sequence of training aircraft B. When the landing period of training aircraft A is between the current takeoff of training aircraft B and the landing of the previous wave, the length of the takeoff and landing period of training aircraft B will be compressed, that is, the amount of airspace will be reduced.

[0064] In order to achieve the goal of maximum airspace configuration, it is necessary to comprehensively consider the multiple relationship between the time intervals of the two aircraft types and the position of the maximum flight time. It can be found that the current take-off and the previous landing periods of training aircraft B must fall on the left and right sides of the multiple period. Only in this way can the maximum dispatch efficiency within a multiple period be achieved.

[0065] Considering that training aircraft B cannot go to a distant airspace at the training site, the round-trip time on the journey is relatively small, and its maximum flight time and sortie interval are relatively close. Therefore, we can plan to form a takeoff and landing combination of training aircraft B as above, located on the left and right sides of the central axis of the multiple time period. What needs to be determined is which side the landing of training aircraft A is on, and then solve it according to the multiple constraint relationship and the maximum number of airspaces as the goal to obtain the optimal solution. Here, the multiple time period refers to the value with the longer sortie interval between the two aircraft types.

[0066] In this embodiment, for dual-aircraft collaborative training, the spatial domain matching method includes the following steps:

[0067] Step 201, calculating the maximum wave number and the low wave equilibrium waiting time and the interval departure time according to the performance parameters of the corresponding aircraft model;

[0068] Step 202, arranging the multiple time period values ​​formed by the sortie intervals of the two models from large to small, calculating the difference between the maximum flight time of the model with the larger sortie interval and the multiple value in sequence with a preset step length, judging whether the difference value is less than half of the sortie interval, and obtaining a critical sortie interval time point through a binary search;

[0069] As an example, the multiple time period values ​​formed by the dispatch interval of two models are arranged from large to small, with a step size of 0.1h, and then the difference between the maximum flight time and the multiple value of the model with a larger dispatch interval is calculated in sequence. For example, if the maximum flight time is 4h and the dispatch interval is 2.2h, the difference is 1.8h.

[0070] Determine whether the difference value is less than half of the sortie interval time, and obtain a critical sortie interval time point through binary search. The calculated difference value is just greater than half of the sortie interval time. If the critical point value is increased, it is less than and the critical value is recorded. For example, when the sortie interval time is 2.6h, the difference time is 1.4h, and half of the sortie interval period is 1.3h, the former is greater than the latter. When the sortie interval time is 2.7h, the difference time is 1.3h, and half of the sortie interval period is 1.35h, the former is less than the latter.

[0071] Step 203, divide the search interval into two parts according to the critical dispatch interval time point, the first part is from the minimum value of the multiple time period value to the critical value (closed interval), and the second part is from the critical value of the multiple time period value (open interval) to the maximum value. For the first part, the search proceeds to step 204, and for the second part, the search proceeds to step 205.

[0072] Step 204, for the first part of the search, that is, for the larger maximum flight time of the two models in the right half of the central axis of the multiple time period, that is, Case 4, Case 5, and Case 6 in the above analysis, perform the following judgment:

[0073] Subtract the remainder of the maximum flight time and the multiple period from the length of the multiple period to get the residual difference, and determine which of the following situations is the case: 4, 5, or 6, based on the length of the residual difference. When the landing period is at the very end on the right, it belongs to situation 6; when the landing period of the aircraft with a longer flight time is located in the middle of the take-off and landing period of the aircraft with a shorter flight time at the right end of the central axis, it belongs to situation 5; otherwise, it means that the landing period of the aircraft with a longer flight time is located in front of the take-off and landing period of the aircraft with a shorter flight time at the right end of the central axis, it belongs to situation 4.

[0074] For example, the maximum flight time is 4h, the multiple period is 2.2h, the remainder is 1.8h, and the remaining difference is 0.4h. It is determined whether the length value is less than 0.25h. If so, it belongs to situation 6, and the landing period is at the end of the right end; for example, the maximum flight time is 4h, the multiple period is 2.3h, the remainder is 1.7h, and the remaining difference is 0.3h. It is determined whether the length value is less than 0.4h. If so, it belongs to situation 5. The landing period of the larger flight time model is located in the middle of the take-off and landing period of the smaller flight time model at the right end of the central axis, such as Figure 3 shown.

[0075] Step 205, for the second part of the search, that is, for the larger maximum flight time of the two models in the left half of the central axis of the multiple time period, that is, situation 1, situation 2, and situation 3 in the above analysis, perform the following judgment:

[0076] Subtract the remainder of the maximum flight time and the multiple period from half of the length of the multiple period to get the remainder difference. According to the length of the remainder difference, determine which of Situation 1, Situation 2, and Situation 3 it belongs to. Among them, when it is judged that the landing period is at the end of the right end, it belongs to Situation 3; when it is judged that the landing period of the aircraft with a longer flight time is in the middle of the take-off and landing period of the aircraft with a shorter flight time at the left end of the central axis, it belongs to Situation 2; otherwise, it belongs to Situation 1.

[0077] For example, the maximum flight time is 4h, the multiple period is 2.7h, the remainder is 1.3h, half of the multiple period is 1.35h, the remaining difference is 0.05h, the length value is less than 0.25h, and the landing period is at the very end on the right, which belongs to Situation 3. As the dispatch interval increases, the difference between the dispatch interval and the maximum flight time of the smaller aircraft becomes smaller. Calculate the difference of the smaller aircraft. If the difference is less than 0.25h, or the calculated remainder difference of the larger aircraft is less than 0.4h, the landing period of the larger flight time model is located in the middle of the take-off and landing period of the smaller flight time model on the left end of the central axis, which belongs to Situation 2. Otherwise, it means that the landing period of the larger flight time model is located in front of the take-off and landing period of the smaller flight time model on the left end of the central axis, which belongs to Situation 1. If Figure 3 shown.

[0078] Step 206, solving situations 1-6, including:

[0079] The following constraints are set for situation 1: the four take-off and landing periods on the left side of the central axis of the multiple period cannot exceed half of the multiple period, and the take-off period of the smaller aircraft cannot exceed the difference between its maximum flight time and the dispatch interval time.

[0080] For situation 2, the following constraints are set: the landing time plus the landing duration of the aircraft with a shorter flight time cannot exceed the landing time of the aircraft with a longer flight time. The calculation result is then assigned to the take-off time and take-off period of the aircraft with a shorter flight time.

[0081] The following constraints are set for situation 3: the landing time plus the landing duration of the aircraft with a smaller flight time cannot exceed half of the multiple period, and the calculated result is then assigned to the take-off time and take-off period of the aircraft with a smaller flight time.

[0082] The following constraints are set for situation 4: the three take-off and landing periods on the right side of the central axis of the multiple period cannot exceed half of the multiple period, and the take-off period of the aircraft with a smaller flight time cannot exceed the difference between its maximum flight time and the dispatch interval time.

[0083] For situation 5, the following constraints are set: the landing time plus the landing duration of the aircraft with a shorter flight time cannot exceed the landing time of the aircraft with a longer flight time. The calculation result is then assigned to the take-off time and take-off period of the aircraft with a shorter flight time.

[0084] The following constraints are set for situation 6: the landing time plus the landing duration of the aircraft with a smaller flight time cannot exceed half of the multiple period, and the calculated result is then assigned to the take-off time and take-off period of the aircraft with a smaller flight time.

[0085] An embodiment of the present invention further provides a spatial domain matching device for dual-aircraft collaborative training, the device comprising:

[0086] The first calculation module is used to obtain the flight time of the day and the model performance parameters of the training aircraft A and the training aircraft B to solve the maximum wave number, the low wave equilibrium waiting time and the interval departure time;

[0087] The search module is used to calculate the multiple of the interval takeoff of each training aircraft A and training aircraft B, obtain the balance time of training aircraft A after taking the remainder according to the maximum flight time and the interval departure time of training aircraft A, and search with a predetermined step length according to the number of waves, and search for the smaller value of the difference between the balance time of training aircraft A and the interval and the difference between the balance time and the zero time, which is set to a+2b; wherein a is the takeoff or landing time of training aircraft A, and b is the takeoff or landing time of training aircraft B;

[0088] The second calculation module obtains the maximum available takeoff time of b according to the flight time and the interval departure time of the training aircraft B, and calculates the time of a to obtain the maximum capacity of each airspace under different flight durations and aircraft performance parameters;

[0089] The airspace matching module is used to obtain the number of single-wave takeoffs based on the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves of each aircraft type under the corresponding optimal interval dispatch time multiples in the search module, and to determine whether the maximum take-off times a and b of training aircraft A and training aircraft B calculated in the search module can be met. If so, the airspace number corresponding to the dispatch sequence is given.

[0090] It is understandable that the calculation and solution processes involved in the present invention can be implemented using known algorithms or software tools, which are not described in detail here due to space considerations. At the same time, these contents do not limit the technical solutions of the present invention.

[0091] The present invention calculates the multiples of the interval takeoffs of each training aircraft A and training aircraft B, loads the corresponding wave numbers, searches with a predetermined step length, subtracts the interval departure time from the maximum flight time of the training aircraft A, obtains the balance time of the training aircraft A after taking the remainder, seeks the smaller value of the balance time of the training aircraft A and the interval difference and the balance time and the zero time difference, multiplies the input airport stationing quantity by the presence rate, the intact rate, the number of single-aircraft flights per day, and the wave number of each aircraft model under the multiple of the optimal interval dispatch time, obtains the single-wave takeoff number, and obtains the dispatch sequence and the airspace number when it is judged that the calculated maximum takeoff times a and b of the training aircraft A and the training aircraft B can be met, and the airspace matching number that meets the maximum flight training efficiency can be quickly obtained. In particular, when an emergency occurs, such as when the maximum flight time of the aircraft type changes, the airspace matching and the flight training plan can be quickly changed, thereby improving the utilization rate of flight training resources.

[0092] In addition, the present invention reduces computational redundancy and has lower requirements on the hardware level of the device.

[0093] Application examples:

[0094] ① The stationing conditions at a certain airport are: 80 B training aircraft and 20 A training aircraft, with the presence rate and intact rate being 0.75 and 0.75 respectively.

[0095] ② The average number of aircraft launched per wave in each airspace: 1.5 training B aircraft and 1 training A aircraft.

[0096] ③ Average flight time per sortie for each aircraft type: 1.5 hours for training aircraft B and 4 hours for training aircraft A.

[0097] ④ The take-off interval of each flight of training aircraft A is 2 minutes, and the take-off interval of each flight of training aircraft B is 1 minute.

[0098] ⑤ Each wave of training aircraft A occupies the airspace for 2 hours, and each wave of training aircraft B occupies the airspace for 1 hour.

[0099] ⑥ The daily dispatch intensity of a single training aircraft A is 2 times, and the daily dispatch intensity of a single training aircraft B is 2.5 times.

[0100] First, according to the situation in the problem description and the airspace configuration planning algorithm, the number of quasi-stationed aircraft, the in-place rate, and the intact rate of training aircraft A and training aircraft B are substituted into the formula:

[0101]

[0102] Number of intact aircraft = number of stationed aircraft × in-place rate × intact rate.

[0103] Number of aircraft dispatched per day = daily dispatch intensity × number of intact aircraft.

[0104] Number of airspace usage = number of aircraft dispatched per day / number of aircraft available for flight in each airspace

[0105] Round trip time = (maximum flight time - airspace occupation time per wave) / 2

[0106]

[0107] Optimal number of airspace configuration waves = Y (maximum number of sorties)

[0108] Number of sorties per wave = number of sorties per day / number of optimal waves for airspace configuration

[0109] Take-off time for each wave = take-off interval time × number of aircraft dispatched per wave

[0110] Number of airspaces = number of times the airspace is used / number of optimal waves of airspace configuration.

[0111] The number of airspaces needs to be rounded up to ensure that the number is sufficient. After calculation, the number of airspace configurations for training aircraft A and training aircraft B is:

[0112]

[0113]

[0114] From the table above, we can see that the number of airspace configurations for training aircraft A and training aircraft B are 5 and 8 respectively, and the take-off time for each wave is 10 minutes and 12 minutes. The deployment plan based on the above airspace configuration is:

[0115]

[0116] The above table is expressed as follows: each row is the specific departure time and order, such as the first batch of training aircraft A departs at 0h, and the second batch of training aircraft B departs; and each column represents the dispatch or return status of each type of aircraft, training aircraft A dispatches the first wave at 0h+10m, the fourth wave at 7h12m+10m, training aircraft B lands the third wave at 4h30m+12m, and the ninth wave at 11h42m+12m.

[0117] Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that the specific implementation modes of the present invention can still be modified or some technical features can be replaced by equivalents without departing from the spirit of the technical solution of the present invention, which should be included in the scope of the technical solution for protection of the present invention.

Claims

1. A spatial domain matching method for dual-aircraft collaborative training, characterized in that: The method includes: Step 101, obtaining the flight time of the day, the model performance parameters of the small wave training aircraft A and the large wave training aircraft B, so as to solve the maximum wave number, the low wave equilibrium waiting time and the interval departure time; Step 102, calculate the multiples of the interval takeoffs of each training aircraft A and training aircraft B, obtain the balance time of training aircraft A after taking the remainder according to the maximum flight time and the interval departure time of training aircraft A, search with a predetermined step length according to the number of waves, and search for the smaller value of the difference between the balance time of training aircraft A and the interval and the difference between the balance time and the zero time, set to a+2b; where a is the takeoff or landing time of training aircraft A, and b is the takeoff or landing time of training aircraft B; Step 103, obtaining the maximum available takeoff time of b according to the flight time and the interval departure time of the training aircraft B, and calculating the time of a, so as to obtain the maximum capacity of each airspace under different flight durations and aircraft performance parameters; Step 104, based on the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves of each aircraft type under the optimal interval dispatch time multiple in step 102, obtain the number of take-offs in a single wave, and determine whether the maximum take-off times a and b of training aircraft A and training aircraft B calculated in step 102 can be met. If so, the number of airspaces corresponding to the dispatch sequence is given; otherwise, return to step 101 and re-enter the number of garrisons and aircraft type parameters.

2. The spatial domain matching method for dual-aircraft collaborative training according to claim 1 is characterized in that: In step 102, the search interval is divided into two parts, the first search part is from the minimum value of the multiple time period value to the critical value, and the second search part is from the critical value of the multiple time period value to the maximum value.

3. The spatial domain matching method for dual-aircraft collaborative training according to claim 2 is characterized in that: Arrange the multiple time period values ​​formed by the dispatch interval of the two models from large to small, calculate the difference between the maximum flight time of the model with a larger dispatch interval and the multiple value in sequence with a preset step size, determine whether the difference value is less than half of the dispatch interval, and obtain a critical dispatch interval time point through binary search.

4. The spatial domain matching method for dual-aircraft collaborative training according to claim 3 is characterized in that: When the absolute value of the difference between half of the sortie wave interval of training aircraft A and the remainder of the landing time of training aircraft A is as small as possible, the remainder of the take-off and landing waves of training aircraft B is made to be between the sortie wave interval and the landing time of training aircraft A.

5. The spatial domain matching method for dual-aircraft collaborative training according to claim 3 is characterized in that: For the first search part, the length of the multiple time period is subtracted from the remainder of the maximum flight time and the multiple time period to obtain the residual difference, and the length value of the residual difference is used to determine which of Situation 4, Situation 5, and Situation 6 it belongs to; among them, when the landing period is judged to be at the very end on the right end, it belongs to Situation 6; when the landing period of the aircraft with a larger flight time is judged to be in the middle of the take-off and landing period of the aircraft with a smaller flight time at the right end of the central axis, it belongs to Situation 5; otherwise, it means that the landing period of the aircraft with a larger flight time is located in front of the take-off and landing period of the aircraft with a smaller flight time at the right end of the central axis, it belongs to Situation 4.

6. The spatial domain matching method for dual-aircraft collaborative training according to claim 3 is characterized in that: For the second, subtract the remainder of the maximum flight time and the multiple time period from half of the length of the multiple time period to obtain the remainder difference. According to the length of the remainder difference, determine which of Situation 1, Situation 2, and Situation 3 it belongs to; among them, when it is judged that the landing period is at the very end on the right, it belongs to Situation 3; when it is judged that the landing period of the aircraft with a larger flight time is in the middle of the take-off and landing period of the aircraft with a smaller flight time at the left end of the central axis, it belongs to Situation 2; otherwise, it belongs to Situation 1.

7. The spatial domain matching method for dual-aircraft collaborative training according to claim 5, characterized in that: The following constraints are set for situation 4: the three take-off and landing periods on the right side of the central axis of the multiple period cannot exceed half of the multiple period, and the take-off period of the aircraft with a smaller flight time cannot exceed the difference between its maximum flight time and the dispatch interval time; For situation 5, the following constraints are set: the landing time plus the landing duration of the aircraft with a shorter flight time cannot exceed the landing time of the aircraft with a longer flight time. The calculation result is then assigned to the take-off time and take-off period of the aircraft with a shorter flight time. The following constraints are set for situation 6: the landing time plus the landing duration of the aircraft with a smaller flight time cannot exceed half of the multiple period, and the calculated result is then assigned to the take-off time and take-off period of the aircraft with a smaller flight time.

8. The spatial domain matching method for dual-aircraft collaborative training according to claim 6, characterized in that: The following constraints are set for situation 1: the four take-off and landing periods on the left side of the central axis of the multiple period cannot exceed half of the multiple period, and the take-off period of the smaller aircraft cannot exceed the difference between its maximum flight time and the sortie interval time; For situation 2, the following constraints are set: the landing time plus the landing duration of the aircraft with a shorter flight time cannot exceed the landing time of the aircraft with a longer flight time. The calculation result is then assigned to the take-off time and take-off period of the aircraft with a shorter flight time. The following constraints are set for situation 3: the landing time plus the landing duration of the aircraft with a smaller flight time cannot exceed half of the multiple period, and the calculated result is then assigned to the take-off time and take-off period of the aircraft with a smaller flight time.

9. A spatial matching device for dual-aircraft collaborative training, characterized in that: The device includes: The first calculation module is used to obtain the flight time of the day and the model performance parameters of the training aircraft A and the training aircraft B to solve the maximum wave number, the low wave equilibrium waiting time and the interval departure time; The search module is used to calculate the multiple of the interval takeoff of each training aircraft A and training aircraft B, obtain the balance time of training aircraft A after taking the remainder according to the maximum flight time and the interval departure time of training aircraft A, and search with a predetermined step length according to the number of waves, and search for the smaller value of the difference between the balance time of training aircraft A and the interval and the difference between the balance time and the zero time, which is set to a+2b; wherein a is the takeoff or landing time of training aircraft A, and b is the takeoff or landing time of training aircraft B; The second calculation module obtains the maximum available takeoff time of b according to the flight time and the interval departure time of the training aircraft B, and calculates the time of a to obtain the maximum capacity of each airspace under different flight durations and aircraft performance parameters; The airspace matching module is used to obtain the number of single-wave takeoffs based on the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves of each aircraft type under the corresponding optimal interval dispatch time multiples in the search module, and to determine whether the maximum take-off times a and b of training aircraft A and training aircraft B calculated in the search module can be met. If so, the airspace number corresponding to the dispatch sequence is given.