Predicted arrival time determination method and device, medium and equipment
By acquiring and updating the position information and preset trajectory of the target aircraft during the descent phase, the problem of inaccurate update of the expected arrival time using presets and other ETA surfaces is solved, and more accurate expected arrival time and improved flight data prediction accuracy are achieved.
Patent Information
- Application Number
- CN202411889407.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-20
- Publication Date
- 2025-03-28
AI Technical Summary
During the aircraft descent stage, when using presets and other ETA surfaces to update the estimated arrival time, it may lead to inaccurate expected arrival time. Because the degree of congestion of the entry paths at different times is different, the aircraft may turn to other entry paths and wait for landing.
By responding that the distance between the target aircraft and the airport to be landed is less than the preset distance, a list of position coordinate information of the target aircraft is obtained for each first preset time period and input it into the trajectory determination model to obtain the target preset trajectory of the target aircraft. According to this trajectory, the estimated arrival time of the target aircraft is updated for each second preset time period.
By considering the arrival trajectory predicted by multiple real-time position point points, including conventional and non-standard orbiting trajectories, the updated projected arrival time is more accurate, improving the accuracy and user experience of flight data prediction.
Smart Images
Figure CN119723950A_ABST
Abstract
Description
Background Art
[0002] During the cruising phase, the aircraft updates the current estimated arrival time based on the preset equal ETA surface it passes through. When the aircraft enters the descent phase, due to the existence of multiple approach paths for a certain airport to be landed and the different congestion levels of each approach path at different times, it is possible that at a certain time, one approach path of a certain airport to be landed may have multiple aircraft waiting to land in line, while another approach path of the airport to be landed may have no aircraft waiting to land or fewer aircraft waiting to land in line. At this time, one or several aircraft at the back of the queue on the approach path with multiple aircraft waiting to land may transfer to the approach path with no aircraft waiting to land or fewer aircraft waiting to land to wait for landing. At this time, if the preset equal ETA surface is continued to be used to update the current estimated arrival time, the estimated arrival time will be inaccurate. Summary of the invention
[0003] In response to the above technical problems, the present application provides a method, device, medium and equipment for determining an estimated arrival time, which at least partially solve the problems existing in the prior art.
[0004] In a first aspect of the present application, a method for determining an estimated arrival time is provided, the method comprising:
[0005] S100, in response to the distance between the target aircraft and the airport to be landed being less than a preset distance, obtaining a list of position coordinate information Z of the target aircraft once every first preset time period, wherein the list is (Z1, Z2, ..., Z i , …, Z n ); i = 1, 2, ..., n; wherein n is the number of position coordinate information of the target aircraft obtained each time; Z i To obtain the i-th position coordinate information;
[0006] S200, input Z into the trajectory determination model to obtain a target preset trajectory corresponding to the target aircraft; wherein the target preset trajectory is any preset trajectory in the preset trajectory list Y, Y = (Y1, Y2, ..., Y j , …, Y m );j=1,2,…,m;m is the number of preset trajectories;Z j is the trajectory identifier of the i-th preset trajectory; Y is obtained by clustering several historical approach trajectories corresponding to the airport to be landed;
[0007] S300, updating the estimated arrival time of the target aircraft at intervals of a second preset time period according to the preset target trajectory.
[0008] In a second aspect of the present application, a device for determining an estimated arrival time is provided, the device comprising:
[0009] The position information acquisition unit is used to acquire the position coordinate information list Z=(Z1, Z2, ..., Z i , …, Z n ); i = 1, 2, ..., n; wherein n is the number of position coordinate information of the target aircraft obtained each time; Z i To obtain the i-th position coordinate information;
[0010] The trajectory determination unit is used to input Z into the trajectory determination model to obtain a target preset trajectory corresponding to the target aircraft; wherein the target preset trajectory is any preset trajectory in the preset trajectory list Y, Y = (Y1, Y2, ..., Y j , …, Y m );j=1,2,…,m;m is the number of preset trajectories;Z j is the trajectory identifier of the i-th preset trajectory; Y is obtained by clustering several historical approach trajectories corresponding to the airport to be landed;
[0011] The time updating unit is used to update the estimated arrival time of the target aircraft at intervals of a second preset time period according to the preset trajectory of the target.
[0012] In a third aspect of the present application, a non-transitory computer-readable storage medium is provided, in which at least one instruction or at least one program is stored, and the at least one instruction or at least one program is loaded and executed by a processor to implement the aforementioned method for determining the estimated arrival time.
[0013] In a fourth aspect of the present application, an electronic device is provided, comprising a processor and the above-mentioned non-transitory computer-readable storage medium.
[0014] This application has at least the following beneficial effects:
[0015] The method for determining the estimated arrival time provided by the present application, in response to the distance between the target aircraft and the airport to be landed being less than the preset distance, that is, the target aircraft is ready to enter the descent phase, then the position coordinate information list Z of the target aircraft is obtained once every first preset time period; then Z is input into the trajectory determination model to obtain the target preset trajectory corresponding to the target aircraft, where the target preset trajectory is any preset trajectory in the preset trajectory list, and the preset trajectory list is obtained by clustering a number of historical approach trajectories corresponding to the airport to be landed, that is, the preset trajectory list includes not only conventional approach trajectories, but also trajectories that detour to other approach paths; then, according to the obtained target preset trajectory, the estimated arrival time of the target aircraft is updated every second preset time period. In the descent phase of the target aircraft, the present application predicts the corresponding approach trajectory according to multiple real-time position points of the target aircraft in the descent phase, and the approach trajectory obtained here is a type of preset trajectory. Then, the estimated arrival time of the target aircraft is updated according to the predicted approach trajectory. Compared with the equal ETA surface, unconventional situations (detours to other approach paths) are taken into account, making the estimated arrival time obtained during the descent phase more accurate, improving the accuracy of flight data prediction, and enhancing the user's flight experience. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only 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.
[0017] Figure 1 A flowchart of a method for determining an estimated arrival time provided in an embodiment of the present application;
[0018] Figure 2 This is a structural block diagram of a device for determining an estimated arrival time provided in an embodiment of the present application. DETAILED DESCRIPTION
[0019] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only 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 those skilled in the art without creative work are within the scope of protection of this application.
[0020] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or server that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0021] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein may be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present application, it should be understood by those skilled in the art that an aspect described herein may be implemented independently of any other aspect, and two or more of these aspects may be combined in various ways. For example, any number of aspects described herein may be used to implement the device and / or practice the method. In addition, other structures and / or functionalities other than one or more of the aspects described herein may be used to implement this device and / or practice this method.
[0022] Please refer to Figure 1 As shown, an embodiment of the present application provides a method for determining an estimated arrival time, characterized in that the method includes:
[0023] S100, in response to the distance between the target aircraft and the airport to be landed being less than a preset distance, obtaining a list of position coordinate information Z of the target aircraft once every first preset time period, wherein the list is (Z1, Z2, ..., Z i , …, Z n ); i = 1, 2, ..., n; wherein n is the number of position coordinate information of the target aircraft obtained each time; Z i is the i-th position coordinate information obtained.
[0024] Specifically, the preset distance may be 250 kilometers. When the distance between the target aircraft and the airport to be landed is less than the preset distance, the aircraft may enter the descent phase. At this time, a list of position coordinate information of the target aircraft is obtained once every first preset time period, where the position coordinate information may be ADS-B data.
[0025] It should be noted that each aircraft has a corresponding approach path when performing each flight mission, that is, it lands on the preset landing runway corresponding to the airport to be landed.
[0026] S200, input Z into the trajectory determination model to obtain a target preset trajectory corresponding to the target aircraft; wherein the target preset trajectory is any preset trajectory in the preset trajectory list Y, Y = (Y1, Y2, ..., Y j , …, Y m );j=1,2,…,m;m is the number of preset trajectories;Z j is the trajectory identifier of the i-th preset trajectory; Y is obtained by clustering several historical approach trajectories corresponding to the airport to be landed.
[0027] Specifically, the trajectory determination model is used to determine which preset trajectory in the preset trajectory list Y is the predicted trajectory corresponding to the currently input position coordinate information list. The preset trajectory is the flight trajectory of the landing that the airport to be landed has thought of in the historical time.
[0028] That is, according to the n position coordinate information obtained before the current time each time, predict the approach path corresponding to the airport to be landed, that is, enter according to the standard approach method (landing on the preset landing runway corresponding to the target flight) or enter according to the non-standard approach method (detour to the preset landing runway corresponding to the non-target aircraft). Y is determined according to the following steps:
[0029] S210, obtaining a number of historical trajectories corresponding to the airport to be landed, so as to obtain a corresponding historical trajectory list L = (L1, L2, ..., L x , …, L y ); x = 1, 2, ..., y; where y is the number of historical trajectories corresponding to the airport to be landed; L x is the xth historical trajectory;
[0030] Here, the historical trajectory is the actual landing trajectory of the aircraft entering the airport to be landed at the historical time;
[0031] S220, cluster L twice to obtain Y.
[0032] Wherein, step S220 includes:
[0033] S221, clustering L to obtain a first cluster list YJ = (YJ1, YJ2, ..., YJ p , …, YJ q ); p = 1, 2, ..., q; where q is the number of the first cluster; YJ P is the pth first cluster.
[0034] Here, since the majority of aircraft enter the airport to be landed normally, each cluster in the clustering result obtained by this clustering is a corresponding standard approach. A small number of non-standard approach methods are removed as noise due to their small number.
[0035] S222, delete the historical tracks included in each first cluster in YJ from L to obtain a key historical track list G = (G1, G2, ..., G a , …, L b );a=1,2,…,b;where b is the number of key historical trajectories; L a is the ath key historical trajectory.
[0036] Furthermore, the historical trajectories contained in each first cluster in the above YJ are deleted from L, and the resulting G contains non-standard approach methods, most of which may involve landing on a preset landing runway that does not correspond to the target aircraft, and may also include some special cases, which are not exhaustively listed here.
[0037] S223, clustering G to obtain a second cluster list EJ=(EJ1, EJ2, ..., EJ c , …, E. J. d ), c = 1, 2, ..., d, where d is the number of the second clustering clusters; EJ c is the cth second cluster; the number of key historical trajectories contained in any second cluster is less than the number of historical trajectories contained in any first cluster.
[0038] Here, G is clustered. Since each historical trajectory of normal entry into the airport to be landed has been deleted, the result of this clustering is the clustering result corresponding to various situations of detouring to a non-corresponding preset landing runway. Therefore, the number of key historical trajectories included in any second cluster is less than the number of historical trajectories included in any first cluster.
[0039] S224: Mark each first cluster and each second cluster to obtain Y.
[0040] Here, each first cluster and each second cluster are marked, for example: the first clusters are marked as 1.1, 1.2, 1.3, etc.; the second clusters are marked as 2.1, 2.2, 2.3, etc., so that each first cluster and each second cluster have different numbers, thereby obtaining Y.
[0041] Since the route of an aircraft changes during the descent process and the cruise phase, this embodiment obtains each cluster corresponding to the standard approach and each cluster corresponding to the non-standard approach through two-step clustering. The Y obtained is more comprehensive and does not ignore a few non-standard approaches. As a result, when obtaining the estimated arrival time of the aircraft in the descent phase, the more realistic position of the aircraft can be obtained based on the predicted target preset trajectory. The estimated arrival time obtained is more accurate than the estimated arrival time obtained using only the preset equal ETA surface. This not only improves the accuracy of flight data prediction, but also improves the user's flight experience.
[0042] In an exemplary embodiment of the present application, after step S223, the method further includes:
[0043] S225, delete the key historical tracks contained in each second cluster in EJ from G to obtain an intermediate historical track list M = (M1, M2, ..., M e , …, M f ), e = 1, 2, ..., f, where f is the number of intermediate historical trajectories, M e is the e-th intermediate historical trajectory.
[0044] S226, clustering M to obtain a third cluster list SJ=(SJ1, SJ2, ..., SJ g , …, E. J. h ), g = 1, 2, ..., h, where h is the number of the third cluster, SJ g is the g-th third cluster; the number of key historical trajectories contained in any third cluster is less than the number of historical trajectories contained in any first cluster.
[0045] S227 , label each first cluster, each second cluster, and each third cluster to obtain Y.
[0046] Here, the key historical tracks contained in each second cluster in EJ are deleted from G, that is, there may still be some more special detours that occur very rarely, which may be removed as noise in the second clustering. In this embodiment, the corresponding clusters are obtained through further clustering. Then, according to the above method, marking is performed, as an example: the first clusters are marked as 1.1, 1.2, 1.3, etc.; the second clusters are marked as 2.1, 2.2, 2.3, etc.; the third clusters are marked as 3.1, 3.2, 3.3, etc. So that the corresponding numbers of each first cluster, each second cluster and each third cluster are different, thereby obtaining Y.
[0047] This embodiment performs a third clustering based on the second clustering, and the approach path covered by the Y obtained thereby is more comprehensive, so that when obtaining the estimated arrival time of the aircraft in the descent phase, the more realistic position of the aircraft can be obtained according to the predicted target preset trajectory, and the estimated arrival time obtained thereby is more accurate than the estimated arrival time obtained by only using the preset equal ETA surface. This not only improves the accuracy of flight data prediction, but also improves the user's flight experience.
[0048] It should be noted that, according to the distribution of specific historical trajectories, a fourth clustering, a fifth clustering, etc. may be performed. In one embodiment, the number of clustering is not specifically limited.
[0049] The above clustering algorithm can be DBSCAN clustering or K-MEANS clustering. DBSCAN clustering is to define a cluster as the largest set of density-connected points, which can divide areas with sufficiently high density into clusters and can find clusters of arbitrary shapes in noisy spatial databases. K-MEANS clustering is an iteration-based clustering algorithm, whose goal is to divide a data set into K clusters, so that each data point belongs to the cluster closest to it, and the center of the cluster is the average value of all data points.
[0050] S300, updating the estimated arrival time of the target aircraft at intervals of a second preset time period according to the preset target trajectory.
[0051] Here, the position information of the target aircraft can be obtained according to the preset target trajectory, and then, according to actual needs, the estimated arrival time of the target aircraft can be updated according to the position information of the target aircraft at every second preset time period.
[0052] Here, the specific method for updating the estimated arrival time of the target aircraft according to the position information of the target aircraft can be obtained by any method well known to those skilled in the art, and will not be described in detail here.
[0053] Please refer to Figure 2 As shown, an embodiment of the present application provides a device 100 for determining an estimated arrival time, the device comprising:
[0054] The position information acquisition unit 110 is used to acquire the position coordinate information list Z of the target aircraft once every first preset time period in response to the distance between the target aircraft and the airport to be landed being less than a preset distance. i , …, Z n ); i = 1, 2, ..., n; wherein n is the number of position coordinate information of the target aircraft obtained each time; Z i is the i-th position coordinate information obtained.
[0055] The trajectory determination unit 120 is used to input Z into the trajectory determination model to obtain a target preset trajectory corresponding to the target aircraft; wherein the target preset trajectory is any preset trajectory in the preset trajectory list Y, Y = (Y1, Y2, ..., Y j , …, Y m );j=1,2,…,m;m is the number of preset trajectories;Z j is the trajectory identifier of the i-th preset trajectory; Y is obtained by clustering several historical approach trajectories corresponding to the airport to be landed.
[0056] The time updating unit 130 is used to update the estimated arrival time of the target aircraft at intervals of a second preset time period according to the preset trajectory of the target.
[0057] In an exemplary embodiment of the present application, an electronic device capable of implementing the above method is also provided.
[0058] Those skilled in the art will appreciate that various aspects of the present application may be implemented as a system, method or program product. Therefore, various aspects of the present application may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to as "circuit", "module" or "system" herein.
[0059] The electronic device according to this embodiment of the present application is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.
[0060] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor mentioned above, the at least one storage device mentioned above, and a bus connecting different system components (including storage devices and processors).
[0061] The storage stores program codes, which can be executed by the processor, so that the processor executes the steps described in the above “Exemplary Method” section of this specification according to various exemplary embodiments of the present application.
[0062] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read only memory (ROM).
[0063] The storage may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.
[0064] The bus may represent one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.
[0065] The electronic device can also communicate with one or more external devices (such as keyboards, pointing devices, Bluetooth devices, etc.), and can also communicate with one or more devices that enable users to interact with the electronic device, and / or communicate with any device (such as routers, modems, etc.) that enables the electronic device to communicate with one or more other computing devices. This communication can be carried out through an input / output (I / O) interface. In addition, the electronic device can also communicate with one or more networks (such as local area networks (LANs), wide area networks (WANs) and / or public networks, such as the Internet) through a network adapter. As shown in the figure, the network adapter communicates with other modules of the electronic device through a bus. It should be understood that, although not shown in the figure, other hardware and / or software modules can be used in conjunction with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.
[0066] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation methods of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation methods of the present application.
[0067] In an exemplary embodiment of the present application, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present application can also be implemented in the form of a program product, which includes a program code. When the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary implementations of the present application described in the above "Exemplary Method" section of the present specification.
[0068] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
[0069] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0070] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
[0071] Program code for performing the operations of the present application may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., via the Internet using an Internet service provider).
[0072] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present application, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.
[0073] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.
[0074] The above are only specific implementations of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.
Claims
1. A method for determining an estimated arrival time, characterized in that: The method comprises: S100, in response to the distance between the target aircraft and the airport to be landed being less than a preset distance, obtaining a list of position coordinate information Z of the target aircraft once every first preset time period, wherein the list is (Z1, Z2, ..., Z i , …, Z n ); i = 1, 2, ..., n; wherein n is the number of position coordinate information of the target aircraft obtained each time; Z i To obtain the i-th position coordinate information; S200, input Z into the trajectory determination model to obtain a target preset trajectory corresponding to the target aircraft; wherein the target preset trajectory is any preset trajectory in the preset trajectory list Y, Y = (Y1, Y2, ..., Y j , …, Y m );j=1,2,…,m;m is the number of preset trajectories;Z j is the trajectory identifier of the i-th preset trajectory; Y is obtained by clustering several historical approach trajectories corresponding to the airport to be landed; S300, updating the estimated arrival time of the target aircraft at intervals of a second preset time period according to the preset target trajectory.
2. The method for determining the estimated arrival time according to claim 1, characterized in that: Y is determined according to the following steps: S210, obtaining a number of historical trajectories corresponding to the airport to be landed, so as to obtain a corresponding historical trajectory list L = (L1, L2, ..., L x , …, L y ); x = 1, 2, ..., y; where y is the number of historical trajectories corresponding to the airport to be landed; L x is the xth historical trajectory; S220, cluster L twice to obtain Y.
3. The method for determining the estimated arrival time according to claim 2, characterized in that: Step S220 includes: S221, clustering L to obtain a first cluster list YJ=(YJ1, YJ2, ..., YJ p , …, YJ q ); p = 1, 2, ..., q; where q is the number of the first cluster; YJ P is the pth first cluster; S222, delete the historical tracks included in each first cluster in YJ from L to obtain a key historical track list G = (G1, G2, ..., G a , …, L b );a=1,2,…,b;where b is the number of key historical trajectories; L a is the ath key historical trajectory; S223, clustering G to obtain a second cluster list EJ=(EJ1, EJ2, ..., EJ c , …, E. J. d ), c = 1, 2, ..., d, where d is the number of the second clustering clusters; EJ c is the cth second cluster; the number of key historical trajectories contained in any second cluster is less than the number of historical trajectories contained in any first cluster; S224: Mark each first cluster and each second cluster to obtain Y.
4. The method for determining the estimated arrival time according to claim 1, characterized in that: The preset distance is 250 kilometers.
5. The method for determining the estimated arrival time according to claim 3, characterized in that: After step S223, the method further includes: S225, delete the key historical tracks contained in each second cluster in EJ from G to obtain an intermediate historical track list M = (M1, M2, ..., M e , …, M f ), e = 1, 2, ..., f, where f is the number of intermediate historical trajectories, M e is the e-th intermediate historical trajectory; S226, clustering M to obtain a third cluster list SJ=(SJ1, SJ2, ..., SJ g , …, E. J. h ), g = 1, 2, ..., h, where h is the number of the third cluster, SJ g is the g-th third cluster; the number of key historical trajectories contained in any third cluster is less than the number of historical trajectories contained in any first cluster; S227 , label each first cluster, each second cluster, and each third cluster to obtain Y.
6. The method for determining the estimated arrival time according to claim 5, characterized in that: The clustering algorithm is DBSCAN clustering or K-MEANS clustering.
7. A device for determining an estimated arrival time, characterized in that: The device comprises: The position information acquisition unit is used to acquire the position coordinate information list Z=(Z1, Z2, ..., Z i , …, Z n ); i = 1, 2, ..., n; wherein n is the number of position coordinate information of the target aircraft obtained each time; Z i To obtain the i-th position coordinate information; The trajectory determination unit is used to input Z into the trajectory determination model to obtain a target preset trajectory corresponding to the target aircraft; wherein the target preset trajectory is any preset trajectory in the preset trajectory list Y, Y = (Y1, Y2, ..., Y j , …, Y m );j=1,2,…,m;m is the number of preset trajectories;Z j is the trajectory identifier of the i-th preset trajectory; Y is obtained by clustering several historical approach trajectories corresponding to the airport to be landed; The time updating unit is used to update the estimated arrival time of the target aircraft at intervals of a second preset time period according to the preset trajectory of the target.
8. A non-transitory computer-readable storage medium, characterized in that: The storage medium stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by the processor to implement the method as claimed in any one of claims 1 to 6.
9. An electronic device, characterized in that: The invention comprises a processor and the non-transitory computer-readable storage medium as claimed in claim 8.