EP0902406A2 - Method for transmitting traffic data and for analysing the road traffic network, traffic-evaluating central unit and terminal therefor - Google Patents

Abstract

A digital route map is defined in terms of a number of sections (1-17) that are connect between nodes (A-T), e.g. junctions. The sections are defined to allow different part routes (W1-W4) to be defined. A mobile communication link to a central station allows route data to be transmitted in sections to a vehicle (18). The data is stored in different sections of memory.

Description

The invention relates to a method for transmitting route data, a method for the analysis of a traffic route network, a traffic registration center and a Terminal.

The transmission of route data between a vehicle and a control center, that is in particular the transmission of one each covered by a vehicle Path-related data (FCD) from the vehicle to the control center or e.g. the Transmission of further assignable in a control center to a transmitted route transmitted data, such as travel times of vehicles charged because of the very high Number of vehicles the transmission path very strong. Especially through the Transmission of route data determined by many individual vehicles to each distances traveled as well as travel times etc. for the respective transmitted Path, due to the large number of vehicles, a very large one to be transmitted Amount of data. The transmission channels available for transmission however, their capacity is not unlimited.

DE 195 08 486 A1 discloses a method for transmitting position data via mobile radio between a vehicle and a control center, each of which is based on a predetermined interval with a GPS receiver position data in the form of a point (specifying longitude and latitude), where two points are connected to a vector and from all so obtained Vectors a first vector train is formed. The first vector is used for data reduction Straight lines approximated with increasing number of straight lines until the maximum distance of the actual position data from the straight line below of a predetermined threshold value, whereupon those reduced in this way Position data are transmitted. An access to information in a digital Traffic network map is not recommended for data reduction.

The object of the present invention is therefore to optimize the transmission of route data between a vehicle and a control center.

This object is achieved by the method according to claims 1, 14 and by a Traffic detection center and a terminal according to claims 19, 22 solved.

The invention optimizes the transmission of route data by reducing the Redundancy, i.e. by increasing the information density during transmission. For this will each have one or more edges in the digital map of the Traffic route network, in which vehicles move, to partial routes summarized. Route data can be identified with a description of the partial route which they relate to are transferred. Other dates such as travel times, Environmental data, temperatures etc. can e.g. by designating a partial route and of the location on the partial route. So it's just a one-dimensional one Path parameters such as the distance from the beginning of the partial route to the description an exact location of train-related information such as travel times or Environmental data required within a partial route, which with a lower Redundancy than with a two-dimensional (geographical longitude and latitude) Location is possible; the place name is therefore a relatively short piece of information.

Edges of the traffic network in which vehicles are moving Sections of roads, lanes or lane groups or the like in one Exit traffic network map and connected to other edges by nodes. On The nodes of a traffic route network can lie on one, two or more edges. If there is only one edge on a node, it is an end point of the Traffic network. If there are two edges on a node, it can be a subdivision of a street, roadway, lane group etc. in the longitudinal direction in act several edges, two edges each by a node are connected. If there are three or more edges on a knot, it acts is a junction or intersection of roads, lanes, lane groups etc. An intersection with more than three edges can be divided by several Knots with three edges to be replaced. The different directions of a street can be represented by one or more edges. Route data in the sense of Claims include data that is covered by one vehicle at a time Identify the path, namely the edges or the partial paths, each one or include several contiguous edges and together the covered Make way. If the route of a vehicle in a digital map of a transport network in the head office can also Further data such as travel times can be assigned to this route.

Particularly advantageous embodiments of the invention result from the Subclaims.

Route data transmitted can in particular be one from a vehicle with one Traffic detector traveled route and from vehicle to headquarters be transmitted. The data determined in this way in the central office can in particular for travel time statistics and for later recommendations on the choice of routes Vehicles are used.

The route data can also relate to the vehicle in particular Head office recommended route and from the head office to the vehicle respectively can be transmitted to several vehicles. It can be used for a vehicle or determined several routes based on travel time statistics in a central office Travel times are informed and advice on the selection of routes.

The transmission of a route is expediently carried out by the transmission of Designations of the partial routes forming it. A way can be from one or exist several partial routes. The names of the partial routes can be found in the Central and in the vehicle in identical or different databases stored with an assignment of edges forming a partial path one partial route each; instead can also be used in the head office and in the vehicle at least one set of rules for the formation of partial paths from edges be stored and for the identification of partial routes of a route to be transmitted these rules are used. Also several different ones Databases and / or sets of regulations for the formation of partial routes in each case Vehicle and be stored in the center, with the transmission of one Path related data the set of regulations or the database to which the route data relate to it, which increases the universality.

Furthermore, when assigning one or more edges each Partly because of the road types of these edges are taken into account; thus can for example partial routes from edges representing highway sections or from Edges representing highway sections and country roads are formed.

At least one vehicle expediently becomes one from the central office recommended route communicates the expected travel time. From a vehicle expediently to the head office for a part or part of the journey Time required. This means that occupancy statistics from In addition to routes, directly determine travel times for certain routes.

The associated period or time is preferably transmitted for route data. The exact time or a quantified period of time are transmitted and stored in the headquarters. The control center can also transmit route data, what time period, for example what time of day, what day of the week or which day of the year these route data relate to, for example Precise route recommendations for traffic jams occurring at certain times of the year can be transmitted.

By a method for the analysis of an edge and knot Traffic route network generating one specified in the claims The target file from a source file is used to reference partial routes in the Suitable transmission of route data between a control center and a vehicle Target file created. Different can be used to generate the target file Approaches can be chosen. For example, starting from a as Starting nodes selected nodes of the network, partial routes are defined in such a way that with ascending numbering of the partial routes, one partial route through if possible long left turn, starting from the starting node. This regulation is very easy to implement.

In a traffic registration center or a terminal, a The method according to the invention advantageously implemented in the form of a program become.

Fig. 1

als einzige Figur schematisch eine digitale Straßenkarte eines Verkehrswegenetzes.

Further features and advantages result from the further claims and from the following description of an embodiment with reference to the drawing. It shows:

Fig. 1

the only figure schematically shows a digital road map of a traffic route network.

FIG. 1 shows a digital road map of an edge 1 to 17 and node A to T extensive traffic network. An edge here comprises a section of the route a street. Alternatively, it would also be possible to have several for one section of the route Edges, for example one edge for each direction of travel or one for each Lane one edge each or a separate edge for turning lanes etc. define. The edge 1 is between the two nodes A and B, the edge 2 is between nodes B and C, edge 3 is between the Nodes C and D etc. In the very small traffic network shown, the nodes are A, G, J, P, T each start node of the digital map of the traffic network, so Knots, of which only one edge or only one edge of the considered Street classes. The nodes B, D, L are branch nodes, i.e. nodes with at least three adjacent edges; this means, for example, from the edge 1 At node B, drive a vehicle in the direction of edge 2 or edge 10 can that there is a real possibility of branching off. Instead of like here three edges each, a junction node can also have more than three edges, for example at an intersection; however, it is also possible to get the here selected representation with branch nodes with exactly three edges each preserved, even at intersections with more than three edges, several junction nodes to define from which exactly three edges each originate. The nodes C, E, F, H, l, K M, N, Q R are nodes, of which only two edges, for example Edge 2 and 3 start from node C. These edges can be in one Digital road map representing traffic route network for specific purposes, such as. Congestion detection may be important, however they are used to analyze a route and transmission of route data relating to this route, in particular Travel times, not important. Furthermore, a traffic route network can be used representing digital map, i.e. output file, to form a partial route of the Traffic network with target file representing low redundancy Consideration of edges and / or nodes of only a certain road class, for example, freeway, are taken into account; also e.g. from one Output file several target files for each street class can be formed.

If with the existing as an output file, a traffic network representing digital road map in Figure 1 a way and this way further route data in question should be transmitted by The passed nodes and / or the passed edges are transmitted. For example, in the edge 1 in the direction of arrow V from Starting node A to the starting node J vehicle 18 moving over the edges Move 1, 2, 3, 7, 8, 9. This way can be in a terminal in the vehicle due to a position detection system (e.g. GPS) and / or one Odometer and / or a speedometer and / or the detection of the Steering movements of the vehicle and / or a digital road map etc. detected become. Furthermore, a total time required for this route can be added to the route and for partial routes of the route, partial route times are recorded. This route data should be transmitted from the vehicle 18 to a control center. This can be done from a terminal in the vehicle 18 to the central office, for example by radio, in particular mobile radio, respectively. For this purpose, for example, transmission according to GSM, in particular GSM SMS, can be selected in the form of a short message.

