Digital modeling method of dynamic trajectory, electronic device and storage medium

Abstract

The application provides a dynamic trajectory digital modeling method, an electronic device and a storage medium. The dynamic trajectory digital modeling method comprises the following steps: defining a time slice algorithm for a dynamic trajectory; performing time slice processing on the obtained dynamic trajectory data with a time span by using the defined time slice algorithm to obtain a dynamic grid set under each time slice; obtaining line feature space-time coding corresponding to the dynamic trajectory data based on the dynamic grid set and a time coding set obtained based on the dynamic trajectory data; and obtaining digital modeling based on the line feature space-time coding. The dynamic trajectory data is modeled by using unified space-time coding, and on the basis of general identification of spatial grid, the purpose of good usability and universality of database access coding of dynamic trajectory features is achieved.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of data processing of airspace dynamic trajectory, and particularly relates to a digital modeling method of dynamic trajectory, an electronic device and a storage medium. BACKGROUND

[0002] On the basis of establishing the airspace gridding general identification, the scientific interpretation of the basic application method is made, mainly including the following aspects: the use method of space reporting, the calculation analysis method, the unified and segmented use method, the database access coding method and the analysis and registration use method of airspace position, etc.

[0003] Database access coding refers to the need to standardize and standardize the data before storing it in the database, in order to ensure the accuracy, reliability and consistency of the data. In this process, coding plays an important role, which can classify, mark and manage data, so as to facilitate data retrieval, analysis and application. For air traffic control specific data, including point elements represented by towers and control points, line elements represented by airport runways and flight corridors, plane information represented by aeronautical charts and airport planes, and body element information represented by no-fly zones or temporary airspace, in addition, there are dynamic trajectory elements containing time information.

[0004] The inventor found that the existing dynamic trajectory database access coding has defects in usability and universality during the implementation of the technical solution. SUMMARY

[0005] In view of the problems in the prior art, the application provides a digital modeling method of dynamic trajectory, an electronic device and a storage medium, which at least partially solve the problem of defects in usability and universality of dynamic trajectory database access coding in the prior art.

[0006] In a first aspect, the embodiments of the present disclosure provide a digital modeling method of dynamic trajectory, comprising:

[0007] Defining a time slicing algorithm for dynamic trajectory;

[0008] Performing time slicing processing on the obtained dynamic trajectory data with time span by using the defined time slicing algorithm to obtain a dynamic grid set under each time slice;

[0009] Obtaining a line element space-time coding corresponding to the dynamic trajectory data based on the dynamic grid set and a time coding set obtained based on the dynamic trajectory data, the line element space-time coding being obtained based on a space-time subdivision algorithm of line element;

[0010] Based on the line element space-time coding to obtain digital modeling.

[0011] Optionally, the obtained dynamic trajectory data with time span is time-sliced using a defined time-slicing algorithm to obtain a dynamic grid set under each time slice, including:

[0012] Determine the expression form of the dynamic trajectory data, thereby converting the dynamic trajectory data into the expression of the airspace line element;

[0013] Time-slice data extraction is performed on the dynamic trajectory data with the determined expression form to obtain key point data of the dynamic trajectory, and a key point set is obtained based on the key point data;

[0014] In each time slice, the key point set is processed into a line element to obtain an airspace gridding set under the time slice.

[0015] Optionally, the expression form of the dynamic trajectory data is determined, thereby converting the dynamic trajectory data into the expression of the airspace line element, including:

[0016] Each dynamic trajectory contains element information of a plurality of key points, and the element information of each key point is expressed by group data. After the time information in the dynamic trajectory is omitted, the dynamic trajectory data is converted into the expression form of the line element.

[0017] Optionally, the expression of the airspace line element includes:

[0018] The line element is composed of a set of ordered points. After the points are expressed in the airspace grid, the node grid coordinates corresponding to the points are determined, and then the node grid coordinates are filled using the spatial adjacent grid surface elements to obtain the expression form of the line element.

[0019] Optionally, the expression form of the line element includes:

[0020] The set is composed of a set of sampling points and filling elements between the sampling points, and the sampling points are obtained based on the point-like entities constituting the line element.

[0021] The attribute of the line element is a set of sampling point attributes.

[0022] Optionally, the expression of the line element is:

