EP1288099A1 - Method for projecting routes for vehicles using destination groups - Google Patents

Abstract

The invention relates to a method for planning routes (V1 to V6) for vehicles, especially for rail-mounted vehicles. The inventive method comprises the following steps: a) defining a route by a start section (100, 200, 31) and a target section (103, 203) and by a number of one or more route sections (12, 13, 1, 14, 22, 2, 24, 32, 3) that lie between the start section and the target section; b) combining the start sections, target sections and route sections to target groups (a to e); c) predetermining one or more routes between one or more predetermined start sections and one or more possible target sections; and d) unambiguously defining every route predetermined in said manner by a sequence of target groups. The inventive method allows to substantially reduce memory requirements since instead of O(n<2>)..O(n<3>) memory location only O(n)..O(n<2>) memory location is required. It also allows to substantially simplify time-consuming checking procedures since it is no longer necessary to check every possible start/target section combination. It is sufficient to check within every target group only the last element as the target section and all possible start sections as the point of departure. It is no longer required to check start and target sections that lie on already covered routes for their integrity since the route sections included in one or more target groups have already been automatically checked along with those groups.

Description

The invention relates to a method for project planning of routes for vehicles, in particular rail-bound vehicles, with a driveway through a start section and a finish section and by a arranged between the start section and the finish section Row of one or more route sections is defined.

In a traffic network, here using the example of a railway network further explained are within a certain in itself closed area, e.g. a station or one Interlocking area, a variety of routes provided the more or less standard of this area frequenting trains. This is it required that provided for each train Driveways also at the right time while maintaining high to provide safety requirements.

Such routes are then made available for example on the basis of the European Patent EP 0 920 391 B1 disclosed solution. There is a procedure for the control and monitoring of a traffic engineering system described in which the and monitoring elements for at least two lanes for track-bound vehicles adjustable through a control process are. This tax process provides a prompt Structure of a route all associated with this route Controls and locks these controls against further request to build further routes as long as until the currently set route is no longer required. The actuators can then be used to build a new route. To the high Safety requirements when building routes in comparatively simple way, it is in of the above patent, each of which is provided by changes in the situation to be carried out in the tax process or Status of the control elements only after successful testing for reliability through one of the control process independent test process. This testing process examines, on a case-by-case basis, whether the requirements for the assembly or dismantling of the Travel path to be blocked and to be set and / or Monitoring elements for a route that has already been created are used and are therefore already blocked. It can the control process according to the so-called track plan principle and the test process according to the so-called closure panel principle work or vice versa.

For performing the above procedure is of course a complete and the high Configuration also meets security requirements of the roads inevitable. For this it is necessary which is usually from an operator of the road network predetermined routes starting from a starting section clearly in sections up to a desired one Define target section and the corresponding on this Path "run over" in terms of control technology or in other words to determine interlocking logic units and their respective Assign setting for the intended routes.

It is easy to understand that these definitions the routes and the corresponding assignments Settings of the interlocking logic units for each of the possible subsets within the planned routes of partial routes and save at safety acceptance to their integrity are review. Even at a medium-sized train station this can mean that a few hundred subsets of Save start and finish sections and are to be accepted for safety reasons. This approach therefore poses in view of the required security level SIL4 (highest software integrity level according to the European standard EN50128) a tremendously large time and Represents cost.

The invention is therefore based on the object of a method for project planning of routes, where the Effort in storage capacity and time and costs at the Decrease in the planned routes compared to today Solution is reduced.

a) eine Fahrstrasse durch einen Startabschnitt und einen Zielabschnitt und durch eine zwischen dem Startabschnitt und dem Zielabschnitt angeordnete Reihe von einem oder mehreren Fahrstrassenabschnitten definiert wird,

b) die Startabschnitte, die Zielabschnitte und die Fahrstrassenabschnitte zu Zielgruppen zusammengelegt werden,

c) eine oder mehrere Fahrstrassen zwischen einem oder mehreren vorgegebenen Startabschnitten und einem oder mehreren möglichen Zielabschnitten vorgegeben werden, und