In the example shown in FIG. 1, a vehicle 18 can travel From A to J the edges 1, 2, 3, 7, 8, 9 and the time required for this as Route data can be transmitted to a control center. Because of the variety of However, vehicles have a very large amount of data. The capacity of the However, the available transmission medium is limited. Therefore the resulting data volume can be kept as low as possible.

For this purpose, the traffic route network is broken down into partial routes. One or several edges 1 - 17 form a partial path. In the terminal and in the control center at least one set of regulations for the formation of partial routes in one Traffic network or one according to a set of regulations from the digital Road map of a traffic route network (output file) less formed redundant (information technology compressed) digital road map of the Traffic route network (i.e. destination file) must be saved. The identification of a path when transmitting a route covered and travel times relating to it etc. from the vehicle to the control center or from the control center to a vehicle, if there are several sets of regulations for the formation of Partial routes or several target files created according to these sets of rules are available, stating the set of regulations applicable to the partial routes or the applicable target file.

The regulations for dividing the transport network into partial routes can be chosen in this way be independent of the digital road maps that exist in the terminal and the head office can be used. In particular, in the terminal and in the Central does not necessarily have the same digital street map or the same Version (update) of a digital road map is available. The procedure is too for different cards or card versions in the terminal and in the head office trainable.

For data reduction of a traffic route network by forming partial routes Multiple edges and / or nodes are different sets of rules possible.

For example, a partial route can be defined between two nodes each are either output nodes A, G, J, P, T or branch nodes B, D, L, respectively. The partial routes of the digital channels shown in FIG. 1 result from this version Road map of a traffic network as follows:

The partial route W ₁ comprises the edge 1, the partial route W ₂ comprises the edges 2, 3, W ₃ = 4, 5, 6, W ₄ = 7, 8, 9, W ₅ = 10, 11, W ₆ = 12, 13, 14, W ₇ = 15, 16, 17. It can be saved according to which set of rules partial branches W ₁ to W _{7 are} formed. It can also be stored in a target file which edges are contained in a partial route W ₁ to W ₇ and / or which nodes form the end of a partial route W ₁ to W ₇ .

A further set of regulations for the formation of partial routes in a digital road map representing a traffic route network can be as follows: A partial route is formed starting from any exit node A with increasing node numbering, by turning left for as long as possible until a further exit node G, J, P, T. Paths between this output node A and the other output nodes are thus detected. After all possible routes from the output node A have been processed, a further rule can lie in the choice of a further output node G, all of which except the route to the output node A already considered being defined accordingly as partial routes. Another requirement may be to proceed accordingly with the remaining exit nodes. According to these methods, the partial routes X ₁ would result for the route from node A to node G, X ₂ = A, J; X ₃ = A, P; X ₄ = A, T; X ₅ = G, J; X ₆ = G, P; X7 = G, T; X ₈ = J, P; X ₉ = J, T; X ₁₀ = P, T, so that the number of partial routes X ₁ to X _{10 is} the faculted number of output nodes. Here, a route as transmitted route data would only contain a partial route.

Another set of regulations for the formation of partial routes can also can be defined as follows: From an arbitrarily selected output node A turns left as long as possible to another exit node G, J, P, T analyzed; partial routes are only used for routes between exit nodes and Output node and possibly additionally between output node and Intersection node defined if based on recorded traffic data from Vehicles shows that a relevant number of vehicles are traveling this route. This means that there are only a few routes in the traffic network, each of which is only one or include several defined partial routes, so that only for these routes Transmission of the route data concerning them is optimized; since however a very large one Some of the vehicles travel at least at certain times, which is a lot include heavily trafficked partial routes, this also results in a very good one Optimization of those involved in the transmission of route data from vehicles Amount of data.

For example, a set of rules for the formation of partial routes may look as follows: the first partial route Y ₁ comprises the edges 1, 2, 3, 7, 8, 9, the partial route Y ₂ comprises the edges 15, 16, 17, the partial route Y ₃ includes the edges 10, 11, 12, 13, 14, the partial route Y ₄ includes the edges 4, 5, 6. This means that all routes that a vehicle 18 can drive from the output node A can be defined and transmitted with a very small amount of data . However, according to this set of regulations, routes between, for example, node C and node D cannot be transmitted in the form of partial routes with little redundancy, which is, however, not a problem if a few vehicles travel from C to D.