[0023]

[0024]

[0025]

[0026] Line elementis a line element, is a node grid coordinate, n is a natural number, SU is a subdivision cell of a point entity at a corresponding subdivision level, Code i is a subdivision code of point data at the level, A refers to an attribute of an element object, A Line is an attribute of a line element, A SU is a subdivision cell attribute.

[0027] Optionally, the node grid coordinate corresponding to the point entity is determined, and the node grid coordinate is filled using spatially adjacent grid surface elements, comprising:

[0028] Determine a key point set of the spatial grid expression according to the spatial coverage range of the line element;

[0029] Determine the grid filling set between the key point sets according to the grid-based line element grid set output algorithm;

[0030] Perform set union on all the calculated filling grid sets to obtain the spatial grid expression structure of the line element.

[0031] Optionally, the key point set of the spatial grid expression is determined according to the spatial coverage range of the line element, comprising:

[0032]

[0033] wherein, Line temp is a key point set, Coverage represents the spatial range covered by the line element, Grid i represents the GeoSOT grid of the node located in the range, Code i (x i ,y i ,z i ) is the encoding of the key point coordinates.

[0034] Optionally, the grid filling set between the key point sets is determined according to the grid-based line element grid set output algorithm, comprising:

[0035] ResultCollection i =Grid_Breseham((x i ,y i ,z i ),(x i+1 ,y i+1 ,z i+1 )),

[0036] wherein, (x i ,y i ,z i ) and (xi+1 y i+1 z i+1 ) are the key nodes of two adjacent line elements, ResultCollection i is a grid filling collection, and Grid_Bresenham is a line element grid collection output algorithm.

[0037] Optionally, the line element spatiotemporal encoding expression is expressed as follows: the expression of the point element is expressed as follows:

[0038]

[0039] Wherein, L, B, H, and T are longitude, latitude, height value, and time value of the position in the airspace space; SU is a subdivision cell of the point entity at a corresponding subdivision level, CODE n is a subdivision code of the point data at the level, g identifies a corresponding mapping relationship between the subdivision code and the actual airspace cell, f is a function of longitude, latitude, height, and time conversion to code, A SU is a subdivision cell attribute, P AS-subdivision is a spatial point element, and A p is a point attribute.

[0040] In a second aspect, the embodiments of the present disclosure further provide an electronic device, which comprises:

[0041] at least one processor; and

[0042] a memory in communication connection with the at least one processor; wherein

[0043] the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the dynamic trajectory digital modeling method of any one of the first aspect.

[0044] In a third aspect, the embodiments of the present disclosure further provide a computer readable storage medium, which stores computer instructions for enabling a computer to execute the dynamic trajectory digital modeling method of any one of the first aspect.

[0045] The dynamic trajectory digital modeling method, the electronic device, and the storage medium provided by the present disclosure, wherein the dynamic trajectory digital modeling method processes dynamic trajectory data by a time slicing algorithm to obtain a dynamic grid collection, and obtains a line element spatiotemporal encoding based on the dynamic grid collection and a time encoding collection, thereby modeling the dynamic trajectory data by using a unified spatiotemporal encoding, and achieving the purpose of good usability and universality of database access encoding of dynamic trajectory elements on the basis of general identification of airspace gridding. BRIEF DESCRIPTION OF DRAWINGS

[0046] The above and other objects, features and advantages of the present disclosure will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings in which like reference characters refer to like parts throughout the figures, in which exemplary embodiments of the present disclosure are shown.

[0047] Figure 1 A flowchart of a dynamic trajectory digital modeling method provided for an embodiment of the present disclosure;

[0048] Figures 2a to 2c A space line element logical table diagram provided for an embodiment of the present disclosure;

[0049] Figure 3a And Figure 3b A schematic diagram of a Breseham algorithm for extending the computer graphics algorithm DDA and Breseham algorithm to a three-dimensional grid provided for an embodiment of the present disclosure;

[0050] Figure 4 A principle block diagram of an electronic device provided for an embodiment of the present disclosure. DETAILED DESCRIPTION

[0051] The embodiments of the present disclosure will be described in detail below with reference to the drawings.