d) jede so vorgegeben Fahrstrasse durch eine Aneinanderreihung von Zielgruppen eindeutig bestimmt wird.

This object is achieved according to the invention in that a method for projecting routes for vehicles, in particular for rail-bound vehicles, is provided in which

a) a route is defined by a start section and a destination section and by a row of one or more route section arranged between the start section and the destination section,

b) the start sections, the destination sections and the route sections are combined to form target groups,

c) one or more routes are specified between one or more predetermined start sections and one or more possible finish sections, and

d) each route thus specified is clearly determined by a series of target groups.

In this way it is possible to drastically reduce the storage volume required for the storage of the driving routes, because instead of O (n ² ) .. O (n ³ ) storage space only O (n) .. O (n ² ) storage space is required becomes. This also drastically simplifies the time-consuming testing process, because now it is no longer necessary to test every possible start / finish section combination, but it is sufficient to check only the last element as the finish section and all possible start sections as starting points within each target group. It is no longer necessary to check the integrity of start and destination sections that are on already traveled routes, because these have already been automatically checked within one or more target groups.

Regarding a particularly effective approach at Application of the method can initially between one or several predetermined start sections and one or one or more of several specified target sections Preferred routes are defined, whose Route sections including the respective start and the respective target section of a single target group be assigned. It is possible in this way, in the beginning form the largest possible target groups from the project planning which later only a few sections of the road removed and sorted into new target groups if it is the requirement of the clear illustration of the Routes on a series of target groups should make it necessary.

In the control and signal box implementation of the projected routes can the high Security requirements met particularly well and easily if the start sections, the finish sections and the Route sections each as an atomic route are defined, with the nuclear routes one Route section not further subdivided in terms of control technology represent a driveway. This can mean that Limit nuclear routes by two code points be, a code point a single signal box logic uniquely adjustable unit. This can be done then cause a route control only ever from one code point to the next code point and thus a route request successively checked and can also be canceled if a Code point based on its current setting and / or Occupancy is not available.

A particularly efficient storage of the intended Driveways can be reached safely if all approved Routes mapped onto a two-dimensional matrix be, in which on one axis the or the Starting sections and all possible sections and on on the other axis all possible route sections and the or the target sections are listed and by the individual matrix elements is specified, which Section of the route to reach the destination section is the next section of the route.

Compared to this described above Storage possibility results in an even more space-saving Storage if all approved routes are on one two-dimensional matrix are shown, in which on the an axis of the start section and all possible Route sections and all possible on the other axis Target groups are listed and by the individual Matrix elements indicate which section of the route next to reach the target section Route section is.

Another way to prioritize certain Routes arise when a fictitious nuclear route is defined, by means of which a preferred route is determined at least in sections. In this way can route several sections to one nuclear route are summarized in this approach should not be further divided. The expression "fictitious" takes into account the fact that it is actually not really a nuclear route by definition is. In this way, for example, in terms of permissible maximum speed and in terms of traction properties of a section of track Preferred routes using fictitious nuclear routes be defined that allow fast moving trains the fastest to drive without traction problems Driveway and, for example, slow-moving trains restrictions relevant to traction to assign traction-technically more favorable route.

Further advantageous embodiments of the invention are the other subclaims.

Figur 1

eine schematische Darstellung von Streckenabschnitten eines kleinen Vorortbahnhofs;

Figur 2

einen ersten Verfahrensschritt zur Projektierung von Vorzugsfahrstrassen im Streckenabschnitt des Vorortbahnhofs gemäss Figur 1;

Figur 3

einen zweiten Verfahrensschritt zur Projektierung von Vorzugsfahrstrassen im Streckenabschnitt des Vorortbahnhofs gemäss Figur 1;

Figur 4

einen dritten Verfahrensschritt zur Projektierung von Vorzugsfahrstrassen im Streckenabschnitt des Vorortbahnhofs gemäss Figur 1;

Figur 5

einen vierten Verfahrensschritt zur Projektierung von Vorzugsfahrstrassen im Streckenabschnitt des Vorortbahnhofs gemäss Figur 1;

Figur 6

