Intelligent product version control method based on rail transit automatic train monitoring system

Abstract

The invention discloses an intelligent product version control method based on a rail transit automatic train monitoring system, and relates to the technical field of rail transit, and the method comprises the following steps: S1, creating a product version node list Listt according to all product version information of the automatic train monitoring system; the method is characterized by comprising the following steps of: constructing VersionInfogt ; step S2, a product version node list Listlt is obtained; the method is characterized by comprising the following steps of: constructing VersionInfogt Creating a product version control chart as input data; and S3, performing product version retrieval in the product version control chart by using a product version retrieval algorithm. According to the method, the iterative upgrading process of the product version can be completely controlled, and whether the specific product version is within the given product version range or not can be flexibly and efficiently retrieved and judged. In the research and development process of product iteration upgrading of the ATS subsystem, the control method can achieve flexible and efficient product version management, and the research and development efficiency of the ATS subsystem and the vitality of products are improved.

Description

Technical Field

[0001] This invention relates to the field of rail transit technology, and more specifically to an intelligent product version control method based on a rail transit automatic train monitoring system. Background Technology

[0002] Automatic Train Supervision (ATS) is an important component of rail transit signaling systems. It ensures efficient, safe, and reliable operation of rail transit by monitoring train operation status in real time, optimizing scheduling plans, ensuring train operation safety, improving operational efficiency, and working in conjunction with other subsystems.

[0003] In the development process of ATS subsystem product iteration and upgrade, how to manage product versions reasonably and efficiently, so as to realize the iteration relationship between product versions and to flexibly and efficiently confirm its version branch path information based on the product version number, is crucial in the ATS subsystem development life cycle.

[0004] Therefore, there is an urgent need for an intelligent product version control method based on the automatic train monitoring system for rail transit. Summary of the Invention

[0005] In order to overcome the defects in the prior art, the present invention discloses an intelligent product version control method based on a rail transit automatic train monitoring system, so as to realize product version management and efficient retrieval and confirmation of version number.

[0006] To achieve the above objectives, the technical solution adopted by the present invention is as follows: A method for intelligent product version control based on an automated rail transit train monitoring system includes the following steps: I. Creating a Product Version Node List Step S1: Create a product version node list (List) based on all product version information of the automatic train monitoring system. <versioninfo>; Preferably, step S1 includes: Step S11: Create a product version node Version object based on the product basic information; wherein, the product basic information includes the version number information and inheritance relationship information of each product, and each Version object has at least version number attribute and previous version number attribute information; Step S12: Traverse all product version node Version objects, create product version node VersionInfo objects with inheritance relationships, and construct a list of product version nodes with inheritance relationships. <versioninfo>.

[0007] II. Product Version Control Chart Creation Step S2: List the product version nodes. <versioninfo>Use the input data to create a product version control chart; Preferably, step S2 includes: Step S21: Traverse the product version node list List <versioninfo>Process the preceding version number of each product version node. If the preceding version number information is empty, set a fixed default value of "null". Step S22: Based on the processing result of step S21, traverse the product version node list List. <versioninfo>If the product version number is all uppercase, then set that product version to belong to the main branch, create a new product version node (VersionNode) object, and then create a mapping structure (Map) for the product version nodes.<String,VersionNode> ; Step S23: Based on the processing result of step S22, traverse the product version node list List. <versioninfo>If the product version node has a predecessor version number, then the mapping structure Map will be used according to its predecessor version number.<String,VersionNode> Find the previous version node and add the current version node to the list of child nodes of the previous version node; Step S24: Based on the processing result of step S23, traverse the mapping structure Map.<String,VersionNode> If the preceding version number of the product version node (VersionNode) is "null", then the product version node is the starting node of the product version control chart, and the product version control chart is now created.

[0008] Preferably, in step S22, the attributes of the VersionNode object include: previous version number, version number, whether it is a main branch flag, and a list of child nodes; the product version node mapping structure is Map.<String,VersionNode> Its key is the product version number, and its value is a VersionNode object.

