EP1500567B1 - Procédé de résolution des conflits dans un système de transport guidé sur une voie - Google Patents

Procédé de résolution des conflits dans un système de transport guidé sur une voie Download PDF

Info

Publication number
EP1500567B1
EP1500567B1 EP03360088A EP03360088A EP1500567B1 EP 1500567 B1 EP1500567 B1 EP 1500567B1 EP 03360088 A EP03360088 A EP 03360088A EP 03360088 A EP03360088 A EP 03360088A EP 1500567 B1 EP1500567 B1 EP 1500567B1
Authority
EP
European Patent Office
Prior art keywords
conflict
measures
class
solution
measure
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.)
Revoked
Application number
EP03360088A
Other languages
German (de)
English (en)
Other versions
EP1500567A1 (fr
Inventor
Andrea Goldman
Hans-Peter Jürgen Huber
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.)
Alcatel Lucent SAS
Original Assignee
Alcatel CIT SA
Alcatel SA
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=33484065&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=EP1500567(B1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Alcatel CIT SA, Alcatel SA filed Critical Alcatel CIT SA
Priority to EP03360088A priority Critical patent/EP1500567B1/fr
Priority to DE50301157T priority patent/DE50301157D1/de
Priority to AT03360088T priority patent/ATE303930T1/de
Publication of EP1500567A1 publication Critical patent/EP1500567A1/fr
Application granted granted Critical
Publication of EP1500567B1 publication Critical patent/EP1500567B1/fr
Anticipated expiration legal-status Critical
Revoked 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
    • B61L27/10—Operations, e.g. scheduling or time tables
    • B61L27/16—Trackside optimisation of vehicle or train operation

Definitions

  • the invention relates to a method for controlling the occupancy in a track-bound traffic system in case of occupancy conflict case or one technical conflict case, with possible alternative measures for resolution the conflict case and taken into account when determining a solution For each solution, a quality factor is determined, and the solution with the best quality factor is applied.
  • conflicts can occur, for example when two trains enter the same track at the same time or the same Want to prove track vacancy section (occupancy conflict case) or because technical incompatibility between a train and the infrastructure (technical conflict).
  • a technical conflict case i. an incompatibility between train and track, for example, exists between an electric powered train and a non-electrified track.
  • Such conflicts must be resolved before they become a dangerous situation, one Malfunction or lead to an accident.
  • measures such as the redirection of a case of conflict train to apply before this conflict happens. Which Measures for which conflicts are applicable, for example, by Operating concept of the railway administration determined.
  • a measure on Applying a train means the train run (schedule) of a conflict change the train involved so that the conflict is resolved.
  • a such action for example, redirecting a train
  • the Resolving a conflict therefore means taking action in an orderly manner Order to resolve the original conflict and any subsequent conflicts that caused by the application of measures to dissolve.
  • a solution for the resolution of a Conflict case is therefore defined as an ordered n-tuple (record) of Measures that together solve the original conflict and all subsequent conflicts.
  • n-tuple Record
  • To determine the best solution it is known to have a figure of merit for each To determine solution. This happens, for example, by calculating a Cost function that represents the quality of the solution. The solution with the lowest cost is the best solution. The cost of a solution is only determinable when the whole solution has been determined.
  • the object of the invention is to provide a method with which the occupancy in a track bound traffic system in a occupancy conflict case quickly and can be controlled without much computational effort.
  • This object is achieved according to the invention by a method of the beginning in which a selection of the resolution of the conflict in question taken from an experience base and only these Measure (s) to be taken into account when identifying solutions.
  • the selection of measures that should be applied to a conflict can be one or include several measures.
  • the conflict can be a Original conflict or a consequential conflict.
  • the solution space is limited because less Solutions must be determined.
  • the measures taken from the experience base All measures lead to a conflict-free situation. For every measure, which leads to a subsequent situation, the quality of this solution is determined. The Measure leading to the best solution is applied.
  • the success of an applicable measure will be assessed and only those as promising measures of the experience basis for determining taken from the solution of a conflict.
  • conflict class conflict class
  • the basis of experience in low-performing times of a conflict resolution system and / or after a Warimplement ist of the process, in particular the first installation in the Conflict resolution system built.
  • the experience base is built up by complete solution spaces are determined and evaluated for a conflict become. Because of the experience base even in times of slowdown is built, the computer power in the conflict resolution system more evenly exploited or used.
  • the experience base can thereby in low-power times, i. if in a track-bound Traffic system little real conflict cases occur, be extended.
  • conflict types and conflict circumstance classes are defined, which are assigned to a conflict class and the Conflict classes are stored in the experience base.
  • the experience in the experience base is stored, is the connection between the Circumstances of a conflict (conflict situation) and the success of measures, used to resolve conflicts in this conflict circumstance can.
  • the conflict type and a conflict circumstance class form together a conflict class.
  • This combination of the two components comes in a railway system only once before. Every conflict can be unique be assigned to exactly one conflict class, since each conflict is also accurate associated with one of its components (conflict resource class, conflict type) can be.
  • a type of conflict for example, by the Railway administration. She does that from her operational point of view.
  • An example of a conflict type is "train following conflict on the open road”.
  • One conflict type is therefore the definition of the circumstances of a conflict from view the railway administration according to the operational concept. Every conflict has to can clearly be assigned to exactly one conflict type.
  • everyone conflict class the applicable i. the measures eligible for Resolution of a conflict associated.
  • a railway administration is determined by its operational concept, which conflict types exist. For each type of conflict is still set, like train 1 and train 2 are determined.
  • the determined railway administration for each type of conflict an unordered list of Measures on train 1 and a disorderly list of measures that are applicable to move 2 of a conflict of a conflict type.
  • An applicable Action is a measure that, for a given type of conflict, is at one certain of the two moves involved in the conflict. For example, the measures “extend hold at train_1" and “hold extend at Switzerland_2 "two different measures.
  • the applicable Measures sorted within a conflict class This allows one fast and good access to appropriate measures to solve a Conflict.
  • conflicts are determined by the conflict resource class classified according to their formalized circumstances. This classification happens unaffected by the view of the railway administration.
  • the classification is based on abstract place and Vehicle parameters.
  • Classification becomes abstract information on the characterization of the trains involved in the conflict and the Infrastructure (conflict location) used. Become the abstraction of this information preferably abstract vehicle parameters and abstract location parameters used.
  • abstract vehicle parameters are the train priority Train Performance, Train Run Priority, Line Priority Priority (Line Recoverability Priority).
  • Main criteria for line recovery are Reserve times in a train run. If a train has very little or no Having spare time in his schedule, he is prone to unrecoverable Delays. Because he can not spend any spare time to To catch up on delays.
  • These vehicle parameters have sorting values how high, medium, low. For example, get train runs with little Reserve time a high value for the parameter line restore.
  • abstract location parameters are a detour potential sorting values such as high, medium, low.
  • conflict formalization parameters have comparative values such as "train 1 greater than train 2".
  • Train 1 greater than train 2
  • one conflict circumstance class an ordered n-tuple (record) of allzanformalisanssparameter.
  • the values of Conflict formalization parameters for a given conflict arise from the logical link of the abstract vehicle parameters involved in this conflict and the abstract location parameters of the Conflict place.
  • Each conflict can clearly be exactly one confluence class be assigned. This means that each conflict is exactly one type of conflict and is assigned to a conflict circumstance class. Every conflict class consists of a conflict type and a conflict circumstance class. this means also that each conflict is associated with exactly one conflict class.
  • there Several different conflicts can be assigned to the same conflict type and several (possibly other) conflicts with the same conflict circumstances assigned to the same conflict circumstance class.
  • the classification system is adaptive and adapts to Complexity of the transport system to which it is applied.
  • the number The conflict classes for a railway system depends on the number of Combinations of abstract parameters used in this railroad system can happen. This number results from the heterogeneity of the Vehicle fleets (train service), timetables (train run priority, priority of Line restoration), the infrastructure (diversion potential, partly Train run priority) and the operating concept (train priority) exactly this Rail system.
  • the success factor can be Be a success counter. In this case, it is recorded, for example, which measure a Conflict class that was applied to a conflict of this conflict class best solution. The success counter associated with this action then becomes incremented. On the basis of the success counter, the measures of a conflict class be sorted.
  • a sorting key is determined via which the appropriate measures for a conflict to be resolved in the Experience base can be found.
  • the sort key sorts the Measures of a conflict class ascending after their success among the Conflicting circumstances of this conflict class. This results in the best, the second best, the third best etc. Measure for conflicts of this conflict class.
  • the sort key forms an index for the measures within a conflict class. Together with a conflict class key he forms a matrix. With this matrix one can take the appropriate measure for one Look up conflict in the experience base.
  • a conflict class key becomes for example, by the conflict classes of the classification system for Conflicts expressed.
  • the sort key is determined by experience and may change as the experience changes over time.
  • the Experience here is the connection between the circumstances of a Conflict (conflict circumstance) and the success of measures leading to the dissolution to be used by conflicts with this conflict circumstance.
  • a conflict class depend on multiple sort factors that are in the Assess the success of a measure.
  • the railway administration can conflict types, measures to resolve Conflicts and a cost function to calculate the cost of a solution To be defined.
  • Another sort factor is the conflict circumstance classes, which are applicable to this very railway system. In particular are this is the abstraction of the location and vehicle parameters, the infrastructure and the Timetables. It can be taken into account which measures in exactly good grip on this railroad system. Furthermore, it can be taken into account how the conflict resolution applies measures, namely incorrect or correct.
  • the sorting of measures of a conflict class is not constant.
  • the sorting is not determined once and then does not change anymore.
  • the sorting is not deterministic. It can not be theoretical be precalculated since it is based on experience only.
  • the sorting is continues to depend on the sort factors and responds to changes in these Sorting factors.
  • At the start of the conflict resolution system is sorting indefinite, there is no sorting. While at system startup to first construction of the experience base complete solution spaces for conflicts calculated, the sorting becomes progressively statistically more and more relevant.
  • the significance of sorting before, during and after the first Structure of the empirical basis can be quantified with a statistical method become.
  • the sorting applies only to a given traffic system for which they are was created. Once the sort was statistically significant, i.
  • a statistical method can be used to describe the mathematical Correlation between the number of evaluated measures on the the sorting is based and the probability that one is considered bad measure will be successful. This Relationship determines how many statistical events are evaluated must have been so that the sort order is statistically significant.
  • One Example of a statistical method is a discrete random variable with Binomial distribution.
  • the sorting of measures within a conflict class can be optimized become. This can happen especially when the few best Measures of a conflict class do not significantly more often provide the best solutions achieve other measures than the same class of conflict. It should be the Classification system can be improved so that the few best Measures of a conflict class much more often to achieve the best solutions as other measures of the same conflict class.
  • the success of Classification system depends on the abstract location and Vehicle parameters. In particular, the parameters and their Value range can be optimized. The value range of the parameters can be extended become. For optimization more than three sorting values like "high”, “medium” and "low” for each or some classification parameters introduced become.
  • mapping of train runs or the infrastructure can the abstract vehicle parameters or abstract location parameters (mapping) optimized later, after the conflict resolution system has been running for some time become.
  • the boundaries between the sorting values "high”, “medium”, “low” can be changed.
  • the Value ranges are changed so that, for example, then some train runs, which were previously mapped to the value "low”, then to the value "medium” are displayed.
  • the scope of the invention also includes a conflict resolution system Implementation of the method according to the invention with a memory for Storing an experience base and means for selecting Measures to resolve a conflict based on experience and resources for determining solutions and the figure of merit of a solution.
  • a conflict resolution system can conflict in a track-bound Traffic system resolved faster than with the state of the art Technology.
  • the scope of the invention also includes a computer program for Implementation of the method according to the invention.
  • Fig. 1 the inventive method is shown schematically.
  • valid conflict types 2 are defined from an operational point of view.
  • Example of a type of conflict is train-following conflict on the open track.
  • Each railway administration has a catalog of conflict resolution measures 3 in its operational concept 1.
  • the quality management standard 4 defines how the quality of a solution is measured by the railway administration For example, it is possible to measure the cost in delay minutes weighted by the train category and to add a delay equivalent for lost connections
  • conflict types are used to formalize the circumstances of a conflict by means of abstract parameters.
  • the conflict classes of the classification system for conflicts 5 are stored in an empirical basis 7 , with several measures for resolving a conflict being filed for each conflict class.
  • a matrix allows access to a measure of the empirical basis 7, wherein the matrix contains a conflict class key and sort key, of which the conflict class key points to a conflict class within the empirical basis and the sort key to a measure within a conflict class.
  • the solution space consists of all solutions to an original conflict, with each solution being assigned a quality factor. These solutions are obtained by applying to the original conflict and to all subsequent conflicts all applicable measures (according to the type of conflict). First, all applicable measures are applied to the original conflict. Each measure results in a new situation, usually with consequential conflicts. Then, in each of these new post-conflict situations, the first temporal conflict is resolved by applying all the measures applicable to that type of conflict. This in turn creates a new situation per applied measure.
  • the situation S0 represents an original conflict case.
  • the measures M1, M2, M3 For each applied measure, this leads to the follow-up situations S1, S2, S3, which each represent a consequential conflict, to which in turn various measures can be applied in order to resolve it.
  • the measures M11, M12 For the situation S1, these are the measures M11, M12, which lead to the follow-up situations S11, S12 .
  • the consequential conflict S2 can be resolved by the measures M21, M22, M23 , with situations S21, S22, S23 occurring in each case.
  • the measures M31, M32, M33 can be applied to the situation S3, which leads to the follow-up situations S31, S32, S33 .
  • situations S11, S12, S21, S22, S23, S31, S32, S33 do not represent conflict situations that need to be resolved.
  • Each path (path) through the solution tree 10 from the original conflict S0 to a conflict-free situation S11, S12, S21, S22, S23, S31, S32, S33 represents a solution.
  • a complete solution tree in which the original conflict and each contention conflict all applicable measures corresponds to the solution space.
  • a quality factor for the solution is determined for each solution. In order to obtain the best solution, ie the one with the best quality factor by comparison, the entire solution space must be determined. In the example, the solution 11 is the best solution.
  • a matrix 12 is shown simplified.
  • Each situation or conflict S0, S1, S2, S3 is assigned to a conflict class KK1 - KK4 .
  • the conflicts S0, S1, S2, S3 are assigned to the conflict classes KK2, KK1, KK4 and KK3.
  • the applicable measures are stored for each conflict class KK1 - KK4, the measures being sorted according to their chances of success.
  • the same measure can exist in different conflict classes. For example, M1 and M23 may be identical.
  • measure M1 is the most promising measure and M3 the least promising measure. If in the conflict resolution system it is given that only the two measures for the resolution of a conflict are to be used to find the best solution, which promise the most success, one obtains the (incomplete) solution tree of Fig. 2c.
  • FIG. 3 shows a matrix 20 for finding measures in an empirical basis.
  • the conflict class key K which is shown on the abscissa, together with the sort key SS (shown on the ordinate) for the measures M a - M i within a conflict class KK1 - KK7 forms a matrix 20.
  • the applicable measures M a - M i for each conflict class KK1 - KK7 sorted according to their success under the conflict circumstances of the respective conflict class KK1 - KK7.
  • the applicable measure M a - M i can be looked up for a conflict in the empirical basis.
  • a measure M x may be applicable in more than one conflict class.
  • the measure M g is applicable, for example, to the conflict classes KK1, KK3, KK4 and KK6.
  • the conflict class KK1 it is the best measure
  • the conflict class KK3 it is the eight best measure
  • the conflict class KK4 it is the third best measure
  • the conflict class KK6 it is the fifth best measure.
  • the basis of experience is built up by the evaluation of completely calculated solution trees. If a conflict of the conflict class KK1 has best been solved by the measure M g , then the success counter for M g in the conflict class KK1 is increased by 1. If a conflict of the conflict class KK3 is best solved by measure M g , then the success counter for M g in the conflict class KK3 is increased by 1, etc. After each change of a success counter, the sorting of the measures within the corresponding conflict class is checked and if necessary tightened.
  • success counter Z x The use of the success counter Z x will be explained again below with reference to FIG. 4 a.
  • the success of a measure M x is the frequency with which this measure M x has led to the best solution (lowest cost) of conflicts under certain conflict circumstances (conflict class). To be able to determine this frequency, success counters Z x are used. For each conflict class CC1 - KK7 there are per applicable measure M x a success counter Z x. A measure M x can be applicable in more than one conflict class KKx. Then there are for this measure M x several success counter x Z.
  • the conflict class is determined to conflict K from the solution tree, for example KK6. Furthermore, it is determined which measure applied to conflict K led to the best solution, for example measure M c .
  • the success counter Z c for measure M c for conflict class KK6 is determined and incremented ( FIG. 4b ). After each change of a success counter Z x , the sorting of the measures M x within the corresponding conflict class KKx is checked in the empirical basis and, if necessary, followed. Variants for counting success are conceivable. The counting can for example be combined with a weighting factor. Other variants relate to which and how many measures of a solution tree are taken into account in the success counting.
  • the evaluation can be restricted to only the measures applied to the original conflict (ie only M1 in Fig. 2c) or to the measures applied to all conflicts of the best solution (M1, M12 in Fig. 2c), or consider any measures applied to any resolved conflict of the solution tree that have best resolved this (consequence) conflict (M1, M12, either M22 or M21, depending on which of the two corresponding solutions is more cost effective).
  • FIG. 5 shows the assignment of the abstract vehicle or train parameters.
  • a mapping to abstract train parameters is made for each train number NR .
  • FIG. 6 illustrates the assignment of the abstract location parameters.
  • the infrastructure IS maps to abstract location parameters.
  • a method for resolving conflict situations (S0, S1, S2) in a track-bound transport system will be a selection of measures (M1, M2, M11, M12, M21, M22) suitable for resolving the conflict, taken from an empirical basis and only these measures (M1, M2, M11, M12, M21, M22) leading to follow-up situations in the determination a solution (11) considered.
  • measures M1, M2, M11, M12, M21, M22

Landscapes

  • Engineering & Computer Science (AREA)
  • Mechanical Engineering (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Train Traffic Observation, Control, And Security (AREA)
  • Traffic Control Systems (AREA)

Claims (12)

  1. Procédé pour contrôler l'occupation dans un système de circulation guidé dans le cas d'un conflit d'occupation (S0, S1, S2, 53) ou dans le cas d'un conflit technique, des mesures (M1 - M3 3 ; Ma - Mi) alternatives possibles destinées à résoudre le cas de conflit (S0, S1, S2, S3) étant déterminées et prises en compte lors de la détermination d'une solution, un facteur de qualité étant déterminé pour chaque solution et la solution (11) ayant le meilleur facteur de qualité étant appliquée, caractérisé en ce qu'une sélection des mesures (M1, M2, M11, M12, M21, M22) envisagées pour résoudre le cas de conflit et ne comprenant pas toutes les mesures envisagées pour résoudre un cas de conflit est prélevée d'une base de connaissances (7), la réussite d'une mesure (M1 - M33 ; Ma - Mi) étant évaluée et seule(s) la ou les mesures (M1, M2, M11, M12, M21, M22) considérées comme prometteuses étant prélevées de la base de connaissances (7) et seule(s) cette ou ces mesures (M1, M2, M11, M12, M21, M22) étant prises en compte lors de la détermination des solutions (11).
  2. Procédé selon la revendication 1, caractérisé en ce qu'une sélection de mesures (M1, M2) est prélevée de la base de connaissances (7) pour un cas de conflit (S0) et une sélection de mesures (M11, M12, M21, M22) est également prélevée de la base de connaissances (7) pour chaque cas de conflit conséquent (S1, S2) résultant d'une mesure (M1, M2) appliquée au cas de conflit (S0).
  3. Procédé selon la revendication 1, caractérisé en ce qu'une clé de tri (SS) est déterminée par le biais de laquelle les mesures appropriées (M1 - M33) pour un conflit à résoudre peuvent être retrouvées dans la base de connaissances (7).
  4. Procédé pour générer une base de connaissances (7, 12), caractérisé en ce que la base de connaissances (7, 12) est construite pendant les périodes de faible utilisation d'un système de résolution des conflits dans lequel est mis en oeuvre le procédé selon la revendication 1 et/ou après une première mise en oeuvre du procédé selon la revendication 1, notamment la première installation dans le système de résolution des conflits.
  5. Procédé selon la revendication 4, caractérisé en ce que des types de conflit (2) et des classes de circonstance de conflit (6, KU) sont définis, lesquels sont associés à une classe de conflit (5, KK1 - KK7) et les classes de conflit (5, KK1 - KK7) sont enregistrées dans la base de connaissances (7).
  6. Procédé selon la revendication 5, caractérisé en ce que les mesures applicables (M1 - M33, Ma - Mi) pour la résolution d'un conflit sont associées à chaque classe de conflit (5, KK1 - KK7).
  7. Procédé selon la revendication 6, caractérisé en ce que les mesures applicables (M1 - M33, Ma - Mi) sont triées au sein d'une classe de conflit (5, KK1 - KK7).
  8. Procédé selon la revendication 5, caractérisé en ce que les conflits sont classifiés au moyen de leurs circonstances formalisées par le biais de la classe de circonstance de conflit (6, KU).
  9. Procédé selon la revendication 8, caractérisé en ce que la classification est effectuée au moyen de paramètres de lieu et de véhicule abstraits (ZP, ZL, ZLP, PLW, R, UP).
  10. Procédé selon la revendication 6, caractérisé en ce qu'un facteur de réussite (compteur de réussites Za - Zf) est associé à chaque mesure applicable (M1 - M33, Ma - Mi) d'une classe de conflit (KK1 - KK7).
  11. Système de résolution des conflits destiné à mettre en oeuvre le procédé selon la revendication 1 comprenant une mémoire pour enregistrer une base de connaissances et comprenant des moyens pour sélectionner des mesures destinées à résoudre un conflit à partir de la base de connaissances et des moyens pour déterminer des solutions ainsi que le facteur de qualité d'une solution.
  12. Programme informatique destiné à mettre en oeuvre le procédé selon la revendication 1.
EP03360088A 2003-07-22 2003-07-22 Procédé de résolution des conflits dans un système de transport guidé sur une voie Revoked EP1500567B1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP03360088A EP1500567B1 (fr) 2003-07-22 2003-07-22 Procédé de résolution des conflits dans un système de transport guidé sur une voie
DE50301157T DE50301157D1 (de) 2003-07-22 2003-07-22 Verfahren zur Auflösung von Konflikten in einem spurgebundenen Verkehrssystem
AT03360088T ATE303930T1 (de) 2003-07-22 2003-07-22 Verfahren zur auflösung von konflikten in einem spurgebundenen verkehrssystem

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP03360088A EP1500567B1 (fr) 2003-07-22 2003-07-22 Procédé de résolution des conflits dans un système de transport guidé sur une voie

Publications (2)

Publication Number Publication Date
EP1500567A1 EP1500567A1 (fr) 2005-01-26
EP1500567B1 true EP1500567B1 (fr) 2005-09-07

Family

ID=33484065

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03360088A Revoked EP1500567B1 (fr) 2003-07-22 2003-07-22 Procédé de résolution des conflits dans un système de transport guidé sur une voie

Country Status (3)

Country Link
EP (1) EP1500567B1 (fr)
AT (1) ATE303930T1 (fr)
DE (1) DE50301157D1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109784684A (zh) * 2018-12-27 2019-05-21 中国铁道科学研究院集团有限公司通信信号研究所 一种基于案例推理的列车运行调整策略决策方法

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
HUE053972T2 (hu) 2016-03-03 2021-08-30 Thales Man & Services Deutschland Gmbh Eljárás jármûvek irányítására konfliktushelyzet esetén és döntéstámogató rendszer
CN113264086B (zh) * 2021-06-08 2022-08-26 卡斯柯信号有限公司 一种基于tacs系统的列车间隔防护控制方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4122523A (en) * 1976-12-17 1978-10-24 General Signal Corporation Route conflict analysis system for control of railroads
US5623413A (en) * 1994-09-01 1997-04-22 Harris Corporation Scheduling system and method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109784684A (zh) * 2018-12-27 2019-05-21 中国铁道科学研究院集团有限公司通信信号研究所 一种基于案例推理的列车运行调整策略决策方法

Also Published As

Publication number Publication date
EP1500567A1 (fr) 2005-01-26
DE50301157D1 (de) 2005-10-13
ATE303930T1 (de) 2005-09-15

Similar Documents

Publication Publication Date Title
DE3416939A1 (de) Verfahren zur steuerung von betriebseinrichtungen
DE19951716A1 (de) Verfahren zur dynamischen Speicherverwaltung
EP3707854A1 (fr) Procédé d'interconnexion d'un premier bloc de données à un deuxième bloc de données, procédé de vérification de l'intégrité d'une structure de chaîne de blocs, dispositif et produit programme informatique
EP1500567B1 (fr) Procédé de résolution des conflits dans un système de transport guidé sur une voie
DE10115046A1 (de) Verfahren und Einrichtung zur Erzeugung eines Abbildes eines netzwerkartigen Herstellungsprozesses
DE19701928C1 (de) Verfahren zur Initialisierung einer Simulation des Verhaltens einer technischen Anlage und Simulationssystem für eine technische Anlage
DE19753034A1 (de) Verfahren zur Prognose eines den Zustand eines Systems repräsentierenden Parameters, insbesondere eines den Zustand eines Verkehrsnetzes repräsentierenden Verkehrsparameters und Vorrichtung zum Durchführen des Verfahrens
DE112021003100T5 (de) Verfahren zum Verwalten der Verteilung eines zum Ankunftspunkt fahrenden Fahrzeug, dazu verwendeter Verwaltungsserver, und Aufzeichnungsmedium, auf dem Programm zum Ausführen des Verfahrens aufgezeichnet ist
EP0770946B1 (fr) Procédé pour concevoir automatiquement la redondance optimale pour des mesures dans le système de controle des centrales électriques
DE102020208620A1 (de) Verfahren und Vorrichtung zum Betreiben eines streckengebundenen Transportsystems mithilfe von Methoden künstlicher Intelligenz
EP3705993B1 (fr) Système et procédé de détection et d'identification des n uds de calcul dans un réseau
DE19644680A1 (de) Verfahren und Vorrichtung zur Handhabung von Kennzeichnungsdaten einer Mehrzahl von Komponenten eines Produktes
WO2004040483A2 (fr) Prevision du degre de respect des delais de livraison dans la fabrication en serie
DE102005019335A1 (de) Verfahren und Vorrichtung zum Auswerten von Ereignissen aus dem Betrieb zumindest eines Fahrzeuges
CH670804A5 (fr)
DE3609925A1 (de) Einrichtung zur simulation von neuronensystemen
DE102016216510A1 (de) Konzept zum Ermitteln eines Belegungszustands eines Stellplatzes eines eine Vielzahl von Stellplätzen umfassenden Parkplatzes
WO2023102583A1 (fr) Procédé de fabrication additive d'une pièce
DE102018123563B4 (de) Verfahren zur Zwischenkernkommunikation in einem Mehrkernprozessor
DE102022213261A1 (de) System oder Verfahren zur Erkennung von Häufigkeiten von gleichen oder ähnlichen Szenarien
DE102022203272A1 (de) Verfahren zum Planen eines AVP-Vorgangs
DE102005042643A1 (de) Kommissionierverfahren
DE102005019518A1 (de) Verfahren und Anordnung zum Auswerten von Ereignissen, insbesondere aus dem Betrieb eines Straßen-Kraftfahrzeuges
EP4092541A1 (fr) Sécurisation et vérification des éléments de données dans un réseau informatique distribué
DE102004002493A1 (de) Betriebsdatenerfassung zur Bewertung des Fahrstreckenverhaltens eines Kraftfahrzeugs

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040308

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

Ref country code: IE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 20050907

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: GERMAN

AKX Designation fees paid

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

REF Corresponds to:

Ref document number: 50301157

Country of ref document: DE

Date of ref document: 20051013

Kind code of ref document: P

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051207

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051207

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051207

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051207

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051218

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060207

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060308

ET Fr: translation filed
REG Reference to a national code

Ref country code: IE

Ref legal event code: FD4D

PLBI Opposition filed

Free format text: ORIGINAL CODE: 0009260

PLAX Notice of opposition and request to file observation + time limit sent

Free format text: ORIGINAL CODE: EPIDOSNOBS2

26 Opposition filed

Opponent name: DEUTSCHE BAHN AG PATENTABTEILUNG

Effective date: 20060607

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060731

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060731

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: ALCATEL LUCENT

RDAF Communication despatched that patent is revoked

Free format text: ORIGINAL CODE: EPIDOSNREV1

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060722

APBP Date of receipt of notice of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA2O

APAH Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNO

BERE Be: lapsed

Owner name: ALCATEL

Effective date: 20060731

APBQ Date of receipt of statement of grounds of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA3O

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070731

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060722

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20050907

APBU Appeal procedure closed

Free format text: ORIGINAL CODE: EPIDOSNNOA9O

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: ALCATEL LUCENT

PLAY Examination report in opposition despatched + time limit

Free format text: ORIGINAL CODE: EPIDOSNORE2

PLBC Reply to examination report in opposition received

Free format text: ORIGINAL CODE: EPIDOSNORE3

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20130717

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20130717

Year of fee payment: 11

Ref country code: FR

Payment date: 20130724

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20130716

Year of fee payment: 11

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: ALCATEL LUCENT

RDAD Information modified related to despatch of communication that patent is revoked

Free format text: ORIGINAL CODE: EPIDOSCREV1

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 50301157

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20140722

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20150331

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140722

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150203

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 50301157

Country of ref document: DE

Effective date: 20150203

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140731

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140722

RDAG Patent revoked

Free format text: ORIGINAL CODE: 0009271

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: PATENT REVOKED

27W Patent revoked

Effective date: 20141024

REG Reference to a national code

Ref country code: AT

Ref legal event code: MA03

Ref document number: 303930

Country of ref document: AT

Kind code of ref document: T

Effective date: 20141024