Multi-model cooperative training airspace matching method and device

Through the airspace matching method of multi-model collaborative training, the take-off and landing time of the training aircraft is optimized. According to the number of airport stations and the performance parameters of aircraft models, the problems of maximizing and rapid adjustment of airspace resources are solved, and the utilization of flight training resources is improved. Rate.

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

Patent Information

Application Number
CN202410945180.4
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 prior art to maximize and rapid adjustment of airspace resource use, especially in the planning and adjustment of aircraft training tasks, and it is difficult to meet the improvement of flexibility and training efficiency in emergencies.

Method used

The airspace matching method of multi-model collaborative training is adopted. By calculating the interval takeoff multiple and takeoff width of each model, the takeoff and landing time of the training aircraft is optimized, and the maximum flight training can be quickly obtained based on the number of airport stations and the performance parameters of the model. Efficient number of airspace matching and quickly adjust the airspace matching scheme in case of emergencies.

Benefits of technology

The maximum utilization and rapid adjustment of airspace resources are achieved, the utilization rate of flight training resources is improved, the calculation redundancy is reduced, and the hardware requirements are low.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118941005A_ABST
    Figure CN118941005A_ABST
Patent Text Reader

Abstract

The invention discloses a multi-aircraft-type cooperative training airspace matching method and device, and belongs to the technical field of flight mission planning. According to input performance parameters, airspace round-trip time and the like of all types of aircrafts, the maximum wave number, the low-wave-number equilibrium waiting time and the interval departure time are solved, the take-off time a of a training machine A, the take-off and landing width time c and landing time c of a training machine C and the take-off and landing width time b and landing time b of a training machine B are combined, and the maximum wave number and the low-wave-number equilibrium waiting time and the interval departure time are calculated. When the time is less than or equal to half of the interval starting duration of the training machine A, performing optimization regulation and control calculation according to the proportion of b value maximization regulation and control and a: c = 1: 1, and searching different combinations to obtain the maximum available time of a, b and c, thereby obtaining the maximum capacity of each airspace under different flight durations and aircraft performance input, and obtaining the single-wave take-off times. 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 flight mission planning, and in particular relates to an airspace matching method and device for collaborative training of multiple aircraft types. 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 multi-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] According to a first aspect of the present invention, a spatial domain matching method for collaborative training of multiple aircraft models is provided, wherein the multiple aircraft models include a small wave of training aircraft A and a large wave of training aircraft B and C, characterized in that the method comprises:

[0006] Step 1: Obtain the flight time of the day, performance parameters of each aircraft type, and round-trip time in the airspace to solve the maximum wave number and the balanced waiting time and interval departure time of the low wave number;

[0007] Step 2, configuring the airspace for training aircraft A, training aircraft B, and training aircraft C; including: calculating the multiples of the takeoff intervals of each training aircraft A, training aircraft B, and training aircraft C, and loading the corresponding wave times, searching with a preset step length, and obtaining the takeoff and landing widths of training aircraft B and training aircraft C;

[0008] Step 3: add the takeoff time a of training aircraft A, the takeoff and landing width time c of training aircraft C, and the takeoff and landing width time b of training aircraft B to a time less than or equal to half of the interval between dispatches of training aircraft A, and perform optimization control calculation according to the maximum control of b value, with a:c=1:1 ratio. By searching different combinations, the maximum available time of a, b, and c is obtained, and the maximum capacity of each airspace is obtained;

[0009] Step 4: Obtain the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves under the optimal interval dispatch time multiple, and obtain the number of take-offs in a single wave. Determine whether the maximum take-off and landing times a, b, and c calculated in step 3 can be met. If so, give the dispatch sequence and determine the number of airspaces.

[0010] According to a second aspect of the present invention, a spatial domain matching device for collaborative training of multiple aircraft types is provided, wherein the multiple aircraft types include a small-wave training aircraft A and a large-wave training aircraft B and C, and the device comprises:

[0011] The first calculation module is used to obtain the flight time of the day, the performance parameters of each aircraft type, and the round-trip time in the airspace to solve the maximum wave number and the balanced waiting time and interval departure time of the low wave number;

[0012] The search module is used to configure the airspace for the training aircraft A, the training aircraft B, and the training aircraft C; including: calculating the multiples of the take-off intervals of each training aircraft A, the training aircraft B, and the training aircraft C, and loading the corresponding wave times, searching with a preset step length, and obtaining the take-off and landing widths of the training aircraft B and the training aircraft C;

[0013] The optimization module is used to maximize the b value and perform optimization control calculations at a:c=1:1, by searching for different combinations to obtain the maximum available time of a, b, and c, and to obtain the maximum capacity of each airspace;

[0014] The airspace matching module is used to obtain the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves under the optimal interval dispatch time multiple, to obtain the number of take-offs in a single wave, and to determine whether the maximum take-off and landing time a, b, and c calculated in the optimization module can be met. If so, the dispatch sequence is given and the number of airspaces is determined.

[0015] In other examples, the interval between dispatches of training aircraft A is divided by 2 to obtain half the time, and then the flight time of training aircraft B is subtracted from the interval between dispatches of training aircraft B to obtain the take-off and landing width of training aircraft B; the flight time of training aircraft C is subtracted from the interval between dispatches of training aircraft C to obtain the take-off and landing width of training aircraft C.

[0016] The present invention can quickly obtain the number of airspace matches that meet the maximum flight training efficiency based on the number of airport garrisons and aircraft performance parameters, and can quickly change the airspace matching and flight training plans in the event of an emergency, thereby improving the utilization rate of flight training resources.

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

[0018] 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

[0019] 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:

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

[0021] Figure 2 This is a schematic diagram of the deployment plan for coordinated training of multiple aircraft types. DETAILED DESCRIPTION

[0022] 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.

[0023] According to an embodiment of the present invention, the multiple aircraft types here include a small wave of training aircraft A and a large wave of training aircraft B and C, and to simplify the calculation, the present invention only discusses the problem of the combination of the number of airspaces of multiple aircraft types when the flight time is a constant.

[0024] To address this problem, the present invention constructs a standard model for the airspace combination of multiple aircraft types with different sortie waves, and strictly sorts them according to the sortie wave interval time in the sortie law. The objective function of the model is:

[0025]

[0026] Where ppi is the time taken for the interval between dispatches of the ith aircraft type, di is the time taken for the ith aircraft type to go to the airspace from the airport when the distance remains unchanged, pi is the flight time occupied by the ith aircraft type to be optimized, j, k represent the number of waves, F represents training aircraft B, h represents training aircraft C, the superscript return represents the landing time, and departure represents the take-off time.

[0027] And has the following constraints:

[0028] (1) Constraint 1:

[0029]

[0030] Wherein, t2 represents the take-off and landing time of training aircraft B, and t3 represents the take-off and landing time of training aircraft C.

[0031] (2) Constraint 2:

[0032] In combination with the problem of timing arrangement of multiple aircraft types, it is necessary to consider that the multiple aircraft types should be in a state of corresponding multiple association between each other, that is, the relationship between training aircraft A, training aircraft B, and training aircraft C should be a prime multiple, so that the take-off and landing time between multiple aircraft types can be maximized while satisfying the non-overlapping condition. This constraint can be expressed as:

[0033]

[0034] pp1=(p1+Ay1)

[0035] pp2=(p2+Δy2)

[0036] pp3=(p3+Δy3)

[0037] Where Δy1, Δy2, and Δy3 are the additional standby times of training machines A, B, and C, respectively.

[0038] That is, the maximum value of the interval between the dispatch waves of training aircraft A, training aircraft B, and training aircraft C is divided by the minimum value of the three, and the ratio of the maximum value to the interval between the dispatch waves of any single aircraft type is divided by an integer, and the remainder is taken to be zero, that is, large prime multiples can divide small prime multiples, such as {1,3,9}; {1,2,4}; {1.333, 2.666, 5.332}, etc.

[0039] The above model indicates that the time of the j-th return and landing of training aircraft B should be as long as possible greater than the time of the j+1-th take-off and dispatch of training aircraft B; the time of the k-th return and landing of training aircraft C should be as long as possible greater than the time of the k+1-th take-off and dispatch of training aircraft C; when the absolute value of the difference between half of the interval time of the small-wave training aircraft A and the modulo the landing time of training aircraft A is as small as possible, and at the same time, the modulo the take-off and landing waves of training aircraft B is between the interval time of the wave of training aircraft A and the landing time, the allocation of the amount of airspace is maximized.

