Path unit generation method, device and system

Abstract

The present invention provides a path unit generation method, device, and system. The method comprises: selecting a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal; sorting the routes between the two parking areas using a link data table corresponding to each target parking area combination, and sequentially assigning target link numbers to target elements in a path unit sequence according to the sorted route order; storing each path unit sequence as row data in a database until the path unit sequence generated for the last target parking area combination is stored, and then outputting the updated database as a path unit configuration table. The path unit generation method, device, and system provided by the present invention enable path unit data to be generated by simply selecting different project files for operation, thereby improving the quality and efficiency of project document delivery.

Description

Technical Field

[0001] The present invention relates to the field of rail transit technology, and in particular to a path unit generation method, device and system. Background Art

[0002] With the development of the rail transit industry, the number of existing operating lines continues to increase, and related extensions are also being expanded. The path unit data involved in these new lines is generally pre-analyzed based on the operational characteristics of the lines to which they belong. This is then analyzed and researched using basic data such as electronic maps in a list-based comparison format. Configuration personnel then manually select path unit data that meets the requirements and use this data as the basis for forming the extended lines.

[0003] However, manual configuration is sufficient for simple maps. However, for complex maps, manual configuration is not only labor-intensive but also extremely difficult to analyze. Furthermore, manually generated data is prone to omissions and mismatches, which is not only time-consuming but also compromises data security. Therefore, the existing manual configuration of route unit data is labor-intensive and difficult for complex routes. Furthermore, excessive human input compromises data quality, increasing subsequent operational and management costs. Summary of the Invention

[0004] The present invention provides a path unit generation method, device and system, which are used to solve the defect of low efficiency caused by manual selection when adding new lines in the prior art.

[0005] The present invention provides a path unit generation method, comprising:

[0006] Screening out a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal;

[0007] sorting the routes between the two parking areas using the link data table corresponding to each target parking area combination, and assigning target link numbers to target elements in the path unit sequence in sequence according to the sorted route order;

[0008] Storing each of the path unit sequences as row data in a database until the path unit sequence generated corresponding to the last target parking area combination is stored, and outputting the updated database as a path unit configuration table;

[0009] Among them, the basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data, and the link data table includes at least the main line link number connected to the end point of the operating line; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; the path unit configuration table is used to enumerate the path units involved between any group of two adjacent parking areas.

[0010] According to a path unit generation method provided by the present invention, the target parking area combination is screened out from a plurality of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal, comprising:

[0011] Classify the parking areas in the parking area table to obtain a plurality of parking area sets having the same number as the categories;

[0012] Combining each parking area in each parking area set with other parking areas in the same set and parking areas in other sets in pairs to obtain the candidate parking area combinations;

[0013] Determining whether two parking areas included in each candidate parking area combination are adjacent to each other, and outputting the candidate parking area combination corresponding to the two adjacent parking areas as a target parking area combination;

[0014] The parking area table is obtained based on the electronic map data, and the parking area table at least includes parking area link numbers that correspond one-to-one to platforms.

[0015] According to a path unit generation method provided by the present invention, the following steps are performed to determine whether two parking areas included in each candidate parking area combination are adjacent:

[0016] Perform a recursive traversal of the links corresponding to the start and end points of the two parking areas included in the current candidate parking area combination to obtain the path link set between the two parking areas.

[0017] If the path link set does not include other parking areas except the current two parking areas, then the current two parking areas are determined to be adjacent parking areas;

[0018] If the path link set contains other parking areas besides the current two parking areas, the current two parking areas are determined not to be adjacent, and the next candidate parking area combination is evaluated for the two parking areas.

[0019] The starting and ending points link corresponding to any parking area are determined according to the link data table.

[0020] According to a path unit generation method provided by the present invention, the parking area set includes a first parking area set, a second parking area set, and a third parking area set;

[0021] Among them, the first parking area set is a parking area set formed after eliminating the parking areas of the yard section and the test line according to the computer interlocking data; the second parking area set is a parking area set formed by filtering out the platform parking area and the transfer rail parking area in the first parking area set according to the parking area table; the third parking area set is a parking area set formed by filtering out the turnaround parking area in the first parking area set according to the parking area table.

[0022] According to a path unit generation method provided by the present invention, the method uses the link set corresponding to each target parking area combination to sort the routes between the two parking areas, and assigns the target link numbers to the target elements in the path unit sequence in sequence according to the sorted route order, including:

[0023] Filtering the route set between the target parking area combination by determining whether the link numbers of the starting and ending points of the route are in the link set corresponding to the target parking area combination;

[0024] After determining the first route from the route set according to the link number of the parking area serving as the starting point in the target parking area combination, a downward search is performed based on the first route to obtain the route sequence.

[0025] According to a path unit generation method provided by the present invention, the path unit configuration table further includes a running direction of the target parking area combination, and one or more fields of a path priority, a reverse path attribute, and a path unit attribute of the path unit sequence;

[0026] Among them, the running direction of the target parking area combination is the running direction between two parking areas serving as the starting point and the ending point respectively in the target parking area combination obtained by querying the link data table; the path priority of the path unit sequence is determined according to the number of switches in the path unit sequence when it is determined that the target parking area combination corresponds to multiple groups of path unit sequences.

