Airspace sector partitioning method based on divide-and-conquer

Abstract

The application discloses a space domain sector division method based on a divide-and-conquer method and belongs to the field of space domain planning; specifically, for a plurality of adjacent airports in a same region, a two-dimensional space domain graph of each airport is drawn according to airport grades and actual geographical positions of the airports; then, N space domains in the two-dimensional space domain graph are numbered, and two-part division is conducted on the space domains which are partially overlapped and different in upper and lower limits; one part is a single space domain, starting from the smallest two parts, i.e., two single space domains, the two-part sector division of the space domains is conducted by using intersection and subtraction, then the two single space domains are taken as a part, sector division is continuously conducted in combination with another single space domain, and the process is sequentially repeated until all single space domains are finally covered to obtain sector division after superposition of all space domains and determine upper and lower limits of each space domain sector; and the application reduces calculation complexity.

Description

TECHNICAL FIELD

[0001] The application belongs to the field of airspace planning, and relates to an airspace sector division method based on a divide-and-conquer method. BACKGROUND

[0002] In order to construct a safe and effective national airspace system and coordinate multiple aviation flight demands, airspace is classified and set up and managed in stages, unified military and civilian flight rules are provided, and differentiated air traffic control services are provided to airspace users.

[0003] For example, the setting rules of the B-type airspace are as follows:

[0004] (1) A civil three-runway (including) airport is usually divided into a three-ring ladder structure with a radius of 20 kilometers, 40 kilometers and 60 kilometers, and the heights are runway surface-900 meters above the airport elevation (including), 900 meters above the airport elevation-1800 meters above the airport elevation, and 1800 meters above the airport elevation-6000 meters above the standard atmospheric pressure.

[0005] (2) A civil double-runway airport is usually divided into a ring ladder structure with a radius of 15 kilometers and 30 kilometers, and the heights are runway surface-600 meters above the airport elevation (including), 600 meters above the airport elevation-3600 meters above the airport elevation, and the top layer is up to 6000 meters above the standard atmospheric pressure.

[0006] (3) A civil single-runway airport is usually divided into a single-ring structure with a radius of 12 kilometers and a runway surface-600 meters above the airport elevation (including).

[0007] When there are multiple airports in a region that are very close to each other, multiple airspaces with different upper and lower height limits will overlap. In order to facilitate the judgment of the airspace category of an aircraft by controllers and pilots, airspaces of the same category with different upper and lower height limits must be combined into a sector, and the horizontal range and upper and lower height limit values of each sector must be given in the published airspace data.

[0008] When multiple airports are adjacent, it is very difficult for airspace planning personnel to manually calculate the horizontal range and upper and lower height limit values of each sector, and there is an urgent need for a method that can automatically calculate the horizontal range and upper and lower height limit values of sectors of multiple adjacent airport airspaces. SUMMARY

[0009] When multiple airport airspaces overlap, it is difficult for airspace classification and setting personnel to plan the range of various types of airspaces, divide airspace sectors, and determine the upper and lower height limits of the sectors. The application provides an airspace sector division method based on a divide-and-conquer method, which divides airspace sectors through iteration.

[0010] The airspace sector division method based on the divide-and-conquer method has the following specific steps:

[0011] Step one, for multiple adjacent airports in the same area, draw a two-dimensional circular air space diagram of each airport according to the airport grade and the actual geographical location of the airport, and set the upper and lower limits of the height of each circular air space;

[0012] The air space of a large airport is usually three layers of circular rings, the air space of a medium-sized airport is usually two layers of circular rings, and the air space of a small airport is one circular ring, and according to the altitude of the airport, the upper and lower limits of the height of each circular air space are set according to the air space classification and standard setting.

[0013] Step two, number N air spaces in the two-dimensional air space diagram, respectively represented as 、 、…、 ;

[0014] The numbering method and order are arbitrarily selected;

[0015] Step three, divide the air spaces that partially overlap and have different height upper and lower limits into two parts;

[0016] Specifically, initially, one air space is arbitrarily selected as one part, and the other part is the remaining air spaces;

[0017] Then, the air spaces are further divided into two parts: one part is arbitrarily selected as one air space, and the other part is the remaining air spaces;

[0018] In this way, until the last two parts each contain only one air space.