einen fünften abschliessenden Verfahrensschritt zur Projektierung von Vorzugsfahrstrassen im Streckenabschnitt des Vorortbahnhofs gemäss Figur 1; und

Figur 7

eine Matrix der in den Verfahrensschritten 1 bis 5 projektierten Fahrstrassen anhand von Zielgruppen.

Exemplary embodiments of the invention are explained in more detail below with reference to the drawing. Show:

Figure 1

a schematic representation of sections of a small suburban station;

Figure 2

a first method step for the planning of preferred routes in the section of the suburban station according to Figure 1;

Figure 3

a second method step for project planning of preferred routes in the section of the suburban station according to FIG. 1;

Figure 4

a third method step for project planning of preferred routes in the section of the suburban station according to FIG. 1;

Figure 5

a fourth method step for the planning of preferred routes in the section of the suburban station according to FIG. 1;

Figure 6

a fifth final method step for the planning of preferred routes in the section of the suburban station according to FIG. 1; and

Figure 7

a matrix of the routes planned in process steps 1 to 5 based on target groups.

Figure 1 shows a schematic representation of Route sections of a small suburban station, based on the inventive method for projecting Routes within the area of this suburban train station will be explained.

First of all, for a better understanding of the in some of the nomenclature used in the claims basic terms are explained. The Route sections of the suburban train station include Start sections 100, 200, 31, finish sections 103, 203 and Route sections 12, 22, 32, 1, 2, 3, 13, 14 and 24. It is common to all these sections that everyone Section itself represents a nuclear route, which in Control technology and signal box logic perspective no longer is further divided. For example, the Route sections 1, 2 and 3 exactly the track sections be inside the suburban train station on which passenger trains come to a standstill for boarding and disembarking passengers.

For the project planning of the routes for this Figure 2 now shows a suburban train station in a first step first dotted preferred route V1, the starting from the start section 200 via the Route sections 12, 13, 1, 14 the destination section 103 reached. For this reason, the route sections 12, 13, 1, 14 and 103 assigned to a first target group a.

In the second step according to FIG. 3, there are now more Preferred route V2, V3 and V4 defines what is initially the Formation of a second target group b, who initially leads the Route sections 22, 2, 24 and 203 belong. With the picture According to FIG. 2, only the preferred routes are V1 and V2 clearly represents because the target sections 103 and 203 reached exclusively via target groups a and b can be. The instruction from the start section 200 about the Target groups a and b to reach target section 203 is currently not clear, because the preferred routes V3 and Offer V4 equally, i.e. the route from 12 to 24 can be 12-2-24 or 12-13-1-24. This ambiguity will be eliminated in the fourth step according to FIG. 5.

In the third step according to FIG. 4, there is now another one Preferred route V5 defines what to form a leads third target group c, the sections 32 and 3 belong. The instruction from 200 starting from the Getting target groups c and b to 203 is clear and leads to route 200-32-3-24-203.

In the fourth step according to FIG. 5, the one in FIG 3 still existing ambiguity regarding the route eliminated from 200 to 203 via target groups a and b, in which the route sections 24 and 203 of the target group b are taken and form a fourth target group d. The Prompt from start section 200 to the finish section Reaching 203 using target group a now leads inevitably via the target group d, but here does not result in a clear preferred route because the Instruction for route 200-12-13-1-24-203 or 200-12-13-1-14-203 could be

The fifth step according to FIG View of the process now a sixth Preferred route V6 defined, which will only be unique may, if the target section 203 taken from the target group d becomes and this target portion 203 itself a fifth Target group forms e. The instruction based on that Starting section 200 to reach destination section 203 is then drive over the target groups a and e. So that is in Figure 5 eliminates the last ambiguity still present.

Using these five steps according to Figures 2 to 6 the basic procedure for the assignment of Route sections to the target groups a to e clearly, too if in this embodiment of the small Target groups, here d and e, are formed, that contain only a single section of the route. at a larger train station or a track area with extensive maneuvering options is the formation of such only one section of the target group rather the exception, because of course during project planning generate as few target groups as possible.