[0027] The present invention also provides a path unit generating device, comprising:

[0028] A basic data enumeration module is used to select a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining the parking areas recorded in the basic data set uploaded by the user terminal;

[0029] a path unit generation module, configured to sort the routes between the two parking areas using the link data table corresponding to each target parking area combination, and assign target link numbers to target elements in the path unit sequence in sequence according to the sorted route order;

[0030] An output module is configured to store each of the path unit sequences as row data in a database until the path unit sequence generated corresponding to the last target parking area combination is stored in the database, and then output the updated database as a path unit configuration table;

[0031] Among them, the basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data, and the link data table includes at least the main line link number connected to the end point of the operating line; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; the path unit configuration table is used to enumerate the path units involved between any group of two adjacent parking areas.

[0032] The present invention also provides a path unit generation system, comprising a remote terminal at a central node and a user terminal at an edge node;

[0033] The remote terminal is communicatively connected to the user terminal, and the remote terminal includes the path unit generating device as described above;

[0034] After the user terminal logs in based on the local browser, the remote terminal provides corresponding data services for generating path units according to the authority of the user terminal.

[0035] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, any one of the above-described path unit generation methods is implemented.

[0036] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which implements any of the above-mentioned path unit generation methods when executed by a processor.

[0037] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements any one of the above-mentioned path unit generation methods.

[0038] The path unit generation method, device, and system provided by the present invention screen out all adjacent parking area combinations based on the basic data set input by the user terminal, obtain the routes between the two adjacent parking areas based on the link data between the two, and sort them. The target link numbers corresponding to the current routes are sequentially assigned to the path unit sequence according to the route order. Finally, the path unit sequence of each adjacent parking area combination is converted into row data for storage to form a path unit configuration table. A set of related algorithm logic can be designed based on the production principles and rules of rail engineering data, so that it can be compatible with the engineering data of various cities. When applying, the user only needs to select different project files to operate, and the path unit data can be generated with one click, thereby improving the delivery quality and efficiency of engineering files, saving personnel input, and avoiding errors caused by manual production. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction is given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0040] Figure 1 It is a schematic flow chart of the path unit generation method provided by the present invention;

[0041] Figure 2 It is a structural diagram of the path unit generating device provided by the present invention;

[0042] Figure 3 It is a structural diagram of the path unit generation system provided by the present invention;

[0043] Figure 4 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0044] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0045] The terms "first," "second," and the like in this application are used to distinguish similar objects, and are not used to describe a particular order or precedence. It should be understood that the terms used in this manner are interchangeable where appropriate, so that the embodiments of this application can be implemented in orders other than those illustrated or described herein. Furthermore, the objects distinguished by "first," "second," and the like generally refer to a class of objects and do not limit the number of objects. For example, the first object may be one or more.

[0046] It should be understood that the terms used in this specification are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the present invention, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include the plural forms.

[0047] The terms “include” and “comprising” indicate the presence of described features, integers, steps, operations, elements and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.

[0048] Figure 1 FIG. 1 is a flow chart of the path unit generation method provided by the present invention. Figure 1 As shown, the path unit generation method provided by the embodiment of the present invention includes: step 101, screening out a target parking area combination from multiple groups of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal.

[0049] The basic data set includes at least electronic map data and computer interlocking data. The target parking area combination consists of two adjacent parking areas.

[0050] It should be noted that the execution subject of the path unit generation method provided in the embodiment of the present invention is a path unit generation device.

[0051] The path unit generation method provided in the embodiment of the present application is suitable for users to traverse and enumerate path unit combinations that can form a complete route from the massive operating route data contained in the electronic map based on actual needs through electronic devices.

[0052] The above-mentioned electronic devices can be implemented in various forms. For example, the electronic devices described in the embodiments of the present application may include mobile terminals such as mobile phones, smart phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), navigation devices, smart bracelets, smart watches, etc., and fixed terminals such as digital TVs, desktop computers, etc. Below, it is assumed that the electronic device is a mobile terminal. However, it will be understood by those skilled in the art that, in addition to components specifically for mobile purposes, the construction according to the embodiments of the present application can also be applied to fixed-type terminals.

[0053] It should be noted that before step 101 , the user can upload the basic data set of the corresponding region in the front-end page of the user terminal used according to actual task requirements to send a query request to the path unit generating device.

[0054] The basic data set includes at least electronic map data and computer interlocking data belonging to a certain area.

[0055] Electronic map data is used to present the topological structure of various rail transit network elements. Electronic map data is formed by representing indoor roads, indoor equipment, major place names, and other elements using multi-dimensional vector data, and then embedding them into the image data of the road network.

[0056] Computer interlocking data refers to the general term for logical variables involved in logical operations in the program of the interlocking equipment that controls the switches, routes and signals at the station, which at least includes the switch number, route number, signal number, etc.

[0057] Specifically, in step 101, the path unit generation device receives and responds to a query request issued by a user terminal. Based on the basic data set carried in the query request, all parking areas contained in the basic data set are combined in pairs to obtain multiple groups of candidate parking area combinations. These groups are then traversed and judged based on parking needs. The target parking area combination is screened out by determining whether two parking areas in the candidate parking area combination are adjacent.

[0058] Step 102: sort the routes between the two parking areas using the link data table corresponding to each target parking area combination, and assign target link numbers to target elements in the path unit sequence in sequence according to the sorted route order.

[0059] The link data table is obtained based on the electronic map data and includes at least the link number of the main line connected to the end point of the operating route. The target link number is the link number in the link data table that matches the route between two adjacent parking areas in the target parking area combination. The order of the elements in the path unit sequence corresponds one-to-one to the order of the routes.

[0060] It should be noted that the link data table is a subtable in the electronic map data. The link data table mainly records the link number (including the main line link and the side line link) connected to each end point, and the relevant attributes of the link segment corresponding to the link number.

[0061] Specifically, in step 102, the path unit generation device takes the two adjacent parking areas in each group of target parking areas as the end points, extracts the link section between the two adjacent parking areas from the link data table, and then filters out all the routes in this section according to the link numbers of the starting and ending points of the routes and sorts them.

[0062] During the sorting process, the link number corresponding to the currently sorted route in the link data table is used as the target link number according to the order of the routes, and is assigned to the path unit sequence in sequence, so that the last element in the current path unit sequence is used as the target element corresponding to the currently sorted route.

[0063] Finally, the number of elements in the formed path unit sequence is equal to the number of routes contained in the target parking area combination, and the arrangement order of the elements is the same as the route order of all routes in the target parking area combination.

[0064] Step 103: Store each of the path unit sequences as row data in a database until the path unit sequence generated corresponding to the last target parking area combination is stored, and then output the updated database as a path unit configuration table.

[0065] The path unit configuration table is used to enumerate the path units involved between any two adjacent parking areas.

[0066] Specifically, in step 103, the path unit generation device uses the adjacent parking areas included in each target parking area combination as starting parking areas and stores their numbers in the "Starting Parking Area" field to form a database index. Each element of the path unit sequence generated for the target parking area combination in step 102 is then sequentially added to the "Entry Number" field corresponding to the index, forming a complete row of data in the database. Once the path unit sequence generated for the last target parking area combination is stored in the database, the database consisting of multiple rows of data is output as a path unit configuration table.

[0067] Among them, the path unit configuration table can enumerate possible routes based on the current operating routes, so that when there is a need for route expansion in the future, by locking the parking area numbers corresponding to the starting and ending points of the route, all routes corresponding to the combination can be retrieved from the path unit configuration table.

[0068] The embodiment of the present invention filters out all adjacent parking area combinations based on the basic data set input by the user terminal, obtains the routes between the two adjacent parking areas based on the link data between the two, and sorts them, and assigns the target link numbers corresponding to the current routes to the path unit sequence in sequence according to the route order, and finally converts the path unit sequence of each adjacent parking area combination into row data for storage to form a path unit configuration table. A set of relevant algorithm logic can be designed based on the production principles and rules of rail engineering data, so that it can be compatible with the engineering data of various cities. When applying, the user only needs to select different project files for operation, and the path unit data can be generated with one click, thereby improving the delivery quality and efficiency of engineering files, saving personnel input, and avoiding errors caused by manual production.

[0069] Based on any of the foregoing embodiments, screening the target parking area combination from multiple candidate parking area combinations obtained by pairwise combining the parking areas recorded in the basic data set uploaded by the user terminal includes: classifying the parking areas in the parking area table to obtain multiple parking area sets equal to the number of categories.

[0070] The parking area table is obtained based on the electronic map data, and the parking area table at least includes parking area link numbers that correspond one-to-one to platforms.

[0071] It should be noted that the parking area table is a subtable in the electronic map data. The parking area table mainly records the stations to which they belong, as well as their corresponding destination numbers, parking area link numbers, and related attributes of the parking areas.

[0072] Specifically, in step 101, the path unit generation device classifies the parking areas according to the relevant attributes of the parking areas recorded in the parking area table, and integrates the parking areas with common relevant attributes into a parking area set belonging to the category. Ultimately, all parking areas can be divided into n parking area sets.

[0073] Each parking area in each parking area set is combined with other parking areas in the same set and parking areas in other sets in pairs to obtain the candidate parking area combinations.

[0074] Specifically, the path unit generation device combines the parking areas in each parking area set with other parking areas in the set except the current parking area, and also combines them with each parking area included in other parking area sets, so as to enumerate all candidate parking area combinations that meet the parking requirements of different routes.

[0075] It is determined whether the two parking areas included in each candidate parking area combination are adjacent to each other, so that the candidate parking area combination corresponding to the two adjacent parking areas is output as a target parking area combination.

[0076] Specifically, the path unit generation device determines whether the two parking areas included in each candidate parking area combination are adjacent. It can traverse each type of parking demand to determine whether the parking area is adjacent to other parking areas of the same or different types, and then output the corresponding adjacent parking areas as the target parking area combination.

