Interconnection flight information updating method and device based on path planning algorithm

By introducing an accurate trigger mechanism based on path planning algorithm in the traditional joint flight information update method, the problems of large calculation volume, low efficiency and untimely update in the traditional methods are solved, and efficient and real-time joint flight information update is achieved.

CN119761608AActive Publication Date: 2025-04-04TRAVELSKY TECHNOLOGY LIMITED
View PDF 9 Cites 0 Cited by

Patent Information

Application Number
CN202411957779.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-12-27
Publication Date
2025-04-04
Estimated Expiration
2044-12-27

AI Technical Summary

Technical Problem

The traditional joint flight information update method has large calculation volume, low efficiency and untimely updates, making it difficult to meet the needs of real-time and accuracy.

Method used

The joint flight information update method based on the path planning algorithm is adopted, and through the joint flight rule management, direct flight management, joint flight refresh triggering and joint flight real-time update steps, the joint information update is accurately triggered, reducing the amount of calculation and improving system efficiency.

Benefits of technology

It realizes accurate triggering of the update of the joint flight information, reduces the amount of calculation, improves the system efficiency, and ensures the real-time and accuracy of the joint flight information.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119761608A_ABST
    Figure CN119761608A_ABST
Patent Text Reader

Abstract

The invention provides a method and a device for updating interlink flight information based on a path planning algorithm. The method comprises the following steps: an interlink rule management step; the direct flight management step is responsible for the management work of the direct flight and notifying the linked flight real-time updating step to update the associated linked flight information; a linked flight refreshing triggering step: receiving change information in the linked flight rule management step and the direct flight management step, and notifying a linked flight real-time updating step to accurately calculate and refresh linked flight information; a linked flight real-time updating step: calculating and generating linked flight information, and updating the linked flight information; and a linked flight data clustering step: storing the path rule data and the calculated and generated linked flight information result data. According to the method and the device, the interline flight information refreshing is triggered by adopting the fine-grained path rule, so that the workload of interline flight calculation is reduced, and the interline flight information refreshing efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of data processing technology, and in particular, relates to a method and device for updating connecting flight information based on a path planning algorithm. Background Art

[0002] A connecting flight is a travel itinerary consisting of two or more consecutive non-stop flights. The emergence of connecting flights has greatly improved the travel experience of passengers. Passengers can solve all the problems of the flight segments from the departure point to the destination at one time by purchasing connecting tickets, without having to re-purchase tickets or check-in at the transfer station. In addition, some connecting flights also provide baggage direct check-in services, and passengers' baggage can be checked directly from the departure point to the destination without having to pick it up at the transfer station and then re-check it in. At the same time, for airlines, connecting flights can optimize resource allocation and improve aircraft utilization. By reasonably arranging flight plans and route networks, airlines can make better use of aircraft resources, reduce aircraft idle time and ground stay time, and reduce operating costs.

[0003] In order to ensure that passengers can accurately query and book connecting flights, the real-time and accuracy of connecting flight information query is particularly important. The generation of connecting flight information is a complex and time-consuming process. In order to ensure query efficiency, connecting flight information is often generated in advance and saved in the connecting flight data cluster. Connecting flights are affected by potential problems such as changes in direct flights and changes in path rules. Therefore, the pre-generated connecting flight information needs to be updated in a timely manner. The traditional update of connecting flight information is based on the trigger of city pairs (departure city and arrival city). This method has problems such as large amount of calculation, low efficiency, and untimely update. Summary of the invention

[0004] In view of the shortcomings of the prior art, the present application provides a method and device for updating connecting flight information based on a path planning algorithm, which can accurately trigger the update of connecting flight information, thereby reducing the amount of calculation and improving system efficiency. The technical problem to be solved by the present application is achieved through the following technical solution.

[0005] The first aspect of the present application provides a method for updating connecting flight information based on a path planning algorithm, comprising:

[0006] Connecting rule management step: receiving and saving path rule information, and notifying the connecting flight real-time update step to update the associated connecting flight information;

[0007] Direct flight management step: responsible for the management of direct flights. After completing the update of direct flights, notify the connecting flight real-time update step to update the associated connecting flight information;

[0008] Connecting flight refresh triggering step: receiving the change information in the connecting rule management step and the direct flight management step, and notifying the connecting flight real-time update step of the identified path rule information that needs to be recalculated to accurately calculate and refresh the connecting flight information;

[0009] Real-time update step of connecting flights: calculate and generate connecting flight information, and update the connecting flight information;

[0010] Connecting flight data clustering step: storing path rule data and calculated connecting flight information result data.

[0011] In combination with the first aspect, the connecting flight refresh triggering step further includes:

[0012] Path rule acquisition sub-step, path rule duplicate removal sub-step, path rule analysis sub-step, path rule conversion sub-step, path rule encoding sub-step, path rule triggering sub-step.

[0013] In combination with the first aspect, the above-mentioned path rule acquisition sub-step further includes: receiving the changed path rule information initiated by the joint process rule management system, and the receiving method is completed through shared memory.

[0014] In combination with the first aspect, the algorithm of the above-mentioned shared memory is: the connecting rule management system writes the changed path rule information into the shared memory, and the information includes the departure city, the arrival city, the transfer airport and the carrier airline; the connecting flight refresh trigger system scans the shared memory in real time, and after obtaining the path rule information, the path rule information is deleted from the shared memory.

[0015] In combination with the first aspect, the above-mentioned path rule duplicate elimination sub-step further includes: receiving change information generated by the connecting rule management step, the change information is the departure city, the arrival city, the transfer airport and the carrier airline, and determining that the priority is high priority.

[0016] In combination with the first aspect, the above-mentioned path rule duplicate elimination sub-step further includes:

[0017] Check for duplicate path rules. In the path rule queue to be triggered, check whether the path rule information already exists. If not, insert it into the queue of the corresponding priority. If it already exists, determine whether the priority of the existing path rule is higher than or equal to the priority of the newly triggered path rule. If it is higher than or equal, end the process. Otherwise, delete the existing path rule information and insert the new path rule information according to the priority rule.

[0018] In combination with the first aspect, the above-mentioned path rule analysis sub-step further includes: splitting the received path rule information, analyzing the operation type of the changed path rule, if the path is newly added, or the original path rule is changed, the triggered operation type is marked as an update type; if the original path rule is deleted, the triggered operation type is marked as a deletion type.

[0019] In combination with the first aspect, the above-mentioned path rule conversion sub-step further includes: parsing the changed direct flight information, retrieving the path rule information including the departure and arrival airports according to the departure airport and arrival airport information, thereby completing the conversion from flight information to path rule information.

[0020] In combination with the first aspect, the above-mentioned path rule encoding sub-step further includes: city pair information encoding, priority queue information encoding, city pair index information encoding, and connecting path information encoding. The data format of the city pair information encoding is: departure city: arrival city: priority; the data format of the priority queue information encoding is: priority: date; the data format of the city pair index information encoding is: departure city: arrival city; the data format of the connecting path information encoding is: departure city: arrival city: PATH.

[0021] A second aspect of the present application provides a connecting flight information updating device based on a path planning algorithm, comprising:

[0022] Connecting rule management module: receiving and saving path rule information, and notifying the connecting flight real-time update module to update the associated connecting flight information;

[0023] Direct flight management module: responsible for the management of direct flights. After completing the update of direct flights, it notifies the connecting flight real-time update module to update the associated connecting flight information.

[0024] Connecting flight refresh trigger module: receives the change information in the connecting rule management module and the direct flight management module, and notifies the connecting flight real-time update module of the identified path rule information that needs to be recalculated to accurately calculate and refresh the connecting flight information;

[0025] Connecting flight real-time update module: calculates and generates connecting flight information, and updates connecting flight information;

[0026] Connecting flight data cluster module: stores path rule data and calculated connecting flight information result data.

[0027] Compared with the prior art, this application has the following advantages:

[0028] 1. Support independent distributed deployment and decouple from the real-time update system of connecting flights.

[0029] 2. Fine-grained path rules are used to trigger the refresh of connecting flight information. There is no need to recalculate all path rules for the entire departure and arrival cities, which greatly reduces the workload of connecting flight calculations and improves the efficiency of connecting flight information refresh.