[0052] It should be apparent that the following describes the embodiments of the present disclosure through specific concrete examples, and those skilled in the art can easily understand other advantages and effects of the present disclosure from the disclosure. Obviously, the described embodiments are only some of the embodiments of the present disclosure, not all. The present disclosure can also be implemented or applied by other different specific embodiments, and the details in the specification can be modified or changed based on different views and applications without departing from the spirit of the present disclosure. It should be noted that the following embodiments and features in the embodiments can be combined with each other without conflict. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the present disclosure.

[0053] It is important to note that the various aspects described hereinafter pertain to embodiments within the scope of the appended claims. It should be apparent that the aspects described herein can be embodied in a wide variety of forms and that any specific structure and / or function described herein is merely illustrative. Based on the teachings herein one skilled in the art should appreciate that an aspect described herein can be implemented independently of any other aspects and that an aspect described herein can be implemented both as any claim and as an aspect of a claim. For example, an apparatus can be implemented using any of a number of aspects described herein. In addition, an art-recognized processing device can be arranged to implement the methods taught here.

[0054] It is also important to note that the present disclosure can be carried out in many ways and that the application is not limited to a specific embodiment, nor to exact construction, operation and appearance of an implementation. There is, of course, a number of variations of the specific structures described herein but such would be a variation of the application and are therefore implied.

[0055] Furthermore, in the following description, numerous specific details are set forth to provide a thorough understanding of the examples. However, it will be apparent to those skilled in the art that the aspects described herein can be practiced without such specific details.

[0056] The present embodiment can select to use the underlying GeoSOT encoding or the AGRS encoding form for expressing the spatial position of the airspace, thereby establishing a general basic airspace data storage coding.

[0057] For the general basic airspace data, in order to balance storage and calculation, the corresponding hierarchical grid corresponding to the GeoSOT or AGRS encoding should be used, that is, the corresponding level of the GeoSOT or AGRS encoding is used for coding storage in the airspace database. Under this condition, the information fidelity of the general basic airspace data can be met, and the size and efficiency of the database storage can also be guaranteed.

[0058] The basic data structure of the present embodiment is described as follows:

[0059] For ease of understanding, as shown in Figure 1 The present embodiment discloses a digital modeling method of dynamic trajectory, comprising:

[0060] defining a time slicing algorithm for dynamic trajectory;

[0061] using the defined time slicing algorithm to perform time slicing processing on the obtained dynamic trajectory data with time span, to obtain a dynamic grid set under each time slice;

[0062] The line feature spatiotemporal coding corresponding to the dynamic trajectory data is obtained based on the dynamic grid set and the time coding set obtained based on the dynamic trajectory data, and the line feature spatiotemporal coding is obtained based on a spatiotemporal subdivision algorithm of the line feature;

[0063] The time coding set is obtained based on the time of the dynamic trajectory, i.e., the start time and the end time of the dynamic trajectory, and the line feature spatiotemporal coding is obtained based on a spatiotemporal subdivision algorithm of the line feature based on the dynamic grid set and the time coding set.

[0064] The digital modeling is obtained based on the line feature spatiotemporal coding.

[0065] Optionally, the obtained dynamic trajectory data with a time span is subjected to time slicing processing by using a defined time slicing algorithm to obtain a dynamic grid set under each time slice, including:

[0066] The expression form of the dynamic trajectory data is determined, so as to convert the dynamic trajectory data into the expression of the airspace line feature;

[0067] The data extraction of the dynamic trajectory data with the determined expression form under the time slicing is performed to obtain key point data of the dynamic trajectory, and a key point set is obtained based on the key point data.

[0068] The key point set is subjected to the line feature processing under each time slice to obtain an airspace gridding set under the time slice.

[0069] By converting the dynamic trajectory data into the airspace gridding set, better usability and universality can be obtained.

[0070] Optionally, the expression form of the dynamic trajectory data is determined, so as to convert the dynamic trajectory data into the expression of the airspace line feature, including:

[0071] Each dynamic trajectory contains element information of a plurality of key points, and the element information of each key point is expressed by group data. After the time information in the dynamic trajectory is omitted, the dynamic trajectory data is converted into the expression form of the line feature.

[0072] By converting the dynamic trajectory data into the line feature, better usability and universality can be obtained.