[0077] This embodiment of the present invention categorizes parking areas based on a parking area table within a basic dataset. By pairing similar and different types of parking areas, it enumerates candidate parking area combinations for different parking requirements. Furthermore, based on the feasibility of the parking requirements, feasible target parking areas are selected from these candidate parking area combinations for path unit design of feasible routes. This algorithm, which accounts for some specific circumstances and correlations, designs an automated and versatile algorithm logic, ensuring that the majority of enumerated routes are directly applicable, improving data production efficiency and reducing human error.

[0078] Based on any of the above embodiments, the following steps are performed to determine whether the two parking areas included in each candidate parking area combination are adjacent: a link recursive traversal path query is performed using the start and end point links corresponding to the two parking areas included in the current candidate parking area combination to obtain a path link set between the two parking areas.

[0079] If the path link set does not include other parking areas except the current two parking areas, then it is determined that the current two parking areas are adjacent parking areas.

[0080] If the path link set includes other parking areas besides the current two parking areas, it is determined that the current two parking areas are not adjacent parking areas, and the judgment is continued on the two parking areas included in the next candidate parking area combination.

[0081] The starting and ending points link corresponding to any parking area are determined according to the link data table.

[0082] Specifically, the path unit generation device uses the parking area numbers of the two parking areas included in the current candidate parking area combination being determined to extract the starting and ending points of the links between the two parking areas from the link data table, perform a recursive traversal of the path link query, and integrate the path links between the two parking areas into a path link set. The set is then used to determine whether the two parking areas included in the current candidate parking area combination are adjacent:

[0083] If the path link set contains only two current parking areas in the current candidate parking area combination and no other parking areas, that is, if there are no other parking areas on the path, then the two current parking areas can be determined to be adjacent parking areas and can be selected as the target parking area combination for path unit division.

[0084] If the path link set contains only two current parking areas in the current candidate parking area combination and no other parking areas, that is, if there are no other parking areas on the path, then the two current parking areas are determined to be adjacent parking areas and can be selected as the target parking area combination for path unit division.

[0085] Otherwise, it is determined that the two current parking areas are not adjacent parking areas, and the above judgment process needs to be continued for the two parking areas included in the next candidate parking area combination.

[0086] This embodiment of the present invention uses a recursive link traversal query to determine whether two parking areas of the same or different categories are adjacent. This algorithm can traverse each parking demand type based on relevant logic, improving data generation efficiency.

[0087] Based on any of the above embodiments, the parking area set includes a first parking area set, a second parking area set, and a third parking area set.

[0088] Among them, the first parking area set is a parking area set formed after eliminating the parking areas of the yard section and the test line according to the computer interlocking data; the second parking area set is a parking area set formed by filtering out the platform parking area and the transfer rail parking area in the first parking area set according to the parking area table; the third parking area set is a parking area set formed by filtering out the turnaround parking area in the first parking area set according to the parking area table.

[0089] Specifically, parking areas can be divided into three categories according to their use:

[0090] The first parking area set mainly includes a parking area set formed by judging based on the interlocking attributes in the computer interlocking data, so as to eliminate parking areas whose interlocking attributes meet the scenarios such as the field section and the test line from all the parking areas covered in the parking area table.

[0091] The second parking area set is obtained by distinguishing between platforms and transfer tracks based on the bit value recorded in the parking area table. Based on this, the parking areas belonging to platforms and transfer tracks that have been screened out are integrated on the basis of the first parking area set.

[0092] The third parking area set determines whether a parking spot belongs to a turnaround parking area based on the parking spot number recorded in the parking area table, and integrates elements belonging to the turnaround parking area into a set.

[0093] The embodiment of the present invention divides parking areas into different categories and uses parking areas of the same or different categories as route starting and ending points to generalize various parking demands, thereby improving the efficiency of data production.

[0094] Based on any of the above embodiments, the link set corresponding to each target parking area combination is used to sort the routes between the two parking areas, and the target link numbers are assigned to the target elements in the path unit sequence in sequence according to the sorted route order, including: using whether the starting and ending link numbers of the routes are in the link set corresponding to the target parking area combination to filter out the route set between the target parking area combinations.

[0095] Specifically, in step 102, the path unit generation device determines the route based on the target parking area combination screened in step 101 and the link set between the two parking areas contained therein. The process is as follows:

[0096] According to the link numbers of the starting and ending points of any route, if the starting and ending points of the route are both in the link set between two parking areas, that is, the route is between these adjacent parking areas, then all the routes in this interval are screened out, and after the route screening, the route set belonging to the target parking area combination is obtained.

[0097] The basis for screening the routes is to delete routes that do not meet the rules according to actual needs, and the embodiment of the present invention does not make any specific limitation on this.

[0098] For example, route screening can be performed based on the rule that the intermediate route cannot be a reentry route.

[0099] For example, route screening can be performed based on the rule that there cannot be any forks in the middle of the route.

[0100] After determining the first route from the route set according to the link number of the parking area serving as the starting point in the target parking area combination, a downward search is performed based on the first route to obtain the route sequence.

