Space domain sector subdivision method based on divide-and-conquer method

The airspace sectors are iteratively divided by the divide-and-conquer method, which solves the problem of high computational complexity in the airspace planning of multiple adjacent airports, realizes fast and effective airspace sector division, and adapts to changes in airport levels.

CN120708448AActive Publication Date: 2025-09-26CHINESE PEOPLES LIBERATION ARMY UNIT 93209
View PDF 10 Cites 0 Cited by

Patent Information

Application Number
CN202510867508.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-26
Publication Date
2025-09-26
Estimated Expiration
2045-06-26

AI Technical Summary

Technical Problem

In the airspace planning of multiple adjacent airports, existing technologies make it difficult to automatically calculate the horizontal range and upper and lower altitude limits of the airspace sectors of multiple adjacent airports, which makes manual calculation complicated and difficult.

Method used

An airspace sector segmentation method based on the divide-and-conquer algorithm is adopted. The airspace of multiple adjacent airports is iteratively segmented and converted into the intersection and subtraction operations of two airspaces to simplify the calculation process.

Benefits of technology

It effectively reduces the computational complexity, makes the airspace sector division more efficient, and can quickly respond to the adjustment of the basic airspace classification when new airports are built or the airport level changes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120708448A_ABST
    Figure CN120708448A_ABST
Patent Text Reader

Abstract

The invention discloses an airspace sector subdivision method based on a divide-and-conquer method, and belongs to the field of airspace planning. The method specifically comprises the following steps: for a plurality of adjacent airports in the same region, drawing a two-dimensional airspace graph of each airport according to the grade of the airport and the actual geographic position of the airport; then, N airspaces in the two-dimensional airspace graph are numbered, and the airspaces which are partially overlapped and have different upper and lower limits of height are divided into two parts; wherein one part is an independent airspace, fan-shaped subdivision is carried out on the two minimum parts, namely the two independent airspaces, starting from the two minimum parts, namely the two independent airspaces, through intersection and subtraction, then the two independent airspaces serve as one part, fan-shaped subdivision continues to be carried out in combination with the other independent airspace, and the like; finally, all the independent airspaces are covered, sector subdivision after all the airspaces are overlapped is obtained, and the upper limit and the lower limit of the height of each airspace sector are determined; according to the invention, the calculation complexity is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of airspace planning and relates to an airspace sector segmentation method based on a divide-and-conquer method. Background Art

[0002] In order to build a safe and effective national airspace system, coordinate diverse aviation flight needs, classify and manage airspace in a hierarchical manner, provide unified military and civil aviation flight rules, and provide differentiated air traffic control services to airspace users.

[0003] For example, the rules for demarcation of Class B airspace are as follows:

[0004] (1) For civil airports with three or more runways, a three-ring stepped structure with a radius of 20 km, 40 km, and 60 km is usually designed, with the heights being runway surface - airport elevation 900 m (inclusive), airport elevation 900 m - airport elevation 1800 m (inclusive), and airport elevation 1800 m - standard pressure altitude 6000 m.

[0005] (2) Civil dual-runway airports usually have circular stepped structures with radii of 15 km and 30 km, with heights from runway pavement to airport elevation 600 m (inclusive) and from airport elevation 600 m to airport elevation 3600 m (inclusive), respectively. The top floor is up to 6000 m above standard atmospheric pressure.

[0006] (3) Civil single-runway airports usually have a single-ring structure with a radius of 12 kilometers and a runway surface-airport elevation of 600 meters (inclusive).

[0007] When there are multiple airports in close proximity in an area, there will be multiple airspaces with different upper and lower altitude limits overlapping. In order to facilitate controllers and pilots to determine the type of airspace where the aircraft is located, the same type of airspace with different upper or lower altitude limits must be merged into one sector, and the horizontal range and upper and lower altitude limits of each sector must be given in the published airspace data.