[0073] Generally, the trajectory data form can be uniformly expressed in the following form. In each trajectory tra i contains element information of a plurality of key points, and the element information of each key point can be expressed by group data <x, y, h, t>. It can be seen that, after the time information is omitted, the trajectory data is degraded into the formatted expression form of the line feature information.

[0074]

[0075]

[0076]

[0077] Optionally, the expression of the airspace line element comprises:

[0078] The line element is composed of a set of ordered points. After the expression of the points is gridized, the node grid coordinates corresponding to the points are determined, and the node grid coordinates are filled using spatially adjacent grid cells to obtain the expression form of the line element.

[0079] The expression form of the line element can be obtained to achieve better usability and versatility.

[0080] Optionally, as shown in Figures 2a to 2c the expression form of the line element comprises:

[0081] The collection is formed by the sampling point section elements and the filling elements between the sampling points, and the sampling points are obtained based on the point elements constituting the line element.

[0082] The attribute of the line element is a collection of sampling point attributes.

[0083] Optionally, the expression of the line element is:

[0084]

[0085]

[0086] wherein Line element is the line element, is the node grid coordinate, n is a natural number, SU is the section element of the point element at the corresponding section level, Code i is the section code of the point data at the level, A refers to the attribute of the element object, A Line is the attribute of the line element, A SU is the section element attribute. A refers to the attribute of the element object, and among the two points 6 and 7, it refers to the attribute of the line element carried by a series of section collection grid attributes.

[0087] The line element grid collection output algorithm program is as follows:

[0088] Input: initial point and end point coordinates of airspace gridization (x1, y1, z1), (x2, y2, z2)

[0089] Output: airspace gridization code collection ResultCollection

[0090]

[0091]

[0092] Optionally, the node grid coordinates corresponding to the point entity are determined, and then the node grid coordinates are filled using spatially adjacent grid surface elements, comprising:

[0093] determining a set of key points of the airspace grid expression according to the spatial coverage of the line element;

[0094] determining a grid filling set between the key point sets according to a grid-based line element grid set output algorithm;

[0095] performing set union on all the calculated filling grid sets to obtain an airspace grid expression structure of the line element.

[0096] The airspace grid expression structure is: Line = ∪ResultCollection i .

[0097] Optionally, the determining a set of key points of the airspace grid expression according to the spatial coverage of the line element comprises:

[0098]

[0099] wherein, Line temp is the set of key points, Coverage represents the spatial range covered by the line element, Grid i represents the GeoSOT grid of the node located in the range, Code i (x i ,y i ,z i ) is the encoding of the key point coordinates.

[0100] Optionally, the determining a grid filling set between the key point sets according to a grid-based line element grid set output algorithm comprises:

[0101] ResultCollection i = Grid_Breseham((x i ,y i ,z i ),(x i+1 ,y i+1 ,z i+1 )),

[0102] wherein, (x i ,y i ,z i) and (x i+1 ,y i+1 ,z i+1 ) are the key nodes of two adjacent line elements, ResultCollection i is the grid filling set, Grid_Breseham is the line element grid set output algorithm, in the use of the above algorithm corresponding generating function, the filling grid of the line element and its set ResultCollction i under the condition can be calculated, the set expresses the grid set of any two key nodes with adjacent relationship. The space-time grid Grid_Breseham algorithm is to apply the computer graphics algorithm DDA and Breseham algorithm to the three-dimensional grid Breseham algorithm, as shown in Figure 3a and Figure 3b .

[0103] The logical modeling of spatial-temporal information records the subdivision cell encoding and entity (point entity) attribute at its spatial position. The three-dimensional subdivision modeling of points can be expressed as the following formula:

[0104]

[0105] Wherein, L, B, H, T are the longitude, latitude, height value and time value of the position in the spatial domain, and the corresponding value is determined by the hierarchical value of the subdivision, SU is the subdivision cell of the point entity at the corresponding subdivision level, CODEn is the subdivision encoding of the point data at this level, indicating that the attribute data of the point at this time is inherited from the attribute of the subdivision cell, g identifies the corresponding mapping relationship between the subdivision encoding and the actual spatial cell, f is the function of converting longitude, latitude, height and time into encoding, A SU is the attribute of the subdivision cell, P AS-subdivision is the spatial point element, and A p is the point attribute. In the traditional way, point elements are generally expressed in the form of longitude and latitude arrays. Therefore, the grid coding of point objects is essentially the conversion of longitude and latitude to grid coding. Here, the selected hierarchical GeoSOT-3D global subdivision grid and Beidou subdivision time code can be directly used for identification and coding.

