Train path planning method, device, electronic device and storage medium
By obtaining and processing the section length and line position in the train path planning, determining the node coordinates and searching with the minimum driving cost, the problems of low planning efficiency and poor accuracy in the existing technology are solved, and dynamic path planning is realized and improved The efficiency and accuracy of train path planning are achieved.
Patent Information
- Application Number
- CN202210480224.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-05-05
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2042-05-05
AI Technical Summary
The existing train path planning methods have low planning efficiency and poor accuracy, and require early configuration of parking area and path unit data. If these data change, they need to be reconfigured.
By obtaining the section length and line position of the area to be planned, determining the coordinates of the section nodes, and searching in the nodes with the minimum driving cost as the goal, planning the paths, avoiding the configuration of parking area and path unit data in advance, and dynamically adjusting the paths.
It improves the efficiency and accuracy of train path planning, without the need to configure data in advance, and can dynamically respond to path unit changes.
Smart Images

Figure CN115077544B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of rail transit technology, and in particular to a train path planning method, device, electronic equipment and storage medium. Background Art
[0002] In the urban rail transit signal system, the train path is defined as the sequence of routes from the starting point to the end point, which is usually generated and verified by the Automatic Train Supervision (ATS) system.
[0003] In the prior art, the station yard is usually simplified into several parking areas, and the data unit consisting of a series of routes in a certain order between adjacent or designated parking areas is defined as a path unit. The parking area and path unit data need to be configured in advance. If the route sequence in the path unit changes, the data personnel need to reconfigure the path unit, which is prone to errors. The existing train path planning method has low planning efficiency and poor accuracy. Summary of the invention
[0004] The present invention provides a train path planning method, device, electronic device and storage medium, which are used to solve the technical problems of low planning efficiency and poor accuracy of the train path planning method in the prior art.
[0005] The present invention provides a train path planning method, comprising:
[0006] Obtain the length of each section in the area to be planned, as well as the line position of each section in the corresponding station;
[0007] Taking each section as a node, based on the length of each section and the line position of each section in the corresponding station, determine the node coordinates of the node corresponding to each section;
[0008] Taking the minimum travel cost of the train at the current node as the goal, searching in each node of the area to be planned to determine the planned path of the train from the starting node to the ending node in the area to be planned;
[0009] The travel cost is determined based on the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the termination node.
[0010] According to the train path planning method provided by the present invention, the node coordinates of the nodes corresponding to each section are determined based on the length of each section and the line position of each section in the corresponding station yard, including:
[0011] The length of any section is used as the horizontal coordinate of the node corresponding to the section, and the line position of the section in the corresponding station is used as the vertical coordinate of the node corresponding to the section;
[0012] Based on the abscissa and the ordinate, the node coordinates of the node corresponding to any one of the segments are determined.
[0013] According to the train path planning method provided by the present invention, the travel cost is determined based on the following steps:
[0014] Determine a first travel cost of the train from the current node to the terminal node based on the difference between the abscissa of the current node and the terminal node, the difference between the ordinate of the current node and the terminal node, the line length weight, and the line position weight;
[0015] Determining a second travel cost of the train from the previous node to the current node based on the Euclidean distance between the current node and the previous node;
[0016] The driving cost is determined based on the first driving cost and the second driving cost.
[0017] According to the train path planning method provided by the present invention, the method takes the minimum travel cost of the train at the current node as the goal, searches each node in the area to be planned, and determines the planned path of the train from the starting node to the ending node in the area to be planned, including:
[0018] Obtaining a previous node, and searching among the nodes in the area to be planned to determine all adjacent nodes of the previous node; the initial value of the previous node is the starting node;
[0019] Determine the travel cost of the train passing through each adjacent node, and use the adjacent node with the smallest travel cost as the current node corresponding to the previous node;
[0020] If the current node is not the termination node, updating the current node to the previous node;
[0021] Based on the previous node and the current node corresponding to the previous node, a planned path for the train to travel from the starting node to the ending node in the area to be planned is determined.
[0022] According to the train path planning method provided by the present invention, the method determines the planned path of the train from the starting node to the ending node in the area to be planned based on the previous node and the current node corresponding to the previous node, and then includes:
[0023] For any node in the planned path, if a search is performed among the nodes in the to-be-planned area, an adjacent node of the node is obtained; the driving cost of the adjacent node is less than the driving cost of the next node of the node in the planned path; the adjacent node is not in the planned path and the next node of the adjacent node is in the planned path;
[0024] Then, the next node of any node in the planned path is removed, and the adjacent node is used as the next node corresponding to any node, and the path planning is re-performed.
[0025] According to the train path planning method provided by the present invention, the step of determining a planned path for a train to travel from a starting node to a terminal node in the area to be planned comprises:
[0026] Determine the signal corresponding to each section in the planned path;
[0027] Based on the signals corresponding to each section in the planned path and the connection relationship between each section, the route sequence of the train in the planned path is determined.
[0028] The present invention provides a train path planning device, comprising:
[0029] An acquisition unit, used to acquire the length of each section in the area to be planned, and the line position of each section in the corresponding station;
[0030] A determination unit, used to determine the node coordinates of the nodes corresponding to each section based on the length of each section and the line position of each section in the corresponding station field, taking each section as a node;
[0031] A planning unit, configured to search among the nodes in the area to be planned with the goal of minimizing the travel cost of the train at the current node, and determine a planned path for the train to travel from the starting node to the ending node in the area to be planned;
[0032] The travel cost is determined based on the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the termination node.
[0033] The present invention provides an electronic device, comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the train path planning method is implemented when the processor executes the program.
[0034] The present invention provides a non-transitory computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the train path planning method is implemented.
[0035] The present invention provides a computer program product, comprising a computer program, wherein the computer program implements the train path planning method when executed by a processor.
[0036] The train path planning method, device, electronic device and storage medium provided by the present invention obtain the length of each section in the area to be planned, and the line position of each section in the corresponding station yard; take each section as a node, and determine the node coordinates of the node corresponding to each section based on the length of each section and the line position of each section in the corresponding station yard; take the minimum travel cost of the train at the current node as the goal, search in each node in the area to be planned, and determine the planned path of the train from the starting node to the ending node in the area to be planned. Since the path planning is carried out in sections, there is no need to configure the data such as the parking area and the path unit in advance, and there is no need to consider the changes in these data, which improves the efficiency of the train path planning. In addition, the travel cost of the train passing through each section is determined according to the length of each section and the line position of each section in the corresponding station yard, which improves the accuracy of the train path planning. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. 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 creative work.
[0038] Figure 1 It is one of the flow charts of the train path planning method provided by the present invention;
[0039] Figure 2 This is the second flow chart of the train path planning method provided by the present invention;
[0040] Figure 3 It is a structural schematic diagram of the train path planning device provided by the present invention;
[0041] Figure 4 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION
[0042] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0043] It should be noted that the terms "first", "second", etc. in the present invention are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0044] Figure 1 It is one of the flow charts of the train path planning method provided by the present invention, such as Figure 1 As shown, the method includes step 110 , step 120 and step 130 .
[0045] Step 110: Obtain the length of each section in the area to be planned, and the line position of each section in the corresponding station.
[0046] Specifically, the train path planning method provided in the embodiment of the present invention may be executed by a train control system, wherein the train may be a passenger train, a freight train, or an urban rail train.
[0047] The area to be planned is the road area where trains may travel. For example, for passenger trains, the geographical area covered by the railway network where they are located can be used as the area to be planned. In the area to be planned, the railway network can include multiple stations and connecting lines between stations. With the station as the center, both the up and down lines of the line are equipped with entry and exit signals. The station yard refers to the area bounded by the entry signals on both sides and including the station.
[0048] For the same station, there may be multiple parallel sections. For these parallel sections, the positions of these sections are usually numbered in the order from straight to curved, indicating the line positions of these sections in the corresponding station. The smaller the line position number, the closer the section is to a straight section, the less complex the road equipment in the section, and the easier it is for trains to pass through the section; the larger the line position number, the closer the section is to a curved section, the more complex the road equipment in the section, and the more difficult it is for trains to pass through the section.
[0049] Path planning can be performed in units of sections on each line in the area to be planned. Before planning, the length of each section in the area to be planned and the line position of each section in the corresponding station can be obtained. These data can be statistically obtained in advance and then input into the train control system before path planning.
[0050] Step 120: Taking each section as a node, based on the length of each section and the line position of each section in the corresponding station, determine the node coordinates of the node corresponding to each section.
[0051] Specifically, each segment can be used as a node for path planning. A node represents a segment, and the adjacent relationship between nodes represents the connection relationship between segments. That is, if two nodes are adjacent nodes, the segments corresponding to the nodes are interconnected segments.
[0052] The node coordinates here are used to describe the properties of the node, such as the length and line position. For example, the node can be represented by two-dimensional coordinates, with the length as the horizontal coordinate and the line position as the vertical coordinate. Using node coordinates to describe the properties of the node can effectively represent the node in the algorithm, which is conducive to automatically realizing path planning through the algorithm.
[0053] Step 130, with the goal of minimizing the travel cost of the train at the current node, search among the nodes in the area to be planned to determine the planned path for the train to travel from the starting node to the ending node in the area to be planned; wherein the travel cost is determined based on the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the ending node.
[0054] Specifically, when performing path planning in the area to be planned, the starting node and the ending node may be determined first. The starting node is the section where the train starts running, and the ending node is the section where the train ends running.
[0055] From the starting node to the ending node, many paths can be planned. In the embodiment of the present invention, the travel cost of the train passing through each node can be determined first, and then the planned path with the minimum travel cost passing through the node can be obtained through the node search method.
[0056] The travel cost is used to measure the energy consumption level or the difficulty of passing the section corresponding to the node when the train passes through it. A higher travel cost means that the train needs to consume more energy or it is more difficult to pass through the section corresponding to the node; a lower travel cost means that the train can consume less energy or it is easier to pass through the section corresponding to the node.
[0057] Taking any node in the area to be planned as the current node, the travel cost of the train at the current node can be determined according to the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the terminal node. For example, according to the node coordinates of the current node and the node coordinates of the previous node of the current node, the travel cost of the train from the previous node to the current node can be calculated, and according to the node coordinates of the current node and the node coordinates of the terminal node, the travel cost of the train from the current node to the terminal node can be calculated.
[0058] If the cost of the train passing the current node is small, it means that the train is more likely to pass the current node; if the cost of the train passing the current node is large, it means that the train is less likely to pass the current node. When there are multiple possible nodes to choose from for the current node, the node with the smallest cost can be selected as the current node.
[0059] According to the above method, each node from the starting node to the ending node is selected in turn, so as to obtain a planned path for the train to travel from the starting node to the ending node in the area to be planned.
[0060] The train path planning method provided by the embodiment of the present invention obtains the length of each section in the area to be planned, and the line position of each section in the corresponding station yard; takes each section as a node, and based on the length of each section and the line position of each section in the corresponding station yard, determines the node coordinates of the node corresponding to each section; takes the minimum travel cost of the train at the current node as the goal, searches in each node in the area to be planned, and determines the planned path of the train from the starting node to the ending node in the area to be planned. Since the path planning is carried out in sections, there is no need to configure the data such as the parking area and the path unit in advance, and there is no need to consider the changes in these data, which improves the efficiency of the train path planning. In addition, the travel cost of the train passing through each section is determined according to the length of each section and the line position of each section in the corresponding station yard, which improves the accuracy of the train path planning.
[0061] Based on the above embodiment, step 120 includes:
[0062] The length of any section is taken as the horizontal coordinate of the node corresponding to the section, and the line position of the section in the corresponding station is taken as the vertical coordinate of the node corresponding to the section;
[0063] Based on the abscissa and the ordinate, the node coordinates of the node corresponding to the segment are determined.
[0064] Specifically, in order to facilitate the search for the node corresponding to any section, the length of the section can be used as the horizontal coordinate of the node corresponding to the section, and the line position of the section in the corresponding station field can be used as the vertical coordinate of the node corresponding to the section. The node coordinates of the node corresponding to the section can be obtained by combining the horizontal coordinate and the vertical coordinate.
[0065] The train path planning method provided by the embodiment of the present invention adopts node coordinates to describe the attributes of nodes, which can effectively represent nodes in the algorithm and facilitate the rapid search for nodes.
[0066] Based on any of the above embodiments, the driving cost is determined based on the following steps:
[0067] Determine a first travel cost of the train from the current node to the terminal node based on the difference between the abscissas of the current node and the terminal node, the difference between the ordinates of the current node and the terminal node, the line length weight, and the line position weight;
[0068] Based on the Euclidean distance between the current node and the previous node, determine the second travel cost of the train from the previous node to the current node;
[0069] Based on the first driving cost and the second driving cost, a driving cost is determined.
[0070] Specifically, the route length weight is used to indicate the degree of influence of the route length in path planning. The larger the route length weight, the higher the priority of considering the route length in path planning; the smaller the route length weight, the lower the priority of considering the route length in path planning.
[0071] The route position weight is used to indicate the influence of the route position in path planning. The larger the route position weight, the more the route planning should prioritize straight routes; the smaller the route position weight, the more the route planning should prioritize curved routes.
[0072] The first travel cost of the train from the current node to the terminal node can be determined according to the difference between the horizontal coordinates of the current node and the terminal node, the difference between the vertical coordinates of the current node and the terminal node, the line length weight and the line position weight, which can be expressed as follows:
[0073] v(n)=k1×|x n -x z |+k2×|y n -y z |
[0074] Where v(n) is the first travel cost from the current node n to the end node z, x n is the horizontal coordinate of the current node n, x zis the horizontal coordinate of the end node z, y n is the ordinate of the current node n, y z is the ordinate of the terminal node z, k1 is the line length weight, and k2 is the line position weight.
[0075] The second travel cost of the train from the previous node to the current node can be determined based on the Euclidean distance between the current node and the previous node, which can be expressed as:
[0076]
[0077] Where S(n) is the second travel cost from the previous node n-1 to the current node n, x n-1 is the horizontal coordinate of the previous node n-1, y n-1 is the vertical coordinate of the previous node n-1.
[0078] According to the first driving cost v(n) and the second driving cost S(n), the driving cost is determined, which can be expressed as:
[0079] f(n)=S(n)+v(n)
[0080] Where f(n) is the travel cost of the train at the current node n.
[0081] The train path planning method provided by an embodiment of the present invention takes into account the influence of line length and line position when calculating the first travel cost, which can improve the accuracy of the first travel cost. It takes into account the first travel cost of the train traveling from the current node to the terminal node, and the second travel cost of the train traveling from the previous node to the current node, thereby improving the accuracy of train path planning.
[0082] Based on any of the above embodiments, step 130 includes:
[0083] Get the previous node and search among the nodes in the area to be planned to determine all adjacent nodes of the previous node; the initial value of the previous node is the starting node;
[0084] Determine the travel cost of the train passing through each adjacent node, and use the adjacent node with the smallest travel cost as the current node corresponding to the previous node;
[0085] If the current node is not the terminal node, update the current node to the previous node;
[0086] Based on the previous node and the current node corresponding to the previous node, a planned path for the train to travel from the starting node to the ending node in the area to be planned is determined.
[0087] Specifically, when performing path planning, start from the starting node and determine each node one by one.
[0088] First, the starting node is used as the initial value, and the nodes in the planned area are searched to determine all the adjacent nodes of the starting node. For the starting node, there may be multiple adjacent nodes. According to the method in the above embodiment, the travel cost when the train passes through each adjacent node is calculated, and the adjacent node with the smallest travel cost is used as the subsequent node corresponding to the starting node, and the path correspondence between the starting node and the subsequent nodes is established.
[0089] Then, the subsequent node is used as the previous node, and the nodes in the area to be planned are searched to determine all the adjacent nodes of the previous node. For the previous node, there may be multiple adjacent nodes. According to the method in the above embodiment, the travel cost when the train passes through each adjacent node is calculated, and the adjacent node with the smallest travel cost is used as the current node corresponding to the previous node, and the path correspondence between the previous node and the current node is established.
[0090] Determine whether the current node is the termination node. If so, the path planning ends; if not, the current node is updated to the previous node and the planning continues until the current node is the termination node.
[0091] The nodes with path correspondence obtained in the above process are combined to obtain a planned path for the train to travel from the starting node to the ending node in the area to be planned.
[0092] The train path planning method provided by the embodiment of the present invention takes minimizing the travel cost as the goal, performs a heuristic search between various nodes in the area to be planned, thereby improving the search efficiency and the efficiency of train path planning.
[0093] Based on any of the above embodiments, based on the previous node and the current node corresponding to the previous node, determining a planned path for the train to travel from the starting node to the ending node in the area to be planned, then including:
[0094] For any node in the planned path, if a search is performed among the nodes in the planned area, the adjacent nodes of any node are obtained; the driving cost of the adjacent node is less than the driving cost of the next node of any node in the planned path; the adjacent node is not in the planned path and the next node of the adjacent node is in the planned path;
[0095] Then, the next node of any node in the planned path is removed, and the adjacent node is used as the next node corresponding to any node, and the path planning is re-performed.
[0096] Specifically, when the path planning is completed, the obtained planned path can be verified. For any node in the planned path, if the search is performed among the nodes in the planned area to obtain the adjacent nodes of the node; the driving cost of the adjacent node is less than the driving cost of the next node of the node in the planned path; the adjacent node is not in the planned path and the next node of the adjacent node is in the planned path. This indicates that there is a better choice path, and the adjacent node of the node obtained by the search is more suitable as the next node of the node in the planned path.
[0097] Therefore, the next node of the node in the planned path can be removed from the original planned path, and the adjacent node can be used as the next node corresponding to the node to re-plan the path.
[0098] For example, for the planned path "node 1-node 2-node 3", during verification, it is searched that node 1 also has an adjacent node 4, node 4 is adjacent to node 3, and the driving cost of node 4 is less than the driving cost of node 2; node 4 is not in the original planned path and the next node of node 4 (node 3) is in the planned path. At this time, node 2 can be removed from the original planned path, and node 4 can be used as the next node of node 1 to re-plan the path.
[0099] The train path planning method provided by the embodiment of the present invention verifies the obtained planned path, thereby improving the accuracy of train path planning.
[0100] Based on any of the above embodiments, step 130 includes:
[0101] Determine the signal corresponding to each section in the planned route;
[0102] Based on the signals corresponding to each section in the planned path and the connection relationship between each section, the route sequence of the train in the planned path is determined.
[0103] Specifically, for a train signal system with vehicle-to-vehicle communication, the various sections in the planned path are connected to each other, and a section sequence that can be used by the train is obtained according to the arrangement order from the starting section to the ending section.
[0104] However, for the train signal system that uses signal communication, the train can only travel on the route, so it is also necessary to generate the route sequence according to the section sequence.
[0105] You can first determine the signal corresponding to each section. For some sections, there is a signal. For some sections, there is no signal. Then, first determine the signal of the starting section, and according to the connection relationship of each section, determine each signal in the planned path in turn. With each signal as the boundary, divide the entire planned path into multiple routes, and obtain the route sequence of the train in the planned path.
[0106] The train path planning method provided by the embodiment of the present invention can generate a train signal system applicable to signal communication by determining the signal corresponding to each section in the planned path, thereby improving the scope of application of the train path planning method.
[0107] Figure 2 FIG. 2 is a flow chart of the train path planning method provided by the present invention. Figure 2 As shown, this method defines Link as the smallest data unit of the station field. Station field elements such as sections and switches can be represented by Links. The signal machine is associated with the section corresponding to the Link by defining a protection Link. Link has a length. For the convenience of subsequent search, the length mark of the Link is defined as the horizontal coordinate of the Link, and the level (line position) of the corresponding element of the Link in the station field is used as the vertical coordinate of the Link. In the station field data structure of this method, a Link is defined as a node, and the connection relationship between Links is defined as an edge.
[0108] Through the definition of Link, this method converts the actual route into a graph consisting of Link and its connection relationship. In order to improve the search speed and efficiency, this method adopts a heuristic search algorithm, uses heuristic information to guide the search process, combines the horizontal and vertical coordinates of Link to calculate the travel cost, and selects the most promising node for expansion.
[0109] The calculation of the driving cost can refer to the above embodiment and will not be repeated here.
[0110] The steps of the heuristic search algorithm used in this method are:
[0111] Step 1: Create a search table and a result table, and put the starting point Link(0) into the search table;
[0112] Step 2: If the search table is empty, it is considered that the search has failed and no reachable path can be found;
[0113] Step 3: Calculate the Link driving costs in the search table and sort them;
[0114] Step 4: Take the Link (X) with the smallest travel cost in the search table as the optimal node and put it into the result table;
[0115] Step 5: If the newly added Link (X) is consistent with the target Link, then find a reachable path. The sequence from the first Link in the result table to the newly added Link is a reachable path Link sequence; retrieve and save;
[0116] Step 6: Continue to search for the adjacent Link (X+1) of Link (X);
[0117] Step 7: Calculate the driving cost of Link (X+1);
[0118] Step 8: If Link(X+1) is already in the search table and is the optimal node in the search table, then set Link(X) as the parent node of Link(X+1), modify the travel cost, and go to step 2;
[0119] Step 9: If Link(X+1) is already in the result table, and the travel cost of Link(X+1) is less than the travel cost in the result table Link(X+1), then set Link(X) as the parent node of Link(X+1), modify the travel cost, and put Link(X+1) into the search table, and go to step 2;
[0120] Step 10: If Link(X+1) is not in the search table or result table, put it into the search table, set Link(X) as the parent node of Link(X+1), and go to step 2.
[0121] Based on any of the above embodiments, Figure 3 is a schematic diagram of the structure of the train path planning device provided by the present invention, such as Figure 3 As shown, the device comprises:
[0122] An acquisition unit 310 is used to acquire the length of each section in the area to be planned, and the line position of each section in the corresponding station;
[0123] The determination unit 320 is used to determine the node coordinates corresponding to each section based on the length of each section and the line position of each section in the corresponding station field, taking each section as a node;
[0124] The planning unit 330 is used to search among the nodes in the area to be planned with the goal of minimizing the travel cost of the train at the current node, and determine the planned path of the train from the starting node to the ending node in the area to be planned;
[0125] The travel cost is determined based on the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the end node.
[0126] The train path planning device provided by the embodiment of the present invention obtains the length of each section in the area to be planned, and the line position of each section in the corresponding station yard; takes each section as a node, and based on the length of each section and the line position of each section in the corresponding station yard, determines the node coordinates of the node corresponding to each section; takes the minimum travel cost of the train at the current node as the goal, searches in each node in the area to be planned, and determines the planned path of the train from the starting node to the ending node in the area to be planned. Since the path planning is carried out in sections, there is no need to configure the data such as the parking area and the path unit in advance, and there is no need to consider the changes in these data, which improves the efficiency of the train path planning. In addition, the travel cost of the train passing through each section is determined according to the length of each section and the line position of each section in the corresponding station yard, which improves the accuracy of the train path planning.
[0127] Based on any of the foregoing embodiments, the determining unit is specifically configured to:
[0128] The length of any section is used as the horizontal coordinate of the node corresponding to any section, and the line position of any section in the corresponding station is used as the vertical coordinate of the node corresponding to any section; based on the horizontal coordinate and the vertical coordinate, the node coordinate of the node corresponding to any section is determined.
[0129] Based on any of the above embodiments, it also includes:
[0130] The calculation unit is used to determine the first travel cost of the train from the current node to the terminal node based on the difference between the horizontal coordinates of the current node and the terminal node, the difference between the vertical coordinates of the current node and the terminal node, the line length weight and the line position weight; determine the second travel cost of the train from the previous node to the current node based on the Euclidean distance between the current node and the previous node; and determine the travel cost based on the first travel cost and the second travel cost.
[0131] Based on any of the above embodiments, the planning unit is specifically used for:
[0132] Get the previous node and search among the nodes in the area to be planned to determine all adjacent nodes of the previous node; the initial value of the previous node is the starting node; determine the travel cost of the train passing through each adjacent node, and use the adjacent node with the smallest travel cost as the current node corresponding to the previous node; if the current node is not the end node, update the current node to the previous node; based on the previous node and the current node corresponding to the previous node, determine the planned path of the train from the starting node to the end node in the area to be planned.
[0133] Based on any of the above embodiments, it also includes:
[0134] The verification unit is used for obtaining the adjacent nodes of any node in the planned path by searching among the nodes in the planned area; the driving cost of the adjacent node is less than the driving cost of the next node of any node in the planned path; the adjacent node is not in the planned path and the next node of the adjacent node is in the planned path; then the next node of any node in the planned path is removed, and the adjacent node is used as the next node corresponding to any node, and the path is replanned.
[0135] Based on any of the above embodiments, it also includes:
[0136] The route sequence determination unit is used to determine the signal corresponding to each section in the planned path; based on the signal corresponding to each section in the planned path and the connection relationship between each section, the route sequence of the train in the planned path is determined.
[0137] Based on any of the above embodiments, Figure 4 A schematic diagram of the structure of an electronic device provided by the present invention, such as Figure 4 As shown, the electronic device may include: a processor (Processor) 410, a communication interface (Communications Interface) 420, a memory (Memory) 430 and a communication bus (Communications Bus) 440, wherein the processor 410, the communication interface 420, and the memory 430 communicate with each other through the communication bus 440. The processor 410 may call the logic command in the memory 430 to execute the following method:
[0138] Obtain the length of each section in the area to be planned, and the line position of each section in the corresponding station; take each section as a node, and determine the node coordinates corresponding to each section based on the length of each section and the line position of each section in the corresponding station; with the goal of minimizing the travel cost of the train at the current node, search among the nodes in the area to be planned, and determine the planned path of the train from the starting node to the ending node in the area to be planned; wherein the travel cost is determined based on the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the ending node.
[0139] In addition, the logic commands in the above-mentioned memory 430 can be implemented in the form of software functional units and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on such an understanding, the technical solution of the present invention, in essence, 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, which is stored in a storage medium and includes several commands to enable 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 disk or an optical disk.
[0140] The processor in the electronic device provided in the embodiment of the present invention can call the logic instructions in the memory to implement the above method. Its specific implementation method is consistent with the implementation method of the aforementioned method and can achieve the same beneficial effects, which will not be repeated here.
[0141] An embodiment of the present invention also provides a non-transitory computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, it is implemented to execute the methods provided in the above embodiments. Its specific implementation method is consistent with the aforementioned method implementation method and can achieve the same beneficial effects, which will not be repeated here.
[0142] An embodiment of the present invention provides a computer program product, including a computer program, and when the computer program is executed by a processor, the steps of the above method are implemented.
[0143] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.
[0144] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of commands to enable 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 some parts of the embodiments.
[0145] 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 embodiments of the present invention.
Claims
1. A train path planning method, characterized in that: include: Obtain the length of each section in the area to be planned, as well as the line position of each section in the corresponding station; Taking each section as a node, based on the length of each section and the line position of each section in the corresponding station, the node coordinates of the corresponding node of each section are determined; the position of each section is numbered in the order from straight strand to curved strand to indicate the line position of each section in the corresponding station; Taking the minimum travel cost of the train at the current node as the goal, searching in each node of the area to be planned to determine the planned path of the train from the starting node to the ending node in the area to be planned; The travel cost is determined based on the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the terminal node; The determining of the node coordinates of the nodes corresponding to each section based on the length of each section and the line position of each section in the corresponding station field includes: The length of any section is used as the horizontal coordinate of the node corresponding to the section, and the line position of the section in the corresponding station is used as the vertical coordinate of the node corresponding to the section; Determine the node coordinates of the node corresponding to any one of the segments based on the abscissa and the ordinate; The driving cost is determined based on the following steps: Determine a first travel cost of the train from the current node to the terminal node based on the difference between the abscissa of the current node and the terminal node, the difference between the ordinate of the current node and the terminal node, the line length weight, and the line position weight; Determining a second travel cost of the train from the previous node to the current node based on the Euclidean distance between the current node and the previous node; The driving cost is determined based on the first driving cost and the second driving cost.
2. The train path planning method according to claim 1, characterized in that: The method takes minimizing the travel cost of the train at the current node as the goal, searches each node in the area to be planned, and determines the planned path of the train from the starting node to the ending node in the area to be planned, including: Obtaining a previous node, and searching among the nodes in the area to be planned to determine all adjacent nodes of the previous node; the initial value of the previous node is the starting node; Determine the travel cost of the train passing through each adjacent node, and use the adjacent node with the smallest travel cost as the current node corresponding to the previous node; If the current node is not the termination node, updating the current node to the previous node; Based on the previous node and the current node corresponding to the previous node, a planned path for the train to travel from the starting node to the ending node in the area to be planned is determined.
3. The train path planning method according to claim 2, characterized in that: The method further comprises: determining a planned path for a train to travel from a starting node to a terminal node in the area to be planned based on the previous node and a current node corresponding to the previous node, and then comprising: For any node in the planned path, if a search is performed among the nodes in the to-be-planned area, an adjacent node of the node is obtained; the driving cost of the adjacent node is less than the driving cost of the next node of the node in the planned path; the adjacent node is not in the planned path and the next node of the adjacent node is in the planned path; Then, the next node of any node in the planned path is removed, and the adjacent node is used as the next node corresponding to any node, and the path planning is re-performed.
4. The train path planning method according to any one of claims 1 to 3, characterized in that: The step of determining a planned path for a train to travel from a starting node to a terminal node in the area to be planned comprises: Determine the signal corresponding to each section in the planned path; Based on the signals corresponding to each section in the planned path and the connection relationship between each section, the route sequence of the train in the planned path is determined.
5. A train path planning device, characterized in that: include: An acquisition unit, used to acquire the length of each section in the area to be planned, and the line position of each section in the corresponding station; The determination unit is used to determine the node coordinates of the nodes corresponding to each section based on the length of each section and the line position of each section in the corresponding station yard; the position of each section is numbered in the order from straight strand to curved strand to indicate the line position of each section in the corresponding station yard; A planning unit, configured to search among the nodes in the area to be planned with the goal of minimizing the travel cost of the train at the current node, and determine a planned path for the train to travel from the starting node to the ending node in the area to be planned; The travel cost is determined based on the node coordinates of the current node, the node coordinates of the previous node of the current node, and the node coordinates of the terminal node; The determining of the node coordinates of the nodes corresponding to each section based on the length of each section and the line position of each section in the corresponding station field includes: The length of any section is used as the horizontal coordinate of the node corresponding to the section, and the line position of the section in the corresponding station is used as the vertical coordinate of the node corresponding to the section; Determine the node coordinates of the node corresponding to any one of the segments based on the abscissa and the ordinate; The driving cost is determined based on the following steps: Determine a first travel cost of the train from the current node to the terminal node based on the difference between the abscissa of the current node and the terminal node, the difference between the ordinate of the current node and the terminal node, the line length weight, and the line position weight; Determining a second travel cost of the train from the previous node to the current node based on the Euclidean distance between the current node and the previous node; The driving cost is determined based on the first driving cost and the second driving cost.
6. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the train path planning method as described in any one of claims 1 to 4 is implemented.
7. 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 train path planning method according to any one of claims 1 to 4 is implemented.
8. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the train path planning method according to any one of claims 1 to 4 is implemented.