[0030] 3. The triggering of the path rule information uses queues as storage and performs hierarchical processing, giving priority to ensuring the real-time calculation of high-priority path rules. In conjunction with the data expiration cleanup mechanism, the burden of connecting flight calculation processing caused by data backlog is avoided.

[0031] In summary, the present application adopts a method for updating connecting flight information according to path rules, which has the advantages of being more accurate, efficient, and reducing the amount of calculation. The present application adds a device for updating connecting flight information according to path rules to the traditional connecting flight update process, thereby optimizing the connecting flight update process.

[0032] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or be understood by practicing the present application. The purpose and other advantages of the present application can be realized and obtained by the structures indicated in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0034] Figure 1 A flow chart of traditional connecting flight information update is shown;

[0035] Figure 2 A flow chart of updating connecting flight information according to path rules in a connecting flight information updating system based on a path planning algorithm is shown;

[0036] Figure 3 A flow chart of updating connecting flight information according to path rules of a connecting flight information updating method based on a path planning algorithm is shown;

[0037] Figure 4 The functional module diagram of the connecting flight refresh trigger system is shown;

[0038] Figure 5 A path rule communication queue diagram is shown;

[0039] Figure 6 A flow chart of the joint process rule processing is shown;

[0040] Figure 7 A flow chart of direct flight information processing is shown;

[0041] Figure 8 A juncture rule processing diagram is shown. DETAILED DESCRIPTION

[0042] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0043] The present application provides a method and device for updating connecting flight information based on a path planning algorithm, which can accurately identify the minimum set of connecting flight information that needs to be updated to reduce the amount of calculation for generating connecting flight information, thereby ensuring the real-time and accuracy of the connecting flight information.

[0044] like Figure 1 As shown in the figure, the traditional connecting flight information update process is updated in the city pair dimension, that is, the departure city and the arrival city are used to trigger the connecting flight information update, and all the connecting flight information of the entire city pair needs to be recalculated. This application adds a connecting flight refresh trigger system to the original process, which can realize the update of connecting flight information in a more fine-grained path rule dimension.

[0045] The present invention provides a method and device for updating connecting flight information based on a path planning algorithm. Figure 2 As shown, the following systems are included:

[0046] Connecting rules management system: responsible for receiving and saving routing rule information, and notifying downstream systems to update the associated connecting flight information.

[0047] Direct flight management system: responsible for the management of direct flights. After completing the update of direct flights, it notifies the downstream system to update the associated connecting flight information.

[0048] Connecting flight refresh trigger system: responsible for receiving changes in the connecting rule management system and the direct flight management system, identifying the path rule information that needs to be recalculated, and notifying the connecting flight real-time update system to perform accurate calculations and refresh the connecting flight information.

[0049] Connecting flight real-time update system: responsible for calculating and generating connecting flight information and updating connecting flight information.

[0050] Connecting flight data cluster: mainly stores path rule data and calculated connecting flight information result data.

[0051] Path rules: refers to the route from the starting point to the destination. It specifies the number of segments of a connecting flight from the departure point to the destination, as well as the transfer airports between the segments and other information.

[0052] The method for updating connecting flight information based on the path planning algorithm is as follows: Figure 3 As shown:

[0053] Connecting rule management step: receiving and saving path rule information, and notifying the connecting flight real-time update step to update the associated connecting flight information;

[0054] Direct flight management step: responsible for the management of direct flights. After completing the update of direct flights, notify the connecting flight real-time update step to update the associated connecting flight information;

[0055] Connecting flight refresh triggering step: receiving the change information in the connecting rule management step and the direct flight management step, and notifying the connecting flight real-time update step of the identified path rule information that needs to be recalculated to accurately calculate and refresh the connecting flight information;

[0056] Real-time update step of connecting flights: calculate and generate connecting flight information, and update the connecting flight information;

[0057] Connecting flight data clustering step: storing path rule data and calculated connecting flight information result data.

[0058] like Figure 4 As shown, the connecting flight refresh trigger system includes the following functional modules: path rule acquisition module, path rule deduplication module, path rule analysis module, path rule conversion module, path rule encoding module, and path rule trigger module.