[0106] The dynamic trajectory data of the determined expression form are subjected to data extraction under time slicing, to obtain key point data of the dynamic trajectory, and the key point set is obtained based on the key point data, which specifically includes:

[0107] Let t ∈ T s be the time slice, the trajectory set trajectory is subjected to time slicing processing, and the trajectory data extraction algorithm program based on time slicing is as follows:

[0108]

[0109] The algorithm will time slice, extract the time slice set t s The key point data of each trajectory in the slice set is represented as follows:

[0110] T Code = encode_time(t i ).

[0111] In each time slice, the key point set is processed to obtain the spatial grid set under the time slice, which is specifically:

[0112] In each time slice t i ∈T s , the key point set p i is processed to obtain the spatial grid set under the time slice

[0113] The embodiment utilizes the split framework and time encoding to associate various types of air traffic control element information, and through the space-time encoding of the airspace, the association between the air traffic control element and the airspace corresponding to the airspace grid unit is established, forming a bottom data architecture based on the grid-based general identification model.

[0114] The embodiment also discloses a digital modeling device for dynamic trajectories, comprising:

[0115] A definition module is configured to define a time slicing algorithm for dynamic trajectories.

[0116] An extraction module is configured to perform time slicing processing on the obtained dynamic trajectory data with time span using the defined time slicing algorithm to obtain a dynamic grid set under each time slice.

[0117] An encoding module is configured to obtain a line element space-time code corresponding to the dynamic trajectory data based on the dynamic grid set and a time code set obtained based on the dynamic trajectory data, the line element space-time code being obtained based on a space-time split algorithm of the line element.

[0118] A modeling module is configured to obtain digital modeling based on the line element space-time code.

[0119] The electronic device disclosed in the embodiment comprises a memory and a processor. The memory is configured to store non-transitory computer-readable instructions. Specifically, the memory can comprise one or more computer program products, which can comprise various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may, for example, comprise random access memory (RAM), cache memory, and / or the like. The non-volatile memory may, for example, comprise read-only memory (ROM), hard disk, flash memory, and / or the like.

[0120] The processor can be a central processing unit (CPU) or other form of processing unit having data processing and / or instruction execution capabilities, and can control other components in the electronic device to perform desired functions. In one embodiment of the present disclosure, the processor is configured to execute the computer-readable instructions stored in the memory, so that the electronic device performs all or part of the steps of the dynamic trajectory digital modeling method of the embodiments of the present disclosure described above.

[0121] Those skilled in the art will understand that, in order to solve the technical problem of how to obtain a good user experience effect, the embodiment can also include well-known structures such as a communication bus, an interface, and the like, which should also be included in the protection scope of the present disclosure.

[0122] As Figure 4 A structural schematic diagram of an electronic device according to an embodiment of the present disclosure is shown. The structural schematic diagram shows a structure suitable for implementing the electronic device in the embodiments of the present disclosure. Figure 4 The electronic device shown is merely an example and should not impose any limitation on the functions and use range of the embodiments of the present disclosure.

[0123] As Figure 4 As shown, the electronic device can comprise a processing device (such as a central processing unit, a graphics processing unit, and the like), which can perform various appropriate actions and processes according to programs stored in a read-only memory (ROM) or loaded from a storage device into a random access memory (RAM). In the RAM, various programs and data required for operation of the electronic device are also stored. The processing device, the ROM, and the RAM are connected to each other through a bus. An input / output (I / O) interface is also connected to the bus.

[0124] Generally, the following devices can be connected to the I / O interface: input devices including, for example, sensors or visual information acquisition devices; output devices including, for example, display screens; storage devices including, for example, magnetic tapes, hard disks, and the like; and communication devices. The communication devices can allow the electronic device to communicate with other devices (such as edge computing devices) wirelessly or by wire to exchange data. Although Figure 4Electronic devices with various apparatuses are shown, but it should be understood that not all of the illustrated apparatuses are required, and that embodiments can be implemented with fewer or additional apparatuses.