[0009] Preferably, in step S2, the product version control chart includes: Product version control graphs are directed acyclic graphs. The edges of the graph are directed, representing the inheritance relationship between versions. Each version node has an edge pointing to its predecessor version node. A node in the product version control chart has multiple branches, indicating that a product version has multiple subsequent versions. Nodes in the product version control chart are unique and will not appear repeatedly; The product version control chart is scalable, allowing new version nodes to be added as the product version iterates and upgrades.

[0010] III. Product Version Search Step S3: Use the product version retrieval algorithm to perform product version retrieval in the product version control chart.

[0011] Preferably, in step S3, the product version retrieval algorithm determines whether a specific product version number belongs to the product version range of the product start version number and the product end version number; when a specific product version number, product start version number and product end version number are input, the retrieval nodes of the product version retrieval algorithm include the nodes and their child nodes on the path from the product start version node to the product end version node; the product version retrieval algorithm is applicable to different retrieval scenarios according to the different forms of its input product end version number parameter.

[0012] Preferably, step S3 is applicable to different retrieval scenarios, including: if no specific product end version number is entered, the retrieval algorithm starts from the input product start version node, traverses the entire product version control graph, traverses the nodes and their child nodes on the search path, until all reachable nodes are traversed, and then determines whether the specific product version number is within the range of the product version.

[0013] Preferably, step S3 is applicable to different retrieval scenarios, including: if a unique product termination version number is input, the retrieval algorithm starts from the input product start version node, traverses the product version control graph, traverses and searches for nodes and their child nodes on the path from the product start version node to the product termination version node, and then determines whether the specific product version number is within the range of the product version.

[0014] Preferably, step S3 is applicable to different retrieval scenarios, including: if multiple product termination version numbers are input, the retrieval algorithm starts from the input product start version node, traverses the product version control graph, traverses and searches for nodes and all child nodes on the path from the product start version node to each product termination version node, and then determines whether a specific product version number is within the product version range.

[0015] Preferably, step S3 includes: A1. Based on the product's initial version number, traverse the product version control chart to find the corresponding product initial version node; A2. In the product version control graph, traverse and find the nodes on the path from the product start version node to the end version node of each product. A3. In the product version control chart, traverse and find all child nodes of the node obtained in step A2, and keep each node unique. A4. Based on the node obtained in step A3, determine whether the specific product version number is within the range of the product version.

[0016] The beneficial effects of this invention are: 1. This invention designs an intelligent product version control method based on a rail transit automatic train monitoring system, which can not only completely control the product version iteration and upgrade process, but also flexibly and efficiently search and determine whether a specific product version is within a given product version range.

[0017] 2. This invention designs a method for creating a product version control graph. The graph has the characteristics of being directed acyclic, each node in the graph is unique, and there are no restrictions on the product version number, which can adapt to any form of naming convention requirements.

[0018] 3. This invention designs an efficient retrieval algorithm that follows product management rules. It can flexibly and efficiently retrieve and determine whether a specific version number is within the specified product version range. Moreover, the algorithm is universal and adaptable to similar application scenarios involving product version control.

[0019] 4. This invention designs a method for creating product version control charts and a retrieval algorithm, both of which have good scalability. Attached Figure Description

[0020] Figure 1 This is a flowchart of the intelligent product version control method of the present invention; Figure 2 This diagram illustrates the first and second traversals during the creation of the product version control chart for this invention. Figure 3 This diagram illustrates the third and fourth traversals during the creation of the product version control chart for this invention. Figure 4 This is a schematic diagram of the intelligent retrieval algorithm process of the present invention; Figure 5 This is a schematic diagram illustrating an application example of the present invention. Detailed Implementation

[0021] The following will provide a clear and complete description of the concept, specific structure, and technical effects of the present invention in conjunction with the embodiments and accompanying drawings, so as to fully understand the purpose, features, and effects of the present invention.

[0022] Example 1 A method for intelligent product version control based on a rail transit automatic train monitoring system, such as Figure 1 As shown, the control method includes: structuring the product version information of the automatic train monitoring system, creating a product version control chart based on the product version information, and a product version retrieval algorithm process.