[0101] Specifically, the path unit generation device uses the link number of the parking area serving as the starting point in the target parking area combination as an index, takes the route corresponding to the link number of the parking area serving as the starting point matched from the route set as the first route, and then repeats the above operation to search downward for the link number, and uses the order in which the routes are found as the route order to perform corresponding route sorting.

[0102] This embodiment of the present invention compares the link numbers of the starting and ending points of a route to a link set to obtain all routes between adjacent parking areas. The first route is determined by the link number of the parking area at the starting point, and then all routes in the route set are sorted to form a path unit sequence in the order of the routes. This method can design a set of relevant algorithms based on the principles and rules of track engineering data production, reducing problems caused by manual production and ensuring traceability throughout the entire process.

[0103] Based on any of the above embodiments, the path unit configuration table further includes a running direction of the target parking area combination, and one or more fields of the path priority, reverse path attribute and path unit attribute of the path unit sequence.

[0104] Among them, the running direction of the target parking area combination is the running direction between two parking areas serving as the starting point and the ending point respectively in the target parking area combination obtained by querying the link data table; the path priority of the path unit sequence is determined according to the number of switches in the path unit sequence when it is determined that the target parking area combination corresponds to multiple groups of path unit sequences.

[0105] Specifically, the path unit generating device may also add other attribute fields to the index corresponding to the target parking area combination according to the user's own needs during the process of generating the path unit configuration table.

[0106] The additional attribute fields can be roughly divided into overall attributes for the line and individual attributes for the path units in the line.

[0107] Optionally, the additional attribute field can be the running direction of the target parking area combination. In this case, it is necessary to query the relationship between the system-defined logical direction and the uplink and downlink directions of the link data table according to the corresponding attributes of the starting parking area, and fill the queried content into this field to represent the running direction between two adjacent parking areas in the target parking area combination.

[0108] Optionally, the additional attribute field may be the path priority of the path unit sequence. If there are multiple paths between two adjacent parking areas (ie, multiple groups of path unit sequences exist), the path priority is set according to the number of switches contained in the path.

[0109] Among them, the number of switches and the path priority are negatively correlated, that is, the fewer the number of switches, the higher the path priority. The priority division in the embodiment of the present invention is not specifically limited.

[0110] For example, the priority of a path with a small number of switches can be set to default, with a path priority value of 0x55 assigned to it, to represent the default path. The priority of a path with a large number of switches can be set to non-default, with a path priority value of 0xAA assigned to it, to represent the non-default path.

[0111] Optionally, the additional attribute field may be a reverse path attribute. In this case, it is necessary to extract from the basic data set whether each unit in the path unit sequence is reverseable. The reverse path attribute is assigned a default value of 0x55 to indicate that each path unit is reverseable.

[0112] Optionally, the additional attribute field may be a path unit attribute. In this case, the attributes of each unit in the path unit sequence need to be extracted from the basic data set. The path unit attribute is filled in as 0x00 by default.

[0113] It is understandable that after step 103, the path unit configuration table in which the data is structured already contains all the necessary data. Structural matching is performed according to the output Excel data structure, and an output model is created in memory for front-end visualization.

[0114] In addition, the download path of the Excel file generated by the structured model output can also be provided to the user terminal for downloading and use.

[0115] The embodiment of the present invention expands and develops the fields of the path unit configuration table according to the actual needs of users, realizes flexible database matching, upgrades the data structure, and improves scalability.

[0116] Figure 2 Schematic diagram of the structure of the path unit generating device provided by the present invention. Figure 2 As shown, the device includes a basic data enumeration module 210, a path unit generation module 220 and an output module 230, wherein:

[0117] The basic data enumeration module 210 is configured to select a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining the parking areas recorded in the basic data set uploaded by the user terminal.

[0118] The path unit generation module 220 is used to sort the routes between the two parking areas using the link data table corresponding to each target parking area combination, and assign target link numbers to target elements in the path unit sequence in sequence according to the sorted route order.

[0119] The output module 230 is configured to store each path unit sequence as row data in a database until the path unit sequence generated corresponding to the last target parking area combination is stored, and then output the updated database as a path unit configuration table.

[0120] Among them, the basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data, and the link data table includes at least the main line link number connected to the end point of the operating line; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; the path unit configuration table is used to enumerate the path units involved between any group of two adjacent parking areas.

[0121] Specifically, the basic data enumeration module 210, the path unit generation module 220 and the output module 230 are electrically connected in sequence.

[0122] The basic data enumeration module 210 receives and responds to a query request from a user terminal. Based on the basic data set carried in the query request, it combines all parking areas contained in the basic data set into pairs to obtain multiple groups of candidate parking area combinations. The modules then traverse and judge the groups based on parking demand, and select the target parking area combination by determining whether two parking areas in the candidate parking area combination are adjacent.

[0123] Path unit generation module 220 uses two adjacent parking areas in each target parking area combination as endpoints. It extracts the link segment between the two adjacent parking areas from the link data table. It then selects and sorts all routes within this segment based on the start and end link numbers of the routes. The resulting path unit sequence has the same number of elements as the number of routes in the target parking area combination, and the elements are arranged in the same order as the routes in the target parking area combination.