[0125] In particular, according to embodiments of the present disclosure, the processes described above with reference to the flowcharts can be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program containing program code for performing the methods illustrated by the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication apparatus, or installed from a storage device, or installed from a ROM. When the computer program is executed by a processing apparatus, all or part of the steps of the dynamic trajectory digital modeling method of embodiments of the present disclosure are performed.

[0126] Detailed descriptions of the embodiments are described above with reference to the corresponding descriptions of the previous embodiments, and will not be repeated here.

[0127] The computer-readable storage medium according to the embodiments of the present disclosure has non-transitory computer-readable instructions stored thereon. When the non-transitory computer-readable instructions are run by a processor, all or part of the steps of the dynamic trajectory digital modeling method of the embodiments of the present disclosure described above are performed.

[0128] The computer-readable storage medium described above includes, but is not limited to, optical storage media (e.g., CD-ROM and DVD), magneto-optical storage media (e.g., MO), magnetic storage media (e.g., magnetic tape or mobile hard disk), media with built-in rewritable non-volatile memory (e.g., memory card), and media with built-in ROM (e.g., ROM cartridge).

[0129] Detailed descriptions of the embodiments can be referred to the corresponding descriptions of the previous embodiments, and will not be repeated here.

[0130] The basic principles of the present disclosure are described above in conjunction with specific embodiments, but it should be noted that the advantages, advantages, effects, etc. mentioned in the present disclosure are only examples and are not limiting, and these advantages, advantages, effects, etc. cannot be considered as the must-have of each embodiment of the present disclosure. In addition, the above-mentioned specific details are only for the purpose of example and for the purpose of understanding, and are not limiting, and the above-mentioned details do not limit the present disclosure to the must-use of the above-mentioned specific details.

[0131] In this disclosure, relational terms such as first and second and the like can be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The block diagram of the devices, apparatus, equipment, systems referred to in this disclosure is merely illustrative and not intended to imply the necessity or arrangement of the connections, arrangement, configuration as shown in the block diagram. As will be appreciated by those skilled in the art, the devices, apparatus, equipment, systems can be connected, arranged, configured in any manner. The words comprising, including, having and the like are to be open ended. As used in this document, the conjunction "or" is to be interpreted in the inclusive sense, i.e. as meaning one or the other, or both. As used in this document, the words "and" and "or" are to be interpreted as having the meaning indicated in the phrase "and / or". As used in this document, the word "such as" is to be interpreted as meaning "such as, but not limited to".

[0132] Also, as used in this document, the word "or" in the cases used to introduce an enumeration of several items, for example, a list of items, is to be interpreted in the inclusive sense, i.e. as meaning one or more, or any combination thereof, of the listed items. Additionally, the phrase "example of" as used in this document is not meant to be limiting in any way.

[0133] It is also important to note that the systems and methods of the present disclosure can be embodied in a variety of forms without departing from the spirit or essential characteristics thereof. Likewise, the disclosure is to be understood to include any alterations, modifications, revisions, or equivalent arrangements not herewith expressly disclosed but which are within the scope and spirit of the present disclosure.

[0134] Various changes, modifications and alterations in the teachings and techniques described herein can be made without departing from the teachings and techniques defined by the appended claims. Moreover, the scope of the claims of this disclosure is not limited to the specific aspects described above. Processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed that perform substantially the same function or achieve substantially the same result as the corresponding aspects described herein can be utilized. Accordingly, the appended claims include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.

[0135] The above description of the disclosed aspects is meant to be illustrative only and not limiting as to the scope of the disclosure. Many variations of these aspects, as well as alternate aspects, can be made without departing from the scope of the present disclosure. Other aspects of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the aspects disclosed herein. Therefore, it is intended that the disclosure not be limited to the aspects disclosed herein, but will include all aspects as can be made within the scope of the appended claims and their equivalents.

[0136] The foregoing description has been presented for the purposes of illustration and description. Furthermore, the description is not intended to limit the embodiments of the disclosure to the forms disclosed herein. Although the various example aspects and embodiments have been described herein with regard to particular aspects and embodiments, those skilled in the art will recognize that certain modifications, changes, substitutions, additions and sub-combinations can be made without departing from the spirit of the disclosure.

Claims