[0023] The structured information of the automatic train monitoring system product version includes: Step S1: Create a structured storage structure List based on the version information of all products in the Automatic Train Monitoring System. <versioninfo>.

[0024] Step S1 includes the following steps: Step S11: Based on the product's basic information, including the version number information and inheritance relationship information of each product, create a product version node Version object. Each Version object must have at least a version number attribute and a predecessor version number attribute. Other attributes can be extended.

[0025] Step S12: Traverse all product version node Version objects, create product version node VersionInfo objects with inheritance relationships, and construct a list of product version nodes with inheritance relationships. <versioninfo>.

[0026] The creation of a product version control chart based on product version information includes: Step S2: Create the product version node list (List) created in step S1. <versioninfo>Use the input data to create a product version control chart.

[0027] Step S2 includes the following steps: Step S21: Traverse the product version node list List <versioninfo>Process the preceding version number of each product version node. If the preceding version number information is empty, set a fixed default value of "null".

[0028] Step S22: Based on the processing result of step S21, traverse the product version node list List. <versioninfo>If the product version number is all uppercase, then set that product version to belong to the main branch, create a new product version node (VersionNode) object, and then create a mapping structure (Map) for the product version nodes.<String, VersionNode> .

[0029] Step S23: Based on the processing result of step S22, traverse the product version node list List. <versioninfo>If the product version node has a predecessor version number, then it is used in the Map based on its predecessor version number.<String,VersionNode> Find the previous version node in the mapping structure and add the current version node to the list of child nodes of the previous version node.

[0030] Step S24: Based on the processing results of step S23, traverse the Map.<String, VersionNode> In the mapping structure, if the preceding version number of the product version node (VersionNode) is "null", then the product version node is the starting node (root node) of the product version control graph, and the product version control graph is now created.

[0031] The VersionNode object in step S22 must have at least four attributes: the previous version number, the current version number, a flag indicating whether it is a main branch, and a list of child nodes. The product version node mapping structure is a Map.<String,VersionNode> Its key is the product version number, and its value is a VersionNode object.

[0032] The product version control chart created in step S24 has the following characteristics: (1) Product version control graph is a directed acyclic graph. The edges of the graph are directional, representing the inheritance relationship between versions. Each version node has an edge pointing to its predecessor version node.

[0033] (2) The nodes in the diagram can have multiple branches, indicating that a product version can have multiple subsequent versions.

[0034] (3) The nodes in the diagram are unique and will not appear repeatedly, ensuring the uniqueness of the product version number.

[0035] (4) The graph structure has good scalability. New version nodes can be added according to the iterative upgrade of product versions without affecting the integrity of the structure and the applicability of the retrieval algorithm.

[0036] The product version retrieval algorithm process includes: Step S3: The product version retrieval algorithm primarily addresses the problem of quickly determining whether a specific product version number falls within the range of the product's start version number and end version number. Given a specific product version number, start version number, and end version number, the retrieval nodes of the algorithm include the nodes and their child nodes along the path from the start version node to the end version node. Depending on the form of the input end version number parameter, the product version retrieval algorithm is applicable to three different retrieval scenarios.

[0037] Step S3 is applicable to the following retrieval scenarios: Step S31: If no specific product end version number is entered, the retrieval algorithm starts from the input product start version node, traverses the entire control chart structure, traverses the nodes and their child nodes on the search path, until all reachable nodes are traversed, and then determines whether the specific product version number is within the range.

[0038] Step S32: If a unique product termination version number is input, the retrieval algorithm starts from the input product start version node, traverses the control chart structure, searches for nodes and their child nodes on the path from the product start version node to the product termination version node, and then determines whether the specific product version number is within this range.

[0039] Step S33: If multiple product termination version numbers are input, the retrieval algorithm starts from the input product start version node, traverses the control chart structure, searches for nodes and all child nodes on the path from the product start version node to each product termination version node, and then determines whether a specific product version number is within the range.

