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 spatial and temporal distribution of air traffic flow, no sector boundary adjustment method has been found, and air traffic flow Exceeding and other problems, to achieve the effect of small amount of coordination between sectors, satisfying distance restrictions, and balanced traffic flow

Inactive Publication Date: 2013-12-25
CIVIL AVIATION UNIV OF CHINA
View PDF2 Cites 25 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 dividing method based on the graph theory and the spectral clustering algorithm. The method is carried out with the help of a computer system which comprises a sector dividing subsystem. The terminal sector dividing method comprises the first step of putting forward a calculating model of a peak connection degree according to the basic airline network structure and air traffic flow in controlled airspace, the second step of effectively dividing peaks of an airspace image based on the spectral clustering algorithm to solve the problem of a division error in short-distance parallel air routes and to achieve construction and division of a sector convex hull, the third step of putting forward a boundary optimized path selection algorithm based on sectors of an MAKLINK image, and the last step of carrying out optimizing to eliminate a sawtooth shape of the boundaries of the sectors to some degree to enable the sector boundaries to be more conform to actual operations so that the final dividing of the sectors can be finished. By means of air traffic flow, reverse deduction is carried out conveniently while the sectors are divided. By means of the terminal sector dividing method based on the graph theory and the spectral clustering algorithm, flows of the sectors are balanced, coordination is small, minimum distance constraint is met, the difficulty of commanding of a controller is reduced, and the security of operation in 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
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