CN112579720A - Method and device for determining gradient section based on logic section path - Google Patents
Method and device for determining gradient section based on logic section path Download PDFInfo
- Publication number
- CN112579720A CN112579720A CN202011524669.2A CN202011524669A CN112579720A CN 112579720 A CN112579720 A CN 112579720A CN 202011524669 A CN202011524669 A CN 202011524669A CN 112579720 A CN112579720 A CN 112579720A
- Authority
- CN
- China
- Prior art keywords
- section
- slope
- node
- logical
- logic
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000013459 approach Methods 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 11
- 238000010845 search algorithm Methods 0.000 claims description 9
- 230000001788 irregular Effects 0.000 claims description 5
- 230000004044 response Effects 0.000 claims description 5
- 239000000126 substance Substances 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 7
- 238000012545 processing Methods 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
- 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
- 239000002699 waste material Substances 0.000 description 1
Images
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 grade section based on a logical section path, comprising: receiving slope section query information, wherein the slope section query information comprises a starting point logical section number and an end point logical section number of a logical section path; determining all slope sections included in a logic section path according to a pre-established slope section node model; the slope section node model is established according to a data table of slope sections in a logic section path in an electronic map, wherein the data table comprises index numbers of the slope sections, numbers of the logic sections corresponding to the starting points of all the slope sections, offset of the starting points in the corresponding logic sections, numbers of the logic sections corresponding to the end points, offset of the end points in the corresponding logic sections, end point positive line slope numbers at the end points of all the logic section paths and end point side line slope numbers at the end points of all the logic section paths. In this way, the accuracy of the sought gradient section can be improved.
Description
Technical Field
Embodiments of the present disclosure relate generally to the field of rail transit technology, and more particularly, to a method and apparatus for determining a grade section based on a logical section path.
Background
At present, in an urban rail signal system, particularly 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, each signal manufacturer system is independent, and the local owner has special requirements for each line, so that the electronic data of each line has certain specificity. Due to the particularity, most of core data of a line, such as approaching zone data and triggering zone data, are manually obtained from basic electronic data by manually observing a CAD drawing to obtain related parameters, calculating a related distance by applying a formula, and then manually finding out a corresponding gradient section.
In the prior art, in the process of searching for the corresponding gradient section, due to the fact that more uncertain factors exist in manual work, the corresponding path can be found with low precision, many manual errors exist, and further, the subsequent data is reworked frequently, the cost is greatly increased, and the waste of labor cost is caused.
Disclosure of Invention
According to the embodiment of the disclosure, the determination scheme of the slope section based on the logic section path is provided, which can improve the precision of the searched slope section, reduce the rework frequency of later data and save the labor cost.
In a first aspect of the present disclosure, there is provided a method for determining a slope section based on a logical section path, including:
receiving slope section query information, wherein the slope section query information comprises a starting point logical section number and an end point logical section number of a logical section path;
determining all slope sections included in a logic section path according to a pre-established slope section node model; the slope section node model is established according to a data table of slope sections in a logic section path in an electronic map, wherein the data table comprises index numbers of the slope sections, numbers of logic sections corresponding to the starting points of each slope section, offset of the starting points of each slope section in the corresponding logic sections, numbers of logic sections corresponding to the end points of each slope section, offset of the end points of each slope section in the corresponding logic sections, end point straight line slope numbers at the end points of the path of each logic section and end point side line slope numbers at the end points of the path of each logic section.
The method according to the above aspect and any possible implementation manner further provides 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 logical section including a start point of the slope section is taken as a left child node, a logical section including an end point of the slope section is taken as a right child node, an offset of the start point of the slope section in the corresponding logical section is a parameter of the left child node, and an offset of the end point of the slope section in the corresponding logical section is a parameter of the right child node, where the slope section node and the logical section node are provided with corresponding numbers. .
The above-described aspect and any possible implementation further provides an implementation in which the determining all slope sections included in the logical section path according to a pre-established slope section node model includes:
according to a pre-established slope section node model, searching a slope section node corresponding to the end point of a logic section path from a slope section node corresponding to the start point of the logic section path by using a depth-first search algorithm, and outputting the searched slope section information; wherein the content of the first and second substances,
the slope section information comprises a logical section node corresponding to a slope section starting point, an offset of the slope section starting point in the logical section, a logical section node corresponding to a slope section end point and an offset of the slope section end point in the logical section.
The above-described aspect and any possible implementation manner further provide an implementation manner in which, according to a pre-established slope section node model, a depth-first search algorithm is used to search a slope section node of an end point of a logical section path from a slope section node of a start point of the logical section path, and the searched slope section information is output, including:
for a slope section node, judging whether a left sub-node of the slope section node is an invalid value or not, and determining a right sub-node of the slope section node by using a depth-first search algorithm in response to that the left sub-node of the slope section node is not the invalid value;
judging whether the right child node of the slope section node is an invalid value or not, and responding to the fact that the right child node of the slope section node is not the invalid value, outputting the offset of a logic section node corresponding to the left child node of the slope section node and the offset of a slope section starting point in a corresponding logic section, and the offset of a logic section node corresponding to the right child node of the slope section node and the offset of a slope section end point in a corresponding logic section.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
determining a slope section corresponding to an approach section in the logical section path and a slope value corresponding to the slope section;
generating a control signal for the train based on the length of the approach zone and a grade zone grade value in the approach zone.
The above aspect and any possible implementation further provides an implementation in which generating a control signal for a train based on a length of the approach zone and a grade zone grade value in the approach zone includes:
and determining the actual running distance of the train and the allowed maximum running speed according to the length of the approaching section and the gradient section gradient value in the approaching section, and generating a control signal.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
determining a slope section corresponding to a trigger section in the logic section path and a slope value corresponding to the slope section;
and generating a control signal of the train according to the length of the approach section and the gradient section gradient value in the trigger section.
In a second aspect of the present disclosure, there is provided a determination device of a gradient section based on a logical section path, including:
the information receiving module is used for receiving slope section query information, and the slope section query information comprises a starting point logic section number and an end point logic section number of a logic section path;
and the gradient section determination 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, an electronic device is provided, comprising a memory having stored thereon a computer program and a processor implementing the method as described above when executing the program.
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, is adapted to carry out the method as set forth above.
It should be understood that the statements herein reciting aspects are not intended to limit the critical or essential features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Through the method for determining the slope section based on the logic section path, the precision of the searched slope section can be improved, the rework frequency of later data is reduced, and the labor cost is saved.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, like or similar reference characters designate like or similar elements, and wherein:
fig. 1 is a flowchart illustrating a method for determining a gradient section based on a logical section path according to a first embodiment of the present disclosure;
fig. 2 is a flowchart illustrating a method for determining a gradient section based on a logical section path according to a second embodiment of the present disclosure;
fig. 3 is a functional configuration diagram of a determination device for a slope section based on a logical section path according to a third embodiment of the present disclosure;
fig. 4 is a schematic structural diagram illustrating a determination apparatus of a gradient section based on a logical section path according to a fourth embodiment of the present disclosure;
FIG. 5 shows a schematic diagram of a data table for a grade section of an electronic map;
fig. 6 is a schematic diagram showing the relative position relationship between a logic section and a slope section in a subway line;
fig. 7 shows a data structure diagram of a node model according to an embodiment of the present disclosure.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present disclosure more clear, the technical solutions of the embodiments of the present disclosure will be described clearly and completely with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are some, but not all embodiments of the present disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
In addition, the term "and/or" herein is only one kind of association relationship describing an associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
The method for determining the slope section in the logic section path in the embodiment of the disclosure can be applied to the process of newly building a route or reconstructing an existing route, and the slope section is determined from the logic section path of the electronic map, so that the approach section and the trigger section containing the corresponding slope section can be determined, and a basis is provided for generating a control signal of a train. The train section data in the prior art is usually stored in the form of electronic data. As shown in fig. 5, is a schematic diagram of a data table of a gradient section of an electronic map. Fig. 6 is a schematic diagram showing the relative position relationship between a logic section and a slope section in a subway line. As can be seen from fig. 5 and 6, the data table of the slope section of the electronic map includes an index number of the slope section, a number of a logical section corresponding to a start point of the slope section, an offset amount of a start point of the slope section in the corresponding logical section, a number of a logical section corresponding to an end point of the slope section, an offset amount of an end point of the slope section in the corresponding logical section, an end point straight line slope number at an end point of a path of the logical section, and an end point side line slope number at an end point of the path of the logical section, wherein 65535 represents an end point of the path of the slope section. Generally, a slope section at least comprises a logical section, the slope section is an actual physical section and is divided by a slope, and the logical road section is a virtual section and is divided by a logical concept. Referring to fig. 6, for the gradient zone 1, the corresponding logical zones are Link10 and Link11, for the gradient zone 2, the corresponding logical zones are Link11 and Link12, and similarly, for the gradient zone 3, the corresponding logical zones are Link12 and Link 13.
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 logical section path according to a first embodiment of the present disclosure is shown. The method for determining the gradient section based on the logic section path of the embodiment may include the following steps:
s101: receiving grade segment query information, the grade 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 approach section data, the trigger section data and the like, the relevant parameters are obtained by manually observing the CAD drawing according to the basic electronic data, the relevant distance is calculated by applying a formula, then the corresponding gradient road section is found in a manual mode, and then the gradient sections corresponding to the approach section and the trigger section are further determined. 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 including the logical section path are acquired from the request information.
S102: all grade segments included in the logical segment path are determined according to a pre-established grade segment node model.
After receiving the grade segment query information, the grade segment in the logical segment path may be determined according to a pre-established grade segment node model. As shown in fig. 7, a data structure diagram of a slope section node model of the embodiment of the present disclosure is shown. 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 containing a starting point of the slope section is taken as a left child node, a logic section containing an end point of the slope section is taken as a right child node, the offset of the starting point of the slope section in the corresponding logic section is a parameter of the left child node, the offset of the end point of the slope section in the corresponding logic section is a parameter of the right child node, and the slope section node and the logic section node are provided with corresponding numbers. . If the corresponding number of 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 logic sections contained in the slope section (contained link arrays) can be included, and then the node model is stored in the form of node information.
When determining a slope section in a logical section path, according to the slope section node model, a depth-first search algorithm may be used to search a slope section node corresponding to an end point of the logical section path from a slope section node corresponding to a start point of the logical section path, and output the searched slope section information, where the slope section information includes a logical section node corresponding to a start point of the slope section, an offset of the start point of the slope section in the logical section, a logical section node corresponding to an end point of the slope section, and an offset of the end point of the slope section in the logical section.
Specifically, for a slope section node, whether a left child node of the slope section node is an invalid value is judged, a right child node of the slope section node is determined by using a depth-first search algorithm in response to that the left child node of the slope section node is not the invalid value, and the right child node of the slope section node is not determined in response to that the left child node of the slope section node is the invalid value.
Judging whether the right child node of the slope section node is an invalid value or not, and responding to the fact that the right child node of the slope section node is not the invalid value, outputting the offset of a logic section node corresponding to the left child node of the slope section node and the offset of a slope section starting point in a corresponding logic section, and the offset of a logic section node corresponding to the right child node of the slope section node and the offset of a slope section end point in a corresponding logic section. And in response to the fact that the right child node of the slope section node is an invalid value, not outputting the offset of the logical section node corresponding to the left child node of the slope section node and the offset of the slope section starting point in the corresponding logical section, and the offset of the logical section node corresponding to the right child node of the slope section node and the offset of the slope section ending point in the corresponding logical section. If the left child node or the right child node of the slope section node is an invalid value, it indicates that the slope section node is an end point of the slope section path, and no logical section exists on the left side of the slope section or no logical section exists on the right side of the slope section.
In the above manner, 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 a collective manner.
In this embodiment, the grade segment node is a digital representation of the grade segment, representing the number of the grade segment, regardless of the length of the grade segment, and similarly, the logical segment node is a digital representation of the logical segment.
Through the method for determining the slope section based on the logic section path, the precision of the searched slope section can be improved, the rework frequency of later data is reduced, and the labor cost is saved.
An implementation of the computer program of the present embodiment is given below:
(1) initializing node information, calling a logic section path search algorithm, calculating all logic sections contained in a slope section path, and storing the logic sections as the node information;
(2) the logical segments and the gradient segments are modeled, the gradient segments are nodes, the logical segments are children, and the left child node index is numbered zdzxpdbh, the right child node index of the node is numbered zdcxpdbh, and if not, 65535.
(3) Obtaining a parameter: the logical section path link _ path.
(4) And constructing a virtual stack lstack { }, a key path keyPath { }, and a path return value ret { }.
(5) And acquiring slope numbers start _ pd _ sybh and end _ pd _ sybh of head and tail logic sections according to the index numbers and the offsets of the head and tail logic section nodes of the logic section path.
(6) The start slope number start _ pd _ sybh is pushed to the virtual stack lstack.
(7) And popping the last gradient index number node _ key from the virtual stack by using the method.
(8) Creating a current _ path as keyPath, and storing the current query path. Node _ key is added to the end of current _ path.
(9) If the left child node of the current node, zdzpdbh, is not 65535 (i.e., invalid), it is added to the virtual stack, the current query path, current _ path, is copied to copy _ path, and the current left child node, zdzpdbh, is added to copy _ path.
(10) The copy _ path is added to the critical path set key _ path.
(11) If the left child 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 of the current node is end _ pd _ sybh, copy _ path is added to the return path set.
(14) And (5) if the virtual stack is not empty, returning to the step, and if the virtual stack is empty, returning to the path set ret.
By the aid of the running stack of the running virtual stack simulator, algorithm crash caused by too many recursion levels due to too large data volume is avoided.
Fig. 2 is a flowchart of a method for determining a gradient section based on a logical section path according to a second embodiment of the present disclosure. The method for determining the gradient section based on the logic section path of the embodiment may include the following steps:
s201: receiving grade segment query information, the grade segment query information including a start logical segment number and an end logical segment number of a logical segment path.
S202: all grade segments included in the logical segment path are determined according to a pre-established grade segment node model.
The above steps are similar to steps S101 to S102 in the first embodiment, and are not repeated here. In addition, the present embodiment may further include the following steps:
s203: determining a grade segment corresponding to the approach segment and a grade value corresponding to the grade segment in the logical segment path.
And determining the actual running distance of the train and the allowed maximum running speed according to the length of the approaching section and the gradient section gradient value in the approaching section, and generating a control signal. Since the logical block path is a projection of the physical road segment on a plane, it ignores the grade value, i.e. the actual length of the train line is longer than the length of the logical block path.
S204: generating a control signal for the train based on the length of the approach zone and a grade zone grade value in the approach zone.
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 and influence the running distance of the train, and the value corresponds to the fluctuation degree of the gradient and influences the running data of the train (providing an acceleration for the train), an accurate control signal can be generated according to the length of the approaching section and the gradient section gradient value in the approaching section, so that the running control of the train is more accurate.
Furthermore, in the above embodiment, the method may further include:
determining a slope section corresponding to a trigger section in the logic section path and a slope value corresponding to the slope section; and generating a control signal of the train according to the length of the triggering section and the gradient section gradient value in the approaching section.
Through the method for determining the slope section in the logic section, the precision of the searched slope section can be improved, the rework frequency of later data is reduced, and the labor cost is saved. Meanwhile, the generated control signals of the approach section and the trigger section are more accurate, so that the running time interval of the train is favorably reduced, and the running efficiency is submitted.
It is noted that while for simplicity of explanation, the foregoing method embodiments have been described as a series of acts or combination of acts, it will be appreciated by those skilled in the art that the present disclosure is not limited by the order of acts, as some steps may, in accordance with the present disclosure, occur in other orders and concurrently. Further, those skilled in the art should also appreciate that the embodiments described in the specification are exemplary embodiments and that acts and modules referred to are not necessarily required by the disclosure.
The above is a description of embodiments of the method, and the embodiments of the apparatus are further described below.
Fig. 3 is a functional structure diagram of a determination device for a slope section based on a logical section path according to a third embodiment of the present disclosure. The determination device of the gradient section in the logic section of the present embodiment includes:
an information receiving module 301, 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 grade segment determination module 302 is configured to determine all grade segments included in the logical segment path according to a pre-established grade segment node model.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the described module may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.
Fig. 4 is a schematic structural diagram illustrating a determination apparatus of a gradient section based on a logical section path according to a fourth embodiment of the present disclosure. The terminal device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 4, the computer system includes a Central Processing Unit (CPU)401 that 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 necessary for system operation are also stored. The CPU 401, ROM 402, and RAM403 are connected to each other via 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 section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and 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. Drivers 410 are also connected to the I/O interface 405 on an as needed basis. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 on an as-needed basis, so that a computer program read out therefrom is mounted on the storage section 408 on an as-needed basis.
In particular, based on the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. 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 illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The computer program performs the above-described functions defined in the method of the present application when executed by a Central Processing Unit (CPU) 401.
The functions described herein above 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), and the like.
Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes 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 codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. 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. A 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.
Further, while 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. Under 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 limitations on the scope of the 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 disclosed as example forms of implementing the claims.
Claims (10)
1. A method for determining a grade segment based on a logical segment path, comprising:
receiving slope section query information, wherein the slope section query information comprises a starting point logical section number and an end point logical section number of a logical section path;
determining all slope sections included in a logic section path according to a pre-established slope section node model; wherein the content of the first and second substances,
the slope section node model is established according to a data table of slope sections in a logic section path in an electronic map, wherein the data table comprises index numbers of the slope sections, numbers of the logic sections corresponding to the starting points of each slope section, offset of the starting points of each slope section in the corresponding logic sections, numbers of the logic sections corresponding to the end points of each slope section, offset of the end points of each slope section in the corresponding logic sections, end point positive line slope numbers at the end points of the path of each logic section and end point side line slope numbers at the end points of the path of each logic section.
2. The method as claimed in claim 1, wherein the slope section node model is an irregular tree model, in which a slope section is used as a node, a logical section containing a start point of the slope section is used as a left child node, a logical section containing an end point of the slope section is used as a right child node, an offset of the start point of the slope section in the corresponding logical section is a parameter of the left child node, and an offset of the end point of the slope section in the corresponding logical section is a parameter of the right child node, wherein the slope section node and the logical section node are provided with corresponding numbers.
3. The method for determining a grade section based on a logical section path according to claim 2, wherein the determining all grade sections included in the logical section path according to a pre-established grade section node model comprises:
according to a pre-established slope section node model, searching a slope section node corresponding to the end point of a logic section path from a slope section node corresponding to the start point of the logic section path by using a depth-first search algorithm, and outputting the searched slope section information; wherein the content of the first and second substances,
the slope section information comprises a logical section node corresponding to a slope section starting point, an offset of the slope section starting point in the logical section, a logical section node corresponding to a slope section end point and an offset of the slope section end point in the logical section.
4. The method for determining a slope section based on a logical section path according to claim 3, wherein the searching for a slope section node of an end point of a logical section path from a slope section node of a start point of the logical section path using a depth-first search algorithm according to a pre-established slope section node model and outputting the searched slope section information comprises:
for a slope section node, judging whether a left sub-node of the slope section node is an invalid value or not, and determining a right sub-node of the slope section node by using a depth-first search algorithm in response to that the left sub-node of the slope section node is not the invalid value;
judging whether the right child node of the slope section node is an invalid value or not, and responding to the fact that the right child node of the slope section node is not the invalid value, outputting the offset of a logic section node corresponding to the left child node of the slope section node and the offset of a slope section starting point in a corresponding logic section, and the offset of a logic section node corresponding to the right child node of the slope section node and the offset of a slope section end point in a corresponding logic section.
5. The method for determining a grade section based on a logical section path according to claim 4, further comprising:
determining a slope section corresponding to an approach section in the logical section path and a slope value corresponding to the slope section;
generating a control signal for the train based on the length of the approach zone and a grade zone grade value in the approach zone.
6. The method of determining a grade section based on a logical section path according to claim 5, wherein the generating a control signal of a train according to the length of the approach section and a grade section grade value in the approach section comprises:
and determining the actual running distance of the train and the allowed maximum running speed according to the length of the approaching section and the gradient section gradient value in the approaching section, and generating a control signal.
7. The method for determining a grade section based on a logical section path according to claim 5, further comprising:
determining a slope section corresponding to a trigger section in the logic section path and a slope value corresponding to the slope section;
and generating a control signal of the train according to the length of the approach section and the gradient section gradient value in the trigger section.
8. A device for determining a grade section based on a logical section path, comprising:
the information receiving module is used for receiving slope section query information, and the slope section query information comprises a starting point logic section number and an end point logic section number of a logic section path;
and the gradient section determination module is used for determining all gradient sections included in the logic section path according to a pre-established gradient section node model.
9. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program, wherein the processor, when executing the program, implements the method of any of claims 1-7.
10. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the method according to any one of claims 1 to 7.
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 true CN112579720A (en) | 2021-03-30 |
| CN112579720B 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 (12)
| 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 |
| US20090119071A1 (en) * | 2007-11-01 | 2009-05-07 | Autodesk, Inc. | Interconnected objects slope modification tool |
| 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 |
-
2020
- 2020-12-22 CN CN202011524669.2A patent/CN112579720B/en active Active
Patent Citations (12)
| 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 |
| US20090119071A1 (en) * | 2007-11-01 | 2009-05-07 | Autodesk, Inc. | Interconnected objects slope modification tool |
| 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 |
|---|
| 孙中央: "自动闭塞区段最大坡度的讨论", 《铁道机车车辆》, no. 4, 30 April 1998 (1998-04-30), pages 38 - 40 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112579720B (en) | 2024-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113033029A (en) | Automatic driving simulation method and device, electronic equipment and storage medium | |
| US11466992B2 (en) | Method, apparatus, device and medium for detecting environmental change | |
| CN112734956B (en) | ETC portal determination method and device and storage medium | |
| CN113868350A (en) | Parking lot map processing method, vehicle and equipment | |
| CN115900742A (en) | Reference trajectory planning method and device for vehicle, electronic equipment and storage medium | |
| CN112066976A (en) | Self-adaptive expansion processing method and system, robot and storage medium | |
| CN113722342A (en) | High-precision map element change detection method, device and equipment and automatic driving vehicle | |
| CN112579720A (en) | Method and device for determining gradient section based on logic section path | |
| CN112616118A (en) | ETC portal frame determination method and device for vehicle passing through and storage medium | |
| CN116416588A (en) | Lane line prediction method, lane line prediction device, electronic equipment and storage medium | |
| CN112590882B (en) | Method and device for determining axle counting sections in logic section path | |
| CN115774837A (en) | Signal verification method, device, equipment, medium, program product and vehicle | |
| CN115049756A (en) | Method, device and medium for converting route map into plan map | |
| CN112686904A (en) | Lane division method, lane division device, electronic equipment and storage medium | |
| CN113570727A (en) | Scene file generation method and device, electronic equipment and storage medium | |
| CN113836612A (en) | Equipment associated information extraction method and device, electronic equipment and storage medium | |
| CN110986989A (en) | Hybrid vehicle type path planning method and related device | |
| CN114440855B (en) | Method and system for positioning and map updating in dynamic scene | |
| CN112798006B (en) | Method, device, storage medium and terminal for analyzing difference points of different paths | |
| CN112966119B (en) | Information acquisition method, equipment and medium | |
| CN112595332B (en) | Middle-precision map intersection processing method and system | |
| CN115061479B (en) | Lane relation determination method and device, electronic equipment and storage medium | |
| CN116576880B (en) | Lane-level road planning method and device, terminal equipment and storage medium | |
| CN115599874A (en) | High-precision map quality evaluation method, storage medium and terminal | |
| CN115408822A (en) | Threshold-based scene generation method and device and storage medium |
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 |