[0040] Steps S32 and S33 include the following steps: (1) Based on the product's initial version number, traverse the product version control graph to find the corresponding product initial version node; (2) In the product version control graph, traverse and search for nodes on the path from the product start version node to the end version node of each product; (3) In the product version control chart, traverse and search all child nodes of the node obtained in step (2), and each node remains unique; (4) Based on the node obtained in step (3), determine whether the specific product version number is within the range.

[0041] Example 2 This embodiment further elaborates on the above embodiments. Figure 2 and Figure 3 The diagram shown illustrates the product version control chart creation process in this invention. The following describes the creation steps in detail, using the product version control chart creation process as an example: Step 101: Initialize the mapping structure Map for product version nodes.<String, VersionNode> This serves as a structure for mapping product version numbers to product version nodes.

[0042] Step 102, Product Version Node List <versioninfo>Use this as input data and perform the first iteration.

[0043] Step 103: Traverse and process the product version node list (List). <versioninfo>The preceding version number of each product version node in the table is set. If the preceding version number information is empty, a fixed default value of "null" is set.

[0044] Step 104: Based on the results of step 103, perform a second traversal of the product version node list. <versioninfo>If the product version number is all uppercase, then set that product version to belong to the main branch, create a new product version node (VersionNode) object, and then create a mapping structure (Map) for the product version nodes.<String, VersionNode> .

[0045] Step 105: Based on the results of step 104, perform a third traversal of the product version node list. <versioninfo>If the product version node has a predecessor version number, then it is used in the Map based on its predecessor version number.<String,VersionNode> Find the previous version node in the mapping structure and add the current version node to the list of child nodes of the previous version node.

[0046] Step 106: Based on the results of step 105, traverse the Map.<String, VersionNode> In the mapping structure, if the preceding version number of the product version node (VersionNode) is "null", then the product version node is the starting node (root node) of the product version control graph, and the product version control graph is now created.

[0047] Example 3 This embodiment further elaborates on the above embodiments. Figure 4 The diagram shown illustrates the intelligent retrieval algorithm process of this invention. The retrieval algorithm will be described in detail below using a specific retrieval process as an example: Step 201: Based on the input product start version number, find the corresponding product start version node in the product version control chart.

[0048] Step 202: Determine that the product termination version number is not empty and is not "null".

[0049] Step 203: If step 202 returns true, then obtain the list of nodes along the path from the product start version node to the product end version node.

[0050] Step 204: Then obtain the list of child nodes of the nodes on the path from the product start version node to the product end version node.

[0051] Step 205: If step 202 returns false, then starting from the product's initial version node, obtain the list of nodes on any path branch.

[0052] Step 206: Determine whether the specific product version node is within the range of result nodes obtained in the above steps.

[0053] Step 207: Based on the result of step 206, return true or false.

[0054] Example 4 This embodiment further elaborates on the above embodiments. Figure 5 The diagram shown illustrates an application example of this invention. The following is a detailed description of a specific application example: Step 301: Create a product version control chart. The detailed process is described in Example 2.

[0055] Step 302: Input parameters for the retrieval algorithm, including: product version control chart, specific product version number, product start version number, and product end version number.

[0056] Step 303: Execute the product version retrieval algorithm. The detailed process is described in Example 3.

[0057] Step 304: The retrieval algorithm returns a result (true or false).

[0058] The embodiments of the present invention have been described in detail above, but the present invention is not limited to the described embodiments. Those skilled in the art can make various equivalent modifications or substitutions without departing from the spirit of the present invention, and these equivalents or substitutions are all included within the scope defined by the claims of the present invention.< / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo> < / versioninfo>

Claims

1. A method for intelligent product version control based on an automatic train monitoring system for rail transit, characterized in that, Includes the following steps: Step S1: Create a product version node list (List) based on all product version information of the automatic train monitoring system. <versioninfo> ；< / versioninfo> Step S2: List the product version nodes. <versioninfo> Use the input data to create a product version control chart;< / versioninfo> Step S3: Use the product version retrieval algorithm to perform product version retrieval in the product version control chart.

2. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 1, characterized in that, Step S1 includes: Step S11: Create a product version node Version object based on the product basic information; wherein, the product basic information includes the version number information and inheritance relationship information of each product, and each Version object has at least version number attribute and previous version number attribute information; Step S12: Traverse all product version node Version objects, create product version node VersionInfo objects with inheritance relationships, and construct a list of product version nodes with inheritance relationships. <versioninfo> 。< / versioninfo> 3. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 1, characterized in that, Step S2 includes: Step S21: Traverse the product version node list List <versioninfo> Process the preceding version number of each product version node. If the preceding version number information is empty, set a fixed default value of "null".< / versioninfo> Step S22: Based on the processing result of step S21, traverse the product version node list List. <versioninfo> If the product version number is all uppercase, then set that product version to belong to the main branch, create a new product version node (VersionNode) object, and then create a mapping structure (Map) for the product version nodes.<String,VersionNode> ;< / versioninfo> Step S23: Based on the processing result of step S22, traverse the product version node list List. <versioninfo> If the product version node has a predecessor version number, then the mapping structure Map will be used according to its predecessor version number.<String,VersionNode> Find the previous version node and add the current version node to the list of child nodes of the previous version node;< / versioninfo> Step S24: Based on the processing result of step S23, traverse the mapping structure Map.<String,VersionNode> If the preceding version number of the product version node (VersionNode) is "null", then the product version node is the starting node of the product version control chart, and the product version control chart is now created.

4. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 3, characterized in that, In step S22, the attributes of the VersionNode object include: previous version number, version number, whether it is a main branch flag, and a list of child nodes; the product version node mapping structure is Map.<String,VersionNode> Its key is the product version number, and its value is a VersionNode object.

5. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 1, characterized in that, In step S2, the product version control chart includes: Product version control graphs are directed acyclic graphs. The edges of the graph are directed, representing the inheritance relationship between versions. Each version node has an edge pointing to its predecessor version node. A node in the product version control chart has multiple branches, indicating that a product version has multiple subsequent versions. Nodes in the product version control chart are unique and will not appear repeatedly; The product version control chart is scalable, allowing new version nodes to be added as the product version iterates and upgrades.

6. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 1, characterized in that, In step S3, the product version retrieval algorithm determines whether a specific product version number belongs to the product version range of the product start version number and the product end version number; when a specific product version number, product start version number and product end version number are input, the retrieval nodes of the product version retrieval algorithm include the nodes and their child nodes on the path from the product start version node to the product end version node. The product version retrieval algorithm is applicable to different retrieval scenarios depending on the form of its input product termination version number parameter.

7. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 6, characterized in that, Step S3 applies to different retrieval scenarios, including: if no specific product end version number is entered, the retrieval algorithm starts from the input product start version node, traverses the entire product version control graph, traverses the nodes and their child nodes on the search path, until all reachable nodes are traversed, and then determines whether the specific product version number is within the range of the product version.

8. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 6, characterized in that, Step S3 applies to different retrieval scenarios, including: if a unique product termination version number is input, the retrieval algorithm starts from the input product start version node, traverses the product version control graph, searches for nodes and their child nodes on the path from the product start version node to the product termination version node, and then determines whether the specific product version number is within the range of the product version.

9. The intelligent product version control method based on a rail transit automatic train monitoring system as described in claim 6, characterized in that, Step S3 applies to different retrieval scenarios, including: if multiple product termination version numbers are input, the retrieval algorithm starts from the input product start version node, traverses the product version control graph, traverses and searches for nodes and all child nodes on the path from the product start version node to each product termination version node, and then determines whether a specific product version number is within the product version range.

10. A method for intelligent product version control based on an automatic train monitoring system for rail transit as described in claim 8 or 9, characterized in that, Step S3 includes: A1. Based on the product's initial version number, traverse the product version control chart to find the corresponding product initial version node; A2. In the product version control graph, traverse and find the nodes on the path from the product start version node to the end version node of each product. A3. In the product version control chart, traverse and find all child nodes of the node obtained in step A2, and keep each node unique. A4. Based on the node obtained in step A3, determine whether the specific product version number is within the range of the product version.

Images