[0059] The path rule acquisition module further includes: receiving the changed path rule information initiated by the connecting rule management system, and the receiving method is completed through shared memory. The algorithm of shared memory is: the connecting rule management system writes the changed path rule information into the shared memory, and the information includes the departure city, the arrival city, the transfer airport and the carrier airline; the connecting flight refresh trigger system scans the shared memory in real time, and after obtaining the path rule information, the path rule information is deleted from the shared memory.

[0060] The path rule information is stored as follows: Figure 5As shown:

[0061] 1. The connecting flight refresh trigger system notifies the connecting flight real-time update system of the path rule information that needs to be calculated, and the notification is completed through the communication queue.

[0062] 2. The path rule information to be calculated is stored in three queues of different priorities: high priority queue, medium priority queue, and low priority queue. Each priority queue is divided into valid and invalid segments. The path rule information in the valid segment will trigger the real-time update system for connecting flights to calculate. The path rule information in the invalid segment will be cleared. If the path rule in the valid segment is not processed within the specified time, the path rule will be moved to the invalid segment.

[0063] 3. The processing order of the path rules in the communication queue is to process the path rules in the high priority queue first, then process the path rules in the medium priority queue, and finally process the path rules in the low priority queue. The processing order of the path rules in each queue is the first-in-first-out principle. When the path rules in the communication queue are processed by the connecting flight real-time update system, the path rule information is deleted from the corresponding queue to avoid repeated calculation.

[0064] 4. Path rule information is encoded and stored in multiple dimensions. The stored data types include city pair information, priority queue, city pair index, and path rule information. The data format is key-value format, as shown in Table 1:

[0065]

[0066] Table 1 Path rule information table

[0067] The path rule analysis module includes: splitting the received path rule information, analyzing the operation type of the changed path rule, if the path is newly added, or the original path rule is changed, the triggered operation type is marked as an update type; if the original path rule is deleted, the triggered operation type is marked as a deletion type.

[0068] The path rule conversion module includes: parsing the changed direct flight information, retrieving the path rule information including the departure and arrival airports according to the departure airport and arrival airport information, thereby completing the conversion from flight information to path rule information.

[0069] The path rule encoding module includes: city pair information encoding, priority queue information encoding, city pair index information encoding, and connecting path information encoding. The rules of the city pair information encoding are: departure city: arrival city: priority. The rules of the priority queue information encoding are: priority: date. The rules of the city pair index information encoding are: departure city: arrival city. The rules of the connecting path information encoding are: departure city: arrival city: PATH.

[0070] The main business processes of the interline rules are as follows: Figure 6 As shown:

[0071] 1. Receive the changed connection rules. Receive the change information generated by the connection rules management system. The information includes: departure city, arrival city, transfer airport, carrier airline, etc., and determine the priority as high priority.

[0072] 2. Check for duplicate path rules. In the queue of path rules to be triggered, check whether the path rule information already exists.

[0073] 3. If it does not exist, insert it into the queue of the corresponding priority.

[0074] 4. If it already exists, determine whether the priority of the existing path rule is higher than or equal to the priority of the newly triggered path rule. If it is higher than or equal to, end the process; otherwise, delete the path rule found in step 2, and then insert the new path rule information according to the priority rule.

[0075] The main business processes for direct flight information processing are as follows: Figure 7 As shown:

[0076] 1. Parse flight information. Get the departure airport and arrival airport, and convert the departure and arrival airport information into city information.

[0077] 2. Are the airport code and city code the same? If they are the same, use the departure airport and arrival airport to retrieve the path rule information. If they are different, query the path rule in three dimensions: a. departure city, arrival airport; b. departure airport, arrival airport; c. departure airport, arrival city.

[0078] 3. Path rule calculation triggering. The queried path rule information is sorted, merged, deduplicated, and sorted, and marked as an update type. The path rule information priority is then marked as high priority and inserted into the path rule queue.

[0079] In order to better understand the technical solution of the present application, the implementation of the present application will be described in detail from three parts: connecting rule processing, direct flight information processing, and path rule triggering.

[0080] The existing connecting rules information is shown in Table 2:

[0081] ID Departure city Arrival City Transfer Point 1 Transfer Point 2 Transfer Point 3 1001 SHE CAN PEK SHA 1002 SHE CAN CTU 1003 SHE CAN KMG 1004 SHE CAN WUH HET 1005 SHE CAN PEK 1006 SHE CAN PVG 1007 SHE CAN XIY

[0082] Table 2 Information on connecting rules

[0083] Taking ID 1001 as an example, the connecting flight is divided into three segments. The first segment starts from SHE and arrives at PEK; the second segment starts from PEK and arrives at SHA; the third segment starts from SHA and arrives at CAN. Figure 8 shown.

[0084] The following update operations have occurred in the joint rules:

[0085] A. The connecting flight rule 1002 was changed to change the connecting airport from CTU to TFU.

[0086] B. Deleted the connecting rule 1003.

[0087] C. Added connecting rule 1008, departure city SHE, arrival city CAN, transfer point 1TSN. The changed connecting rule is shown in Table 3:

[0088] ID Departure city Arrival City Transfer Point 1 Transfer Point 2 Transfer Point 3 1001 SHE CAN PEK SHA 1002 SHE CAN TFU 1004 SHE CAN WUH 1005 SHE CAN TNS 1006 SHE CAN PVG 1007 SHE CAN XIY 1008 SHE CAN PEK

[0089] Table 3 Changed connecting rules

[0090] After the connecting flight refresh triggers the system, the changed path is identified and the connecting flight refresh is triggered according to Table 4. The paths of other SHE-CAN do not need to be updated and calculated:

[0091] ID Operation Type Priority 1002 renew High priority 1003 delete High priority 1008 renew High priority

[0092] Table 4 Triggering the refresh of connecting flights

[0093] Direct flight information processing:

[0094] 1. The rules for connecting flights are the same as above.

[0095] 2. There is a change in the flight from SHE to PEK. In the path rules of SHE-CAN, there is a path that includes the SHE-PEK segment. Therefore, the traditional connecting flight information update process will trigger the recalculation of all SHE-CAN paths.

[0096] 3. After the connecting flight refresh trigger system searches, it finds that all the path rules containing the SHE-PEK segment are 1001 and 1008, so only the connecting flight information of these two path rules will be refreshed:

[0097] ID Operation Type Priority 1001 renew Medium priority 1008 renew Medium priority

[0098] Table 5 Updated flight information

[0099] Path rule triggering:

[0100] 1. The path rules that have been triggered and need to be calculated and refreshed are shown in Table 6:

[0101]

[0102] Table 6 Path rules to be calculated 2. The path rules to be triggered are now received as shown in Table 7:

[0103] ID Operation Type Priority 1008 renew High priority

[0104] Table 7 Triggered path rules

[0105] 3. After querying the queue, it is found that the path rule 1008 already exists, the priority is medium, and the priority of the target trigger is high. Therefore, the path rule information of the medium priority is deleted first, and then the path rule is inserted into the high priority queue. As shown in Table 8:

[0106]

[0107] Table 8 Path rules to be calculated 4. Other information of path rules is shown in Table 9:

[0108]

[0109] Table 9: Interconnection route information

[0110] The method and device proposed in this application support efficient and accurate triggering of recalculation and refreshing of connecting flight information.

[0111] 1. The method and device support independent distributed deployment and are decoupled from the real-time update system of connecting flights.

[0112] 2. This application uses fine-grained path rules to trigger the refresh of connecting flight information. There is no need to recalculate all path rules for the entire departure and arrival cities, which greatly reduces the workload of connecting flight calculations and improves the efficiency of connecting flight information refresh.

[0113] 3. The triggering of the path rule information of this application uses queues as storage and performs hierarchical processing, which gives priority to ensuring the real-time calculation of high-priority path rules. In conjunction with the data expiration cleanup mechanism, the burden of connecting flight calculation processing caused by data backlog is avoided.

