WO2019029637A1 - 列车排序方法及装置 - Google Patents

列车排序方法及装置 Download PDF

Info

Publication number
WO2019029637A1
WO2019029637A1 PCT/CN2018/099693 CN2018099693W WO2019029637A1 WO 2019029637 A1 WO2019029637 A1 WO 2019029637A1 CN 2018099693 W CN2018099693 W CN 2018099693W WO 2019029637 A1 WO2019029637 A1 WO 2019029637A1
Authority
WO
WIPO (PCT)
Prior art keywords
train
communication
communication train
offset
target
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.)
Ceased
Application number
PCT/CN2018/099693
Other languages
English (en)
French (fr)
Inventor
潘磊
苏波
卓开阔
王发平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BYD Co Ltd
Original Assignee
BYD Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by BYD Co Ltd filed Critical BYD Co Ltd
Publication of WO2019029637A1 publication Critical patent/WO2019029637A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L23/00—Control, warning or like safety means along the route or between vehicles or trains

Definitions

  • the invention relates to the technical field of rail transit, and in particular to a train sorting method and device.
  • the present invention aims to solve at least one of the technical problems in the related art to some extent.
  • the first object of the present invention is to provide a train sorting method for realizing the ordering of trains, facilitating the calculation of the mobile authorization of the train, and solving the cumbersome technical problem of calculating the mobile authorization process in the prior art.
  • a second object of the present invention is to provide a train sorting device.
  • a third object of the present invention is to propose a computer device.
  • a fourth object of the present invention is to provide a non-transitory computer readable storage medium.
  • a fifth object of the present invention is to provide a computer program product.
  • the first aspect of the present invention provides a train sequencing method, including:
  • the AT and the virtual UT are sorted according to the magnitude of the first offset and the second offset to form a train ranking result.
  • determining a second offset between the virtual non-communication train and the reference point comprises: determining a distance between a front of the virtual non-communication train and the reference point or a distance between a tail of the virtual non-communication train and the reference point; a distance between a front of the virtual non-communication train and the reference point or a tail of the virtual non-communication train and the reference point The distance between the two is determined as a second offset between the virtual non-communication train and the reference point.
  • the method further includes: storing parameter information of the communication train and the virtual non-communication train into a preset array; wherein the parameter information includes: a train ID (IDentity), a partial The shift and pointer information, wherein the offset is represented by a first offset or a second offset.
  • sorting the communication train and the virtual non-communication train according to the first offset amount and the second offset amount to form a train sorting result including: using a bubble sorting method
  • the array is sorted according to the size of the offset to form the sorting result, wherein the arrays in the sorting result are arranged in descending order of the offset.
  • the train ID of the virtual non-communication train is a preset value
  • the pointer information is empty.
  • the acquiring the occupied state of the logical segment in the route, and virtualizing the at least two logical segments that are continuously in the occupied state into one virtual non-communication train including: acquiring the axle counting device on the axle counting segment The axis counting state, determining an area occupied by the axle counting section according to the axle counting state; wherein the occupied area includes at least two consecutive logical sections; if the occupied area is within Determining that the at least two consecutive logical segments included in the occupied area are occupied by the non-communication train; the at least two consecutive ones included in the occupied area
  • the logical segment is virtualized into one of the virtual non-communication trains.
  • the method further includes: if the communication train is included in the occupied area, determining, according to the first location information reported by the communication train, the first location information a logical section; virtualizing the remaining logical sections included in the occupied area into one virtual non-communication train; wherein the remaining logical sections refer to divisions in the occupied area
  • the logical segment outside the logical segment corresponding to the first location information and the remaining logical segment includes at least two consecutive logical segments.
  • the method further comprises: obtaining a train ID of each train from the sorting result, determining whether the train is a communication train according to the train ID; calculating each Mobile authorization for communication trains.
  • the calculating a mobility authorization of each communication train includes: acquiring a train ID of a target communication train; wherein the target communication train is any one of all communication trains on the train line;
  • the train ID of the target communication train queries the sort result, acquires a train ID of a first train that is closest to the target communication train and is located in front of the target communication train; and calculates a train based on the train ID of the first train The mobile authorization of the target communication train.
  • the method further comprises: determining a security envelope range of the target communication train; determining whether there is a switch within the security envelope; The ball is present to acquire the state of the ballast; when the ballast is in a state requiring emergency braking, the target communication train is braked urgently.
  • the method further includes completing a train head screen of the target communication train and acquiring an approach matching table of the target communication train when the switch is in a state in which emergency braking is not required.
  • the ranking result is queried according to the train ID of the target communication train, and before the train ID of the first train that is closest to the target communication train and located in front of the target communication train is acquired,
  • the method further includes: querying a state of the front approach according to the approach matching table, and extending the mobile authorization of the target communication train to a position of the signal at the end of the approach if the forward approach is in an open state And considering a safety margin; if there is a protection section in the front access and the protection section is locked, extending the movement authorization of the target communication train to the end position of the protection section, and considering a safety margin; if there is a train in the forward approach, the query is performed according to the train ID of the target communication train, and the first result is obtained from the target communication train and located in front of the target communication train.
  • the train ID of a train is if there is a train in the forward approach, the query is performed according to the train ID of the target communication train, and the first result is obtained from the target communication train and located in
  • the calculating, according to the train ID of the first train, the mobile authorization of the target communication train comprising: determining, according to the train ID of the first train, whether the first train is a communication train And if the first train is the communication train, relining the movement authorization of the target communication train to the safety tail of the first train, and considering the safety margin; if the first train For the virtual non-communication train, the mobile authorization of the target communication train is retracted to the target axle counting section, and the safety margin is considered; wherein the target axle counting section is in the first train Behind the first axle counting section and spaced apart from the first axle counting section by one axle counting section.
  • the train sorting method of the embodiment of the present invention obtains the first position information reported by the AT, determines the first offset between the AT and the reference point according to the first position information of the AT, and acquires the occupied state of the logical segment in the line. Virtualizing at least two consecutive logical segments in an occupied state into one virtual UT, acquiring second location information of the logical segment in an occupied state, and determining a second bias between the virtual UT and the reference point according to the second location information The shift amount is sorted according to the size of the first offset and the second offset to form a train sorting result. Thereby, it is possible to sort all the trains in the line, facilitate the subsequent calculation of the mobile authorization, and simplify the calculation process of the mobile authorization.
  • the logical segment in the occupied state is virtualized into a virtual UT, which can avoid the passage of the train in the case where the road condition is unknown, and ensure the safe operation of the train. .
  • the train sorting result it is not necessary to determine the occupied state of the front section and the train type, thereby being able to solve the prior art. Calculate the cumbersome technical problems of the mobile authorization process.
  • the second aspect of the present invention provides a train sorting apparatus, including:
  • a first acquiring module configured to acquire first location information reported by the AT, and determine a first offset between the AT and the reference point according to the first location information of the AT;
  • a second acquiring module configured to acquire an occupied state of the logical segment in the route, and virtualize at least two consecutive logical segments in the occupied state into one virtual UT;
  • a third acquiring module configured to acquire second location information of the logical segment in an occupied state, and determine a second offset between the virtual UT and the reference point according to the second location information
  • a sorting module configured to sort the AT and the virtual UT according to the size of the first offset and the second offset to form a train sorting result.
  • the third obtaining module is further configured to: determine a distance between a front of the virtual non-communication train and the reference point or a tail of the virtual non-communication train and the reference point a distance between the front of the virtual non-communication train and the reference point or a distance between a tail of the virtual non-communication train and the reference point as the virtual non-communication train A second offset from the reference point.
  • the apparatus further includes: a depositing module, configured to store parameter information of the communication train and the virtual non-communication train into a preset array; wherein the parameter information Included: a train ID, an offset, and pointer information, wherein the offset is represented by a first offset or a second offset; the ordering module is further configured to: follow the array by bubble sorting The size of the offset is sorted to form the sort result, wherein the array in the sort result is arranged in descending order of the offset.
  • a depositing module configured to store parameter information of the communication train and the virtual non-communication train into a preset array
  • the parameter information Included: a train ID, an offset, and pointer information, wherein the offset is represented by a first offset or a second offset
  • the ordering module is further configured to: follow the array by bubble sorting The size of the offset is sorted to form the sort result, wherein the array in the sort result is arranged in descending order of the offset.
  • the second obtaining module is further configured to: obtain an axle counting state of the axle counting device on the axle counting section, and determine an occupied area of the axle counting section according to the axle counting state; Determining at least two consecutive logical segments in the occupied area; determining that at least two consecutive logics included in the occupied area are included if the communication train is absent in the occupied area A segment is occupied by the non-communication train; at least two consecutive logical segments contained within the occupied area are virtualized into one of the virtual non-communication trains.
  • the second obtaining module is further configured to: if the communication train is included in the occupied area, determine the first according to the first location information reported by the communication train a logical section corresponding to the location information; virtualizing the remaining logical sections included in the occupied area into one virtual non-communication train; wherein the remaining logical section refers to the occupied area A logical segment other than the logical segment corresponding to the first location information and the remaining logical segment includes at least two consecutive logical segments.
  • the apparatus further includes: a determining module, configured to acquire a train ID of each train from the sorting result, determine whether the train is a communication train according to the train ID; and calculate a module for calculating Mobile authorization for each communication train.
  • a determining module configured to acquire a train ID of each train from the sorting result, determine whether the train is a communication train according to the train ID; and calculate a module for calculating Mobile authorization for each communication train.
  • the calculating module is further configured to: acquire a train ID of the target communication train; wherein the target communication train is any one of all communication trains on the train line; and the communication train according to the target The train ID queries the sort result, acquires a train ID of the first train that is closest to the target communication train and is located in front of the target communication train; and calculates the target communication train based on the train ID of the first train Mobile authorization.
  • the calculating module is further configured to: determine a security envelope range of the target communication train; determine whether there is a switch within the security envelope; if the switch exists, acquire the switch a state; when the ballast is in a state requiring emergency braking, the target communication train is braked.
  • the calculating module is further configured to: when the switch is in a state in which emergency braking is not required, complete a train head screen of the target communication train and acquire a route matching of the target communication train table.
  • the calculating module is further configured to: query a state of the front approach according to the approach matching table, and if the front access is in an open state, extend the mobile authorization of the target communication train Positioning the signal to the end of the approach, and considering the safety margin; if there is a protection zone in the forward approach and the protection zone is locked, extending the mobile authorization of the target communication train to the Protecting the end position of the section and considering the safety margin; if there is a train in the forward approach, the query is performed according to the train ID of the target communication train, and the acquisition is closest to the target communication train and A train ID of a first train located in front of the target communication train.
  • the calculating module is further configured to: determine, according to the train ID of the first train, whether the first train is a communication train; if the first train is the communication train, Determining the movement authorization of the target communication train to the safety tail of the first train, and considering the safety margin; if the first train is the virtual non-communication train, then the target communication train is The movement authorization is retracted to the target axle counting section, and the safety margin is considered; wherein the target axle counting section is behind the first axle counting section where the first train is located and is related to the first gauge
  • the shaft segments are separated by an axle counting section.
  • the train sorting device of the embodiment of the present invention obtains the first position information reported by the AT, determines the first offset between the AT and the reference point according to the first position information of the AT, and acquires the occupied state of the logical segment in the line. Virtualizing at least two consecutive logical segments in an occupied state into one virtual UT, acquiring second location information of the logical segment in an occupied state, and determining a second bias between the virtual UT and the reference point according to the second location information The shift amount is sorted according to the size of the first offset and the second offset to form a train sorting result. Thereby, it is possible to sort all the trains in the line, facilitate the subsequent calculation of the mobile authorization, and simplify the calculation process of the mobile authorization.
  • the logical segment in the occupied state is virtualized into a virtual UT, which can avoid the passage of the train in the case where the road condition is unknown, and ensure the safe operation of the train. .
  • the train sorting result it is not necessary to determine the occupied state of the front section and the train type, thereby being able to solve the prior art. Calculate the cumbersome technical problems of the mobile authorization process.
  • a third aspect of the present invention provides a computer apparatus comprising: a memory, a processor, and a computer program stored on the memory and operable on the processor, the processor executing the computer program
  • the train sequencing method as described in the first aspect embodiment is implemented.
  • a fourth aspect of the present invention provides a non-transitory computer readable storage medium having stored thereon a computer program, the computer program being executed by a processor to implement a train sequencing method as described in the foregoing embodiments .
  • a fifth aspect of the present invention provides a computer program product for performing a train sorting method as described in the foregoing embodiments when an instruction in the computer program product is executed by a processor.
  • FIG. 1 is a schematic flow chart of a train sorting method according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of determining an offset between a virtual UT train and a reference point
  • FIG. 3 is a schematic flow chart of a train sorting method according to another embodiment of the present invention.
  • FIG. 4 is a schematic flow chart of a train sorting method according to another embodiment of the present invention.
  • FIG. 5 is a schematic diagram of determining the occupied condition of a logical section
  • FIG. 6 is a schematic flow chart of a train sorting method according to still another embodiment of the present invention.
  • FIG. 7 is a schematic structural diagram of a train sorting apparatus according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of a train sorting apparatus according to another embodiment of the present invention.
  • FIG. 9 is a schematic structural diagram of a train sorting apparatus according to still another embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
  • AT refers to the communication train, has a communication function, and can feedback the position information to the monitoring system in real time.
  • UT refers to non-communication trains, the English full name is Unequipped Train.
  • the approach refers to the path traveled by the train.
  • Logical section which refers to the smallest physical segment unit.
  • the axle counting section refers to a physical section between two adjacent axle counting devices, and one axle counting section may include more than one logical section.
  • the segment clearing that is, the train in a track circuit segment leaves the segment and makes the track circuit of the segment idle.
  • the segment occupancy that is, the train in a track circuit segment occupies the segment, so that the track circuit of the segment is in an occupied state.
  • FIG. 1 is a schematic flow chart of a train sorting method according to an embodiment of the present invention.
  • the train sequencing method includes the following steps:
  • Step 101 Acquire first location information reported by the AT, and determine a first offset between the AT and the reference point according to the first location information of the AT.
  • the AT is equipped with a Vehicle On Board Controller (VOBC) and has a communication function.
  • AT can upload information such as position and driving direction to the monitoring system through VOBC, such as Zone Controller (ZC).
  • ZC Zone Controller
  • the ZC acquires the first location information reported by the AT, the first offset between the AT and the reference point may be further determined according to the first location information of the AT.
  • the running track of the train can be regarded as a static coordinate system, and a starting point is selected as a reference point in the static coordinate system, and the first offset is 0 at the reference point. Furthermore, in this embodiment, after the first location information reported by the AT is acquired, according to the distance of the first location information with respect to the reference point, the first offset between the AT and the reference point may be determined.
  • Step 102 Acquire an occupation status of the logical segment in the route, and virtualize at least two consecutive logical segments in the occupied state into one virtual UT.
  • the occupation status of the logical segment includes: logical segment clearing (Logic Clean, LCL), logical segment AT occupation (LAT), logical segment UT occupation (LUT), and logical segment counting failure (clearing) LARBCL), AT occupying T (LARBA) when the logical sector counts the fault, and UT occupied (LOD) when the logical sector counts the fault.
  • logical segment clearing Logic Clean, LCL
  • LAT logical segment AT occupation
  • LUT logical segment UT occupation
  • LUT logical segment counting failure
  • the occupation state of the axle counting segment to which the logical segment belongs may be acquired first, and the occupation state of the axle counting segment may be through a computer interlocking subsystem (Computer Interlocking, CI) Get.
  • the occupancy status of the axle counting section indicates that the axle counting section is occupied by the AT
  • the occupancy state of each logical section in the axle counting section may be determined according to the state of the head screen tail screen of the AT in the axle counting section. Specifically, according to the train position, it can be determined which logical section the train occupies, or which two logical sections are occupied, and the logical section actually occupied by the train is occupied by the AT.
  • the logical section in front of the front of the axle section is free. If the head screen fails, the logical section in front of the front of the axle section is occupied by the UT.
  • the occupied state of the axle counting section indicates that the axle counting section is not occupied by the AT, the occupied state of each logical section in the axle counting section may be determined according to the occupied state of the axle counting section. If the axle counting section is not occupied, the logical section within the axle counting section is not occupied. If the logical segment within the axle counting section is occupied, the axle counting section is occupied.
  • At least two consecutive logical regions in the occupied state can be virtualized into one virtual UT without virtualizing each logical segment, thereby reducing the virtual train to be sorted.
  • Step 103 Acquire second position information of at least two consecutive logical segments in an occupied state, and determine a second offset between the virtual UT and the reference point according to the second location information.
  • the second location information of the at least two consecutive logical segments in the occupied state may be further acquired, and determined according to the second location information.
  • the second location information is location information of any one of at least two consecutive logical segments in an occupied state.
  • the second location information of the at least two consecutive logical segments in the occupied state is considered, and the second location information is used as the location information of the virtual UT, and further, according to the second location information and the reference point.
  • the distance determines a second offset between the virtual UT and the reference point.
  • FIG. 2 is a schematic diagram of determining a second offset between a virtual UT and a reference point.
  • the whole route is regarded as a static coordinate system.
  • a starting point (O point) is considered as a reference point.
  • the static coordinate system includes 14 logical segments (actually compared with 14). Much more).
  • the direction indicated by the arrow indicates the traveling direction of the train.
  • the occupancy state of three consecutive logical segments is determined to be UT occupation, and the three logical segments are virtualized as one virtual UT, and the length of the OM indicates the deviation of the tail of the virtual UT.
  • the amount of shift, the length of ON indicates the offset of the head of the virtual UT, and the offset of the tail of the virtual UT or the offset of the head of the virtual UT can be used as the second offset between the virtual UT and the reference point. the amount.
  • Step 104 Sort the AT and the virtual UT according to the size of the first offset and the second offset to form a train ranking result.
  • the first or second offset of all ATs and all virtual UTs included in the route relative to the reference point can be obtained. Further, the AT and the virtual UT on the route may be sorted according to the size of all the first or second offsets obtained, and the ranking results of all the trains in the route are obtained, so as to calculate the movement authorization of the train according to the sorting result.
  • the train sorting method of the embodiment obtains the first position information reported by the AT, determines the first offset between the AT and the reference point according to the first position information of the AT, and acquires the occupied state of the logical segment in the line. At least two consecutive logical segments in an occupied state are virtualized into one virtual UT, acquiring second location information of the logical segment in an occupied state, and determining a second offset between the virtual UT and the reference point according to the second location information
  • the quantity according to the size of the first offset and the second offset, sorts the AT and the virtual UT to form a train ranking result. Thereby, it is possible to sort all the trains in the line, facilitate the subsequent calculation of the mobile authorization, and simplify the calculation process of the mobile authorization.
  • the logical segment in the occupied state is virtualized into a virtual UT, which can avoid the passage of the train in the case where the road condition is unknown, and ensure the safe operation of the train. .
  • the logical segment in the occupied state is virtualized into a virtual UT, which can avoid the passage of the train in the case where the road condition is unknown, and ensure the safe operation of the train. .
  • by sorting the trains in the line according to the magnitude of the offset in order to calculate the movement authorization according to the sorting result of the train, it is not necessary to judge the occupied state of the front section and the train type, thereby being able to solve the prior art
  • the technical problem of calculating the cumbersome process of mobile authorization is not necessary to judge the occupied state of the front section and the train type, thereby being able to solve the prior art.
  • FIG. 3 is a schematic flow chart of the train sorting method according to another embodiment of the present invention.
  • the train sorting method may include the following steps:
  • Step 201 Acquire first location information reported by the AT, and determine a first offset between the AT and the reference point according to the first location information of the AT.
  • Step 202 Acquire an occupation status of the logical segment in the route, and virtualize at least two consecutive logical segments in the occupied state into one virtual UT.
  • Step 203 Acquire second position information of the logical segment in the occupied state, and determine a second offset between the virtual UT and the reference point according to the second location information.
  • step 201 to the step 203 of the present invention can be referred to the description of the step 101 to the step 103 in the foregoing embodiment, and the implementation principle is similar, and details are not described herein again.
  • Step 204 Store parameter information of the AT and the virtual UT into a preset array.
  • the parameter information includes: a train ID, an offset, and pointer information, wherein the offset is represented by a first offset or a second offset.
  • the parameter information can be provided by the in-vehicle system or by the computer interlocking subsystem itself.
  • the IDs of all the ATs in the route can be obtained by traversing the global array of the AT, wherein the ID of the AT is used to uniquely identify the corresponding AT, and the ID of all ATs is stored in the global array; or, The AT obtains its ID, and the AT controls the AT to report its own ID to the monitoring system, such as ZC.
  • the train ID is a preset value, such as 0xFF, and the pointer information is empty.
  • all ATs and all virtual UTs can be trained.
  • the ID, the first or second offset, and the pointer information are stored as parameter information in a preset array.
  • Step 205 Sort the array according to the size of the offset by using a bubble sorting method to form a sorting result, wherein the arrays in the sorting result are arranged in descending order according to the offset.
  • the array can be further sorted.
  • the bubble sorting method may be used to sort the array according to the offset of all train tails, and the offsets in the array are arranged in order from small to large to form a sorting result.
  • the smaller the offset the smaller the index position of the train in the array.
  • the train sorting method of this embodiment after acquiring the first or second offset of all ATs and all virtual UTs, the train IDs, first or second offsets, and pointers of all ATs and all virtual UTs
  • the information is stored as parameter information in a preset array, and the array is sorted by the bubble sorting method according to the size of the first or second offset, and the first or second offsets in the array are arranged from small to large.
  • the sorting result can facilitate the subsequent search for the relevant information of the train when calculating the mobile authorization according to the sorting result, and simplify the calculation process of the mobile authorization.
  • FIG. 4 is a schematic flow chart of a train sorting method according to another embodiment of the present invention.
  • the occupation status of the logical segment in the route is obtained, and the at least two consecutive logical segments in the occupied state are virtualized into one virtual UT, which may include the following steps:
  • Step 301 Acquire an axle counting state of the axle counting device on the axle counting section, and determine an occupied area of the axle counting section according to the axle counting state, wherein the occupied zone includes at least two consecutive logical sections.
  • the axle counting state includes the physical cleaning (PCL), the axle counting is occupied by at least one AT (PAT), the axle counting is occupied only by the UT (PUT), and the axle counting fault is cleared (PARB), When the axis fails, it is occupied by at least one AT (PARBAT), and when the axis is faulty, it is only occupied by the UT (POD).
  • PCL physical cleaning
  • PAT the axle counting is occupied by at least one AT
  • PUT the axle counting is occupied only by the UT
  • PARB axle counting fault is cleared
  • the axle counting state of the axle counting device on the axle counting section can be obtained by the CI system, and the area occupied by the axle counting section is determined according to the axle counting state.
  • the axle counter can count the number of wheel pairs of the train passing through the route, as an example, the axle counter can be installed at each end of each logical segment in the route, by monitoring the axle counters at each end of each logical segment.
  • the axle counting state determines the occupied area in the axle counting section.
  • the axle counting states of the axle counting devices at both ends of the logical segment are inconsistent, it indicates that the logical segment is occupied, and when the occupied logical region is at least two consecutive logical regions, at least two consecutive ones that can be occupied may be occupied.
  • the logical area is determined to be the occupied area within the axle counting section.
  • step 302 it is determined whether there is an AT in the occupied area.
  • the area is occupied, it can be considered that there is a car in the area, and since only the AT has a communication function, in this embodiment, whether the AT is occupied in the occupied area can be determined by sending a communication message to the occupied area. . If it is possible to establish a communication connection with the train in the occupied area, it is determined that there is an AT in the occupied area, and step 305 is performed. If the communication connection cannot be established, it is determined that there is no AT in the occupied area, and step 303 is performed.
  • Step 303 determining that at least two consecutive logical segments included in the occupied area are occupied by the UT.
  • Step 304 Virtualize at least two consecutive logical segments included in the occupied area into one virtual UT.
  • Step 305 Determine, according to the first location information reported by the AT, a logical segment corresponding to the first location information.
  • Step 306 Virtualize the remaining logical segments included in the occupied area into a virtual UT, where the remaining logical segments refer to logic in the occupied area except the first location information.
  • a logical segment outside the segment and the remaining logical segment includes at least two consecutive logical segments.
  • the logical segment corresponding to the first location information is determined according to the first location information reported by the train, and the logic occupied by the AT included in the occupied area is used.
  • the remaining logical segments outside the segment are virtualized into a virtual UT.
  • FIG. 5 is a schematic diagram of determining the occupancy of a logical section.
  • one axle counting section is divided into seven logical sections, and the logical section numbers are 1 to 7 from left to right, and the traveling direction of the train is shown by the direction indicated by the arrow in FIG.
  • logical area 2 and logical section 5 are occupied by ATs and B, respectively, that is, logical sections 2 and 5 are occupied by ATs. If both AT A and B in logical zone 2 and logical section 5 complete the head and tail screens, then logical sections 1, 3, 4, 6 and 7 are in an cleared state.
  • the AT A in the logical section 2 completes the head and tail screens
  • the ATB in the logical section 5 only completes the tail screen
  • the logical sections 1, 3 and 4 are in the clear state
  • the logical sections 6 and 7 are UT occupancy, virtualizing logical segments 6 and 7 into a virtual UT.
  • the AT B in the logical section 5 only completes the head screen
  • the logical sections 1, 6 and 7 are in the clear state
  • the logical section 3 and 4 is occupied by the UT, thereby virtualizing the logical sections 3 and 4 into a virtual UT.
  • neither of the AT A and B in the logical sections 2 and 5 completes the head and tail screens
  • logical sections 1, 3, 4, 6, and 7 are occupied by the UT.
  • the train sorting method of the embodiment determines the occupied area of the axle counting section according to the axle counting state by obtaining the axle counting state of the axle counting section on the axle counting section, and determines that the axle counting section is occupied when there is no AT in the occupied area.
  • the logical sector unit included in the occupied area is occupied by the UT, and the logical segment included in the occupied area is virtualized into a virtual UT.
  • the information determines the corresponding logical segment, and virtualizes the remaining logical segments included in the occupied region into a virtual UT, which can accurately identify the occupied condition of the logical segment, and calculate the mobile authorization and ensure the safe operation of the train.
  • the purpose of sorting the train is to simplify the calculation process of the mobile authorization. Therefore, in a possible implementation manner of the embodiment of the present invention, as shown in FIG. 6, on the basis of the foregoing embodiment, the formation is performed. After sorting the train results, the following steps can also be included:
  • Step 401 Obtain a train ID of each train from the sorting result, and determine whether the train is an AT according to the train ID.
  • the train ID can be used to uniquely identify the AT; for a virtual UT, the train ID is a preset value, such as 0xFF. Therefore, in the present embodiment, after the offsets in the array are sorted in order from small to large to generate the sort result, the train ID of each train can be obtained from the sort result, and whether the train is AT according to the train ID is determined.
  • the acquired train ID is not 0 and the train ID is not 0xFF, it is determined that the train is AT; if the acquired train ID is 0xFF, it is determined that the train is UT.
  • Step 402 calculating a mobile authorization for each AT.
  • a mobile authorization for each AT can be calculated.
  • the train ID of the target AT may be acquired first, wherein the target AT is any one of all ATs on the train line; and then according to the acquired target AT The train ID queries the sorting result, and obtains the train ID of the first train that is closest to the target AT and is located in front of the target AT traveling direction from the sorting result; finally, based on the train ID of the first train, the mobile authorization of the target AT is calculated.
  • whether the first train is an AT may be further determined according to the train ID of the first train. If it is determined that the first train is an AT, the movement authorization of the target AT is retracted to the safety tail of the first train, and the safety margin is considered, wherein the safety margin is a preset fixed distance; if it is determined that the first train is The virtual UT, the movement authorization of the target AT is retracted to the target axle counting section, and the safety margin is considered, wherein the target axle counting section is behind the first axle counting section where the first train is located and is related to the first gauge
  • the shaft segments are separated by an axle counting section.
  • the security envelope range of the target AT may be further determined, where the security envelope range is the front safety distance and the rear of the vehicle The sum of the safety distance and the length of the train.
  • the state of the switch is obtained when there is a switch, and when the switch is in the four open state/missing state (the lost state refers to the command that the switch is not received)
  • the switch is in an emergency braking state, and the target AT is braked urgently;
  • the train head screen of the target AT is completed (where the head screen succeeds in that there is no suspicious vehicle within a certain range of the train) and the access target non-empty (ie, the actual communication train exists) is obtained.
  • the state of the front approach is inquired. If the front approach is open, the mobile AT of the target AT is extended to the position of the signal at the end of the approach, and the safety margin is considered; If there is a protection zone and the protection zone is locked, the mobile AT of the target AT is extended to the end position of the protection zone, and the safety margin is considered; if there is a train in the front route, the train ID is queried according to the target AT. Sorting the result, acquiring the train ID of the first train that is closest to the target AT and located in front of the target AT, and calculating the mobile authorization of the target AT based on the train ID of the first train.
  • the train ID of each train is obtained from the sorting result, whether the train is an AT according to the train ID, and the mobile authorization of each AT is calculated, and the mobile authorization can be real-time. Feedback to the AT to ensure the safe driving of the AT.
  • the present invention also proposes a train sorting device.
  • FIG. 7 is a schematic structural diagram of a train sorting apparatus according to an embodiment of the present invention.
  • the train sorting device 70 includes a first obtaining module 710 , a second acquiring module 720 , a third acquiring module 730 , and a sorting module 740 . among them,
  • the first obtaining module 710 is configured to acquire first location information reported by the AT, and determine a first offset between the AT and the reference point according to the first location information of the AT.
  • the second obtaining module 720 is configured to acquire an occupied state of the logical segment in the route, and virtualize at least two consecutive logical segments in the occupied state into one virtual UT.
  • the second acquiring module 720 is specifically configured to acquire a counting state of the axle counting device on the axle counting section, and determine an occupied area of the axle counting section according to the axle counting state, wherein Having at least two consecutive logical segments in the occupied area; if there is no AT in the occupied area, determining that at least two consecutive logical segments included in the occupied area are occupied by the UT and will be At least two consecutive logical segments included in the occupied area are virtualized into one virtual UT; if there is an AT in the occupied area, the logical segment corresponding to the first location information is determined according to the first location information reported by the AT, And virtualizing the remaining logical segments included in the occupied area into one virtual UT, wherein the remaining logical segments refer to logical segments in the occupied area except the first location information.
  • a logical segment other than the remaining logical segment includes at least two consecutive logical segments.
  • the third obtaining module 730 is configured to acquire second location information of the logical segment in an occupied state, and determine a second offset between the virtual UT and the reference point according to the second location information.
  • the sorting module 740 is configured to sort the AT and the virtual UT according to the first offset and the size of the second offset to form a train sorting result.
  • the train sorting apparatus may further include:
  • the storage module 750 is configured to store parameter information of the AT and the virtual UT into a preset array, where the parameter information includes: a train ID, an offset, and pointer information, where the offset is first The offset or the second offset is represented.
  • the train ID of the virtual UT is a preset value, such as 0xFF, and the pointer information is empty.
  • the sorting module 740 is specifically configured to sort the array according to the size of the offset by using a bubble sorting method to form a sorting result, wherein the arrays in the sorting result are arranged in descending order of the offset.
  • the purpose of sorting the trains in the route is to simplify the calculation process of the mobile authorization. Further, in a possible implementation manner of the embodiment of the present invention, as shown in FIG. 9, the basis of the embodiment shown in FIG.
  • the sorting device 70 of the train may further include:
  • the determining module 760 is configured to obtain the train ID of each train from the sorting result, and determine whether the train is an AT according to the train ID.
  • the calculation module 770 is configured to calculate a mobile authorization of each AT.
  • the calculating module 770 is specifically configured to acquire a train ID of the target AT, where the target AT is any one of all ATs on the train line; according to the target AT The train ID queries the sort result, acquires the train ID of the first train that is closest to the target AT and is located in front of the target AT; and calculates the mobile authorization of the target AT based on the train ID of the first train.
  • the mobile authorization of the target AT when calculating the mobile authorization of the target AT based on the train ID of the first train, it may first determine whether the first train is an AT according to the train ID of the first train; if the first train is an AT, the mobile authorization of the target AT is retracted. Go to the safety tail of the first train and consider the safety margin; if the first train is a virtual UT, then the movement authorization of the target AT is retracted to the target axle counting section, and the safety margin is considered, wherein the target axle count The section is located behind the first axle counting section in which the first train is located and is spaced from the first axle counting section by an axle counting section.
  • the calculating module 770 is specifically configured to further determine a security envelope range of the target AT after acquiring the train ID of the target AT, where the security envelope range is The total distance between the front safety distance, the rear safety distance and the length of the train.
  • the target AT is braked urgently; when the switch is in a state in which emergency braking is not required, the train head screen of the target AT is completed and the target AT non-empty approach matching table is obtained. After that, according to the approach matching table, the state of the front approach is inquired.
  • the mobile AT of the target AT is extended to the position of the signal at the end of the approach, and the safety margin is considered; If there is a protection zone and the protection zone is locked, the mobile AT of the target AT is extended to the end position of the protection zone, and the safety margin is considered; if there is a train in the front route, the train ID is queried according to the target AT. Sorting the result, acquiring the train ID of the first train that is closest to the target AT and located in front of the target AT, and calculating the mobile authorization of the target AT based on the train ID of the first train.
  • the present invention also proposes a computer device.
  • FIG. 10 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
  • the computer device 100 includes a memory 1001, a processor 1002, and a computer program 1003 stored on the memory 1001 and operable on the processor 1002.
  • the processor 1002 executes the computer program 1003, the implementation is as described above.
  • the present invention also provides a train control center capable of realizing the train sorting method as described in the foregoing embodiments.
  • the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program capable of implementing the train sequencing method as described in the foregoing embodiments when the computer program is executed by the processor.
  • the present invention also provides a computer program product for performing the train sequencing method as described in the foregoing embodiments when the instructions in the computer program product are executed by the processor.
  • first and second are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated.
  • features defining “first” and “second” may include at least one of the features, either explicitly or implicitly.
  • the meaning of "a plurality” is at least two, such as two, three, etc., unless specifically defined otherwise.
  • a "computer-readable medium” can be any apparatus that can contain, store, communicate, propagate, or transport a program for use in an instruction execution system, apparatus, or device, or in conjunction with the instruction execution system, apparatus, or device.
  • computer readable media include the following: electrical connections (electronic devices) having one or more wires, portable computer disk cartridges (magnetic devices), random access memory (RAM), Read only memory (ROM), erasable editable read only memory (EPROM or flash memory), fiber optic devices, and portable compact disk read only memory (CDROM).
  • the computer readable medium may even be a paper or other suitable medium on which the program can be printed, as it may be optically scanned, for example by paper or other medium, followed by editing, interpretation or, if appropriate, other suitable The method is processed to obtain the program electronically and then stored in computer memory.
  • portions of the invention may be implemented in hardware, software, firmware or a combination thereof.
  • multiple steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system.
  • a suitable instruction execution system For example, if implemented in hardware and in another embodiment, it can be implemented by any one or combination of the following techniques well known in the art: discrete with logic gates for implementing logic functions on data signals Logic circuits, application specific integrated circuits with suitable combinational logic gates, programmable gate arrays (PGAs), field programmable gate arrays (FPGAs), and the like.
  • each functional unit in each embodiment of the present invention may be integrated into one processing module, or each unit may exist physically separately, or two or more units may be integrated into one module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules.
  • the integrated modules, if implemented in the form of software functional modules and sold or used as stand-alone products, may also be stored in a computer readable storage medium.
  • the above mentioned storage medium may be a read only memory, a magnetic disk or an optical disk or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Mechanical Engineering (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

一种列车排序方法及装置（70），其中，方法包括：获取通信列车上报的第一位置信息，根据通信列车的第一位置信息，确定通信列车与参考点之间的第一偏移量（101）；获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟非通信列车（102）；获取处于占用状态的至少两个连续的逻辑区段中任一个的第二位置信息，根据第二位置信息，确定虚拟非通信列车与参考点之间的第二偏移量（103）；根据第一偏移量和第二偏移量的大小，对通信列车和虚拟非通信列车进行排序，形成列车排序结果（104）。通过该方法，可以实现列车的排序，为计算列车的移动授权提供便利，解决现有技术中计算移动授权过程繁琐的技术问题。

Description

列车排序方法及装置
相关申请的交叉引用
本申请基于申请号为201710682287.4，申请日为2017年8月10日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本发明涉及轨道交通技术领域，尤其涉及一种列车排序方法及装置。
背景技术
轨道交通技术中，为保障列车的安全运行，通常需要计算移动授权(Movement Authority，MA)，并将计算的MA值提供给通信列车(Automatic Train，AT)，使AT参考MA值进行控制，实现AT在线路内的安全行驶。
相关技术中，在计算移动授权时，需要查看前方区段是否被占用，判断被占用区段上列车的类型，以及获取下一个区段上信号机的状态，计算过程较为繁琐。
发明内容
本发明旨在至少在一定程度上解决相关技术中的技术问题之一。
为此，本发明的第一个目的在于提出一种列车排序方法，以实现列车的排序，为计算列车的移动授权提供便利，解决现有技术中计算移动授权过程繁琐的技术问题。
本发明的第二个目的在于提出一种列车排序装置。
本发明的第三个目的在于提出一种计算机设备。
本发明的第四个目的在于提出一种非临时性计算机可读存储介质。
本发明的第五个目的在于提出一种计算机程序产品。
为达上述目的，本发明第一方面实施例提出了一种列车排序方法，包括：
获取AT上报的第一位置信息，根据所述AT的第一位置信息，确定所述AT与参考点之间的第一偏移量；
获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT(Unequipped train)；
获取处于占用状态的所述逻辑区段的第二位置信息，根据所述第二位置信息，确定所述虚拟UT与所述参考点之间的第二偏移量；
根据所述第一偏移量和所述第二偏移量的大小，对AT和虚拟UT进行排序，形成列车排序结果。
在一种实施方式中，确定所述虚拟非通信列车与所述参考点之间的第二偏移量包括：确定所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离；将所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离确定为所述虚拟非通信列车与所述参考点之间的第二偏移量。
在一种实施方式中，在所述根据所述第一偏移量和所述第二偏移量的大小，对所述通信列车和所述 虚拟非通信列车进行排序，形成列车排序结果之前，所述方法还包括：将所述通信列车和所述虚拟非通信列车的参数信息，存入到预设的数组中；其中，所述参数信息包括：列车ID(IDentity，身份标识号码)、偏移量以及指针信息，其中所述偏移量由第一偏移量或第二偏移量表示。所述根据所述第一偏移量和所述第二偏移量的大小，对所述通信列车和所述虚拟非通信列车进行排序，形成列车排序结果，包括：采用冒泡排序法对所述数组按照偏移量的大小进行排序，形成所述排序结果，其中，所述排序结果中所述数组按照所述偏移量从小到大的顺序排列。
在一种实施方式中，所述虚拟非通信列车的所述列车ID为预设的数值，所述指针信息为空。
在一种实施方式中，所述获取路线中逻辑区段的占用状态，将连续处于占用状态的至少两个逻辑区段虚拟成一个虚拟非通信列车，包括：获取计轴区段上计轴器的计轴状态，根据所述计轴状态确定所述计轴区段被占用的区域；其中，所述被占用的区域内包括至少两个连续的逻辑区段；如果所述被占用的区域内无所述通信列车，则确定所述被占用的区域内所包含的至少两个连续的逻辑区段被所述非通信列车占用；将所述被占用的区域内所包含的至少两个连续的逻辑区段虚拟成一个所述虚拟非通信列车。
在一种实施方式中，所述方法还包括：如果所述被占用的区域内有所述通信列车，根据所述通信列车上报的所述第一位置信息，确定所述第一位置信息对应的逻辑区段；将所述被占用的区域内所包括的剩余逻辑区段，虚拟成一个所述虚拟非通信列车；其中，所述剩余逻辑区段指的是所述被占用区域内的除与所述第一位置信息对应的逻辑区段之外的逻辑区段且所述剩余逻辑区段包括至少两个连续的逻辑区段。
在一种实施方式中，在所述形成列车排序结果之后，所述方法还包括：从所述排序结果中获取每个列车的列车ID，根据所述列车ID判断列车是否为通信列车；计算每个通信列车的移动授权。
在一种实施方式中，所述计算每个通信列车的移动授权，包括：获取目标通信列车的列车ID；其中，所述目标通信列车为列车线路上所有通信列车中的任意一个通信列车；根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID；基于所述第一列车的列车ID，计算所述目标通信列车的移动授权。
在一种实施方式中，在所述获取目标通信列车的列车ID之后，所述方法还包括：确定所述目标通信列车的安全包络范围；判断所述安全包络范围内是否存在道岔；如果存在所述道岔，获取所述道岔的状态；当所述道岔处于需要紧急制动的状态时，则控制所述目标通信列车紧急制动。
在一种实施方式中，所述方法还包括：当所述道岔处于非需要紧急制动的状态时，完成所述目标通信列车的列车头筛并获取所述目标通信列车的进路匹配表。
在一种实施方式中，在所述根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID之前，所述方法还包括：根据所述进路匹配表查询前方进路的状态，如果所述前方进路处于开放状态，则将所述目标通信列车的移动授权延伸至进路终点处信号机的位置，并考虑安全余量；如果所述前方进路中存在保护区段且所述保护区段锁闭，则将所述目标通信列车的移动授权延伸至所述保护区段的终点位置，并考虑安全余量；如果所述前方进路中存在列车，则所述根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID。
在一种实施方式中，所述基于所述第一列车的列车ID，计算所述目标通信列车的移动授权，包括：根据所述第一列车的列车ID判断所述第一列车是否为通信列车；如果所述第一列车为所述通信列车， 则将所述目标通信列车的移动授权回退到所述第一列车的安全车尾，并考虑所述安全余量；如果所述第一列车为所述虚拟非通信列车，则将所述目标通信列车的移动授权回退到目标计轴区段，并考虑所述安全余量；其中，所述目标计轴区段处于所述第一列车所在的第一计轴区段后方且与所述第一计轴区段间隔一个计轴区段。
本发明实施例的列车排序方法，通过获取AT上报的第一位置信息，根据AT的第一位置信息确定AT与参考点之间的第一偏移量，获取线路中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT，获取处于占用状态的逻辑区段的第二位置信息，根据第二位置信息确定虚拟UT与参考点之间的第二偏移量，根据第一偏移量和第二偏移量的大小，对AT和虚拟UT进行排序，形成列车排序结果。由此，能够实现对线路中所有列车进行排序，为后续计算移动授权提供便利，简化移动授权的计算过程。通过将设备故障等原因导致逻辑区段被占用的情况考虑在内，将处于占用状态的逻辑区段虚拟成一个虚拟UT，能够在前方道路状况未知的情况下避免列车通过，保障列车的安全运行。与现有技术相比，通过根据偏移量的大小对线路中的列车进行排序，以便根据列车排序结果计算移动授权，无需判断前方区段的占用状态和列车类型，从而能够解决现有技术中计算移动授权过程繁琐的技术问题。
为达上述目的，本发明第二方面实施例提出一种列车排序装置，包括：
第一获取模块，用于获取AT上报的第一位置信息，根据所述AT的第一位置信息，确定所述AT与参考点之间的第一偏移量；
第二获取模块，用于获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT；
第三获取模块，用于获取处于占用状态的所述逻辑区段的第二位置信息，根据所述第二位置信息，确定所述虚拟UT与所述参考点之间的第二偏移量；
排序模块，用于根据所述第一偏移量和所述第二偏移量的大小，对AT和虚拟UT进行排序，形成列车排序结果。
在一种实施方式中，所述第三获取模块进一步用于：确定所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离；将所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离确定为所述虚拟非通信列车与所述参考点之间的第二偏移量。
在一种实施方式中，所述装置还包括：存入模块，用于将所述通信列车和所述虚拟非通信列车的参数信息，存入到预设的数组中；其中，所述参数信息包括：列车ID、偏移量以及指针信息，其中所述偏移量由第一偏移量或第二偏移量表示；所述排序模块进一步用于：采用冒泡排序法对所述数组按照偏移量的大小进行排序，形成所述排序结果，其中，所述排序结果中所述数组按照所述偏移量从小到大的顺序排列。
在一种实施方式中，所述第二获取模块进一步用于：获取计轴区段上计轴器的计轴状态，根据所述计轴状态确定所述计轴区段被占用的区域；其中，所述被占用的区域内包括至少两个连续的逻辑区段；如果所述被占用的区域内无所述通信列车，则确定所述被占用的区域内所包含的至少两个连续的逻辑区段被所述非通信列车占用；将所述被占用的区域内所包含的至少两个连续的逻辑区段虚拟成一个所述虚拟非通信列车。
在一种实施方式中，所述第二获取模块还用于：如果所述被占用的区域内有所述通信列车，根据所述通信列车上报的所述第一位置信息，确定所述第一位置信息对应的逻辑区段；将所述被占用的区域内所包括的剩余逻辑区段，虚拟成一个所述虚拟非通信列车；其中，所述剩余逻辑区段指的是所述被占用区域内的除与所述第一位置信息对应的逻辑区段之外的逻辑区段且所述剩余逻辑区段包括至少两个连续的逻辑区段。
在一种实施方式中，所述装置还包括：判断模块，用于从所述排序结果中获取每个列车的列车ID，根据所述列车ID判断列车是否为通信列车；计算模块，用于计算每个通信列车的移动授权。
在一种实施方式中，所述计算模块进一步用于：获取目标通信列车的列车ID；其中，所述目标通信列车为列车线路上所有通信列车中的任意一个通信列车；根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID；基于所述第一列车的列车ID，计算所述目标通信列车的移动授权。
在一种实施方式中，所述计算模块还用于：确定所述目标通信列车的安全包络范围；判断所述安全包络范围内是否存在道岔；如果存在所述道岔，获取所述道岔的状态；当所述道岔处于需要紧急制动的状态时，则控制所述目标通信列车紧急制动。
在一种实施方式中，所述计算模块还用于：当所述道岔处于非需要紧急制动的状态时，完成所述目标通信列车的列车头筛并获取所述目标通信列车的进路匹配表。
在一种实施方式中，所述计算模块还用于：根据所述进路匹配表查询前方进路的状态，如果所述前方进路处于开放状态，则将所述目标通信列车的移动授权延伸至进路终点处信号机的位置，并考虑安全余量；如果所述前方进路中存在保护区段且所述保护区段锁闭，则将所述目标通信列车的移动授权延伸至所述保护区段的终点位置，并考虑安全余量；如果所述前方进路中存在列车，则所述根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID。
在一种实施方式中，所述计算模块还用于：根据所述第一列车的列车ID判断所述第一列车是否为通信列车；如果所述第一列车为所述通信列车，则将所述目标通信列车的移动授权回退到所述第一列车的安全车尾，并考虑所述安全余量；如果所述第一列车为所述虚拟非通信列车，则将所述目标通信列车的移动授权回退到目标计轴区段，并考虑所述安全余量；其中，所述目标计轴区段处于所述第一列车所在的第一计轴区段后方且与所述第一计轴区段间隔一个计轴区段。
本发明实施例的列车排序装置，通过获取AT上报的第一位置信息，根据AT的第一位置信息确定AT与参考点之间的第一偏移量，获取线路中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT，获取处于占用状态的逻辑区段的第二位置信息，根据第二位置信息确定虚拟UT与参考点之间的第二偏移量，根据第一偏移量和第二偏移量的大小，对AT和虚拟UT进行排序，形成列车排序结果。由此，能够实现对线路中所有列车进行排序，为后续计算移动授权提供便利，简化移动授权的计算过程。通过将设备故障等原因导致逻辑区段被占用的情况考虑在内，将处于占用状态的逻辑区段虚拟成一个虚拟UT，能够在前方道路状况未知的情况下避免列车通过，保障列车的安全运行。与现有技术相比，通过根据偏移量的大小对线路中的列车进行排序，以便根据列车排序结果计算移动授权，无需判断前方区段的占用状态和列车类型，从而能够解决现有技术中计算移动授权过程繁琐的技术问题。
为达上述目的，本发明第三方面实施例提出了一种计算机设备，包括：存储器、处理器以及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时，实现如第一方面实施例所述的列车排序方法。
为达上述目的，本发明第四方面实施例提出一种非临时性计算机可读存储介质，其上存储有计算机程序，该计算机程序被处理器执行时实现如前述实施例所述的列车排序方法。
为达上述目的，本发明第五方面实施例提出一种计算机程序产品，当所述计算机程序产品中的指令由处理器执行时，执行如前述实施例所述的列车排序方法。
本发明附加的方面和优点将在下面的描述中部分给出，部分将从下面的描述中变得明显，或通过本发明的实践了解到。
附图说明
本发明上述的和/或附加的方面和优点从下面结合附图对实施例的描述中将变得明显和容易理解，其中：
图1为本发明一实施例提出的列车排序方法的流程示意图；
图2为确定虚拟UT列车与参考点之间的偏移量的示意图；
图3为本发明另一实施例提出的列车排序方法的流程示意图；
图4为本发明又一实施例提出的列车排序方法的流程示意图；
图5为确定逻辑区段的被占用情况示意图；
图6为本发明还一实施例提出的列车排序方法的流程示意图；
图7为本发明一实施例提出的列车排序装置的结构示意图；
图8为本发明另一实施例提出的列车排序装置的结构示意图；
图9为本发明又一实施例提出的列车排序装置的结构示意图；
图10为本发明一实施例提出的计算机设备的结构示意图。
具体实施方式
下面详细描述本发明的实施例，所述实施例的示例在附图中示出，其中自始至终相同或类似的标号表示相同或类似的元件或具有相同或类似功能的元件。下面通过参考附图描述的实施例是示例性的，旨在用于解释本发明，而不能理解为对本发明的限制。
下面参考附图描述本发明实施例的列车排序方法及装置。
为了便于理解本发明，在详细解释本发明的具体实现方案之前，首先对本发明中可能用到的术语进行解释如下：
AT，指通信列车，具有通信功能，可以向监控系统实时反馈位置信息等。
UT，指非通信列车，英文全称为Unequipped Train。
进路，指列车行进的路径。
逻辑区段，指最小的物理区段单元。
计轴区段，指两个相邻的计轴器之间的物理区段，一个计轴区段可以包括不止一个逻辑区段。
区段出清，即某一轨道电路区段中的列车驶离该区段后使该区段的轨道电路空闲。
区段占用，即某一轨道电路区段中的列车占用该区段，使该区段的轨道电路处于占用状态。
图1为本发明一实施例提出的列车排序方法的流程示意图。
如图1所示，该列车排序方法包括以下步骤：
步骤101，获取AT上报的第一位置信息，根据AT的第一位置信息，确定AT与参考点之间的第一偏移量。
AT上设置有车载控制器(Vehicle On Board Controller，VOBC)，具有通信功能。AT可以通过VOBC将位置、行驶方向等信息上传至监控系统，比如区域控制器(Zone Controller，ZC)。ZC获取了AT上报的第一位置信息之后，可以进一步根据AT的第一位置信息确定AT与参考点之间的第一偏移量。
在确定第一偏移量时，可以将列车的运行轨道看作是一个静态坐标系，在静态坐标系中选取一个起点作为参考点，在参考点处第一偏移量为0。进而，本实施例中，在获取了AT上报的第一位置信息之后，根据第一位置信息相对于参考点的距离，可以确定AT与参考点之间的第一偏移量。
步骤102，获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT。
其中，逻辑区段的占用状态包括：逻辑区段出清(Logic Clean，LCL)、逻辑区段AT占用(LAT)、逻辑区段UT占用(LUT)、逻辑区段计轴故障时出清(LARBCL)、逻辑区段计轴故障时AT占用T(LARBA)、逻辑区段计轴故障时UT占用(LOD)。
本实施例中，在获取路线中逻辑区段的占用状态时，可以先获取逻辑区段所属计轴区段的占用状态，计轴区段的占用状态可以通过计算机联锁子系统(Computer Interlocking，CI)获取。当计轴区段的占用状态指示计轴区段由AT占用时，可以根据计轴区段内AT的头筛尾筛状态确定计轴区段内各逻辑区段的占用状态。具体的，根据列车位置,可以确定列车占用哪个逻辑区段,或者占用哪两个逻辑区段,列车实际占用的逻辑区段是AT占用。如果头筛完成,则计轴区段内车头前面的逻辑区段是空闲的,如果头筛失败,则计轴区段内车头前面的逻辑区段是UT占用。当计轴区段的占用状态指示计轴区段未被AT占用时，可以根据计轴区段的占用状态确定计轴区段内各逻辑区段的占用状态。计轴区段未被占用,则该计轴区段内的逻辑区段不被占用。若计轴区段内的逻辑区段被占用,则该计轴区段被占用。
获取了路线中逻辑区段的占用状态之后，可以将处于占用状态的至少两个连续的逻辑区域虚拟成一个虚拟UT，无需对每个逻辑区段进行虚拟化，从而减少了待排序的虚拟列车的数量，简化了排序过程。
步骤103，获取处于占用状态的至少两个连续的逻辑区段的第二位置信息，根据第二位置信息，确定虚拟UT与参考点之间的第二偏移量。
本实施例中，获取了路线中至少两个连续的逻辑区段的占用状态之后，可以进一步获取处于占用状态的至少两个连续的逻辑区段的第二位置信息，并根据第二位置信息确定虚拟UT与参考点之间的第二偏移量。第二位置信息为处于占用状态的至少两个连续的逻辑区段中的任意一个的位置信息。
由于UT不具备通信功能，不能上报其位置信息，因而不能直接获取虚拟UT的位置信息。因此，本实施例中考虑获取处于占用状态的至少两个连续的逻辑区段的第二位置信息，将第二位置信息作为虚拟UT的位置信息，进而根据第二位置信息与参考点之间的距离，确定虚拟UT与参考点之间的第二偏移量。
作为一种示例，图2为确定虚拟UT与参考点之间的第二偏移量的示意图。如图2所示，将整个路线作为一个静态坐标系，在静态坐标系中认为设定一个起点(O点)作为参考点，该静态坐标系中包括14个逻辑区段(实际要比14个多得多)。图2中，箭头所指的方向表示列车的行驶方向。从图2中可以 看出，有三个连续的逻辑区段的占用状态被确定为UT占用，将这三个逻辑区段虚拟为一个虚拟UT，则OM的长度表示该虚拟UT的车尾的偏移量，ON的长度表示该虚拟UT的车头的偏移量，可将虚拟UT的车尾的偏移量或虚拟UT的车头的偏移量作为虚拟UT与参考点之间的第二偏移量。
步骤104，根据第一偏移量和第二偏移量的大小，对AT和虚拟UT进行排序，形成列车排序结果。
通过上述步骤，可以获取路线中包括的所有AT和所有虚拟UT相对于参考点的第一或第二偏移量。进而，可以根据获取的所有第一或第二偏移量的大小，对路线上的AT和虚拟UT进行排序，得到路线中所有列车的排序结果，以便于后续根据排序结果计算列车的移动授权。
本实施例的列车排序方法，通过获取AT上报的第一位置信息，根据AT的第一位置信息确定AT与参考点之间的第一偏移量，获取线路中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT，获取处于占用状态的逻辑区段的第二位置信息，根据第二位置信息确定虚拟UT与参考点之间的第二偏移量，根据第一偏移量和第二偏移量的大小，对AT和虚拟UT进行排序，形成列车排序结果。由此，能够实现对线路中所有列车进行排序，为后续计算移动授权提供便利，简化移动授权的计算过程。通过将设备故障等原因导致逻辑区段被占用的情况考虑在内，将处于占用状态的逻辑区段虚拟成一个虚拟UT，能够在前方道路状况未知的情况下避免列车通过，保障列车的安全运行。与现有技术相比，通过根据偏移量的大小对线路中的列车进行排序，以便根据列车的排序结果计算移动授权，无需判断前方区段的占用状态和列车类型，从而能够解决现有技术中计算移动授权过程繁琐的技术问题。
对路线中的列车进行排序的目的在于方便计算列车的移动授权，为便于从排序结果中查找列车的相关信息，进而方便移动授权的计算，可以对列车的相关信息进行存储。从而，本发明提出了另一种列车的排序方法，图3为本发明另一实施例提出的列车排序方法的流程示意图。
如图3所示，该列车排序方法可以包括以下步骤：
步骤201，获取AT上报的第一位置信息，根据AT的第一位置信息，确定AT与参考点之间的第一偏移量。
步骤202，获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT。
步骤203，获取处于占用状态的逻辑区段的第二位置信息，根据第二位置信息，确定虚拟UT与参考点之间的第二偏移量。
需要说明的是，本发明对步骤201-步骤203的描述，可参见前述实施例中对步骤101-步骤103的描述，其实现原理类似，此处不再赘述。
步骤204，将AT和虚拟UT的参数信息，存入到预设的数组中。
其中，参数信息包括：列车ID、偏移量以及指针信息，其中偏移量由第一偏移量或第二偏移量表示。参数信息可由车载系统提供,或由计算机联锁子系统自身构建。
对于AT而言，可以通过遍历AT的全局数组的方式获取路线中所有AT的ID，其中，AT的ID用于唯一标识对应的AT，全局数组中存储有所有AT的ID；或者，也可以从AT处获取其ID，控制AT将自身的ID上报至监控系统，比如ZC。对于虚拟UT而言，列车ID为预设的数值，比如0xFF，指针信息为空。
本实施例中，确定了路线中所有AT与参考点之间的第一偏移量以及所有的虚拟UT与参考点之间的第二偏移量之后，可以将所有AT和所有虚拟UT的列车ID、第一或第二偏移量以及指针信息作为参数信 息存入至预设的数组中。
步骤205，采用冒泡排序法对数组按照偏移量的大小进行排序，形成排序结果，其中，排序结果中数组中按照偏移量从小到大顺序排列。
对于存入了所有AT和所有虚拟UT的参数信息的数组，可以进一步对数组进行排序。
具体地，可以采用冒泡排序法对数组按照所有列车车尾的偏移量的大小进行排序，将数组中的偏移量按照从小到大的顺序进行排列，形成排序结果。在排序结果中，偏移量越小的列车在数组中的索引位置越小。
本实施例的列车排序方法，通过在获取了所有AT和所有虚拟UT的第一或第二偏移量之后，将所有AT和所有虚拟UT的列车ID、第一或第二偏移量以及指针信息作为参数信息存入到预设的数组中，并采用冒泡排序法对数组按照第一或第二偏移量的大小进行排序，形成数组中第一或第二偏移量从小到大排列的排序结果，能够便于后续根据排序结果计算移动授权时查找列车的相关信息，简化移动授权的计算过程。
为了更加清楚地说明获取路线中逻辑区段的占用状态，将连续处于占用状态的至少两个逻辑区段虚拟成一个虚拟UT的具体实现过程，本发明实施例提出了另一种列车排序方法，图4为本发明又一实施例提出的列车排序方法的流程示意图。
如图4所示，在前述实施例的基础上，获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT，具体可以包括以下步骤：
步骤301，获取计轴区段上计轴器的计轴状态，根据计轴状态确定计轴区段被占用的区域，其中，被占用的区域内包括至少两个连续的逻辑区段。
其中，计轴状态包括计轴出清(Physical Clean，PCL)、计轴被至少一辆AT占用(PAT)、计轴仅被UT占用(PUT)、计轴故障时出清(PARB)、计轴故障时被至少一辆AT占用(PARBAT)、计轴故障时仅被UT占用(POD)。
本实施例中，可以通过CI系统获取计轴区段上计轴器的计轴状态，并根据计轴状态确定计轴区段被占用的区域。
由于计轴器可以统计路线中所经过列车的车轮对数，作为一种示例，可以在路线中各个逻辑区段的每一个端点处安装计轴器，通过监测各个逻辑区段每一端计轴器的计轴状态来判断计轴区段内被占用的区域。当逻辑区段两端的计轴器的计轴状态不一致时，表明该逻辑区段被占用，当被占用的逻辑区域为至少两个连续的逻辑区域时，可以将被占用的至少两个连续的逻辑区域确定为计轴区段内被占用的区域。
步骤302，判断被占用的区域内是否有AT。
区域被占用可以认为该区域内有车，而又由于只有AT具有通信功能，因此，本实施例中，可以通过向被占用的区域发送通信报文的方式来判断被占用的区域内是否有AT。若能够与被占用区域内的列车建立通信连接，则判定被占用区域内有AT，此时执行步骤305；若不能建立通信连接，则判定被占用区域内无AT，此时执行步骤303。
步骤303，确定被占用的区域内所包含的至少两个连续的逻辑区段被UT占用。
步骤304，将被占用的区域内所包含的至少两个连续的逻辑区段虚拟成一个虚拟UT。
本实施例中，若判定被占用区域内无AT，则确定被占用的区域内所包含的至少两个连续的逻辑区段 被UT占用，进而确定将被占用的区域内所包含的至少两个连续的逻辑区段虚拟成一个UT。
步骤305，根据AT上报的第一位置信息，确定第一位置信息对应的逻辑区段。
步骤306，将被占用的区域内所包括的剩余逻辑区段，虚拟成一个虚拟UT，其中，剩余逻辑区段指的是所述被占用区域内的除与所述第一位置信息对应的逻辑区段之外的逻辑区段且所述剩余逻辑区段包括至少两个连续的逻辑区段。
本实施例中，若判定被占用的区域内有AT，则根据列车上报的第一位置信息确定第一位置信息对应的逻辑区段，并将被占用的区域内所包括的除AT占用的逻辑区段之外的剩余逻辑区段，虚拟成一个虚拟UT。
作为一种示例，图5为确定逻辑区段的被占用情况示意图。如图5所示，一个计轴区段被划分为7个逻辑区段，逻辑区段的编号从左至右依次为①～⑦，列车的行驶方向如图5中箭头所指方向所示。在图5所示的示例中，逻辑区域②和逻辑区段⑤分别被AT A和B占用，即逻辑区段②和⑤为AT占用。如果逻辑区域②和逻辑区段⑤内的两辆AT A和B均完成头筛和尾筛，则逻辑区段①、③、④、⑥和⑦为出清状态。如果逻辑区段②内的AT A完成头筛和尾筛，逻辑区段⑤内的ATB只完成了尾筛，则逻辑区段①、③和④为出清状态，逻辑区段⑥和⑦为UT占用，将逻辑区段⑥和⑦虚拟成一个虚拟UT。如果逻辑区段②内的AT A完成了头筛和尾筛，逻辑区段⑤内的AT B只完成了头筛，则逻辑区段①、⑥和⑦为出清状态，逻辑区段③和④为UT占用，进而将逻辑区段③和④虚拟成一个虚拟UT。如果逻辑区段②和⑤内的两辆AT A和B都没有完成头筛和尾筛，则逻辑区段①、③、④、⑥和⑦为UT占用。
本实施例的列车排序方法，通过获取计轴区段上计轴器的计轴状态，根据计轴状态确定计轴区段被占用的区域，并在被占用的区域内无AT时，确定被占用的区域内所包含的逻辑区段单元被UT占用，将被占用的区域内所包含的逻辑区段虚拟成一个虚拟UT，在本占用的区域内有AT时，根据AT上报的第一位置信息确定对应的逻辑区段，并将被占用的区域内所包括的剩余逻辑区段，虚拟成一个虚拟UT，能够准确识别逻辑区段的被占用情况，为计算移动授权和保障列车的安全运行奠定基础。
如前文所述，对列车进行排序的目的在于简化移动授权的计算过程，从而，在本发明实施例一种可能的实现方式中，如图6所示，在前述实施例的基础上，在形成列车的排序结果之后，还可以包括以下步骤：
步骤401，从排序结果中获取每个列车的列车ID，根据列车ID判断列车是否为AT。
对于AT而言，列车ID可以用于唯一标识AT；而对于虚拟UT而言，列车ID为预设的数值，比如0xFF。从而，本实施例中，对数组中的偏移量按照从小到大的顺序进行排序生成排序结果之后，可以从排序结果中获取每个列车的列车ID，并根据列车ID判定列车是否为AT。
具体地，若获取的列车ID不为0且列车ID不为0xFF，则判定该列车为AT；若获取的列车ID为0xFF，则判定该列车为UT。
步骤402，计算每个AT的移动授权。
本实施例中，针对判定出的每个AT，可以计算每个AT的移动授权。
作为一种可能的实现方式，在计算每个AT的移动授权时，可以先获取目标AT的列车ID，其中，目标AT为列车线路上所有AT中的任意一个AT；再根据获取的目标AT的列车ID查询排序结果，从排序结果中获取距离目标AT最近且位于目标AT行驶方向前方的第一列车的列车ID；最后，基于第一列车的列车ID，计算目标AT的移动授权。
具体地，在获取了第一列车的列车ID之后，可以进一步根据第一列车的列车ID判定第一列车是否为AT。如果判定第一列车为AT，则将目标AT的移动授权回退至第一列车的安全车尾，并考虑安全余量，其中，安全余量为预设的固定距离；如果判定第一列车为虚拟UT，则将目标AT的移动授权回退至目标计轴区段，并考虑安全余量，其中，目标计轴区段处于第一列车所在的第一计轴区段后方且与第一计轴区段间隔一个计轴区段。
通过为目标AT确定较小的移动授权，可以控制目标AT的运行速度，避免后车与前车发生追尾，保证列车的安全运行。
进一步地，在本发明实施例一种可能的实现方式中，在获取了目标AT的列车ID之后，可以进一步确定目标AT的安全包络范围，其中，安全包络范围为车头安全距离、车尾安全距离与列车长度的总和。进而判定安全包络范围内是否存在道岔，并在存在道岔时获取道岔的状态，当道岔处于四开状态/失表状态(失表状态是指没有收到搬动道岔的命令的情况下道岔进入四开状态或者在搬动超时的情况下道岔却还没有到达预期位置)或者故障状态中的至少一种状态时，判定道岔处于需要紧急制动的状态，此时控制目标AT紧急制动；当道岔处于非需要紧急制动的状态时，完成目标AT的列车头筛(其中头筛成功是指列车一定范围内没有可疑车辆)并获取目标AT非空(即存在实际的通信列车)的进路匹配表。之后，根据进路匹配表查询前方进路的状态，如果前方进路处于开放状态，则将目标AT的移动授权延伸至进路终点处信号机的位置，并考虑安全余量；如果前方进路中存在保护区段且保护区段锁闭，则将目标AT的移动授权延伸至保护区段的终点位置，并考虑安全余量；如果前方进路中存在列车，则根据目标AT的列车ID查询排序结果，获取距离目标AT最近且位于目标AT前方的第一列车的列车ID，并根据第一列车的列车ID计算目标AT的移动授权。
通过计算不同情况下列车的移动授权，能够保证列车的安全运行。
本实施例的列车排序方法，通过在形成排序结果之后，从排序结果中获取每个列车的列车ID，根据列车ID判断列车是否为AT，并计算每个AT的移动授权，能够将移动授权实时反馈给AT，保证AT的安全行驶。
为了实现上述实施例，本发明还提出一种列车排序装置。
图7为本发明一实施例提出的列车排序装置的结构示意图。
如图7所示，该列车排序装置70包括：第一获取模块710、第二获取模块720、第三获取模块730，以及排序模块740。其中，
第一获取模块710，用于获取AT上报的第一位置信息，根据AT的第一位置信息，确定AT与参考点之间的第一偏移量。
第二获取模块720，用于获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟UT。
在本发明实施例一种可能的实现方式中，第二获取模块720具体用于获取计轴区段上计轴器的计轴状态，根据计轴状态确定计轴区段被占用的区域，其中，被占用的区域内包括至少两个连续的逻辑区段；如果被占用的区域内无AT，则确定被占用的区域内所包含的至少两个连续的逻辑区段被UT占用，并将被占用的区域内所包含的至少两个连续的逻辑区段虚拟成一个虚拟UT；如果被占用的区域内有AT，根据AT上报的第一位置信息，确定第一位置信息对应的逻辑区段，并将被占用的区域内所包括的剩余逻辑区段，虚拟成一个虚拟UT，其中，剩余逻辑区段指的是所述被占用区域内的除与所述第一位置信息对 应的逻辑区段之外的逻辑区段且所述剩余逻辑区段包括至少两个连续的逻辑区段。
第三获取模块730，用于获取处于占用状态的逻辑区段的第二位置信息，根据第二位置信息，确定虚拟UT与参考点之间的第二偏移量。
排序模块740，用于根据第一偏移量和所述第二偏移量的大小，对AT和虚拟UT进行排序，形成列车排序结果。
在本发明实施例一种可能的实现方式中，如图8所示，在如图7所示实施例的基础上，该列车排序装置还可以包括：
存入模块750，用于将AT和虚拟UT的参数信息，存入到预设的数组中，其中，参数信息包括：列车ID、偏移量以及指针信息，其中所述偏移量由第一偏移量或第二偏移量表示。
其中，虚拟UT的列车ID为预设的数值，比如0xFF，指针信息为空。
此时，排序模块740具体用于采用冒泡排序法对数组按照偏移量的大小进行排序，形成排序结果，其中，排序结果中数组中按照偏移量从小到大的顺序排列。
由于对路线中的列车进行排序的目的在于简化移动授权的计算过程，进一步地，在本发明实施例一种可能的实现方式中，如图9所示，在如图7所示实施例的基础上，该列车的排序装置70还可以包括：
判断模块760，用于从排序结果获取每个列车的列车ID，根据列车ID判断列车是否为AT。
计算模块770，用于计算每个AT的移动授权。
可选地，在本发明实施例一种可能的实现方式中，计算模块770具体用于获取目标AT的列车ID，其中，目标AT为列车线路上所有AT中的任意一个AT；根据目标AT的列车ID查询排序结果，获取距离目标AT最近且位于目标AT前方的第一列车的列车ID；基于第一列车的列车ID，计算目标AT的移动授权。
其中，基于第一列车的列车ID计算目标AT的移动授权时，可以先根据第一列车的列车ID判断第一列车是否为AT；如果第一列车为AT，则将目标AT的移动授权回退到第一列车的安全车尾，并考虑安全余量；如果第一列车为虚拟UT，则将目标AT的移动授权回退到目标计轴区段，并考虑安全余量，其中，目标计轴区段处于第一列车所在的第一计轴区段后方且与第一计轴区段间隔一个计轴区段。
可选地，在本发明实施例一种可能的实现方式中，计算模块770具体用于在获取了目标AT的列车ID之后，进一步确定目标AT的安全包络范围，其中，安全包络范围为车头安全距离、车尾安全距离与列车长度的总和。判定安全包络范围内是否存在道岔，并在存在道岔时获取道岔的状态，当道岔处于四开状态/失表状态或者故障状态中的至少一种状态时，判定道岔处于需要紧急制动的状态，此时控制目标AT紧急制动；当道岔处于非需要紧急制动的状态时，完成目标AT的列车头筛并获取目标AT非空的进路匹配表。之后，根据进路匹配表查询前方进路的状态，如果前方进路处于开放状态，则将目标AT的移动授权延伸至进路终点处信号机的位置，并考虑安全余量；如果前方进路中存在保护区段且保护区段锁闭，则将目标AT的移动授权延伸至保护区段的终点位置，并考虑安全余量；如果前方进路中存在列车，则根据目标AT的列车ID查询排序结果，获取距离目标AT最近且位于目标AT前方的第一列车的列车ID，并根据第一列车的列车ID计算目标AT的移动授权。
需要说明的是，前述对列车排序方法实施例的解释说明也适用于本实施例的列车排序装置，其实现原理类似，此处不再赘述。
本实施例的列车排序装置，
为了实现上述实施例，本发明还提出一种计算机设备。
图10为本发明一实施例提出的计算机设备的结构示意图。如图10所示，该计算机设备100包括：存储器1001、处理器1002以及存储在存储器1001上并可在处理器1002上运行的计算机程序1003，当处理器1002执行计算机程序1003时，实现如前述实施例所述的列车排序方法。
为了实现上述实施例，本发明还提出一种列车控制中心，能够实现如前述实施例所述的列车排序方法。
为了实现上述实施例，本发明还提出一种非临时性计算机可读存储介质，其上存储有计算机程序，当该计算机程序被处理器执行时能够实现如前述实施例所述的列车排序方法。
为了实现上述实施例，本发明还提出一种计算机程序产品，当计算机程序产品中的指令由处理器执行时，执行如前述实施例所述的列车排序方法。
在本说明书的描述中，参考术语“一个实施例”、“一些实施例”、“示例”、“具体示例”、或“一些示例”等的描述意指结合该实施例或示例描述的具体特征、结构、材料或者特点包含于本发明的至少一个实施例或示例中。在本说明书中，对上述术语的示意性表述不必须针对的是相同的实施例或示例。而且，描述的具体特征、结构、材料或者特点可以在任一个或多个实施例或示例中以合适的方式结合。此外，在不相互矛盾的情况下，本领域的技术人员可以将本说明书中描述的不同实施例或示例以及不同实施例或示例的特征进行结合和组合。
此外，术语“第一”、“第二”仅用于描述目的，而不能理解为指示或暗示相对重要性或者隐含指明所指示的技术特征的数量。由此，限定有“第一”、“第二”的特征可以明示或者隐含地包括至少一个该特征。在本发明的描述中，“多个”的含义是至少两个，例如两个，三个等，除非另有明确具体的限定。
流程图中或在此以其他方式描述的任何过程或方法描述可以被理解为，表示包括一个或更多个用于实现定制逻辑功能或过程的步骤的可执行指令的代码的模块、片段或部分，并且本发明的优选实施方式的范围包括另外的实现，其中可以不按所示出或讨论的顺序，包括根据所涉及的功能按基本同时的方式或按相反的顺序，来执行功能，这应被本发明的实施例所属技术领域的技术人员所理解。
在流程图中表示或在此以其他方式描述的逻辑和/或步骤，例如，可以被认为是用于实现逻辑功能的可执行指令的定序列表，可以具体实现在任何计算机可读介质中，以供指令执行系统、装置或设备(如基于计算机的系统、包括处理器的系统或其他可以从指令执行系统、装置或设备取指令并执行指令的系统)使用，或结合这些指令执行系统、装置或设备而使用。就本说明书而言，"计算机可读介质"可以是任何可以包含、存储、通信、传播或传输程序以供指令执行系统、装置或设备或结合这些指令执行系统、装置或设备而使用的装置。计算机可读介质的更具体的示例(非穷尽性列表)包括以下：具有一个或多个布线的电连接部(电子装置)，便携式计算机盘盒(磁装置)，随机存取存储器(RAM)，只读存储器(ROM)，可擦除可编辑只读存储器(EPROM或闪速存储器)，光纤装置，以及便携式光盘只读存储器(CDROM)。另外，计算机可读介质甚至可以是可在其上打印所述程序的纸或其他合适的介质，因为可以例如通过对纸或其他介质进行光学扫描，接着进行编辑、解译或必要时以其他合适方式进行处理来以电子方式获得所述程序，然后将其存储在计算机存储器中。
应当理解，本发明的各部分可以用硬件、软件、固件或它们的组合来实现。在上述实施方式中，多个步骤或方法可以用存储在存储器中且由合适的指令执行系统执行的软件或固件来实现。如，如果用硬 件来实现和在另一实施方式中一样，可用本领域公知的下列技术中的任一项或他们的组合来实现：具有用于对数据信号实现逻辑功能的逻辑门电路的离散逻辑电路，具有合适的组合逻辑门电路的专用集成电路，可编程门阵列(PGA)，现场可编程门阵列(FPGA)等。
本技术领域的普通技术人员可以理解实现上述实施例方法携带的全部或部分步骤是可以通过程序来指令相关的硬件完成，所述的程序可以存储于一种计算机可读存储介质中，该程序在执行时，包括方法实施例的步骤之一或其组合。
此外，在本发明各个实施例中的各功能单元可以集成在一个处理模块中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。所述集成的模块如果以软件功能模块的形式实现并作为独立的产品销售或使用时，也可以存储在一个计算机可读取存储介质中。
上述提到的存储介质可以是只读存储器，磁盘或光盘等。尽管上面已经示出和描述了本发明的实施例，可以理解的是，上述实施例是示例性的，不能理解为对本发明的限制，本领域的普通技术人员在本发明的范围内可以对上述实施例进行变化、修改、替换和变型。

Claims (25)

  1. 一种列车排序方法，其特征在于，包括：
    获取通信列车上报的第一位置信息，根据所述通信列车的第一位置信息，确定所述通信列车与参考点之间的第一偏移量；
    获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟非通信列车；
    获取处于占用状态的至少两个连续的逻辑区段中任一个的第二位置信息，根据所述第二位置信息，确定所述虚拟非通信列车与所述参考点之间的第二偏移量；
    根据所述第一偏移量和所述第二偏移量的大小，对所述通信列车和所述虚拟非通信列车进行排序，形成列车排序结果。
  2. 根据权利要求1所述的方法，其特征在于，确定所述虚拟非通信列车与所述参考点之间的第二偏移量包括：
    确定所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离；
    将所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离确定为所述虚拟非通信列车与所述参考点之间的第二偏移量。
  3. 根据权利要求1或2所述的方法，其特征在于，在所述根据所述第一偏移量和所述第二偏移量的大小，对所述通信列车和所述虚拟非通信列车进行排序，形成列车排序结果之前，还包括：
    将所述通信列车和所述虚拟非通信列车的参数信息，存入到预设的数组中；其中，所述参数信息包括：列车ID、偏移量以及指针信息，其中所述偏移量由第一偏移量或第二偏移量表示；
    所述根据所述第一偏移量和所述第二偏移量的大小，对所述通信列车和所述虚拟非通信列车进行排序，形成列车排序结果，包括：
    采用冒泡排序法对所述数组按照偏移量的大小进行排序，形成所述排序结果，其中，所述排序结果中所述数组按照所述偏移量从小到大的顺序排列。
  4. 根据权利要求3所述的方法，其特征在于，所述虚拟非通信列车的所述列车ID为预设的数值，所述指针信息为空。
  5. 根据权利要求1-4中任一项所述的方法，其特征在于，所述获取路线中逻辑区段的占用状态，将处于占用状态的至少两个逻辑区段虚拟成一个虚拟非通信列车，包括：
    获取计轴区段上计轴器的计轴状态，根据所述计轴状态确定所述计轴区段被占用的区域；其中，所述被占用的区域内包括至少两个连续的逻辑区段；
    如果所述被占用的区域内无所述通信列车，则确定所述被占用的区域内所包含的至少两个连续的逻辑区段被所述非通信列车占用；
    将所述被占用的区域内所包含的至少两个连续的逻辑区段虚拟成一个所述虚拟非通信列车。
  6. 根据权利要求5所述的方法，其特征在于，还包括：
    如果所述被占用的区域内有所述通信列车，根据所述通信列车上报的所述第一位置信息，确定所述第一位置信息对应的逻辑区段；
    将所述被占用的区域内所包括的剩余逻辑区段，虚拟成一个所述虚拟非通信列车；其中，所述剩余逻辑区段指的是所述被占用区域内的除与所述第一位置信息对应的逻辑区段之外的逻辑区段且所述剩余逻辑区段包括至少两个连续的逻辑区段。
  7. 根据权利要求1-6任一项所述的方法，其特征在于，在所述形成列车排序结果之后，还包括：
    从所述排序结果中获取每个列车的列车ID，根据所述列车ID判断列车是否为通信列车；
    计算每个通信列车的移动授权。
  8. 根据权利要求7所述的方法，其特征在于，所述计算每个通信列车的移动授权，包括：
    获取目标通信列车的列车ID；其中，所述目标通信列车为列车线路上所有通信列车中的任意一个通信列车；
    根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID；
    基于所述第一列车的列车ID，计算所述目标通信列车的移动授权。
  9. 根据权利要求8所述的方法，其特征在于，在所述获取目标通信列车的列车ID之后，还包括：
    确定所述目标通信列车的安全包络范围；
    判断所述安全包络范围内是否存在道岔；
    如果存在所述道岔，获取所述道岔的状态；
    当所述道岔处于需要紧急制动的状态时，则控制所述目标通信列车紧急制动。
  10. 根据权利要求9所述的方法，其特征在于，还包括：
    当所述道岔处于非需要紧急制动的状态时，完成所述目标通信列车的列车头筛并获取所述目标通信列车的进路匹配表。
  11. 根据权利要求10所述的方法，其特征在于，在所述根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID之前，还包括：
    根据所述进路匹配表查询前方进路的状态，如果所述前方进路处于开放状态，则将所述目标通信列车的移动授权延伸至进路终点处信号机的位置，并考虑安全余量；
    如果所述前方进路中存在保护区段且所述保护区段锁闭，则将所述目标通信列车的移动授权延伸至所述保护区段的终点位置，并考虑安全余量；
    如果所述前方进路中存在列车，则所述根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID。
  12. 根据权利要求8-11中任一项所述的方法，其特征在于，所述基于所述第一列车的列车ID，计算所述目标通信列车的移动授权，包括：
    根据所述第一列车的列车ID判断所述第一列车是否为通信列车；
    如果所述第一列车为所述通信列车，则将所述目标通信列车的移动授权回退到所述第一列车的安全车尾，并考虑所述安全余量；
    如果所述第一列车为所述虚拟非通信列车，则将所述目标通信列车的移动授权回退到目标计轴区段，并考虑所述安全余量；其中，所述目标计轴区段处于所述第一列车所在的第一计轴区段后方且与所述第一计轴区段间隔一个计轴区段。
  13. 一种列车排序装置，其特征在于，包括：
    第一获取模块，用于获取通信列车上报的第一位置信息，根据所述通信列车的第一位置信息，确定所述通信列车与参考点之间的第一偏移量；
    第二获取模块，用于获取路线中逻辑区段的占用状态，将处于占用状态的至少两个连续的逻辑区段虚拟成一个虚拟非通信列车；
    第三获取模块，用于获取处于占用状态的至少两个连续的逻辑区段中任一个的第二位置信息，根据所述第二位置信息，确定所述虚拟非通信列车与所述参考点之间的第二偏移量；
    排序模块，用于根据所述第一偏移量和所述第二偏移量的大小，对所述通信列车和所述虚拟非通信列车进行排序，形成列车排序结果。
  14. 根据权利要求13所述的装置，其特征在于，所述第三获取模块进一步用于：
    确定所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离；
    将所述虚拟非通信列车的车头与所述参考点之间的距离或所述虚拟非通信列车的车尾与所述参考点之间的距离确定为所述虚拟非通信列车与所述参考点之间的第二偏移量。
  15. 根据权利要求13或14所述的装置，其特征在于，还包括：
    存入模块，用于将所述通信列车和所述虚拟非通信列车的参数信息，存入到预设的数组中；其中，所述参数信息包括：列车ID、偏移量以及指针信息，其中所述偏移量由第一偏移量或第二偏移量表示；
    所述排序模块进一步用于：
    采用冒泡排序法对所述数组按照偏移量的大小进行排序，形成所述排序结果，其中，所述排序结果中所述数组按照所述偏移量从小到大的顺序排列。
  16. 根据权利要求15所述的装置，其特征在于，所述第二获取模块进一步用于：
    获取计轴区段上计轴器的计轴状态，根据所述计轴状态确定所述计轴区段被占用的区域；其中，所述被占用的区域内包括至少两个连续的逻辑区段；
    如果所述被占用的区域内无所述通信列车，则确定所述被占用的区域内所包含的至少两个连续的逻辑区段被所述非通信列车占用；
    将所述被占用的区域内所包含的至少两个连续的逻辑区段虚拟成一个所述虚拟非通信列车。
  17. 根据权利要求16所述的装置，其特征在于，所述第二获取模块还用于：
    如果所述被占用的区域内有所述通信列车，根据所述通信列车上报的所述第一位置信息，确定所述第一位置信息对应的逻辑区段；
    将所述被占用的区域内所包括的剩余逻辑区段，虚拟成一个所述虚拟非通信列车；其中，所述剩余逻辑区段指的是所述被占用区域内的除与所述第一位置信息对应的逻辑区段之外的逻辑区段且所述剩余逻辑区段包括至少两个连续的逻辑区段。
  18. 根据权利要求13-17任一项所述的装置，其特征在于，还包括：
    判断模块，用于从所述排序结果中获取每个列车的列车ID，根据所述列车ID判断列车是否为通信列车；
    计算模块，用于计算每个通信列车的移动授权。
  19. 根据权利要求18所述的装置，其特征在于，所述计算模块进一步用于：
    获取目标通信列车的列车ID；其中，所述目标通信列车为列车线路上所有通信列车中的任意一个通信列车；
    根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID；
    基于所述第一列车的列车ID，计算所述目标通信列车的移动授权。
  20. 根据权利要求19所述的装置，其特征在于，所述计算模块还用于：
    确定所述目标通信列车的安全包络范围；
    判断所述安全包络范围内是否存在道岔；
    如果存在所述道岔，获取所述道岔的状态；
    当所述道岔处于需要紧急制动的状态时，则控制所述目标通信列车紧急制动。
  21. 根据权利要求20所述的装置，其特征在于，所述计算模块还用于：
    当所述道岔处于非需要紧急制动的状态时，完成所述目标通信列车的列车头筛并获取所述目标通信列车的进路匹配表。
  22. 根据权利要求21所述的装置，其特征在于，所述计算模块还用于：
    根据所述进路匹配表查询前方进路的状态，如果所述前方进路处于开放状态，则将所述目标通信列车的移动授权延伸至进路终点处信号机的位置，并考虑安全余量；
    如果所述前方进路中存在保护区段且所述保护区段锁闭，则将所述目标通信列车的移动授权延伸至所述保护区段的终点位置，并考虑安全余量；
    如果所述前方进路中存在列车，则所述根据所述目标通信列车的列车ID查询所述排序结果，获取距离所述目标通信列车最近且位于所述目标通信列车前方的第一列车的列车ID。
  23. 根据权利要求19-22中任一项所述的装置，其特征在于，所述计算模块还用于：
    根据所述第一列车的列车ID判断所述第一列车是否为通信列车；
    如果所述第一列车为所述通信列车，则将所述目标通信列车的移动授权回退到所述第一列车的安全车尾，并考虑所述安全余量；
    如果所述第一列车为所述虚拟非通信列车，则将所述目标通信列车的移动授权回退到目标计轴区段，并考虑所述安全余量；其中，所述目标计轴区段处于所述第一列车所在的第一计轴区段后方且与所述第一计轴区段间隔一个计轴区段。
  24. 一种计算机设备，包括：存储器、处理器以及存储在存储器上并可在处理器上运行的计算机程序，其特征在于，所述处理器执行所述计算机程序时，实现如权利要求1-12中任一项所述的列车排序方法。
  25. 一种列车控制中心，用于执行如权利要求1-12中任一项所述的列车排序方法。
PCT/CN2018/099693 2017-08-10 2018-08-09 列车排序方法及装置 Ceased WO2019029637A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710682287.4A CN109383566B (zh) 2017-08-10 2017-08-10 列车排序方法及装置
CN201710682287.4 2017-08-10

Publications (1)

Publication Number Publication Date
WO2019029637A1 true WO2019029637A1 (zh) 2019-02-14

Family

ID=65270894

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/099693 Ceased WO2019029637A1 (zh) 2017-08-10 2018-08-09 列车排序方法及装置

Country Status (2)

Country Link
CN (1) CN109383566B (zh)
WO (1) WO2019029637A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115481879A (zh) * 2022-09-01 2022-12-16 交控科技股份有限公司 列车运行等级升级的方法、装置及电子设备
US20220410950A1 (en) * 2019-11-29 2022-12-29 Byd Company Limited Train, and control method, control apparatus and vehicle on-board controller therefor
CN116331297A (zh) * 2023-01-29 2023-06-27 成都交控轨道科技有限公司 一种基于车车通信的无直轨计轴占用方案
CN117485405A (zh) * 2023-12-18 2024-02-02 成都交控轨道科技有限公司 一种保护区段精简计轴控车方法、计算机设备和介质

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110834650B (zh) * 2019-11-11 2021-10-08 通号城市轨道交通技术有限公司 移动闭塞模式下的列车追踪方法及装置
CN111845859B (zh) * 2020-07-24 2022-02-15 交控科技股份有限公司 确定车辆前筛结果的行车控制方法、区域控制器及系统
CN112061180B (zh) * 2020-08-28 2022-07-19 交控科技股份有限公司 一种道岔侧冲防护方法及系统
CN112572541B (zh) * 2020-12-17 2023-03-24 交控科技股份有限公司 一种货运铁路列车安全位置计算方法、装置及设备
CN115743249B (zh) * 2021-08-31 2025-10-17 比亚迪股份有限公司 列车自动驾驶方法、装置及系统
CN114358516A (zh) * 2021-12-13 2022-04-15 青岛海信微联信号有限公司 一种列车排序的方法及设备
CN116534084B (zh) * 2023-05-30 2024-09-06 北京全路通信信号研究设计院集团有限公司 虚拟区段的状态确定方法、装置、设备及介质
CN116890893B (zh) * 2023-06-13 2026-03-03 通号城市轨道交通技术有限公司 移动闭塞模式下的列车追踪方法及系统
CN119283943B (zh) * 2024-07-09 2026-01-16 北京城建智控科技股份有限公司 逻辑区段的设计方法及装置
CN119975480B (zh) * 2025-04-16 2025-07-29 北京城建智控科技股份有限公司 列车筛选方法及装置、计算设备、计算机可读存储介质
CN120735828B (zh) * 2025-09-08 2025-12-02 湖南中车时代通信信号有限公司 一种列车安全运行区段规划方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5533695A (en) * 1994-08-19 1996-07-09 Harmon Industries, Inc. Incremental train control system
CN101239623A (zh) * 2008-03-11 2008-08-13 北京佳讯飞鸿电气股份有限公司 一种基于路由自适应无线网络的铁路安全行车系统
CN102963399A (zh) * 2012-11-30 2013-03-13 北京交控科技有限公司 固定闭塞模式下的列车排序方法及识别号追踪方法
CN106476846A (zh) * 2016-10-20 2017-03-08 中车青岛四方车辆研究所有限公司 重载货物列车编组装置、编组方法及电控空气制动系统
CN106672020A (zh) * 2016-12-12 2017-05-17 交控科技股份有限公司 基于对象控制器的前车识别方法、车载控制器及列车

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1390246B1 (en) * 2001-05-08 2018-08-15 Siemens Industry, Inc. Condition monitoring system
CN101934807B (zh) * 2010-08-24 2011-09-28 北京交大资产经营有限公司 基于列车控制系统的移动授权计算方法
CN106740989B (zh) * 2016-12-09 2019-06-18 交控科技股份有限公司 一种基于轨道电路的移动授权计算方法
CN106515797B (zh) * 2016-12-20 2018-04-17 交控科技股份有限公司 无次级轨道检测设备的列车追踪运行方法及cbtc系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5533695A (en) * 1994-08-19 1996-07-09 Harmon Industries, Inc. Incremental train control system
CN101239623A (zh) * 2008-03-11 2008-08-13 北京佳讯飞鸿电气股份有限公司 一种基于路由自适应无线网络的铁路安全行车系统
CN102963399A (zh) * 2012-11-30 2013-03-13 北京交控科技有限公司 固定闭塞模式下的列车排序方法及识别号追踪方法
CN106476846A (zh) * 2016-10-20 2017-03-08 中车青岛四方车辆研究所有限公司 重载货物列车编组装置、编组方法及电控空气制动系统
CN106672020A (zh) * 2016-12-12 2017-05-17 交控科技股份有限公司 基于对象控制器的前车识别方法、车载控制器及列车

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220410950A1 (en) * 2019-11-29 2022-12-29 Byd Company Limited Train, and control method, control apparatus and vehicle on-board controller therefor
CN115481879A (zh) * 2022-09-01 2022-12-16 交控科技股份有限公司 列车运行等级升级的方法、装置及电子设备
CN116331297A (zh) * 2023-01-29 2023-06-27 成都交控轨道科技有限公司 一种基于车车通信的无直轨计轴占用方案
CN117485405A (zh) * 2023-12-18 2024-02-02 成都交控轨道科技有限公司 一种保护区段精简计轴控车方法、计算机设备和介质

Also Published As

Publication number Publication date
CN109383566A (zh) 2019-02-26
CN109383566B (zh) 2020-11-20

Similar Documents

Publication Publication Date Title
WO2019029637A1 (zh) 列车排序方法及装置
CN109305200B (zh) 列车排序、列车移动授权的计算方法、装置及其设备
CN100515845C (zh) 适用于不同闭塞制式的列车定位方法
CN109318943B (zh) 列车控制系统和列车
CN111145555B (zh) 一种检测车辆违章的方法和装置
CN109318933B (zh) 列车筛选方法、装置、系统及车载设备
AU2020366769B2 (en) Sensor performance evaluation system and method, and automatic driving system
CN103921810B (zh) 一种列车自动运行系统坡度处理方法及装置
CN113127466A (zh) 一种车辆轨迹数据预处理方法及计算机存储介质
US11455840B2 (en) Method, device and computer-readable storage medium with instructions for processing data in a motor vehicle for forwarding to a back end
WO2024234545A1 (zh) 轨道交通列车筛选方法及装置
CN107180533A (zh) 道路预警方法和装置
CN103868516B (zh) 用于确定道路基础设施的位置和/或类型的方法和装置
CN107705582A (zh) 一种车辆违规检测方法和系统
CN109318945B (zh) 列车控制方法、装置及系统
CN114080342B (zh) 用于运行轨道车辆的方法
ES2661126T3 (es) Procedimiento de discriminación de la presencia de un vehículo ferroviario sobre un cantón, procedimiento de cálculo de un intervalo de seguridad y dispositivo asociado
JP7578078B2 (ja) 地図更新装置、地図更新方法、および地図更新用コンピュータプログラム
CN114524006B (zh) 列车筛选的方法与装置
CN104859609A (zh) 一种车辆控制方法及装置与车辆
JP5113398B2 (ja) 自動列車制御装置
CN116461572A (zh) 一种追踪方法及装置
CN109318944B (zh) 列车控制方法、装置及系统
CN106114504A (zh) 一种车距提示方法及装置
US20250104441A1 (en) Vehicle detection method, and controller, program and storage medium

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18845067

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18845067

Country of ref document: EP

Kind code of ref document: A1