[0040] Figure 1This is an example of the sortie sequence of multiple types of airspace planning under the standard model. As shown in the figure, the sortie distribution rules of training aircraft A, training aircraft B, and training aircraft C under the standard model of airspace planning, and the take-off and landing time difference between the k+1th wave and the kth wave of training aircraft C is 3 hours minus pp3 hours, and the take-off and landing time difference between the j+1th wave and the jth wave of training aircraft B is 1.5 hours minus pp2 hours. Since the interval departure time of training aircraft B is half of the interval departure time of training aircraft A and training aircraft C, there are two waves of take-offs and landings of training aircraft B in the interval departure time of one wave of training aircraft A, that is, the first half of the time period is the jth wave take-off and the j-1th wave landing, and the second half of the time period is the j+1th wave take-off and the jth wave landing. In other words, a+b+c plus the sum of the take-off and landing interval time of training aircraft B and the take-off and landing interval time of training aircraft C is less than or equal to the sortie interval time of training aircraft B, so as to ensure that in the second half of the time period, the take-off of training aircraft B is completed after the landing of training aircraft A.

[0041] Based on the above, an embodiment of the present invention provides a spatial domain matching method for collaborative training of multiple aircraft types (machine types), such as Figure 2 As shown, the following steps are included:

[0042] Step 1: Obtain the flight time of the day, performance parameters of each aircraft type, and round-trip time in the airspace to solve the maximum wave number and the balanced waiting time and interval departure time of the low wave number;

[0043] Step 2, configuring the airspace for training aircraft A, training aircraft B, and training aircraft C; including: calculating the multiples of the takeoff intervals of each training aircraft A, training aircraft B, and training aircraft C, and loading the corresponding wave numbers, searching with a preset step length, and obtaining the takeoff and landing widths of training aircraft B and training aircraft C.

[0044] Specifically, divide the interval between departures of training aircraft A by 2 to get half the time, and then subtract the interval between departures of training aircraft B from the flight time of training aircraft B to find out the take-off and landing width of training aircraft B; subtract the interval between departures of training aircraft C from the flight time of training aircraft C to find out the take-off and landing width of training aircraft C.

[0045] For example, searching with a preset step size of 0.1, dividing the 2.5-hour interval between dispatches of training aircraft A by 2, we get half of the time, 1.25 hours. Subtracting the 1.25-hour interval between dispatches of training aircraft B from the 1.5-hour flight time of training aircraft B, we get a take-off and landing width of 0.167 hours for training aircraft B. Subtracting the 2.5-hour interval between dispatches of training aircraft C from the 3-hour flight time of training aircraft C, we get a take-off and landing width of 0.5 hours for training aircraft C.

[0046] Step 3: add the takeoff time a of training aircraft A, the takeoff and landing width time c of training aircraft C, and the takeoff and landing width time b of training aircraft B to a time less than or equal to half of the interval between dispatches of training aircraft A, and perform optimization control calculation according to the maximum control of b value, with a:c=1:1 ratio. By searching different combinations, the maximum available time of a, b, and c is obtained, and the maximum capacity of each airspace is obtained;

[0047] For example, the takeoff time a of training aircraft A, plus the takeoff and landing width time of training aircraft C of 0.5 hours and the landing time c, plus the takeoff and landing width time of training aircraft B of 0.167 hours and the landing time b, is less than or equal to half of the time between the dispatch of training aircraft A, that is, a+b+c+0.5+0.167≤(2.5-1.25), and the optimization control calculation is performed according to the maximum control of the b value, and the ratio of a:c=1:1. By searching for different combinations, the maximum available time of a, b, and c is obtained. Since the takeoff time determines the number of airspaces, the maximum capacity of each airspace under different flight durations and aircraft performance inputs is obtained.

[0048] Step 4: Obtain the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves under the optimal interval dispatch time multiple, and obtain the number of take-offs in a single wave. Determine whether the maximum take-off and landing times a, b, and c calculated in step 3 can be met. If so, give the dispatch sequence and determine the number of airspaces; otherwise, re-enter the number of airport garrisons and related parameters.