[0114] Although the present application has been described in detail with reference to the aforementioned embodiments, a person of ordinary skill in the art should understand that it is still possible to modify the technical solutions described in the aforementioned embodiments, or to make equivalent replacements for some of the technical features therein; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A method for updating connecting flight information based on a path planning algorithm, characterized in that: include: Connecting rule management step: receiving and saving path rule information, and notifying the connecting flight real-time update step to update the associated connecting flight information; Direct flight management step: responsible for the management of direct flights. After completing the update of direct flights, notify the connecting flight real-time update step to update the associated connecting flight information; Connecting flight refresh triggering step: receiving the change information in the connecting rule management step and the direct flight management step, notifying the connecting flight real-time update step of the identified path rule information that needs to be recalculated to accurately calculate and refresh the connecting flight information; Real-time update step of connecting flights: calculate and generate connecting flight information, and update the connecting flight information; Connecting flight data clustering step: storing path rule data and calculated connecting flight information result data.

2. The method according to claim 1, characterized in that: The connecting flight refresh triggering step further includes: Path rule acquisition sub-step, path rule duplicate removal sub-step, path rule analysis sub-step, path rule conversion sub-step, path rule encoding sub-step, path rule triggering sub-step.

3. The method according to claim 2, characterized in that The path rule acquisition sub-step further includes: receiving the changed path rule information initiated by the joint process rule management system, and the receiving method is completed through shared memory.

4. The method according to claim 3, characterized in that The algorithm of the shared memory is: the connecting rule management system writes the changed path rule information into the shared memory, the information including the departure city, the arrival city, the transfer airport and the carrier airline; The connecting flight refresh triggers the system to scan the shared memory in real time, and after obtaining the path rule information, delete the path rule information in the shared memory.

5. The method according to claim 2, characterized in that: The path rule deduplication sub-step further includes: receiving change information generated by the connecting rule management step, the change information is the departure city, the arrival city, the transfer airport and the carrier airline, and determining the priority is high priority.

6. The method according to claim 5, characterized in that The path rule duplicate elimination sub-step further comprises: Check for duplicate path rules. In the path rule queue to be triggered, check whether the path rule information already exists. If not, insert it into the queue of the corresponding priority. If it already exists, determine whether the priority of the existing path rule is higher than or equal to the priority of the newly triggered path rule. If it is higher than or equal, end the process. Otherwise, delete the existing path rule information and insert the new path rule information according to the priority rule.

7. The method according to claim 6, characterized in that The path rule analysis sub-step further includes: splitting the received path rule information, analyzing the operation type of the changed path rule, if the path is newly added, or the original path rule is changed, the triggered operation type is marked as an update type; if the original path rule is deleted, the triggered operation type is marked as a deletion type.

8. The method according to claim 7, characterized in that The path rule conversion sub-step further includes: parsing the changed direct flight information, retrieving the path rule information including the departure and arrival airports according to the departure airport and arrival airport information, thereby completing the conversion from flight information to path rule information.

9. The method according to claim 8, characterized in that The path rule encoding sub-step further includes: city pair information encoding, priority queue information encoding, city pair index information encoding, and connecting path information encoding. The data format of the city pair information encoding is: departure city: arrival city: priority; the data format of the priority queue information encoding is: priority: date; the data format of the city pair index information encoding is: departure city: arrival city; the data format of the connecting path information encoding is: departure city: arrival city: PATH.

10. A connecting flight information updating device based on a path planning algorithm, characterized in that: include: Connecting rule management module: receiving and saving path rule information, and notifying the connecting flight real-time update module to update the associated connecting flight information; Direct flight management module: responsible for the management of direct flights. After completing the update of direct flights, it notifies the connecting flight real-time update module to update the associated connecting flight information. Connecting flight refresh trigger module: receives the change information in the connecting rule management module and the direct flight management module, and notifies the connecting flight real-time update module of the identified path rule information that needs to be recalculated to accurately calculate and refresh the connecting flight information; Connecting flight real-time update module: calculates and generates connecting flight information, and updates connecting flight information; Connecting flight data cluster module: stores path rule data and calculated connecting flight information result data.

Citation Information

Patent Citations

  • Method and device for rapidly planning optimal path

    CN105606113A

  • Throughput-optimized real-time flexible shutdown position scheduling method and scheduling system

    CN110163491A

  • Airport security check area people flow prediction analysis method and system

    CN110751340A

  • Path updating and equivalent path planning method under dynamic network and related device

    CN116366538A

  • Flight data change publishing system and method

    CN119476769A