Claims (24)

Method for transmitting route data, in particular by mobile radio, between a vehicle (18) and a central office, whereby route data are transmitted with names of partial routes (W ₁ , W ₂ , W ₄ ) comprising one or more adjacent edges (1; 2, 3; 7, 8, 9), wherein at least some partial routes (W ₁ , W ₂ , W ₄ ) comprise several edges (2,3; 7,8, 9) in the digital map of the traffic route network. Method according to claim 1,
characterized,
that route data for a route traveled by the vehicle (18) with a traffic detector are transmitted from the vehicle (18) to the control center. Method according to one of the preceding claims,
characterized,
that route data for a route are transmitted from the center to the vehicle (18). Method according to one of the preceding claims,
characterized,
that the transmission of a route takes place by the transmission of designations of the partial routes forming it, the designations (W ₁ to W ₈ ) in the control center and in the vehicle (18) being the same (W ₁ to W ₇ ; W ₁ to W ₇ ) or stored in different (W ₁ to W ₈ ; X ₁ to X ₁₀ ) databases, in particular in the form of target files formed according to claim 14, with an assignment of edges (7, 8, 9 each forming a partial path (W ₄ ) ) to a partial route (W ₄ ). Method according to one of the preceding claims,
characterized,
that the transmission of a route takes place by the transmission of designations of at least the partial routes forming it, at least one set of regulations for the formation of partial routes from edges being stored in the control center and in the vehicle. Method according to claim 5,
characterized,
that several sets of regulations for the formation of partial routes are stored and that route data for a route are also used to transmit the associated set of regulations or a description of this set of regulations. Method according to one of the preceding claims,
characterized,
that a partial path is formed between a node from which at least three edges branch off and a further node from which at least three edges branch off. Method according to one of the preceding claims,
characterized,
that the road types (freeway) of the edges are taken into account when assigning edges to partial routes. A method according to claim 8,
characterized,
that a partial route is formed only from edges of the same road type, preferably only partial routes between end nodes of this road class are defined. Method according to one of the preceding claims,
characterized,
that the travel time expected for this route is transmitted from the control center to a vehicle for a route. Method according to one of the preceding claims,
characterized,
that the travel time required for the route and / or for partial routes is transmitted from the vehicle to the control center for a route covered by the vehicle. Method according to one of the preceding claims,
characterized,
that the period or time at which the route data was recorded or the period or time at which the route data was ascertained is transmitted. Method according to one of the preceding claims,
characterized,
that in the case of route data recorded by several vehicles for several routes, assigned travel times and assigned acquisition periods or acquisition times are stored in a statistics file in the central office. Method for analyzing an edge (1 to 17) and node (A to T) having traffic network, which in the form of at least information about Compound connections of edges and / or nodes together Output file is present, one representing the traffic network Destination file is generated by multiple partial routes each by summary one or more connected edges or nodes of the Output file are formed and a designation for each of these partial routes this partial route and a list of the edges and / or nodes contained therein is saved in the target file. The method of claim 14
characterized,
that the edges or nodes not contained in a partial route are also saved in the target file. Method according to claim 14 or 15
characterized,
that edges of a certain road class (highway) are analyzed separately and saved in a separate target file or target part file. Method according to one of claims 14 to 16,
characterized,
that a partial route is defined in each case between a node from which at least three edges branch off and a further node from which at least three edges branch off. Method according to one of claims 14 to 17,
characterized,
that starting from a selectable starting node (A) of the network, the partial route with the number 1 is formed by turning it and at further nodes to the left, and that further partial routes each with the next lower number are formed turning left as long as possible. Traffic recording center for recording traffic with a memory, a receiver, a program stored in memory Implementation of the method according to one of the preceding claims and a controller for processing the program. Traffic detection center according to claim 19,
characterized,
that it has a target file generated according to claim 14. Traffic detection center according to claim 19 or 20,
characterized,
that the traffic control center also has a transmitter. Terminal, in particular for a vehicle, for recording traffic, with a memory, a transmitter, a program stored in memory for Implementation of the method according to one of claims 1 to 18 and with Control for processing the program. Terminal according to claim 22,
with a receiver. Terminal according to claim 22 or 23,
with a target file generated according to claim 14.

Images