[0124] Output module 230 treats each target parking area combination as a starting point parking area and stores the numbers of each adjacent parking area in the "Starting Point Parking Area" field, forming a database index. Each element of the path unit sequence generated for the target parking area combination in step 102 is then sequentially added to the "Entry Number" field corresponding to the index, forming a complete row of data in the database. Once the path unit sequence generated for the last target parking area combination is stored in the database, the database consisting of multiple rows of data is output as a path unit configuration table.

[0125] Optionally, the basic data enumeration module 210 includes a parking area classification unit, a parking area combination screening unit, and an adjacent parking area judgment unit, wherein:

[0126] The parking area classification unit is used to classify the parking areas in the parking area table to obtain a plurality of parking area sets having the same number as the categories.

[0127] The parking area combination screening unit is configured to combine each parking area in each parking area set with other parking areas in the same set and parking areas in other sets in pairs to obtain the candidate parking area combination.

[0128] The adjacent parking area determination unit is configured to determine whether two parking areas included in each candidate parking area combination are adjacent to each other, so as to output the candidate parking area combination corresponding to the two adjacent parking areas as a target parking area combination.

[0129] The parking area table is obtained based on the electronic map data, and the parking area table at least includes parking area link numbers that correspond one-to-one to platforms.

[0130] Optionally, the adjacent parking area judgment unit is specifically configured to perform a link recursive traversal path query using the start and end point links corresponding to the two parking areas included in the current candidate parking area combination to obtain a path link set between the two parking areas.

[0131] If the path link set does not include other parking areas except the current two parking areas, then it is determined that the current two parking areas are adjacent parking areas.

[0132] If the path link set includes other parking areas besides the current two parking areas, it is determined that the current two parking areas are not adjacent parking areas, and the judgment is continued on the two parking areas included in the next candidate parking area combination.

[0133] The starting and ending points link corresponding to any parking area are determined according to the link data table.

[0134] Optionally, the parking area set includes a first parking area set, a second parking area set, and a third parking area set;

[0135] Among them, the first parking area set is a parking area set formed after eliminating the parking areas of the yard section and the test line according to the computer interlocking data; the second parking area set is a parking area set formed by filtering out the platform parking area and the transfer rail parking area in the first parking area set according to the parking area table; the third parking area set is a parking area set formed by filtering out the turnaround parking area in the first parking area set according to the parking area table.

[0136] Optionally, the path unit generation module 220 includes a path acquisition unit and a path sorting unit, wherein:

[0137] The route acquisition unit is used to filter out the route set between the target parking area combination by determining whether the link numbers of the starting and ending points of the route are in the link set corresponding to the target parking area combination.

[0138] The route sorting unit is used to determine the first route from the route set according to the link number of the parking area serving as the starting point in the target parking area combination, and then search downward according to the first route to obtain the route order.

[0139] Optionally, the path unit configuration table further includes a running direction of the target parking area combination, and one or more fields of a path priority, a reverse path attribute, and a path unit attribute of the path unit sequence;

[0140] Among them, the running direction of the target parking area combination is the running direction between two parking areas serving as the starting point and the ending point respectively in the target parking area combination obtained by querying the link data table; the path priority of the path unit sequence is determined according to the number of switches in the path unit sequence when it is determined that the target parking area combination corresponds to multiple groups of path unit sequences.

[0141] The path element generation device provided in an embodiment of the present invention is used to execute the path element generation method of the present invention. Its implementation is consistent with the implementation of the path element generation method provided in the present invention and can achieve the same beneficial effects, and will not be described in detail here.

[0142] The embodiment of the present invention filters out all adjacent parking area combinations based on the basic data set input by the user terminal, obtains the routes between the two adjacent parking areas based on the link data between the two, and sorts them, and assigns the target link numbers corresponding to the current routes to the path unit sequence in sequence according to the route order, and finally converts the path unit sequence of each adjacent parking area combination into row data for storage to form a path unit configuration table. A set of relevant algorithm logic can be designed based on the production principles and rules of rail engineering data, so that it can be compatible with the engineering data of various cities. When applying, the user only needs to select different project files for operation, and the path unit data can be generated with one click, thereby improving the delivery quality and efficiency of engineering files, saving personnel input, and avoiding errors caused by manual production.

[0143] Figure 3 Schematic diagram of the structure of the path unit generation system provided by the present invention. Figure 3 As shown, the system includes a remote terminal 310 at a central node and a user terminal 320 at an edge node.

[0144] The remote terminal 310 is in communication with the user terminal 320 , and the remote terminal 310 includes the path unit generating device as described above.

[0145] After the user terminal 320 logs in based on the local browser, the remote terminal 320 provides corresponding data services for generating path units according to the authority of the user terminal 310 .

[0146] Specifically, the path unit generation system consists of a remote terminal 310 located at a central computing node and multiple user terminals 320 located at edge computing nodes. Remote terminal 310 is developed and deployed as a server using a B / S architecture, with relevant data stored on the server. Users with the required permissions can log in and use the system using the local browser of user terminal 310.

[0147] According to actual task requirements, after successfully logging into the front-end page on the user terminal 320 used by the user, the user can upload the basic data set of the corresponding region to send a query request to the remote terminal 310.

[0148] The remote terminal 310 receives and responds to the query request sent by the user terminal, combines all parking areas included in the basic data set carried in the query request into pairs, obtains multiple groups of candidate parking area combinations, and then traverses and judges them based on parking demand. The target parking area combination is screened out by determining whether two parking areas in the candidate parking area combination are adjacent.

[0149] Next, the two adjacent parking areas in each target parking area combination are used as endpoints. The link segment between the two adjacent parking areas is extracted from the link data table. All routes within this segment are then filtered and sorted based on their starting and ending link numbers. During the sorting process, the link numbers corresponding to the currently sorted routes in the link data table are used as target link numbers and are sequentially assigned to the path unit sequence, with the last element in the current path unit sequence being the target element corresponding to the currently sorted route.

[0150] Finally, the adjacent parking areas included in each target parking area combination are designated as starting parking areas, and their numbers are stored in the "Starting Parking Area" field to form a database index. Each element of the path unit sequence generated for the target parking area combination in the previous step is then sequentially added to the "Entry Number" field corresponding to the index, forming a complete row of data in the database. Once the path unit sequence generated for the last target parking area combination is stored in the database, the database consisting of multiple rows of data is output as a path unit configuration table.

[0151] Among them, the path unit configuration table can enumerate possible routes based on the current operating routes, so that when there is a need for route expansion in the future, by locking the parking area numbers corresponding to the starting and ending points of the route, all routes corresponding to the combination can be retrieved from the path unit configuration table.

[0152] The embodiment of the present invention filters out all adjacent parking area combinations based on the basic data set input by the user terminal, obtains the routes between the two adjacent parking areas based on the link data between the two, and sorts them, and assigns the target link numbers corresponding to the current routes to the path unit sequence in sequence according to the route order, and finally converts the path unit sequence of each adjacent parking area combination into row data for storage to form a path unit configuration table. A set of relevant algorithm logic can be designed based on the production principles and rules of rail engineering data, so that it can be compatible with the engineering data of various cities. When applying, the user only needs to select different project files for operation, and the path unit data can be generated with one click, thereby improving the delivery quality and efficiency of engineering files, saving personnel input, and avoiding errors caused by manual production.

[0153] Figure 4 An example of a physical structure diagram of an electronic device is shown below. Figure 4 As shown, the electronic device may include: a processor 410, a communication interface 420, a memory 430 and a communication bus 440, wherein the processor 410, the communication interface 420 and the memory 430 communicate with each other via the communication bus 440. The processor 410 may call the logic instructions in the memory 430 to execute the path unit generation method, which includes: screening out a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining the parking areas recorded in the basic data set uploaded by the user terminal; sorting the routes between the two parking areas using the link data table corresponding to each target parking area combination, and assigning the target link numbers to the target elements in the path unit sequence in sequence according to the sorted route order; storing each path unit sequence as row data in the database, until the path unit sequence generated corresponding to the last target parking area combination is completed and stored in the database, and the updated database is used as Output is a path unit configuration table; wherein, the basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data, and the link data table includes at least the main line link number connected to the end point of the operating line; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; the path unit configuration table is used to enumerate the path units involved between any group of two adjacent parking areas.

[0154] In addition, the logic instructions in the above-mentioned memory 430 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0155] On the other hand, the present invention also provides a computer program product, which includes a computer program. The computer program can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the path unit generation method provided by the above methods, which includes: screening out a target parking area combination from multiple groups of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal; using a link data table corresponding to each target parking area combination to sort the routes between the two parking areas, and assigning target link numbers to target elements in a path unit sequence in sequence according to the sorted route order; storing each path unit sequence as row data in a database until the last target After the path unit sequence generated corresponding to the target parking area combination is completed and stored in the database, the updated database is output as a path unit configuration table; wherein, the basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data, and the link data table includes at least the main line link number connected to the end point of the operating line; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; the path unit configuration table is used to enumerate the path units involved between any group of two adjacent parking areas.

[0156] In another aspect, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the path unit generation method provided by the above-mentioned methods, the method comprising: screening out a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal; sorting the routes between the two parking areas using a link data table corresponding to each target parking area combination, and assigning target link numbers to target elements in a path unit sequence in sequence according to the order of the routes obtained by sorting; storing each path unit sequence as row data in a database until the path generated corresponding to the last target parking area combination is obtained. After the unit sequence is completed and stored in the database, the updated database is output as a path unit configuration table; wherein, the basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data, and the link data table includes at least the main line link number connected to the end point of the operating line; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; the path unit configuration table is used to enumerate the path units involved between any group of two adjacent parking areas.

[0157] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, i.e., they may be located in one location or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of the present embodiment. Persons of ordinary skill in the art will be able to understand and implement the present invention without inventive effort.

[0158] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, or of course, by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the existing technology can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or certain parts of the embodiments.