[0049] The following table shows the maximum control margin for the standard model:

[0050]

[0051] From the table above, we can see that when the interval between the dispatch of training aircraft A is 2.534 hours, the interval between the dispatch of training aircraft B is 1.2670 hours, and the interval between the dispatch of training aircraft C is 2.534 hours, the 14-minute control of b maximizes the most balanced optimization value when a meets 10 minutes and c meets 10 minutes. As the interval between the dispatch of training aircraft A and the multiple of the interval between the dispatch of training aircraft B increase, the value of a increases significantly, but the value of b decreases significantly, and the number of dispatches of training aircraft B is greatly reduced. Therefore, (2.534h, 1.267h, 2.534h) is selected from the relative integer items of the departure time point as the optimal option for the standard model of multi-aircraft airspace planning.

[0052] After calculation, we can get the airspace number combinations of 4 waves, 9 waves and 4 waves for training aircraft A, training aircraft B and training aircraft C respectively. The wave dispatching schedule of the optimal airspace planning under the standard model is:

[0053]

[0054]

[0055] Substituting the balanced and optimized airspace number combination 6, that is, the single-wave airspace allocation quota of training aircraft B is 9, into the model for solution, we can obtain the dispatch plan of each type of aircraft. For example, the calculation is performed using the interval time of the dispatch wave as the balance standard, such as Figure 2 As shown, training aircraft A, training aircraft B, and training aircraft C take off and land at critical positions.

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

[0057] The first calculation module is used to obtain the flight time of the day, the performance parameters of each aircraft type, and the round-trip time in the airspace to solve the maximum wave number and the balanced waiting time and interval departure time of the low wave number;

[0058] The search module is used to configure the airspace for the training aircraft A, the training aircraft B, and the training aircraft C; including: calculating the multiples of the take-off intervals of each training aircraft A, the training aircraft B, and the training aircraft C, and loading the corresponding wave times, searching with a preset step length, and obtaining the take-off and landing widths of the training aircraft B and the training aircraft C;

[0059] The optimization module is used to maximize the b value and perform optimization control calculations at a:c=1:1, by searching for different combinations to obtain the maximum available time of a, b, and c, and to obtain the maximum capacity of each airspace;

[0060] The airspace matching module is used to obtain the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves under the optimal interval dispatch time multiple, to obtain the number of take-offs in a single wave, and to determine whether the maximum take-off and landing time a, b, and c calculated in the optimization module can be met. If so, the dispatch sequence is given and the number of airspaces is determined.

[0061] The present invention solves the maximum wave number and the low wave balanced waiting time and the interval departure time according to the input performance parameters of each aircraft type, the round-trip time of the airspace, etc., and adds the take-off time a of the training aircraft A, the take-off width time and the landing time c of the training aircraft C, and the take-off width time and the landing time b of the training aircraft B, which is less than or equal to half of the interval dispatch time of the training aircraft A, and optimizes the control calculation according to the maximum control of the b value, and the ratio of a:c=1:1, and obtains the maximum available time of a, b, and c by searching different combinations. The take-off time determines the number of airspaces, thereby obtaining the maximum capacity of each airspace under different flight durations and aircraft performance inputs, and obtaining the number of single-wave take-offs. It is judged whether the maximum take-off and landing times a, b, and c calculated in step 3 can be met. If it can, the dispatch sequence is given, and then the number of airspaces is given.

[0062] The present invention can quickly obtain the number of airspace matches that meet the maximum flight training efficiency based on the number of airport garrisons and aircraft performance parameters, and can quickly change the airspace matching and flight training plans in the event of an emergency, thereby improving the utilization rate of flight training resources.

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

[0064] Application examples:

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

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

[0067] ③ Average flight time per flight of each aircraft type: 4 hours for training aircraft A, 1.5 hours for training aircraft B, and 3 hours for training aircraft C.

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

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

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

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

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

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

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

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

[0076]

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

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

[0079] Among them: the number of airspaces needs to be rounded up to ensure sufficient quantity. After calculation, the following information can be obtained:

[0080]

[0081]

[0082] From the table above, we can see that the number of airspace configurations for training aircraft A, training aircraft B, and training aircraft C are 5, 6, and 5 respectively, and the take-off time for each wave is 10 minutes, 9 minutes, and 10 minutes. The dispatch plan table (part) of each aircraft type is as follows:

[0083]

[0084] In the above table, each row is the specific departure time and order, such as the first batch of training aircraft A departs at 0h, the second batch of training aircraft B departs, and the third batch of training aircraft C departs; and each column represents the dispatch or return status of each type of aircraft, training aircraft B dispatches the first wave at 0h22m+9m, the fourth wave at 4h10m+9m, and training aircraft B lands the third wave at 4h24m+9m.

[0085] 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 multi-aircraft collaborative training, wherein: The multiple models include a small-wave training machine A and large-wave training machines B and C, and the method includes: Step 1: Obtain the flight time of the day, performance parameters of each aircraft type, and round-trip time in the airspace to solve the maximum wave number and the balanced waiting time and interval departure time of the low wave number; Step 2, configuring the airspace for training aircraft A, training aircraft B, and training aircraft C; including: calculating the multiples of the takeoff intervals of each training aircraft A, training aircraft B, and training aircraft C, and loading the corresponding wave times, searching with a preset step length, and obtaining the takeoff and landing widths of training aircraft B and training aircraft C; Step 3: add the takeoff time a of training aircraft A, the takeoff and landing width time c of training aircraft C, and the takeoff and landing width time b of training aircraft B to a time less than or equal to half of the interval between dispatches of training aircraft A, and perform optimization control calculation according to the maximum control of b value, with a:c=1:1 ratio. By searching different combinations, the maximum available time of a, b, and c is obtained, and the maximum capacity of each airspace is obtained; Step 4: Obtain the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves under the optimal interval dispatch time multiple, and obtain the number of take-offs in a single wave. Determine whether the maximum take-off and landing times a, b, and c calculated in step 3 can be met. If so, give the dispatch sequence and determine the number of airspaces.

2. The spatial domain matching method for multi-aircraft collaborative training according to claim 1 is characterized in that: In step 2, divide the interval between dispatch of training aircraft A by 2 to get half of the time, then subtract the interval between dispatch of training aircraft B from the flight time of training aircraft B to find out the take-off and landing width of training aircraft B; subtract the interval between dispatch of training aircraft C from the flight time of training aircraft C to find out the take-off and landing width of training aircraft C.

3. A spatial matching device for multi-aircraft collaborative training, wherein: The multiple models include a small-wave training machine A and large-wave training machines B and C, characterized in that the device includes: The first calculation module is used to obtain the flight time of the day, the performance parameters of each aircraft type, and the round-trip time in the airspace to solve the maximum wave number and the balanced waiting time and interval departure time of the low wave number; The search module is used to configure the airspace for the training aircraft A, the training aircraft B, and the training aircraft C; including: calculating the multiples of the take-off intervals of each training aircraft A, the training aircraft B, and the training aircraft C, and loading the corresponding wave times, searching with a preset step length, and obtaining the take-off and landing widths of the training aircraft B and the training aircraft C; The optimization module is used to maximize the b value and perform optimization control calculations at a:c=1:1, by searching for different combinations to obtain the maximum available time of a, b, and c, and to obtain the maximum capacity of each airspace; The airspace matching module is used to obtain the number of airport garrisons, attendance rate, availability rate, number of single-aircraft flights per day, and the number of waves under the optimal interval dispatch time multiple, to obtain the number of take-offs in a single wave, and to determine whether the maximum take-off and landing time a, b, and c calculated in the optimization module can be met. If so, the dispatch sequence is given and the number of airspaces is determined.

4. The spatial domain matching device for multi-aircraft collaborative training according to claim 3 is characterized in that: In the search module, divide the interval between dispatches of training aircraft A by 2 to get half the time, and then subtract the interval between dispatches of training aircraft B from the flight time of training aircraft B to search for the take-off and landing width of training aircraft B; subtract the interval between dispatches of training aircraft C from the flight time of training aircraft C to search for the take-off and landing width of training aircraft C.