Figure 7 now shows a matrix in which in the horizontal top line all start sections 100, 200 and 31 as well as all Route sections 12, 13, 1, 14, 22, 2, 24, 32 and 3 are listed. In the left column, the target groups are a listed to e. The individual matrix elements now show that in each case in the relevant target group a to e next destination along a preferred priority route V1, V2, V4, V5 and V6. The matrix therefore forms exactly that in Figure 6 reached the state of the project planning.

On the basis of only about 27% provided with information Matrix (only 16 out of 60 matrix elements have a zero different statement on) becomes easy to understand, in how to use storage space very economically becomes. The procedure in the prior art would have been for example for the matrix element (12; e) for an entry 13-1-14-203 led. The entry for the Matrix element (12; d) are 13-1-24. For the acceptance of this Project planning means, for example, the acceptance of the Preferred route V1 from 200 to 103 that automatically the Sections 200-12, 200-12-13, 200-12-13-1, 200-12-13-1-14, 12-13, 12-13-1, 12-13-1-14, 13-1, 13-1-14 and 1-14 are taken away. It is easy to see that this automatic acceptance based on the educated target group in view of the care required by SIL4 represents considerable savings in working time and costs.

In conclusion, it should be noted that the present Invention by no means on the project planning of Railway routes limited, but with appropriate Division of a route network into so-called Nuclear routes of course also for Road traffic routes, water transport routes and air corridors suitable.

LIST OF REFERENCE NUMBERS

100, 200, 31

start sections

103, 203

target portions

12, 13, 1, 14, 22, 2, 24, 32, 3

Fahrstrasse sections

V1 to V6

Preferred route segments

Claims (8)

Method for projecting routes (V1 to V6) for vehicles, in particular rail-bound vehicles, wherein a route (V1 to V6) has a start section (100, 200, 31) and a destination section (103, 203) and one between the start section ( 100, 200, 31) and the destination section (103, 203) arranged row of one or more route sections (12, 13, 1, 14, 22, 2, 24, 32, 3) is defined,
characterized in that
the start sections (100, 200, 31), the finish sections (103, 203) and the driveway sections (12, 13, 1, 14, 22, 2, 24, 32, 3) are combined into target groups (a to e), whereby one or more routes are specified between one or more predetermined start sections (100, 200, 31) and one or more possible destination sections (103, 203) and each route (V1 to V6) is clearly specified by a series of target groups (a to e) becomes. Method according to claim 1,
characterized in that
A preferred route (V1 to V6) is defined between a predetermined starting section (100, 200, 31) and a specified destination section (103, 203), the sections of which are assigned to a single target group (a to e). Method according to claim 1 or 2,
characterized in that
the start sections (100, 200, 13), the destination sections (103, 203) and the route sections (12, 13, 1, 14, 22, 2, 24, 32, 3) are each defined as an atomic route, the atomic routes being one Represent the route section of a route (V1 to V6) that is not technically further subdivided. Method according to claim 3,
characterized in that
the nuclear routes are each delimited by two code points, one code point being a signal box logic unit. Method according to claim 4,
characterized in that
route control is always carried out from one code point to the next code point. Method according to one of claims 1 to 5,
characterized in that
All approved routes (V1 to V6) are mapped onto a two-dimensional matrix, in which the one or more start sections (100, 200, 31) and all possible route sections (12, 13, 1, 14, 22, 2, 24 , 32, 3) and on the other axis all possible route sections (12, 13, 1, 14, 22, 2, 24, 32, 3) and the destination section (s) (103, 203) are listed and indicated by the individual matrix elements which route section is the next route section to reach the destination section (103, 203). Method according to one of claims 1 to 6,
characterized in that
All approved routes (V1 to V6) are mapped onto a two-dimensional matrix, in which the one or more start sections (100, 200, 31) and all possible route sections (12, 13, 1, 14, 22, 2, 24 , 32, 3) and on the other axis all possible target groups (a to e) are listed and the individual matrix elements indicate which route section is the next route section to reach the destination section (103, 203). Method according to one of claims 1 to 7,
characterized in that
a fictitious nuclear route is defined, by means of which a preferred route (V1 to V6) is defined at least in sections.

Images