CN112579720B - Logic section path-based gradient section determination method and device - Google Patents
Logic section path-based gradient section determination method and device Download PDFInfo
- Publication number
- CN112579720B CN112579720B CN202011524669.2A CN202011524669A CN112579720B CN 112579720 B CN112579720 B CN 112579720B CN 202011524669 A CN202011524669 A CN 202011524669A CN 112579720 B CN112579720 B CN 112579720B
- Authority
- CN
- China
- Prior art keywords
- section
- gradient
- node
- logic
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004590 computer program Methods 0.000 claims description 11
- 238000010845 search algorithm Methods 0.000 claims description 11
- 230000015654 memory Effects 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 9
- 230000001788 irregular Effects 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 239000004065 semiconductor Substances 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present disclosure provides a method for determining a gradient section based on a logical section path, comprising: receiving gradient section inquiry information, wherein the gradient section inquiry information comprises a start logic section number and an end logic section number of a logic section path; determining all gradient sections included in the logic section path according to a pre-established gradient section node model; the gradient section node model is established according to a data table of gradient sections in a logic section path in an electronic map, and the data table comprises index numbers of gradient sections, numbers of logic sections corresponding to starting points of each gradient section, offset of starting points in the corresponding logic sections, numbers of logic sections corresponding to end points, offset of end points in the corresponding logic sections, end point positive line gradient numbers at end points of each logic section path and end point side line gradient numbers at end points of each logic section path. In this way, the accuracy of the gradient section sought can be improved.
Description
Technical Field
Embodiments of the present disclosure relate generally to the field of rail traffic technology, and more particularly, to a method and apparatus for determining a grade section based on a logical section path.
Background
At present, in a urban rail signal system, particularly in a ground area control center, complex line and station yard data need to be described, so that mobile authorization is generated, and safe and efficient operation of a train is controlled.
However, due to the special complexity of the subway signal system, the signal manufacturer systems are independent, and meanwhile, local owners have special requirements on each line, so that the electronic data of each line has certain specificity. Because of such specificity, core data of a line, such as approaching section data, triggering section data, etc., are mostly manually obtained according to basic electronic data, CAD drawings are manually observed, related parameters are obtained, and after a related distance is calculated by applying a formula, a corresponding gradient section is found manually.
In the prior art, in the process of searching for the corresponding gradient section, due to the fact that more uncertain factors exist manually, the accuracy of searching for the corresponding path is low, many manual errors exist, further, the later-period data are frequently reworked, the cost is greatly increased, and the labor cost is wasted.
Disclosure of Invention
According to the embodiment of the disclosure, the determination scheme of the gradient section based on the logic section path, which can improve the precision of the searched gradient section, reduce the frequency of later data return and save the labor cost, is provided.
In a first aspect of the present disclosure, there is provided a method for determining a gradient section based on a logic section path, including:
Receiving gradient section inquiry information, wherein the gradient section inquiry information comprises a start logic section number and an end logic section number of a logic section path;
Determining all gradient sections included in the logic section path according to a pre-established gradient section node model; the gradient section node model is established according to a data table of gradient sections in a logic section path in an electronic map, wherein the data table comprises index numbers of gradient sections, numbers of logic sections corresponding to starting points of each gradient section, offset of starting points of each gradient section in the corresponding logic section, numbers of logic sections corresponding to end points of each gradient section, offset of end points of each gradient section in the corresponding logic section, end point positive line gradient numbers at end points of each logic section path and end point side line gradient numbers at end points of each logic section path.
In the aspect and any possible implementation manner described above, there is further provided an implementation manner, where the slope section node model is an irregular tree model, in the irregular tree model, a slope section is taken as a node, a logic section including a start point of the slope section is taken as a left sub-node, a logic section including an end point of the slope section is taken as a right sub-node, an offset of the start point of the slope section in a corresponding logic section is a parameter of the left sub-node, and an offset of the end point of the slope section in a corresponding logic section is taken as a parameter of the right sub-node, where the slope section node and the logic section node are provided with corresponding numbers. .
In aspects and any one of the possible implementations described above, there is further provided an implementation, where determining all gradient sections included in the logical section path according to a pre-established gradient section node model includes:
According to a pre-established gradient section node model, starting from a gradient section node corresponding to a starting point of a logic section path by utilizing a depth-first search algorithm, searching a gradient section node corresponding to an end point of the logic section path, and outputting searched gradient section information; wherein,
The gradient section information comprises a logic section node corresponding to a gradient section starting point, an offset of the gradient section starting point in a logic section, a logic section node corresponding to a gradient section ending point and an offset of the gradient section ending point in the logic section.
In the aspect and any possible implementation manner described above, there is further provided an implementation manner, according to a pre-established gradient section node model, using a depth-first search algorithm, from a gradient section node at a start point of a logic section path, searching a gradient section node at an end point of the logic section path, and outputting searched gradient section information, including:
Judging whether a left child node of a gradient section node is an invalid value or not for the gradient section node, and determining a right child node of the gradient section node by using a depth-first search algorithm in response to the left child node of the gradient section node not being the invalid value;
And judging whether the right child node of the gradient section node is an invalid value, and outputting the offset of the logic section node corresponding to the left child node of the gradient section node and the gradient section starting point in the corresponding logic section and the offset of the logic section node corresponding to the right child node of the gradient section node and the gradient section ending point in the corresponding logic section in response to the fact that the right child node of the gradient section node is not the invalid value.
Aspects and any one of the possible implementations as described above, further providing an implementation, the method further including:
Determining a gradient section corresponding to an approaching section in the logic section path and a gradient value corresponding to the gradient section;
and generating a control signal of the train according to the length of the approaching section and the gradient value of the gradient section in the approaching section.
In the aspect and any possible implementation manner described above, there is further provided an implementation manner, the generating a control signal of the train according to the length of the approaching section and the gradient section gradient value in the approaching section includes:
And determining the actual running distance and the allowable maximum running speed of the train according to the length of the approaching section and the gradient value of the gradient section in the approaching section, and generating a control signal.
Aspects and any one of the possible implementations as described above, further providing an implementation, the method further including:
Determining a gradient section corresponding to a trigger section in the logic section path and a gradient value corresponding to the gradient section;
and generating a control signal of the train according to the length of the approaching section and the gradient value of the gradient section in the triggering section.
In a second aspect of the present disclosure, there is provided a logic section path-based slope section determining apparatus, comprising:
the information receiving module is used for receiving gradient section inquiry information, wherein the gradient section inquiry information comprises a start logic section number and an end logic section number of a logic section path;
And the gradient section determining module is used for determining all gradient sections included in the logic section path according to a pre-established gradient section node model.
In a third aspect of the present disclosure, there is provided an electronic device comprising a memory having a computer program stored thereon and a processor that when executing the program implements the method as described above.
In a fourth aspect of the present disclosure, a computer readable storage medium is provided, on which a computer program is stored, which program, when being executed by a processor, implements a method as described above.
It should be understood that what is described in this summary is not intended to limit the critical or essential features of the embodiments of the disclosure nor to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following description.
By the method for determining the gradient section based on the logic section path, the precision of the searched gradient section can be improved, the later data return frequency is reduced, and the labor cost is saved.
Drawings
The above and other features, advantages and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, wherein like or similar reference numerals denote like or similar elements, in which:
FIG. 1 illustrates a flow chart of a method of determining a grade segment based on a logical segment path in accordance with an embodiment of the present disclosure;
FIG. 2 illustrates a flow chart of a method of determining a grade segment based on a logical segment path in accordance with a second embodiment of the present disclosure;
Fig. 3 is a functional schematic diagram showing a logic section path-based gradient section determination apparatus according to a third embodiment of the present disclosure;
fig. 4 is a schematic structural view showing a determining apparatus of a gradient section based on a logic section path according to a fourth embodiment of the present disclosure;
FIG. 5 shows a schematic diagram of a data table of a grade section of an electronic map;
FIG. 6 shows a schematic diagram of the relative positional relationship of a logic section and a grade section in a subway line;
fig. 7 shows a data structure schematic of a node model of an embodiment of the present disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are some embodiments of the present disclosure, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the disclosure, are within the scope of the disclosure.
In addition, the term "and/or" herein is merely an association relationship describing an association object, and means that three relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.
The method for determining the gradient section in the logic section path can be applied to a new line or an existing line reconstruction process, the gradient section is determined from the logic section path of the electronic map, and then the approaching section and the triggering section containing the corresponding gradient section can be determined, so that a basis is provided for generating a control signal of a train. The train section data in the prior art is typically stored in the form of electronic data. Fig. 5 is a schematic diagram of a data table of a gradient section of the electronic map. Fig. 6 shows a schematic diagram of the relative positional relationship of the logic section and the gradient section in the subway line. As can be seen from fig. 5 and 6, the data table of the gradient section of the electronic map includes the index number of the gradient section, the number of the logical section corresponding to the start point of the gradient section, the offset of the start point of the gradient section in the corresponding logical section, the number of the logical section corresponding to the end point of the gradient section, the offset of the end point of the gradient section in the corresponding logical section, the end point positive line gradient number at the end point of the path of the logical section, and the end point side gradient number at the end point of the path of the logical section, wherein 65535 represents the end point of the path of the gradient section. In general, a slope section at least includes a logic section, where the slope section is an actual physical section, and is divided by a logic concept, and the logic section is a virtual section. Referring to fig. 6, for slope segment 1, the corresponding logical segments are Link10 and Link11, for slope segment 2, the corresponding logical segments are Link11 and Link12, and similarly, the corresponding logical segments for slope segment 3 are Link12 and Link13.
Specifically, as an embodiment of the present disclosure, as shown in fig. 1, a flowchart of a method for determining a gradient section based on a logic section path according to a first embodiment of the present disclosure is shown. The method for determining a gradient section based on a logic section path according to the embodiment may include the following steps:
S101: slope segment query information is received, the slope segment query information including a start logical segment number and an end logical segment number of a logical segment path.
In the prior art, in the process of determining the approaching section data, the triggering section data and the like, usually, manually, according to basic electronic data, manually observing CAD drawings to obtain related parameters, calculating a related distance by using a formula, then manually finding out a corresponding gradient section, and further determining gradient sections corresponding to the approaching section and the triggering section. Specifically, when request information for determining a gradient section in a logical section path is received, a start logical section number and an end logical section number of the logical section path are acquired from the request information.
S102: and determining all gradient sections included in the logic section path according to a pre-established gradient section node model.
After receiving the grade section query information, grade sections in the logical section paths may be determined according to a pre-established grade section node model. As shown in fig. 7, a data structure schematic of a slope segment node model of an embodiment of the present disclosure is shown. The gradient section node model is an irregular tree model, in the irregular tree model, a gradient section is taken as a node, a logic section comprising the starting point of the gradient section is taken as a left sub-node, a logic section comprising the ending point of the gradient section is taken as a right sub-node, the offset of the starting point of the gradient section in the corresponding logic section is taken as a parameter of the left sub-node, the offset of the ending point of the gradient section in the corresponding logic section is taken as a parameter of the right sub-node, and the gradient section node and the logic section node are provided with corresponding numbers. . If the number corresponding to the left child node or the right child node is 65535, the left child node or the right child node is an invalid node. In addition, the number of logical sections (link arrays included) included in the gradient section may be included, and then the node model is stored in the form of node information.
When determining the gradient section in the logic section path, a depth-first search algorithm may be utilized to search gradient section nodes corresponding to the end point of the logic section path from gradient section nodes corresponding to the start point of the logic section path according to the gradient section node model, and the searched gradient section information is output, where the gradient section information includes the logic section nodes corresponding to the gradient section start point, the offset of the gradient section start point in the logic section, the offset of the logic section nodes corresponding to the gradient section end point and the gradient section end point in the logic section.
Specifically, for a slope segment node, whether the left child node of the slope segment node is an invalid value is determined, the right child node of the slope segment node is determined by using a depth-first search algorithm in response to the left child node of the slope segment node not being the invalid value, and the right child node of the slope segment node is no longer determined in response to the left child node of the slope segment node being the invalid value.
And judging whether the right child node of the gradient section node is an invalid value, and outputting the offset of the logic section node corresponding to the left child node of the gradient section node and the gradient section starting point in the corresponding logic section and the offset of the logic section node corresponding to the right child node of the gradient section node and the gradient section ending point in the corresponding logic section in response to the fact that the right child node of the gradient section node is not the invalid value. And responding to the fact that the right child node of the gradient section node is an invalid value, not outputting the offset of the logic section node corresponding to the left child node of the gradient section node and the gradient section starting point in the corresponding logic section, and the offset of the logic section node corresponding to the right child node of the gradient section node and the gradient section ending point in the corresponding logic section. If the left child node or the right child node of the gradient section node is an invalid value, the gradient section node is indicated to be the end point of the gradient section path, and no logic section exists on the left side of the gradient section or no logic section exists on the right side of the gradient section.
In the manner described above, the determination of one gradient section is completed, and then in the same manner, other gradient sections may be determined until all gradient sections in the logical section path are determined, and then the determined gradient sections may be stored in an aggregate manner.
In this embodiment, the slope segment node is a digitized representation of the slope segment, representing the number of the slope segment, and similarly, the logical segment node is a digitized representation of the logical segment, regardless of the length of the slope segment.
By the method for determining the gradient section based on the logic section path, the precision of the searched gradient section can be improved, the later data return frequency is reduced, and the labor cost is saved.
The implementation manner of the computer program of the present embodiment is given below:
(1) Initializing node information, calling a logic section path searching algorithm, calculating all logic sections contained in the gradient section path, and storing the logic sections as node information;
(2) The logical section and the gradient section are modeled, the gradient section is a node, the logical section is a child node, the index number of the left child node is zdzxpdbh, the index number of the right child node of the node is zdcxpdbh, and if not, the index number of the right child node of the node is 65535.
(3) Obtaining a parameter: logical segment path link_path.
(4) Virtual stack lstack = { }, critical path keyPath = { }, path return value ret= { }.
(5) And acquiring a gradient number start_pd_ sybh and an end_pd_ sybh of the head-tail logic section according to the index number and the offset of the head-tail logic section node of the logic section path.
(6) The starting point gradient number start_pd_ sybh is pushed onto the virtual stack lstack.
(7) The last slope index number node_key is popped from the virtual stack using the method described above.
(8) A current path= keyPath is created, storing the current query path. Node_key is added to the last of current_path.
(9) If the left child node of the current node, zdzxpdbh, is not 65535 (i.e., an invalid value), it is added to the virtual stack, the current query path, current_path, is copied to copy_path, and the current left child node zdzxpdbh is added to copy_path.
(10) Copy_path is added to the critical path set key_path.
(11) If the left child node of the current node is end_pd_ sybh, copy_path is added to the return path set.
(12) If the current node's right child node zdcxpdbh is not 65535 (i.e., an invalid value), it is added to the virtual stack, the current query path, current_path, is copied to copy_path, and the current right child node zdcxpdbh is added to copy_path.
(13) If the right child node of the current node is end_pd_ sybh, copy_path is added to the return path set.
(14) And (5) returning to the step (5) if the virtual stack is not empty, and returning to the path set ret if the virtual stack is empty.
The operation stack during the operation of the virtual stack simulation program is used for avoiding algorithm breakdown caused by too many recursion levels due to the overlarge data volume.
As shown in fig. 2, a flowchart of a method for determining a gradient section based on a logic section path according to a second embodiment of the present disclosure is shown. The method for determining a gradient section based on a logic section path according to the embodiment may include the following steps:
S201: slope segment query information is received, the slope segment query information including a start logical segment number and an end logical segment number of a logical segment path.
S202: and determining all gradient sections included in the logic section path according to a pre-established gradient section node model.
The above steps are similar to steps S101 to S102 in the first embodiment, and the description thereof will not be repeated here. In addition, the present embodiment may further include the steps of:
S203: and determining a gradient section corresponding to the approaching section and a gradient value corresponding to the gradient section in the logic section path.
And determining the actual running distance and the allowable maximum running speed of the train according to the length of the approaching section and the gradient value of the gradient section in the approaching section, and generating a control signal. Since the logical segment path is a projection of the physical segment on a plane, it ignores the grade value, i.e., the actual length of the trainline is longer than the length of the logical segment path.
S204: and generating a control signal of the train according to the length of the approaching section and the gradient value of the gradient section in the approaching section.
Because the gradient value has positive and negative values, wherein the positive and negative values of the gradient value correspond to the fluctuation of the gradient, which affects the running distance of the train, and the value corresponds to the fluctuation degree of the gradient, which affects the running data of the train (provides an acceleration for the train), accurate control signals can be generated according to the length of the approaching section and the gradient value of the gradient section in the approaching section, so that the running control of the train is more accurate.
In addition, in the above embodiment, it may further include:
Determining a gradient section corresponding to a trigger section in the logic section path and a gradient value corresponding to the gradient section; and generating a control signal of the train according to the length of the triggering section and the gradient value of the gradient section in the approaching section.
By the method for determining the gradient section in the logic section, the precision of the searched gradient section can be improved, the later data return frequency is reduced, and the labor cost is saved. Meanwhile, the generated control signals of the approaching section and the triggering section are more accurate, so that the running time interval of the train is reduced, and the running efficiency is improved.
It should be noted that, for simplicity of description, the foregoing method embodiments are all described as a series of acts, but it should be understood by those skilled in the art that the present disclosure is not limited by the order of acts described, as some steps may be performed in other orders or concurrently in accordance with the present disclosure. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all alternative embodiments, and that the acts and modules referred to are not necessarily required by the present disclosure.
The foregoing is a description of embodiments of the method, and the following further describes embodiments of the present disclosure through examples of apparatus.
As shown in fig. 3, a functional structure diagram of a logic section path-based gradient section determination device according to a third embodiment of the present disclosure is shown. The determination device of the gradient section in the logic section of the present embodiment includes:
the information receiving module 301 is configured to receive gradient section query information, where the gradient section query information includes a start logical section number and an end logical section number of a logical section path;
The gradient section determining module 302 is configured to determine all gradient sections included in the logic section path according to a pre-established gradient section node model.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the described modules may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again.
Fig. 4 shows a schematic structural diagram of a logic section path-based gradient section determination apparatus according to a fourth embodiment of the present disclosure. The terminal device shown in fig. 4 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present application.
As shown in fig. 4, the computer system includes a Central Processing Unit (CPU) 401, which can perform various appropriate actions and processes based on a program stored in a Read Only Memory (ROM) 402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data required for the system operation are also stored. The CPU 401, ROM 402, and RAM403 are connected to each other by a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output portion 407 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 408 including a hard disk or the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. The drive 410 is also connected to the I/O interface 405 on an as-needed basis. Removable media 411, such as magnetic disks, optical disks, magneto-optical disks, semiconductor memories, and the like, are installed on an as-needed basis on drive 410 so that a computer program read therefrom is installed into storage section 408 on an as-needed basis.
In particular, the processes described above with reference to flowcharts may be implemented as computer software programs, based on embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 409 and/or installed from the removable medium 411. The above-described functions defined in the method of the present application are performed when the computer program is executed by a Central Processing Unit (CPU) 401.
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a load programmable logic device (CPLD), etc.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
Moreover, although operations are depicted in a particular order, this should be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be implemented in multiple implementations separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are example forms of implementing the claims.
Claims (6)
1. A method for determining a grade segment based on a logical segment path, comprising:
Receiving gradient section inquiry information, wherein the gradient section inquiry information comprises a start logic section number and an end logic section number of a logic section path;
determining all gradient sections included in the logic section path according to a pre-established gradient section node model; wherein,
The gradient section node model is established according to a data table of gradient sections in a logic section path in an electronic map, and the data table comprises an index number of the gradient section, a number of a logic section corresponding to a starting point of each gradient section, an offset of the starting point of each gradient section in the corresponding logic section, a number of a logic section corresponding to an ending point of each gradient section, an offset of the ending point of each gradient section in the corresponding logic section, an ending point positive line gradient number at the ending point of each logic section path and an ending point side gradient number at the ending point of each logic section path;
The gradient section node model is an irregular tree model, in the irregular tree model, a gradient section is taken as a node, a logic section comprising the starting point of the gradient section is taken as a left sub-node, a logic section comprising the end point of the gradient section is taken as a right sub-node, the offset of the starting point of the gradient section in the corresponding logic section is taken as a parameter of the left sub-node, the offset of the end point of the gradient section in the corresponding logic section is taken as a parameter of the right sub-node, and the gradient section node and the logic section node are provided with corresponding numbers;
The determining all gradient sections included in the logic section path according to the pre-established gradient section node model comprises the following steps:
According to a pre-established gradient section node model, starting from a gradient section node corresponding to a starting point of a logic section path by utilizing a depth-first search algorithm, searching a gradient section node corresponding to an end point of the logic section path, and outputting searched gradient section information; the gradient section information comprises a logic section node corresponding to a gradient section starting point, an offset of the gradient section starting point in a logic section, a logic section node corresponding to a gradient section end point and an offset of the gradient section end point in the logic section;
The method for searching the gradient section node of the end point of the logic section path from the gradient section node of the start point of the logic section path by utilizing a depth-first search algorithm according to a pre-established gradient section node model, and outputting the searched gradient section information comprises the following steps:
Judging whether a left child node of a gradient section node is an invalid value or not for the gradient section node, and determining a right child node of the gradient section node by using a depth-first search algorithm in response to the left child node of the gradient section node not being the invalid value; judging whether the right child node of the gradient section node is an invalid value, and outputting the offset of the logic section node corresponding to the left child node of the gradient section node and the gradient section starting point in the corresponding logic section and the offset of the logic section node corresponding to the right child node of the gradient section node and the gradient section ending point in the corresponding logic section in response to the fact that the right child node of the gradient section node is not the invalid value;
the method further comprises the steps of:
Determining a gradient section corresponding to an approaching section in the logic section path and a gradient value corresponding to the gradient section; and generating a control signal of the train according to the length of the approaching section and the gradient value of the gradient section in the approaching section.
2. The logic section path-based grade section determination method of claim 1, wherein the generating a control signal for the train based on the length of the approach section and the grade section grade value in the approach section comprises:
And determining the actual running distance and the allowable maximum running speed of the train according to the length of the approaching section and the gradient value of the gradient section in the approaching section, and generating a control signal.
3. The method of determining a grade segment of a logical segment-based path of claim 1, further comprising:
Determining a gradient section corresponding to a trigger section in the logic section path and a gradient value corresponding to the gradient section;
and generating a control signal of the train according to the length of the approaching section and the gradient value of the gradient section in the triggering section.
4. A logic section path-based slope section determination apparatus, comprising:
the information receiving module is used for receiving gradient section inquiry information, wherein the gradient section inquiry information comprises a start logic section number and an end logic section number of a logic section path;
The gradient section determining module is used for determining all gradient sections included in the logic section path according to a pre-established gradient section node model;
wherein,
The gradient section node model is established according to a data table of gradient sections in a logic section path in an electronic map, and the data table comprises an index number of the gradient section, a number of a logic section corresponding to a starting point of each gradient section, an offset of the starting point of each gradient section in the corresponding logic section, a number of a logic section corresponding to an ending point of each gradient section, an offset of the ending point of each gradient section in the corresponding logic section, an ending point positive line gradient number at the ending point of each logic section path and an ending point side gradient number at the ending point of each logic section path;
The gradient section node model is an irregular tree model, in the irregular tree model, a gradient section is taken as a node, a logic section comprising the starting point of the gradient section is taken as a left sub-node, a logic section comprising the end point of the gradient section is taken as a right sub-node, the offset of the starting point of the gradient section in the corresponding logic section is taken as a parameter of the left sub-node, the offset of the end point of the gradient section in the corresponding logic section is taken as a parameter of the right sub-node, and the gradient section node and the logic section node are provided with corresponding numbers;
The determining all gradient sections included in the logic section path according to the pre-established gradient section node model comprises the following steps:
According to a pre-established gradient section node model, starting from a gradient section node corresponding to a starting point of a logic section path by utilizing a depth-first search algorithm, searching a gradient section node corresponding to an end point of the logic section path, and outputting searched gradient section information; the gradient section information comprises a logic section node corresponding to a gradient section starting point, an offset of the gradient section starting point in a logic section, a logic section node corresponding to a gradient section end point and an offset of the gradient section end point in the logic section;
The method for searching the gradient section node of the end point of the logic section path from the gradient section node of the start point of the logic section path by utilizing a depth-first search algorithm according to a pre-established gradient section node model, and outputting the searched gradient section information comprises the following steps:
Judging whether a left child node of a gradient section node is an invalid value or not for the gradient section node, and determining a right child node of the gradient section node by using a depth-first search algorithm in response to the left child node of the gradient section node not being the invalid value; judging whether the right child node of the gradient section node is an invalid value, and outputting the offset of the logic section node corresponding to the left child node of the gradient section node and the gradient section starting point in the corresponding logic section and the offset of the logic section node corresponding to the right child node of the gradient section node and the gradient section ending point in the corresponding logic section in response to the fact that the right child node of the gradient section node is not the invalid value;
Determining a gradient section corresponding to an approaching section in the logic section path and a gradient value corresponding to the gradient section; and generating a control signal of the train according to the length of the approaching section and the gradient value of the gradient section in the approaching section.
5. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program, characterized in that the processor, when executing the program, implements the method of any of claims 1-3.
6. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any one of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011524669.2A CN112579720B (en) | 2020-12-22 | 2020-12-22 | Logic section path-based gradient section determination method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011524669.2A CN112579720B (en) | 2020-12-22 | 2020-12-22 | Logic section path-based gradient section determination method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112579720A CN112579720A (en) | 2021-03-30 |
| CN112579720B true CN112579720B (en) | 2024-04-26 |
Family
ID=75136608
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011524669.2A Active CN112579720B (en) | 2020-12-22 | 2020-12-22 | Logic section path-based gradient section determination method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112579720B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6260054B1 (en) * | 1998-10-29 | 2001-07-10 | Neomagic Corp. | Reciprocal generator using piece-wise-linear segments of varying width with floating-point format |
| CN101833282A (en) * | 2010-04-30 | 2010-09-15 | 林定伟 | Artificial intelligent control system and method |
| WO2011076081A1 (en) * | 2009-12-23 | 2011-06-30 | Lin Dingwei | Logical network automatic operation control system, automation control system and application method |
| EP3124303A2 (en) * | 2015-07-30 | 2017-02-01 | Toyota Jidosha Kabushiki Kaisha | Control apparatus for hybrid vehicle, hybrid vehicle and control method for hybrid vehicle |
| CN107798991A (en) * | 2017-11-15 | 2018-03-13 | 交控科技股份有限公司 | A kind of electronic map Gradient generation method |
| JP2018136543A (en) * | 2018-02-26 | 2018-08-30 | Ｎｅｃプラットフォームズ株式会社 | Detection device, detection method and program thereof |
| CN109791732A (en) * | 2016-09-28 | 2019-05-21 | 五十铃自动车株式会社 | Section determination device and section determining method |
| CN110379150A (en) * | 2018-09-13 | 2019-10-25 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus for assessing road |
| CN110795868A (en) * | 2019-11-19 | 2020-02-14 | 通号城市轨道交通技术有限公司 | Train operation simulation data processing method and device based on urban rail transit |
| CN111003030A (en) * | 2019-12-27 | 2020-04-14 | 卡斯柯信号(北京)有限公司 | Method and device for generating temporary speed limit message test case of train control system |
| CN111959564A (en) * | 2020-08-28 | 2020-11-20 | 成都劳杰斯信息技术有限公司 | Train approaching early warning method based on computer interlocking and railway locomotive positioning |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8131517B2 (en) * | 2007-11-01 | 2012-03-06 | Autodesk, Inc. | Interconnected objects slope modification tool |
-
2020
- 2020-12-22 CN CN202011524669.2A patent/CN112579720B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6260054B1 (en) * | 1998-10-29 | 2001-07-10 | Neomagic Corp. | Reciprocal generator using piece-wise-linear segments of varying width with floating-point format |
| WO2011076081A1 (en) * | 2009-12-23 | 2011-06-30 | Lin Dingwei | Logical network automatic operation control system, automation control system and application method |
| CN101833282A (en) * | 2010-04-30 | 2010-09-15 | 林定伟 | Artificial intelligent control system and method |
| EP3124303A2 (en) * | 2015-07-30 | 2017-02-01 | Toyota Jidosha Kabushiki Kaisha | Control apparatus for hybrid vehicle, hybrid vehicle and control method for hybrid vehicle |
| CN109791732A (en) * | 2016-09-28 | 2019-05-21 | 五十铃自动车株式会社 | Section determination device and section determining method |
| CN107798991A (en) * | 2017-11-15 | 2018-03-13 | 交控科技股份有限公司 | A kind of electronic map Gradient generation method |
| JP2018136543A (en) * | 2018-02-26 | 2018-08-30 | Ｎｅｃプラットフォームズ株式会社 | Detection device, detection method and program thereof |
| CN110379150A (en) * | 2018-09-13 | 2019-10-25 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus for assessing road |
| CN110795868A (en) * | 2019-11-19 | 2020-02-14 | 通号城市轨道交通技术有限公司 | Train operation simulation data processing method and device based on urban rail transit |
| CN111003030A (en) * | 2019-12-27 | 2020-04-14 | 卡斯柯信号(北京)有限公司 | Method and device for generating temporary speed limit message test case of train control system |
| CN111959564A (en) * | 2020-08-28 | 2020-11-20 | 成都劳杰斯信息技术有限公司 | Train approaching early warning method based on computer interlocking and railway locomotive positioning |
Non-Patent Citations (1)
| Title |
|---|
| 自动闭塞区段最大坡度的讨论;孙中央;《铁道机车车辆》;19980430(第4期);第38-40页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112579720A (en) | 2021-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200272157A1 (en) | Method and apparatus for planning travelling path, and vehicle | |
| CN104111073A (en) | Method and device for identifying inaccurate paths in map data | |
| CN110532250B (en) | Method and device for processing traffic data | |
| CN113868350A (en) | Parking lot map processing method, vehicle and equipment | |
| CN108711025B (en) | Car rental vehicle inventory query method and device, electronic equipment and storage medium | |
| CN112734956A (en) | ETC portal determination method and device and storage medium | |
| CN112579720B (en) | Logic section path-based gradient section determination method and device | |
| CN114092909A (en) | Lane line extraction method and device, vehicle and storage medium | |
| CN113885917A (en) | Program flashing method and device of controller, controller and storage medium | |
| CN113722342A (en) | High-precision map element change detection method, device and equipment and automatic driving vehicle | |
| CN111951059A (en) | Real estate valuation method, device, terminal and readable storage medium | |
| CN112590882B (en) | Method and device for determining axle counting sections in logic section path | |
| CN113434938B (en) | BIM model checking method, BIM model checking device, computer equipment and storage medium | |
| CN113626483B (en) | Front-end caching method, system, equipment and storage medium for filling forms | |
| CN112666389B (en) | Double-core interaction method and device for double-core intelligent electric meter, double-core intelligent electric meter and medium | |
| CN112686904A (en) | Lane division method, lane division device, electronic equipment and storage medium | |
| CN111326006B (en) | Reminding method, reminding system, storage medium and vehicle-mounted terminal for lane navigation | |
| CN110542426B (en) | Method, device and readable medium for identifying small path | |
| KR102459682B1 (en) | Battery life predicting method for predicting battery life of electric vehicle and apparatus therefor | |
| CN112446940B (en) | Simplifying method and device for 3D model, electronic equipment and storage medium | |
| CN114440855B (en) | Method and system for positioning and map updating in dynamic scene | |
| CN111125179B (en) | Travel mode determining method, device, equipment and storage medium | |
| CN112798006B (en) | Method, device, storage medium and terminal for analyzing difference points of different paths | |
| CN112925867B (en) | Method and device for acquiring positioning truth value and electronic equipment | |
| CN113804213B (en) | AStar rapid path planning improvement algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |