Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Terminal sector dividing method based on graph theory and spectral clustering algorithm

A spectral clustering algorithm and terminal area technology, which is applied in the field of terminal sector division based on graph theory and spectral clustering algorithm, can solve the problem of unbalanced temporal and spatial distribution of air traffic flow, undiscovered sector boundary adjustment methods, and air traffic flow Exceeding and other problems, to achieve the effect of small inter-sector coordination, meeting distance restrictions, and balanced traffic flow

Inactive Publication Date: 2015-04-29
CIVIL AVIATION UNIV OF CHINA
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, with the development of air transport, the existing methods for demarcating sector boundaries in terminal areas have shown two deficiencies: 1) The air traffic flow in certain sectors often exceeds its capacity limit; 2) The temporal and spatial distribution of air traffic flow among sectors is extremely uneven
[0003] Although there are currently some methods for sector division of terminal airspace, they are essentially combinatorial optimization problems, and the calculation efficiency is not high, and the sector boundaries are often jagged and cannot be used directly. It must be based on this. Boundary adjustments are made, but no reports of sector boundary adjustment methods have been found
[0004] Considering the status quo of the sector division of the existing terminal area, there is still a lack of a fast, effective and practical method for sector division of the terminal

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Terminal sector dividing method based on graph theory and spectral clustering algorithm
  • Terminal sector dividing method based on graph theory and spectral clustering algorithm
  • Terminal sector dividing method based on graph theory and spectral clustering algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0042] In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention and are not intended to limit the invention.

[0043] Now give an example of realizing the sector division of the terminal area:

[0044] Collect the airspace structure data in a certain terminal airspace and the air traffic flow value between each vertex.

[0045] Establish airspace map model and mathematical programming model.

[0046] Divide the number of sectors:

[0047] (1)

[0048] Objective function:

[0049] (2)

[0050] Restrictions:

[0051] (3)

[0052] (4)

[0053] ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a terminal sector division method based on graph theory and spectral clustering algorithm, which is realized with the assistance of a computer system. The system includes a sector division subsystem. First, according to the basic route network structure and air traffic flow of the controlled airspace, a method is proposed. The calculation model of the connection degree between vertices; the spectral clustering algorithm is used to realize the effective segmentation of the vertices of the airspace graph, which solves the problem of segmentation error of short-distance parallel air routes, and realizes the construction and division of the convex hull of the sector; proposes the inter-sector based on the MAKLINK graph Boundary optimization path selection algorithm; finally, the sector boundary is optimized to eliminate the sawtooth shape, so that it is more in line with the actual operation, and the final division of the sector is completed; the invention uses the air traffic flow to conveniently carry out the reverse when dividing the sector Deduction, through the sector division method of graph theory and spectral clustering algorithm, the flow of each sector is more balanced, the amount of coordination is small, the minimum distance constraint is satisfied, the difficulty of commanding by the controller is reduced, and the operation safety of the terminal area is guaranteed.

Description

technical field [0001] The invention relates to the field of airspace planning, in particular to a terminal sector division method based on graph theory and spectral clustering algorithm. The method is applied to realize terminal airspace planning and reduce the workload of controllers. Background technique [0002] The airspace of the terminal area is highly complex and the flight traffic is large, and the maneuvering flight of the aircraft is subject to the actual geographical restrictions, which has a great impact on the safety and capacity of the airspace system. A sector is the basic unit of the national airspace system, and my country's airspace system consists of about 200 airspace sectors. Each airspace sector has a controller responsible for directing flights. At present, with the development of air transport, the existing methods for demarcating sector boundaries in terminal areas have shown two deficiencies: 1) The air traffic flow in certain sectors often exceed...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G08G5/00G06F19/00
Inventor 王超王飞刘宏志张召悦王晓英
Owner CIVIL AVIATION UNIV OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products