[0019] Step four, perform a sectioning operation on each two-part air space, and combine the height upper and lower limits of the circular air space to obtain all air space sectors after air space stacking and determine the height upper and lower limits of each air space sector;

[0020] First, for the two parts that each contain only one air space, air spaces GA and GB, calculate the air space sectioning operation; the formula is as follows:

[0021] 𝐹 =

[0022] =

[0023] First, calculate the air space , set the height range of air space GA as , and the height range of air space GB as , when the horizontal range of air spaces GA and GB overlaps, set air space GC = GA∩GB.

[0024] When or , the height range of the airspace sector GC is ;

[0025] When or , the height range of the airspace sector GC is

[0026] ;

[0027] When there is no overlap between the GA and GB airspace horizontal ranges, no operation is performed, and an empty set is returned ;

[0028] The airspace is then calculated again, and if the airspace GA does not contain the airspace GB and the two airspaces intersect, the airspace sector GD of the airspace GA minus the airspace GB is calculated using computer graphics methods, and the upper and lower limits of the height of the airspace GD are consistent with the upper and lower limits of the height of the airspace GA; when the airspace GB has no intersection with the airspace GA, the airspace GA is returned; when the airspace GB contains the airspace GA, the airspace GB is directly returned ; similarly, the airspace can be calculated.

[0029] Then, the airspaces GA and GB are taken as a part, and the airspace subdivision operation is calculated with the next single airspace GO to obtain the airspace sector under the superposition of GA, GB and GO and determine the upper and lower limits of the height of each airspace sector;

[0030] Similarly, GA, GB and GO are taken as a part, and the calculation of the subdivision sector under the superposition of airspaces is continued to be repeated with the next single airspace, and the upper and lower limits of the height of each airspace sector are determined;

[0031] Until all single airspaces are calculated completely.

[0032] The advantages of the present application are as follows:

[0033] 1. The airspace sector subdivision method based on the divide-and-conquer method converts the problem of classifying and dividing multiple airport airspaces into the intersection and subtraction of two airspaces, thereby reducing the calculation complexity;

[0034] 2. The airspace sector subdivision method based on the divide-and-conquer method only needs to quickly perform the airspace basic classification and division according to the present method on the basis of the original airspace classification structure when a new airport is built or the level of an existing airport changes, without the need to completely recalculate. DETAILED DESCRIPTION

[0035] Figure 1 The flowchart of the airspace sector subdivision method based on the divide-and-conquer method of the present application;

[0036] Figure 2 The five space domains and their numbers for the embodiment of the present application are shown in the schematic diagram.

[0037] Figure 3 The schematic diagram of the dissected sector obtained by calculating two separate space domains for the embodiment of the present application is shown.

[0038] Figure 4 The schematic diagram of the dissected sector obtained by calculating three separate space domains for the embodiment of the present application is shown.

[0039] Figure 5 The schematic diagram of the dissected sector obtained by calculating four separate space domains for the embodiment of the present application is shown.

[0040] Figure 6 The schematic diagram of the dissected sector obtained by calculating five separate space domains for the embodiment of the present application is shown. DETAILED DESCRIPTION

[0041] The specific implementation method of the present application is further described in detail below with reference to the accompanying drawings.

[0042] The present application is a geometric divide-and-conquer method based on graph calculation, which performs space sector dissection by iteration. Figure 1 As shown in the following specific steps:

[0043] Step one, for multiple adjacent airports in the same region, draw a two-dimensional circular ring airspace diagram for each airport according to the airport grade and the actual geographical location of the airport, and set the upper and lower limits of the height of each circular ring airspace.

[0044] It can also be divided into polygons or line arcs according to the actual situation.

[0045] The airspace of a large airport is usually three circular rings, the airspace of a medium-sized airport is usually two circular rings, and the airspace of a small airport is one circular ring, and according to the altitude of the airport, the upper and lower limits of the height of each circular ring airspace are set according to the airspace classification and division standard.

[0046] Step two, number the N airspaces in the two-dimensional airspace diagram, respectively represented as , , …, .

[0047] The numbering method and order are arbitrarily selected.