[0008] When multiple airports are adjacent, it is very difficult for airspace planners to manually calculate the horizontal range and upper and lower altitude limits of each sector. There is an urgent need for a method that can automatically calculate the horizontal range and upper and lower altitude limits of the sectors of the airspace of multiple adjacent airports. Summary of the Invention

[0009] When multiple airport airspaces overlap, it is difficult for airspace classification personnel to plan the scope of various types of airspace, divide the airspace sectors and determine the upper and lower limits of the sector heights. The present invention proposes an airspace sector division method based on the divide-and-conquer method, which performs airspace sector division through iteration.

[0010] The specific steps of the spatial sector decomposition method based on the divide-and-conquer method are as follows:

[0011] Step 1: For multiple adjacent airports in the same area, draw a two-dimensional circular airspace map of each airport according to the airport level and the actual geographical location of the airport, and set the upper and lower altitude limits of each circular airspace;

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

[0013] Step 2: Number the N airspaces in the two-dimensional airspace map and represent them as 、 、…、 ;

[0014] The numbering method and numbering order can be selected arbitrarily;

[0015] Step 3: The airspace with overlapping parts and different upper and lower altitude limits is divided into two parts;

[0016] Specifically: an arbitrary airspace is initially used as one part, and the other part is the remaining airspace;

[0017] Then, yes The airspace is further divided into two parts: one part is any airspace, and the other part is the remaining airspace;

[0018] And so on, until the last two parts of the iteration contain only one empty space.

[0019] Step 4: Divide the airspace of each two parts, combine the upper and lower limits of the annular airspace to obtain the airspace sectors after all airspaces are superimposed, and determine the upper and lower limits of the height of each airspace sector;

[0020] First, for the two parts that only contain one airspace in the end, the airspace GA and GB, calculate the airspace partitioning operation; the formula is as follows:

[0021] 𝐹 =

[0022] =

[0023] Find the airspace first , let the height range of airspace GA be , the altitude range of airspace GB is , when the horizontal ranges of the airspace GA and GB overlap, let the airspace GC = GA ∩ GB.

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

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

[0026] ;

[0027] When the horizontal ranges of the GA and GB airspaces do not overlap, no operation is performed and an empty set is returned. ;

[0028] Find the airspace If the airspace GA does not contain the airspace GB and the two airspaces intersect, the airspace sector GD is calculated by subtracting the airspace GB from the airspace GA using computer graphics methods. 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 and the airspace GA do not intersect, the airspace GA is returned. When the airspace GB contains the airspace GA, it is directly returned. ; We can also find .

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

[0030] Similarly, taking GA, GB and GO as a part, and with the next separate airspace, continue to repeatedly calculate the subdivision sectors under the airspace superposition and determine the upper and lower limits of the height of each airspace sector;

[0031] Until all separate airspaces are calculated.

[0032] The advantages of the present invention are:

[0033] 1. The present invention proposes a divide-and-conquer airspace sectorization method that iteratively transforms the problem of classifying and demarcating multiple airport airspaces into the intersection and subtraction of two airspaces, thereby reducing computational complexity.

[0034] 2. The present invention provides an airspace sector division method based on the divide-and-conquer approach. When a new airport is built or the level of an existing airport changes, it is only necessary to quickly perform basic airspace classification according to the method based on the original airspace classification structure without recalculating everything. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 This is a flow chart of a method for partitioning airspace sectors based on the divide-and-conquer method of the present invention;

[0036] Figure 2 A schematic diagram of the five airspaces divided and their numbers according to an embodiment of the present invention;

[0037] Figure 3 This is a schematic diagram of a sector-shaped partition obtained by calculating two separate airspaces according to an embodiment of the present invention;

[0038] Figure 4 A schematic diagram of a sector-shaped partition obtained by calculating three separate airspaces according to an embodiment of the present invention;

[0039] Figure 5 A schematic diagram of a sector-shaped partition obtained by calculating four separate airspaces according to an embodiment of the present invention;

[0040] Figure 6 This is a schematic diagram of a sector-shaped partition obtained by calculating five separate airspaces according to an embodiment of the present invention. DETAILED DESCRIPTION

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

