# US 11,308,818 B2 · Method and apparatus for outputting information > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,308,818 B2 - Document ID: US11308818B2 - Status: Granted - Kind: B2 - Application number: 16/721,484 - Filed: 2019-12-19 - Published: 2020-11-12 - Granted: 2022-04-19 - Earliest claimed: 2019-05-09 - Assignees: Beijing Baidu Netcom Science Technology Co., Ltd. - Applicants: Beijing Baidu Netcom Science and Technology Co., Ltd. - Inventors: Chao Jiang; Xiaohui Li; Feifan Fu; Wei Zhou - Web page: https://patentgrep.com/patent/US11308818B2 ## CPC - G08G 5/51: for control when on the ground, e.g. taxiing or rolling - G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem - G08G 5/22: located on the ground - G08G 5/56: for two or more aircraft - G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93}) - G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR ## Abstract Embodiments of the present disclosure relate to a method and apparatus for outputting information. The method may include: acquiring flight information, airport gate information, taxiway information and a taxiing path; constructing an integer programming model according to the flight information, the airport gate information, the taxiway information and the taxiing path, the integer programming model including a target, a decision variable and a constraint; optimizing the integer programming model according to the constraint; and solving the optimized integer programming model to obtain a corresponding relationship table of flights and airport gates, and outputting the corresponding relationship table. ## Claims ### Claim 1 A method for outputting information, comprising: acquiring flight information, airport gate information, taxiway information and a taxiing path; constructing an integer programming model according to the flight information, the airport gate information, the taxiway information and the taxiing path, the integer programming model comprising a target, a decision variable and a constraint; optimizing the integer programming model according to the constraint; solving the optimized integer programming model to obtain a corresponding relationship table of flights and airport gates, and outputting the corresponding relationship table; selecting, in response to receiving an adjustment request of a target flight, several airport gates randomly, and adding the airport gates to a rearrangement list; adding to the rearrangement list, an airport gate that conflicts with the randomly selected airport gates, in the corresponding relationship table of flights and airport gates; constructing a local integer programming model according to airport gate information involved in the arrangement list and related flight information, the taxiway information and the taxiing path; solving the local integer programming model to obtain an optimal solution within a local range, and updating the corresponding relationship table of flights and airport gates; and adjusting a position of an aircraft in the airport according to the updated corresponding relationship table. ### Claim 2 (depends on 1) The method according to claim 1, further comprising: assigning an airport gate to a flight not assigned with an airport gate by means of a greedy algorithm. ### Claim 3 (depends on 1) The method according to claim 1, further comprising: evaluating an effect of the corresponding relationship table of flights and airport gates. ### Claim 4 (depends on 1) The method according to claim 1, wherein the decision variable comprises at least one of: an identifier for indicating occupation of an airport gate by a flight, a flight push-out conflict identifier, a completion rate of a target bridge docking rate of an airline, a taxiway occupation identifier, a flight attribute, an airport gate attribute, a flight arrival time, a flight departure time, a flight pick-up start time, a flight pick-up end time, a flight drop-off start time, a flight drop-off end time, an identifier of a near airport gate, a number of passengers on board, a pick-up/drop-off conflict identifier, a distance between an airport gate and a runway, an identifier of a temporary airport gate, a target bridge docking rate identifier of an airline or an identifier of a conflicting airport gate. ### Claim 5 (depends on 4) The method according to claim 4, wherein the constraint comprises at least one of: an attribute constraint, a VIP flight constraint, a space constraint, a time constraint, a conflicting airport gate constraint, a pick-up/drop-off conflict constraint or a push-out conflict constraint. ### Claim 6 (depends on 5) The method according to claim 5, wherein the target is a weighted sum of at least one of: a bridge docking rate of a flight, a bridge docking rate of a passenger, a bridge docking completion rate of an airline, a push-out conflict rate, a taxi distance rate, a time usage rate of a near airport gate or a usage rate of a temporary airport gate. ### Claim 7 (depends on 5) The method according to claim 5, wherein the optimizing the integer programming model according to the constrain comprises at least one of: an airport gate conflict constraint optimization, a push-out conflict constraint optimization, a conflicting airport gate constraint optimization or a piecewise linear transforming bridge docking rate of an airline. ### Claim 8 (depends on 7) The method according to claim 7, wherein the solving the optimized integer programming model comprises: solving the optimized integer programming model using a branch and bound method. ### Claim 9 An apparatus for outputting information, comprising: at least one processor; and a memory storing instructions, the instructions when executed by the at least one processor, cause the at least one processor to perform operations, the operations comprising: acquiring flight information, airport gate information, taxiway information and a taxiing path; constructing an integer programming model according to the flight information, the airport gate information, the taxiway information and the taxiing path, the integer programming model comprising a target, a decision variable and a constraint; optimizing the integer programming model according to the constraint; solving the optimized integer programming model to obtain a corresponding relationship table of flights and airport gates, and outputting the corresponding relationship table; selecting, in response to receiving an adjustment request of a target flight, several airport gates randomly, and adding the airport gates to a rearrangement list; adding to the rearrangement list, an airport gate that conflicts with the randomly selected airport gates, in the corresponding relationship table of flights and airport gates; constructing a local integer programming model according to airport gate information involved in the arrangement list and related flight information, the taxiway information and the taxiing path; solving the local integer programming model to obtain an optimal solution within a local range, and updating the corresponding relationship table of flights and airport gates; and adjusting a position of an aircraft in the airport according to the updated corresponding relationship table. ### Claim 10 (depends on 9) The apparatus according to claim 9, the operations further comprising: assigning an airport gate to a flight not assigned with an airport gate by means of a greedy algorithm. ### Claim 11 (depends on 9) The apparatus according to claim 9, the operations further comprising: evaluating an effect of the corresponding relationship table of flights and airport gates. ### Claim 12 (depends on 9) The apparatus according to claim 9, wherein the decision variable comprises at least one of: an identifier for indicating occupation of an airport gate by a flight, a flight push-out conflict identifier, a completion rate of a target bridge docking rate of an airline, a taxiway occupation identifier, a flight attribute, an airport gate attribute, a flight arrival time, a flight departure time, a flight pick-up start time, a flight pick-up end time, a flight drop-off start time, a flight drop-off end time, an identifier of a near airport gate, a number of passengers on board, a pick-up/drop-off conflict identifier, a distance between an airport gate and a runway, an identifier of a temporary airport gate, a target bridge docking rate identifier of an airline or an identifier of a conflicting airport gate. ### Claim 13 (depends on 12) The apparatus according to claim 12, wherein the constraint comprises at least one of: an attribute constraint, a VIP flight constraint, a space constraint, a time constraint, a conflicting airport gate constraint, a pick-up/drop-off conflict constraint or a push-out conflict constraint. ### Claim 14 (depends on 13) The apparatus according to claim 13, wherein the target is a weighted sum of at least one of: a bridge docking rate of a flight, a bridge docking rate of a passenger, a bridge docking completion rate of an airline, a push-out conflict rate, a taxi distance rate, a time usage rate of a near airport gate or a usage rate of a temporary airport gate. ### Claim 15 (depends on 13) The apparatus according to claim 13, wherein the optimizing the integer programming model according to the constrain comprises at least one of: an airport gate conflict constraint optimization, a push-out conflict constraint optimization, a conflicting airport gate constraint optimization or a piecewise linear transforming bridge docking rate of an airline. ### Claim 16 (depends on 15) The apparatus according to claim 15, wherein the solving the optimized integer programming model comprises: solving the optimized integer programming model using a branch and bound method. ### Claim 17 A non-transitory computer readable medium, storing a computer program, wherein the computer program, when executed by a processor, causes the processor to perform operations, the operations comprising: acquiring flight information, airport gate information, taxiway information and a taxiing path; constructing an integer programming model according to the flight information, the airport gate information, the taxiway information and the taxiing path, the integer programming model comprising a target, a decision variable and a constraint; optimizing the integer programming model according to the constraint; solving the optimized integer programming model to obtain a corresponding relationship table of flights and airport gates, and outputting the corresponding relationship table; selecting, in response to receiving an adjustment request of a target flight, several airport gates randomly, and adding the airport gates to a rearrangement list; adding to the rearrangement list, an airport gate that conflicts with the randomly selected airport gates, in the corresponding relationship table of flights and airport gates; constructing a local integer programming model according to airport gate information involved in the arrangement list and related flight information, the taxiway information and the taxiing path; solving the local integer programming model to obtain an optimal solution within a local range, and updating the corresponding relationship table of flights and airport gates; and adjusting a position of an aircraft in the airport according to the updated corresponding relationship table.