[0048] Step three, for the airspaces ( with two parts of overlap and different height upper and lower limits, perform two-part dissection: one part is an arbitrary 1 airspace, and the other part is the remaining The two parts of the airspace are divided into two parts.

[0049] The specific calculation for the subdivision is as follows: (1)

[0050]

[0051] make Indicates from Arbitrarily remove the first from the airspace. Other after one airspace A set of spatial domains, in which for Choose any number. This represents a function that partitions multiple spatial domains. The symbol ∩ indicates the intersection of spatial domains, and the symbol - indicates the subtraction of spatial domains.

[0052] Step 4: Continue with airspace ( It is divided into two parts: one part is any one empty space, and the other part is the remaining space. Two spatial domains; the formula (2) for iterative subdivision of these two spatial domains:

[0053] 𝐹 =

[0054]

[0055] make Indicates from Arbitrarily remove the first from the airspace. , Other after one airspace A set of spatial domains, in which for Choose any number.

[0056] Step 5: Iterate until both parts contain only one spatial domain. For spatial domains GA and GB, the spatial domain partitioning formula is as follows:

[0057] 𝐹 =

[0058] =

[0059] First, determine the airspace. Let the height range of the airspace GA be... The altitude range of the airspace GB is When the horizontal ranges of spatial domains GA and GB overlap, let spatial domain GC = GA ∩ GB.

[0060] when or the height range of the airspace sector GC is ;

[0061] When or the height range of the airspace sector GC is

[0062] ;

[0063] When there is no overlap between the GA and GB airspace horizontal ranges, no operation is performed and the empty set is returned ;

[0064] Again, the airspace , if the airspace GA does not contain the airspace GB and the two airspaces intersect, the airspace sector GD of the airspace GA subtracted by the airspace GB is calculated by computer graphics method, the upper and lower limits of the height of the airspace GD are consistent with the upper and lower limits of the height of the airspace GA; when the airspace GB has no intersection with the airspace GA, the airspace GA is returned; when the airspace GB contains the airspace GA, the airspace GB is directly returned ; Similarly, the airspace .

[0065] Step six, taking the airspaces GA and GB as a part, the airspace subdivision operation is calculated with the next single airspace GO to obtain the airspace sector under the superposition of GA, GB and GO and determine the upper and lower limits of the height of each airspace sector;

[0066] Similarly, taking GA, GB and GO as a part, the airspace subdivision sector under the superposition is repeatedly calculated with the next single airspace, and the upper and lower limits of the height of each airspace sector are determined;

[0067] Until all single airspaces are calculated, the subdivision sector after the superposition of all airspaces is finally obtained, and the upper and lower limits of the height of each airspace sector are determined.

[0068] Embodiment:

[0069] This embodiment selects a large airport and a medium-sized airport, and the airspace sector formed after the superposition of the airspaces is as follows:

[0070] As shown in Figure 2 , the airspaces are numbered as A, B, C, D and E respectively; according to the intersection and subtraction rules, first, two parts of the airspaces are selected for calculation, and for AB two airspaces, each as a part, F(A, B) is calculated first

[0071] F(A, B) = { (F(A) - B), (F(A) ∩ B), B - A}

[0072] = {A-B, A∩B, B-A} = {1, B, ф} = {1, B}

[0073] The result is shown in Figure 3

[0074] Then, the two parts of space AB are taken as a part of space, and the fan-shaped partition calculation is performed again with space C, that is, F(A, B, C) = { (F(A, B) - C), (F(A, B)∩C), C-A-B}

[0075] F(A, B, C) = { (F(A, B) - C), (F(A, B)∩C), C-A-B}

[0076] = {1-C, B-C, 1∩C, B∩C, C-A-B} = {1, 2, C, ф} = {1, 2, C}

[0077] The result is shown in Figure 4

[0078] Then, the three parts of space ABC are taken as a part, and the fan-shaped partition calculation is performed again with space D, that is, F(A, B, C, D) = { (F(A, B, C) - D), (F(A, B, C)∩D), D-A-B-C}

[0079] F(A, B, C, D) = { (F(A, B, C) - D), (F(A, B, C)∩D), D-A-B-C}

[0080] = {1-D, 2-D, C-D, 1∩D, 2∩D, C∩D, D-A-B-C}

[0081] = {1’, 2’, 3, 6, 5, 4, 7}

[0082] The result is shown in Figure 5

[0083] Continue, take the four parts of space ABCD as a part, and perform fan-shaped partition calculation with space E, that is, F(A, B, C, D, E) = { (F(A, B, C, D) - E), (F(A, B, C, D)∩E), E-A-B-C-D}

[0084] F(A, B, C, D, E) = { (F(A, B, C, D) - E), (F(A, B, C, D)∩E), E-A-B-C-D}

[0085] = {1’-E, 2’-E, 3-E, 6-E, 5-E, 4-E, 7-E, 1’∩E, 2’∩E, 3∩E, 6∩E, 5∩E, 4∩E, 7∩E, E-A-B-C-D}

[0086] = {1’, 2’, 3, 6’, 10, 5’, 4, 7’, ф, ф, ф, 9, 8, ф, 11, ф}

[0087] = {1’, 2’, 3, 6’, 10, 5’, 4, 7’, 9, 8, 11}

[0088] The result is shown in​​​Figure 6 As shown.

[0089] right The airspace that partially overlaps and has different upper and lower altitude limits By performing subdivision and summarizing the above methods, we can conclude that... airspace The spatial sector partitioning resulting from their superposition can be represented using the following graphical combination method:

[0090]

[0091]

[0092] in for Choose any number, Indicates from Arbitrarily remove the first from the airspace. Other after one airspace A set of spatial domains.

Claims

1. A method for airspace sectorization based on divide and conquer, characterized in that, The specific steps are as follows: Step one, for multiple adjacent airports in the same region, draw a two-dimensional circular air space diagram of each airport according to the airport grade and the actual geographical position of the airport, and set the upper and lower limits of the height of each circular air space; Step two, number the N spaces in the two-dimensional space map, respectively represented as , , ; Step 3, for The airspace that overlaps in some parts and has different upper and lower altitude limits is divided into two parts; Specifically: an initial arbitrary one airspace as a part, the other part is the remaining airspace; Then, the one empty space is divided into two parts: one part is an arbitrary 1 empty space, and the other part is the remaining empty space; By analogy, until the last two parts are divided into only one air space; Step four, perform air space sectioning operation on each two-part air space, combine the upper and lower limits of the height of the circular air space to obtain all air space sectors after air space superposition and determine the upper and lower limits of the height of each air space sector; First, for the two parts that finally contain only one air space, air space GA and GB, calculate the air space sectioning operation; the formula is as follows: F = = First, find the airspace , let the height range of airspace GA be , the height range of airspace GB be , when the horizontal range of airspace GA and GB overlap, let airspace GC = GA∩GB; When or the height range of the airspace sector GC is ; When Or The height range of the airspace sector GC is ； When there is no overlap in the spatial horizontal range of GA and GB, then no operation is performed and the empty set is returned ; Rezone the airspace If the airspace GA does not contain the airspace GB and the two airspaces intersect, then the airspace sector GD of the airspace GA minus the airspace GB is calculated by the method of computer graphics, the height upper and lower limits of the airspace GD are consistent with the height upper and lower limits of the airspace GA; when the airspace GB has no intersection with the airspace GA, return the airspace GA; when the airspace GB contains the airspace GA, then directly return ; Similarly, the can also be calculated Then, take air spaces GA and GB as a part, and calculate the air space sectioning operation with the next single air space GO to obtain the air space sectors under the superposition of GA, GB and GO and determine the upper and lower limits of the height of each air space sector; Similarly, take GA, GB and GO as a part, and continue to repeat the calculation of the sectioning sector under the air space superposition and determine the upper and lower limits of the height of each air space sector with the next single air space. Until all single air spaces are calculated.

2. The divide-and-conquer based airspace sectorization method of claim 1, wherein, In step one, the air space of a large airport is usually a three-layer circular ring, the air space of a medium-sized airport is usually a two-layer circular ring, and the air space of a small airport is a circular ring, and according to the airport elevation, the upper and lower limits of the height of each circular air space are set according to the air space classification and standard setting.

3. The divide-and-conquer based airspace sectorization method of claim 1, wherein, In step two, the numbering method and order are arbitrarily selected.

4. The divide-and-conquer based airspace sectorization method of claim 1, wherein, In the third or fourth step, one of the initial arbitrary spaces is taken as a part, and the other part is the remaining space The specific calculation formula is as follows: Let denote the set of the other dimensional spaces after removing the dimensional space from the dimensional space, where is an arbitrary number; denote the function of partitioning the multiple dimensional spaces, where the symbol ∩ denotes the intersection of the dimensional spaces, and the symbol - denotes the subtraction of the dimensional spaces.​

Images