[0042] The present invention is a geometric divide-and-conquer method based on graphic calculation, which performs spatial sector division through iteration; Figure 1 The specific steps are as follows:

[0043] Step 1: For multiple adjacent airports in the same area, draw a two-dimensional circular airspace map of each airport according to the airport level and the actual geographical location of the airport, and set the upper and lower altitude limits of each circular airspace;

[0044] It can also be drawn as a polygon or line arc combination according to actual conditions;

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

[0046] Step 2: Number the N airspaces in the two-dimensional airspace map and represent them as 、 、…、 ;

[0047] The numbering method and numbering order can be selected arbitrarily;

[0048] Step 3: Partially overlapping airspace with different upper and lower altitude limits ( Divide into two parts: one part is an arbitrary airspace, and the other part is the remaining The two airspaces are divided into two parts;

[0049] The specific calculation of the subdivision is as follows:

[0050]

[0051] make Indicates from In the airspace, any Other airspaces after A collection of airspaces, where for A number chosen at random. Represents a function for partitioning multiple airspaces. The symbol ∩ indicates that airspaces intersect, and the symbol - indicates that airspaces subtract.

[0052] Step 4: Continue airspace ( Divided into two parts: one part is an arbitrary airspace, and the other part is the remaining The formula for iteratively partitioning these two airspaces is (2):

[0053] 𝐹 =

[0054]

[0055] make Indicates from In the airspace, any 、 Other airspaces after A collection of airspaces, where for A number chosen at random.

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

[0057] 𝐹 =

[0058] =

[0059] Find the airspace first , let the height range of airspace GA be , the altitude range of airspace GB is , when the horizontal ranges of the airspace GA and GB overlap, let the airspace GC = GA ∩ GB.

[0060] when or When , the altitude range of the airspace sector GC is ;

[0061] when or When , the altitude range of the airspace sector GC is

[0062] ;

[0063] When the horizontal ranges of the GA and GB airspaces do not overlap, no operation is performed and an empty set is returned. ;

[0064] Find the airspace If the airspace GA does not contain the airspace GB and the two airspaces intersect, the airspace sector GD is calculated by subtracting the airspace GB from the airspace GA using computer graphics methods. 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 and the airspace GA do not intersect, the airspace GA is returned. When the airspace GB contains the airspace GA, it is directly returned. ; We can also find .

[0065] Step 6: Take the airspace GA and GB as a part and calculate the airspace partitioning operation with the next single airspace GO to obtain the airspace sectors 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, and with the next separate airspace, continue to repeatedly calculate the subdivision sectors under the airspace superposition and determine the upper and lower limits of the height of each airspace sector;

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

[0068] Example:

[0069] In this embodiment, a large airport and a medium-sized airport are selected to form an airspace sector by superimposing the airspace. The specific process is as follows:

[0070] like Figure 2 As shown, the airspaces are numbered A, B, C, D, and E respectively. According to the intersection and subtraction rules, first, two parts of the airspace are selected for calculation. For each of the two airspaces AB, first find

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

[0072] ={AB,A∧B,BA}={1,B,ф}={1,B};

[0073] The results obtained are as follows Figure 3 As shown;

[0074] Then, take the two airspaces AB as part of the airspace and perform fan-shaped subdivision calculation again with airspace C, that is, to find:

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

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

[0077] The results obtained are as follows Figure 4 As shown;

[0078] Then, take the three airspaces ABC as a part and perform fan-shaped subdivision calculation again with airspace D, that is, to find:

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

[0080] ={1-D, 2-D, CD, 1∩D, 2∩D, C∩D, DABC}

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

[0082] The results obtained are as follows Figure 5 As shown;

[0083] Continuing, we take the four airspaces ABCD as one part and perform fan-shaped calculation with airspace E, that is, to find:

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

[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,EABCD}

[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 results obtained are as follows Figure 6 shown.

[0089] right Partially overlapping airspace with different upper and lower altitude limits By analyzing and summarizing the above methods, we can see that airspace , the division of the superimposed spatial sector can be expressed by the following graphic combination method:

[0090]

[0091]

[0092] in for Any number chosen, Indicates from In the airspace, any Other airspaces after A collection of airspaces.

Claims

1. A space sector partitioning method based on the divide-and-conquer approach, characterized in that: The specific steps are as follows: Step 1: For multiple adjacent airports in the same area, draw a two-dimensional circular airspace map of each airport according to the airport level and the actual geographical location of the airport, and set the upper and lower altitude limits of each circular airspace; Step 2: Number the N airspaces in the two-dimensional airspace map and represent them as 、 、…、 ; Step 3: The airspace with overlapping parts and different upper and lower altitude limits is divided into two parts; Specifically: an arbitrary airspace is initially used as one part, and the other part is the remaining airspace; Then, yes The airspace is further divided into two parts: one part is any airspace, and the other part is the remaining airspace; And so on, until the last two parts of the iteration contain only one empty space; Step 4: Divide the airspace of each two parts, combine the upper and lower limits of the annular airspace to obtain the airspace sectors after all airspaces are superimposed, and determine the upper and lower limits of the height of each airspace sector; First, for the two parts that only contain one airspace in the end, the airspace GA and GB, calculate the airspace partitioning operation; the formula is as follows: 𝐹 = = Find the airspace first , let the height range of airspace GA be , the altitude range of airspace GB is , when the horizontal ranges of airspace GA and GB overlap, let airspace GC = GA ∩ GB; when or When , the altitude range of the airspace sector GC is ; when or When , the altitude range of the airspace sector GC is ; When the horizontal ranges of the GA and GB airspaces do not overlap, no operation is performed and an empty set is returned. ; Find the airspace If the airspace GA does not contain the airspace GB and the two airspaces intersect, the airspace sector GD is calculated by subtracting the airspace GB from the airspace GA using computer graphics methods. 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 and the airspace GA do not intersect, the airspace GA is returned. When the airspace GB contains the airspace GA, it is directly returned. ; We can also find ; Then, the airspace GA and GB are taken as a part and the airspace partitioning operation is calculated with the next single airspace GO to obtain the airspace sectors under the superposition of GA, GB and GO and determine the upper and lower limits of the height of each airspace sector; Similarly, taking GA, GB and GO as a part, and with the next separate airspace, continue to repeatedly calculate the subdivision sectors under the airspace superposition and determine the upper and lower limits of the height of each airspace sector; Until all separate airspaces are calculated.

2. The method for partitioning the spatial domain based on the divide-and-conquer method according to claim 1, wherein: In step 1, the airspace of a large airport is usually three-layered, the airspace of a medium-sized airport is usually two-layered, and the airspace of a small airport is one ring. The upper and lower limits of the height of each ring airspace are set according to the airport altitude and the airspace classification standards.

3. The method for spatial sector division based on the divide-and-conquer method according to claim 1, wherein: In step 2, the numbering method and numbering order can be selected arbitrarily.

4. The method for spatial sector division based on the divide-and-conquer method according to claim 1, wherein: In the step 3 or 4, an arbitrary space is initially used as a part, and the other part is the remaining The specific calculation formula for segmentation is as follows: make Indicates from In the airspace, any Other airspaces after A collection of airspaces, where for A number chosen at random; Represents a function for partitioning multiple airspaces. The symbol ∩ indicates that airspaces intersect, and the symbol - indicates that airspaces subtract.

Citation Information

Patent Citations

  • Sector dynamic division method

    CN113823125A

  • Space domain sector complexity prediction method based on space-time diagram convolutional network

    CN115223402A

  • Temporary airspace division method, temporary airspace management method and temporary airspace division system

    CN116129680A

  • Information processing device, information processing method, program, presentation control device and system

    JP2023129877A

  • System and method for determining an alternative flight route based on sector geometry

    US20160358480A1