1. A method of digital modeling of dynamic trajectories, characterized in that, The method comprises the following steps: defining a time slice algorithm for dynamic trajectories; performing time slice processing on the obtained dynamic trajectory data with a time span using the defined time slice algorithm to obtain a dynamic grid set under each time slice; obtaining a line feature spatiotemporal encoding corresponding to the dynamic trajectory data based on the dynamic grid set and a time encoding set obtained based on the dynamic trajectory data, wherein the line feature spatiotemporal encoding is obtained based on a spatiotemporal subdivision algorithm of the line feature; obtaining digital modeling based on the line feature spatiotemporal encoding; the step of performing time slice processing on the obtained dynamic trajectory data with a time span using the defined time slice algorithm to obtain a dynamic grid set under each time slice comprises the following steps: determining an expression form of the dynamic trajectory data, so as to convert the dynamic trajectory data into an expression of an aerial line feature; performing data extraction on the dynamic trajectory data with the determined expression form under time slices to obtain key point data of the dynamic trajectory, and obtaining a key point set based on the key point data; performing line feature processing on the key point set under each time slice to obtain an aerial gridding set under the time slice; the step of determining an expression form of the dynamic trajectory data, so as to convert the dynamic trajectory data into an expression of an aerial line feature, comprises the following steps: each dynamic trajectory contains element information of a plurality of key points, and the element information of each key point is expressed by a group of data. After the time information in the dynamic trajectory is ignored, the dynamic trajectory data is converted into an expression form of a line feature; the expression of the aerial line feature comprises the following steps: the line feature is composed of a group of ordered point entities. After the point entities are expressed by aerial gridding, the node grid coordinates corresponding to the point entities are determined, and then the node grid coordinates are filled by using spatially adjacent grid surface elements, so as to obtain the expression form of the line feature; the expression form of the line feature comprises the following steps: a set formed by the subdivision elements of the sampling points and the filling elements between the sampling points, wherein the sampling points are obtained based on the point entities constituting the line feature; the attribute of the line feature is a set of sampling point attributes; the expression of the line feature comprises the following steps: ， ， ， wherein, is a line element, is a node grid coordinate, n is a natural number, and SU is a subdivision cell of a point entity at a corresponding subdivision level, is a subdivision code of the point data at the level, and A denotes an attribute of the element object, is an attribute of the line element, is a subdivision cell attribute; the node grid coordinates corresponding to the point entities are determined, and then the node grid coordinates are filled by using spatially adjacent grid surface elements; the step of determining the node grid coordinates corresponding to the point entities, and then filling the node grid coordinates by using spatially adjacent grid surface elements comprises the following steps: determining a key point set for aerial gridding expression according to the spatial coverage range of the line feature; determining a grid filling set between the key point sets according to a grid-based line feature grid set output algorithm; performing set union on all the calculated filling grid sets to obtain the aerial gridding expression structure of the line feature; wherein, is a set of key points, represents a spatial extent covered by the line element, represents a GeoSOT grid of nodes located within the extent, is an encoding of the key point coordinates.

2. The method of digitally modeling dynamic trajectories of claim 1, wherein, the step of determining the key point set for aerial gridding expression according to the spatial coverage range of the line feature comprises the following steps: ， wherein, with are key nodes of two adjacent line elements, is a mesh fill set, is a line element mesh set output algorithm.

3. The method of digitally modeling dynamic trajectories of claim 1, wherein, the step of determining the grid filling set between the key point sets according to the grid-based line feature grid set output algorithm comprises the following steps: ， wherein, are respectively longitude, latitude, height value and time value of the position in the spatial space; is a point entity in the corresponding subdivision level, is a subdivision encoding of the point data in the level, g identifies the corresponding mapping relationship between the subdivision encoding and the actual spatial body element, and f is a function of converting longitude, latitude, height and time into encoding, is a subdivision body element attribute, is a spatial point element, is a point attribute.

4. An electronic device, comprising: the line feature spatiotemporal encoding expression comprises the expression of a point feature, and the expression of the point feature comprises the following steps: The electronic device comprises: at least one processor; and a memory connected in communication with the at least one processor; wherein The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method of claim 1-3.

5. A computer readable storage medium, characterized in that, The computer readable storage medium stores computer instructions for causing a computer to perform the method of claim 1-3.

Images