[0159] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A path unit generation method, characterized in that: include: Screening out a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal; sorting the routes between the two parking areas using the link data table corresponding to each target parking area combination, and assigning target link numbers to target elements in the path unit sequence in sequence according to the sorted route order; Storing each of the path unit sequences as row data in a database until the path unit sequence generated corresponding to the last target parking area combination is stored, and outputting the updated database as a path unit configuration table; The basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data and includes at least the main line link number connected to the end point of the operating route; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; and the path unit configuration table is used to enumerate the path units involved between any set of two adjacent parking areas. The step of selecting a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal comprises: Classify the parking areas in the parking area table to obtain a plurality of parking area sets having the same number as the categories; Combining each parking area in each parking area set with other parking areas in the same set and parking areas in other sets in pairs to obtain the candidate parking area combinations; Determining whether two parking areas included in each candidate parking area combination are adjacent to each other, and outputting the candidate parking area combination corresponding to the two adjacent parking areas as a target parking area combination; The parking area table is obtained based on the electronic map data, and the parking area table at least includes parking area link numbers that correspond one-to-one to platforms.

2. The path unit generation method according to claim 1, characterized in that: The following steps are performed to determine whether two parking areas included in each candidate parking area combination are adjacent: Perform a recursive traversal of the links corresponding to the start and end points of the two parking areas included in the current candidate parking area combination to obtain the path link set between the two parking areas. If the path link set does not include other parking areas except the current two parking areas, then the current two parking areas are determined to be adjacent parking areas; If the path link set contains other parking areas besides the current two parking areas, the current two parking areas are determined not to be adjacent, and the next candidate parking area combination is evaluated for the two parking areas. The starting and ending points link corresponding to any parking area are determined according to the link data table.

3. The path unit generation method according to claim 1, wherein: The parking area set includes a first parking area set, a second parking area set, and a third parking area set; Among them, the first parking area set is a parking area set formed after eliminating the parking areas of the yard section and the test line according to the computer interlocking data; the second parking area set is a parking area set formed by filtering out the platform parking area and the transfer rail parking area in the first parking area set according to the parking area table; the third parking area set is a parking area set formed by filtering out the turnaround parking area in the first parking area set according to the parking area table.

4. The path unit generation method according to claim 1, characterized in that: The method of sorting the routes between the two parking areas using the link data table corresponding to each target parking area combination and assigning target link numbers to target elements in the path unit sequence in sequence according to the sorted route order includes: Filtering the route set between the target parking area combination by determining whether the link numbers of the starting and ending points of the route are in the link set corresponding to the target parking area combination; After determining the first route from the route set according to the link number of the parking area serving as the starting point in the target parking area combination, a downward search is performed based on the first route to obtain the route sequence.

5. The path unit generation method according to any one of claims 1 to 4, characterized in that: The path unit configuration table further includes a running direction of the target parking area combination, and one or more fields of a path priority, a reverse path attribute, and a path unit attribute of the path unit sequence; Among them, the running direction of the target parking area combination is the running direction between two parking areas serving as the starting point and the ending point respectively in the target parking area combination obtained by querying the link data table; the path priority of the path unit sequence is determined according to the number of switches in the path unit sequence when it is determined that the target parking area combination corresponds to multiple groups of path unit sequences.

6. A path unit generating device, characterized in that: include: A basic data enumeration module is used to select a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining the parking areas recorded in the basic data set uploaded by the user terminal; a path unit generation module, configured to sort the routes between the two parking areas using the link data table corresponding to each target parking area combination, and assign target link numbers to target elements in the path unit sequence in sequence according to the sorted route order; An output module is configured to store each of the path unit sequences as row data in a database until the path unit sequence generated corresponding to the last target parking area combination is stored in the database, and then output the updated database as a path unit configuration table; The basic data set includes at least electronic map data and computer interlocking data; the target parking area combination consists of two adjacent parking areas; the link data table is obtained based on the electronic map data and includes at least the main line link number connected to the end point of the operating route; the target link number is the link number in the link data table that matches the route between the two adjacent parking areas in the target parking area combination; the element arrangement order of the path unit sequence corresponds one-to-one to the route order; and the path unit configuration table is used to enumerate the path units involved between any set of two adjacent parking areas. The step of selecting a target parking area combination from a plurality of candidate parking area combinations obtained by pairwise combining parking areas recorded in a basic data set uploaded by a user terminal comprises: Classify the parking areas in the parking area table to obtain a plurality of parking area sets having the same number as the categories; Combining each parking area in each parking area set with other parking areas in the same set and parking areas in other sets in pairs to obtain the candidate parking area combinations; Determining whether two parking areas included in each candidate parking area combination are adjacent to each other, and outputting the candidate parking area combination corresponding to the two adjacent parking areas as a target parking area combination; The parking area table is obtained based on the electronic map data, and the parking area table at least includes parking area link numbers that correspond one-to-one to platforms.

7. A path unit generation system, characterized in that: It includes remote terminals at the central node and user terminals at the edge node; The remote terminal is communicatively connected to the user terminal, and the remote terminal includes the path unit generating device according to claim 6; After the user terminal logs in based on the local browser, the remote terminal provides corresponding data services for generating path units according to the authority of the user terminal.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the path unit generation method according to any one of claims 1 to 5 is implemented.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the path unit generation method according to any one of claims 1 to 5 is implemented.

Images