Method and system for controlling a motor vehicle

By dividing the road into sub-regions in the space-time chart, using the space-time coordinate system and traffic participants to predict the motion trajectory, the problem of difficulty in determining the driving movement of motor vehicles in real time in the existing technology is solved, and fast and accurate driving decisions are achieved and improved Real-time and efficiency of motor vehicle control system.

CN113165669BActive Publication Date: 2024-12-06ZF AUTOMOTIVE GERMANY GMBH
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN201980082775.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2018-12-17
Filing Date
2019-12-16
Publication Date
2024-12-06
Estimated Expiration
2039-12-16

AI Technical Summary

Technical Problem

The prior art is difficult to determine the various possible driving maneuver actions of motor vehicles in complex driving situations in real time, especially in the event of multiple lane changes or long-term driving, which cannot be timely analyzed and derived.

Method used

By dividing the road into different sub-regions in the space-time graph, including areas with variable lanes and immutable lanes, the space-time coordinate system is used to quickly determine the possible driving maneuvering actions of motor vehicles, considering the predicted motion trajectories of traffic participants and obstacles, and optimizing Computer programs to enable real-time decision making.

Benefits of technology

It realizes the rapid and resource-saving determination of various possible driving maneuver actions under complex driving conditions, improves the real-time and accuracy of the motor vehicle control system, and reduces the calculation time.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113165669B_ABST
    Figure CN113165669B_ABST
Patent Text Reader

Abstract

The invention relates to a method for controlling a motor vehicle (10) which is traveling in a current lane (14) of a road (12) having at least one other lane (16). First, a free area (B) is determined. f ) and / or occupied areas (B ) occupied by other road users (18, 20) b ), free area (B f ) and occupied area (B b ) is a spatiotemporal region; based on the determined idle region (B f ) and / or occupied area (B b ) to determine a lane change area where a lane change can be made between two lanes (14, 16) and / or a lane keeping area where a lane change cannot be made between two lanes (14, 16). Then, a possible driving maneuver of the motor vehicle (10) is determined at least between the lane change areas and / or lane keeping areas adjacent to each other in pairs. A motor vehicle (10) control system (26) is also disclosed.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to a method for controlling a motor vehicle, a controller for a motor vehicle control system, a motor vehicle control system, a computer program for executing the method and a computer-readable data carrier having such a computer program. Background Art

[0002] One of the main challenges for driver assistance systems which sometimes automatically control the longitudinal and lateral movements of a motor vehicle, and in particular for fully automated motor vehicles, is to analyze the specific situation of the motor vehicle and to derive corresponding meaningful driving maneuvers based thereon.

[0003] The computational complexity of driving maneuvers usually increases as some driving maneuvers continue. If various possible driving maneuvers are determined over a long period of time, such as more than 3 seconds, or if it is a complex driving maneuver with multiple lane changes, the methods known so far can no longer determine them in real time. Summary of the invention

[0004] It is therefore an object of the present invention to provide a method for controlling a motor vehicle and a motor vehicle control system in which the disadvantages of the prior art are improved.

[0005] According to the invention, this task is accomplished by a method for controlling a motor vehicle, the motor vehicle being driven in a current lane on a road, wherein the road has at least one other lane adjacent to the current lane of the motor vehicle. Firstly, free areas and / or occupied areas occupied by other traffic participants are determined at least in the current lane of the motor vehicle and in the at least one other lane, wherein the free areas and occupied areas are spatiotemporal areas. Based on the determined free areas and / or occupied areas, a lane change area in which a lane change between two lanes is possible and / or a lane keeping area in which a lane change between two lanes is not possible can be determined, wherein the lane change area and the lane keeping area are respectively a spatiotemporal sub-area of ​​the free area. Now, possible driving maneuvers of the motor vehicle are determined at least between pairs of adjacent lane change areas and / or lane keeping areas.

[0006] The method according to the invention is based on the basic idea of ​​mapping a road onto a space-time diagram and dividing the road into different sub-areas in the space-time diagram, namely into sub-areas in which lane changes are possible and sub-areas in which lane changes are not possible. Possible driving maneuvers can then be determined very quickly and resource-savingly between the individual sub-areas, since only a small part of the road needs to be taken into account at any one time, rather than the entire road traffic situation. Thus, the method according to the invention makes it possible to determine various possible driving maneuvers in real time.

[0007] In particular, the method according to the invention is a computer-implemented method which is executed on a motor vehicle controller and / or on a controller of a higher-level control system, for example at least which is assigned to the road section on which the motor vehicle is currently travelling, wherein the motor vehicle and the control system are in mutual signal transmission communication and can exchange signals with one another.

[0008] The spatiotemporal regions and the spatiotemporal subregions are here respectively described by at least one location coordinate (especially a length coordinate in the road direction) and a time coordinate. In particular, the coordinates in the road transverse direction are discrete and fixed to a certain value for each lane.

[0009] Here and below, a driving maneuver is a transfer of the motor vehicle from one space-time sub-region to another space-time sub-region at least once. Of course, the transfer can only be carried out in the positive time direction. Usually, a driving maneuver consists of a plurality of consecutive transfers between a plurality of adjacent space-time sub-regions.

[0010] In particular, the occupied area includes not only such subareas actually occupied by other road users, but also safety distances to the relevant other road users to be observed, wherein the safety distances can be set, preset and / or selected by the driver. In addition, the occupied area can also include areas that cannot be driven through due to other obstacles such as construction sites, etc.

[0011] One aspect of the present invention provides that the lane change area is a subarea of ​​a free area of ​​the current lane and at least one further lane in which both the current lane and the at least one further lane are free of other traffic participants. In particular, the free area also does not include other obstacles such as construction sites or the like that would impede driving. The lane change area is therefore a region of the current lane and the further lane in which a lane change is possible because both the current lane and the further lane are free.

[0012] According to one embodiment of the present invention, the lane keeping area is a sub-area of ​​the free area of ​​the current lane and at least one other lane, in which each other lane is occupied and / or lane change is not possible. In other words, the lane keeping area is a sub-area in which lane change is not possible because there are other traffic participants in the adjacent lane, because the adjacent lane is also congested and / or because there is a sign prohibiting overtaking or lane change on the corresponding road section.

[0013] According to another aspect of the present invention, in order to determine the lane change area, it is necessary to determine whether the lane change area located spatially between the current lane and at least another lane is occupied by other traffic participants or whether it is impossible to pass due to other reasons. The transition from one lane to another lane is carried out through the lane change area. Here, when the current lane and the other lane are both idle, the lane change area is also idle. Therefore, when one of the two lanes is occupied, the lane change area is also occupied. The lane change area takes into account the fact that motor vehicles and other traffic participants temporarily block two lanes during the lane change. The lane change area is also impassable in other situations, for example, when there is a no-overtaking or no-lane-change sign on the corresponding road section and / or when an obstacle prevents passing through the lane change area.

[0014] Preferably, at least one spacetime polygon corresponding to the current lane, at least one spacetime polygon corresponding to at least one other lane, and at least one spacetime polygon corresponding to the occupied area are determined respectively, wherein the spacetime polygons corresponding to the free area of ​​the two lanes are determined from the spacetime polygons by polygon clipping, in particular wherein the polygon corresponding to the occupied area is removed from the polygon corresponding to one of the two lanes in order to determine the free area. The determination of the free area is thus reduced to geometric operations that can be performed very quickly and resource-savingly, thereby saving computing time when determining possible driving maneuvers.

[0015] In particular, each lane and the occupied area of ​​these lanes are polygons in the (L, t) coordinate system, where L is the current longitudinal direction of the road and t is the time. Spur,i \P belegt,i The free area of ​​lane number i is obtained by symbolic representation, where P Spur,i is the space-time polygon corresponding to lane i, and where P belegt,i Include all space-time polygons that contain the occupied area in lane number i.

[0016] More preferably, an intersection of two polygons corresponding to the free areas in the two lanes is formed to determine the lane change area and the lane keeping area, in particular to determine whether the lane change area is free. In other words, the free area of ​​the lane change area is thus obtained as the intersection of the polygons corresponding to the free areas in these lanes, i.e., by calculating P frei,i ∩P frei.j The determination of the lane change zone and the lane keeping zone is thus reduced to geometric calculations that can be performed very quickly and in a resource-saving manner, thereby saving computing time when determining possible driving maneuvers.

[0017] One embodiment of the invention provides that at least the current lane and / or at least one further lane is or will be transformed into the Frenet-Serret coordinate system. In this coordinate system, every road has no turns, so that any road traffic situation can be treated in the same way regardless of the actual direction of the road. In particular, the above-mentioned space-time polygon is determined in the Frenet-Serret coordinate system.

[0018] According to another aspect of the invention, a lane vertex is respectively assigned to the lane change area and / or lane keeping area of ​​two lanes, wherein the lane vertices are connected in pairs by edges when a motor vehicle driving maneuver can be performed between the corresponding lane change area and / or lane keeping area, and in particular, the lane vertices are sorted in time. A series of driving maneuvers that can be performed one after another is obtained by interrupting the lines along the edges of the lane vertices in the ascending time direction. In this way, a graph is generated, which contains a plurality of different possible driving maneuvers, in particular all possible driving maneuvers. The generated graph can then be further processed by another module and / or subsystem of the motor vehicle, for example, by a module that determines the driving maneuver to be performed from the possible driving maneuvers.

[0019] Preferably, at least one lane changing zone vertex is assigned to the lane changing zone, in particular, the lane changing zone is divided into a plurality of time bars, each time bar being assigned at least one lane changing zone vertex, wherein, if a motor vehicle driving maneuver can be performed between a corresponding sub-area of ​​the lane changing zone and a corresponding lane changing area or lane keeping area, the at least one lane changing zone vertex is connected in pairs to the lane vertex via an edge. By interrupting lines along the edges of the lane vertices and the lane changing zone vertices in the ascending time direction, a series of driving maneuvers that can be performed one after another is obtained. In this way, a graph is generated, which contains a plurality of different possible driving maneuvers, in particular all possible driving maneuvers. The generated graph can then be further processed by another module and / or subsystem of the motor vehicle, for example by a module that determines the driving maneuver to be performed from the possible driving maneuvers.

[0020] Especially, the new time bar for the lane change zone starts from each event on one of the two lanes. Here and below, an event refers to any change in the form of one of the two lanes occupying.

[0021] Preferably, a plurality of different driving maneuvers, in particular all possible driving maneuvers, are determined for the motor vehicle. Thus, not only a single possible driving maneuver is determined, but a plurality of different driving maneuvers are determined, wherein the different driving maneuvers represent various different possibilities of how the motor vehicle can be controlled. The various different driving maneuvers can then be forwarded to another module and / or subsystem of the motor vehicle, for example to a module which selects a driving maneuver to be executed from the possible driving maneuvers.

[0022] A further aspect of the invention provides that the predicted movement trajectory of other road participants is taken into account when determining the free areas and / or occupied areas occupied by other road participants. The predicted movement trajectory can be predicted by other modules or subsystems of the motor vehicle, obtained from other road participants by means of vehicle-to-vehicle communication and / or obtained from a control system assigned to at least the road section on which the motor vehicle is currently traveling. The predicted movement trajectory also includes lane changes of other road participants in particular. The method according to the invention thus makes it possible to incorporate the driving maneuvers of other road participants into the determination of possible driving maneuvers of the motor vehicle and to control the motor vehicle in a manner adapted to the respective specific road traffic situation.

[0023] According to one embodiment of the invention, it is determined whether the motor vehicle can reach the respective spatiotemporal subregion, in particular taking into account the current speed of the motor vehicle, the maximum deceleration of the motor vehicle, the maximum acceleration of the motor vehicle and / or the speed limit. Inaccessible subregions are then no longer taken into account for controlling the motor vehicle in the following steps, thereby saving computing time when determining possible driving maneuvers.

[0024] Preferably, a motor vehicle motion trajectory corresponding to the driving maneuver is determined. Here, a motion trajectory is respectively a determined space-time curve along which the motor vehicle moves when the motion trajectory is selected and the motor vehicle is controlled accordingly. In particular, it is a motion trajectory that is optimized based on one or more conditions. For example, the distance covered should be as short as possible, the duration of the driving maneuver is minimized, and / or the longitudinal acceleration and / or the lateral acceleration that occurs should not exceed a predetermined limit acceleration.

[0025] In particular, at least one sensor detects the current lane and / or at least one other lane to determine free areas, occupied areas and / or undriveable areas. The at least one sensor generates corresponding surroundings data, which are used to generate a surroundings image, in particular in the form of a spatiotemporal diagram.

[0026] The at least one sensor may be a camera, a radar sensor, a range finding sensor, a lidar sensor and / or any other type of sensor suitable for detecting at least a portion of the motor vehicle's environment.

[0027] Alternatively or additionally, the at least one sensor can be designed as an interface to a control system which is assigned at least to the road section on which the motor vehicle is currently traveling. The control system is designed to transmit environmental data about the road and / or other traffic participants, in particular their predicted movement trajectory, to the motor vehicle and / or other traffic participants.

[0028] According to another embodiment of the present invention, at least one of the possible driving maneuvers is selected and an instruction is given to the driver based on the at least one driving maneuver. The instruction is in particular information about the selected at least one driving maneuver. For example, a plurality of possible driving maneuvers are selected and displayed at a user interface. The driver can decide which of the possible driving maneuvers should be performed and select the driving maneuver, for example, via a user interface.

[0029] Preferably, one of the possible driving maneuvers is selected and the vehicle is controlled according to the selected driving maneuver. In this case, the motor vehicle is controlled at least partially automatically, in particular fully automatically, based on the selected driving maneuver. Preferably, the selected driving maneuver is an optimal driving maneuver, which is selected from a number of possible driving maneuvers based on boundary conditions. For example, the distance covered should be as short as possible, the duration of the driving maneuver should be minimized and / or the longitudinal acceleration and / or the transverse acceleration that occurs should not exceed a predetermined limit acceleration.

[0030] Furthermore, according to the invention, this object is achieved by a control unit for a motor vehicle control system, wherein the control unit is designed to carry out one of the above-mentioned methods. With regard to the advantages, reference is made to the above description of the method.

[0031] The controller can be part of the motor vehicle or part of a superordinate system, for example a control system.

[0032] Furthermore, this object is achieved according to the invention by a motor vehicle control system having a control device as described above. With regard to the advantages, reference is made to the above description in connection with the method.

[0033] According to the invention, this object is also achieved by a computer program with a program code for executing the steps of one of the above methods when the computer program is run on a computer or a corresponding computing unit, in particular a computing unit of the above controller. With regard to the advantages, reference is made to the above description of the method.

[0034] “Program code” here and hereinafter refers to computer-executable instructions in the form of program code and / or program code modules in compiled and / or uncompiled form, which can exist in any programming language and / or machine language.

[0035] Furthermore, this task is accomplished according to the invention by a computer-readable data carrier on which the above-mentioned computer program is stored. The data carrier can be an integral component of the above-mentioned controller or can be constructed separately from the controller. The data carrier has a memory in which the computer program is stored. The memory is any suitable type of memory, for example based on magnetic data storage and / or optical data storage. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Further advantages and features of the present invention are apparent from the following description and the accompanying drawings, in which:

[0037] Figure 1 The road traffic conditions are schematically shown;

[0038] Figure 2 A schematic circuit block diagram of a motor vehicle control system according to the present invention is shown;

[0039] Figure 3 A flow chart showing the steps of the method according to the invention;

[0040] Figure 4 (a) and (b) schematically show a road before transformation into the Frenet-Serret coordinate system and a road after transformation into the Frenet-Serret coordinate system;

[0041] Figures 5 to 10 They are Figure 3 FIG. 1 is a diagrammatic representation of some steps of the method according to the invention. DETAILED DESCRIPTION

[0042] Figure 1 A road traffic situation is schematically shown, in which a motor vehicle 10 is traveling in a current lane 14 on a road 12. Next to the current lane 14 there is a further lane 16.

[0043] In addition, on the road 12 there is a first other road user 18 and a second other road user 20 in the current lane 14 or in another lane 16. In the example shown, the other road users 18, 20 are cars, but they can also be trucks, motorcycles or any other road users.

[0044] There is a lane change zone 21 between the current lane 14 and the other lane 16 , and the lane change zone 21 partially overlaps the current lane 14 and the other lane 16 .

[0045] The dashed lines 22 and 24 indicate that the first other road user 18 plans to change from the current lane 14 via the lane change zone 21 to the other lane 16 in the near future, or that the second other road user 20 plans to change from the other lane 16 via the lane change zone to the current lane 14 of the motor vehicle 10 in the near future. The other road users 18, 20 indicate such a lane change, for example, by using corresponding direction indicators.

[0046] exist Figure 1 Also shown is a coordinate system comprising a longitudinal axis defining the longitudinal direction L and a normal axis defining the transverse direction N. The origin of the coordinate system is located in the longitudinal direction L at the current position of the head of the motor vehicle 10 and, viewed in the longitudinal direction L, at the right road edge.

[0047] The specific coordinate system also used below is a coordinate system fixed to the road, which therefore does not move with the mobile vehicle 10. However, any other coordinate system can naturally be used. Figure 2 As shown, the motor vehicle 10 has a control system 26 of the motor vehicle 10 . The control system 26 includes a plurality of sensors 28 and at least one controller 30 .

[0048] Sensors 28 are arranged at the front, rear and / or sides of motor vehicle 10 and are designed to measure the environment of motor vehicle 10, generate corresponding environment data and forward them to control unit 30. Specifically, sensors 28 measure information at least about current lane 14, other lane 16 and other road users 18, 20.

[0049] Sensors 28 are each a camera, a radar sensor, a range sensor, a lidar sensor, and / or any other type of sensor suitable for measuring the environment of motor vehicle 10 .

[0050] Alternatively or additionally, at least one of the sensors 28 can be designed as an interface to a control system, which is assigned at least to the shown section of the road 12 and is designed to transmit environmental data about the road 12 and / or other road users to the motor vehicle 10 and / or other road users 18, 20. In this case, one sensor 28 can be designed as a mobile radio communication module, for example for communication according to the 5G standard.

[0051] In summary, the controller 30 processes the environmental data obtained by the sensor 28 and controls the motor vehicle 10 at least partially automatically, in particular fully automatically, based on the processed environmental data. Thus, a driver assistance system is implemented on the controller 30, which can control the lateral movement and / or longitudinal movement of the motor vehicle 10 at least partially automatically, in particular fully automatically.

[0052] To this end, the controller 30 is designed to perform the following combined Figures 4 to 10 Specifically, the controller 30 includes a data carrier 32 and a computing unit 34 , wherein a computer program is stored on the data carrier 32 , which runs on the computing unit 34 and contains program codes for executing the steps of the method described below.

[0053] Firstly, an image of road 12 , more specifically of current lane 14 and further lane 16 , based on surrounding data acquired by sensor 28 , is transformed into a Frenet-Serret coordinate system (step S1 ).

[0054] Step S1 Figure 4 is shown in . Figure 4 (a) in FIG. 1 shows the road 12 as it actually runs. In the example shown, the road turns left when viewed in the longitudinal direction L. By means of a local coordinate transformation, the road 12 is transformed into the Frenet-Serret coordinate system, in which the road 12 no longer turns, wherein: Figure 4 (b) in FIG. 1 shows the transformation result. As can be clearly seen, the direction of the road 12 in this coordinate system is straight along the longitudinal direction L without any bend.

[0055] Next, determine the free area B between the current lane 14 and another lane 16 f and occupied area B b (Step S2), where the free area B f and occupied area B b They are respectively space-time regions.

[0056] Here, the free area B f These are the spatial and temporal regions which are free of other road users 18 , 20 and other obstacles that would prevent driving into the respective lane 14 , 16 .

[0057] And occupied area B b is a space-time region that is occupied by other road users 18, 20 and / or other obstacles, such that the occupied region B b The motor vehicle 10 cannot pass through. In particular, the occupied area B b This includes not only the current occupied area, but also the safety distance to be observed, which can be set, preset or selectable by the driver.

[0058] In order to determine the occupied area, the controller 30 needs the predicted movement trajectory 22, 24 of the other traffic participants 18, 20. The controller 30 can determine the movement trajectory 22, 24 itself, for example based on environmental data obtained by the sensor 28, such as information that the direction indicator of the other traffic participants 18, 20 is activated, or based on data exchanged by means of in-vehicle communication. Alternatively, the controller 30 can obtain the movement trajectory 22, 24 directly from the other traffic participants 18, 20 or the control system.

[0059] As in Figure 5 Based on Figure 1 As shown in the specific example, first, the free area B is determined for the current lane 14 and the other lane 16 respectively. f and occupied area B b , and more precisely, are respectively determined in a tL diagram, where t is the time.

[0060] In this example, the first other road user 18 starts a lane change maneuver from the current lane 14 to the other lane 16 at the time t=1 s, and the lane change maneuver ends at the time t=5 s. Figure 5 In the illustrated figure, the first other road user 18 always occupies two occupancy areas B b During the lane change process, the first other road user 18 at least temporarily occupies both lanes 14 , 16 .

[0061] The second other traffic participant 20 starts a lane change maneuver from the other lane 16 to the current lane 14 at time t=3s, and the lane change maneuver ends at time t=7s. Figure 5 In the figure shown, the second other road user 20 occupies two occupancy areas B respectively. b The lower side occupies the area in.

[0062] Occupancy area B b The slope of corresponds to the speed of the respective other road user 18 or 20. Figures 5 to 10 In the example shown, the speed of the other road users 18 , 20 is therefore constant.

[0063] For the sake of simplicity, the coordinate is here discrete in the transverse direction N, so that it can only take three different values ​​corresponding to the current lane 14, the other lane 16 or the lane change zone 21. Figure 5 The three diagrams shown are therefore tL diagrams for the current lane 14, for the other lane 16 and for the lane change zone 21. The shaded areas in the diagrams correspond to the occupied areas B of the respective lanes 14, 16. b The unshaded area in the figure corresponds to the free area B of each lane 14 and 16. f .

[0064] In order to determine the free area B f First, a space-time polygon P is determined for each lane 14, 16 14 or P 16 , which corresponds to the entire lane 14 or 16 in front of the motor vehicle 10, in particular the part of the lane 14, 16 that is located in the range of action of the sensor 28. Figure 5 In the polygon P 14 and P 16 It is the quadrilateral shown by the dotted line.

[0065] Furthermore, the space-time polygon P is determined for each of the two lanes 14 and 16. 14,b and P 16,b , which surrounds the occupied area B of each lane 14, 16 b .

[0066] Free space B in current lane 14 f Or more precisely, corresponding to the free area B f The polygon P 14 So we will use polygon clipping to determine the method, which is to cut the polygon P 14,b From the polygon P 14 In other words, it is therefore the operation

[0067] P 14,f =P 14 \P 14,b .

[0068] Similarly, the free area B on the other lane 16 f It is also determined by polygon clipping, where the polygon P 16,b From the polygon P 16 is removed. Therefore, the operation P is performed 16,f =P 16 \P 16,b .

[0069] Next, if Figure 6 As shown, determine the free sub-area of ​​the lane change zone 21 (step S3). Here, the lane change zone 21 is just free when both the current lane 14 and the other lane 16 are free and the lane change zone 21 cannot be passed due to other reasons, such as obstacles or prohibition of overtaking.

[0070] Therefore, the free sub-region of the lane change area 21 or more precisely the polygon P corresponding to the free sub-region of the lane change area 21 21,f Determined as two polygons P 14,f and P 16,fIf the lane change zone 21 cannot be driven through due to obstacles or other reasons, a corresponding space-time polygon P surrounding the non-drivable sub-region of the lane change zone 21 is determined. h , and remove it from the above intersection.

[0071] In other words, the free sub-area P of the lane change area 21 21,f Therefore, the following calculation is obtained

[0072] P 21,f =(P 14,f ∩P 16,f )\P h .

[0073] The diagram for the current lane 14 and for the further lane 16 is now divided into a plurality of time strips (step S4), wherein a new time strip is started from each event. Figure 7 In the figure, different time bars are separated from each other by vertical dividing lines E, which are respectively added to the figure when an event occurs. Here and below, an event refers to any form of change in the occupation of each lane 14, 16.

[0074] Therefore, if the occupation of any subarea of ​​the current lane 14 or of the further lane 16 begins or ends at a certain time, a new time bar for the current lane 14 or the further lane 16 begins at this time in the diagram.

[0075] The dividing lines between the time bars in the diagram for the two lanes 14 and 16 are also transferred to the diagram for the lane change zone 21 .

[0076] In order to obtain a constant division of the images between the three images for the current lane 14, the other lane 16 and the lane change zone 21, an oblique dividing line T is added to the images for the current lane 14 and the other lane 16, which respectively represents one of the occupied areas B. b extension. Figures 8 to 10 An additional oblique dividing line T is shown.

[0077] Vertical dividing line E, diagonal dividing line T and occupied area B b Divide each of the three graphs into several sub-regions T i , where i is a natural number greater than zero, which can be from sub-region 1 to sub-region T i The total value. Figure 8 As shown, next, for each sub-area T of the current lane 14 and another lane 16, i Assign a lane vertex V to each i , and each sub-region T of the graph i A lane change zone vertex W is assigned to each lane change zone 21.i (Step S5). Here, i is a natural number greater than zero, and it can be from sub-region 1 to sub-region T. i The value of the total.

[0078] exist Figure 8 In the middle, the lane vertex V i and the vertex W of the lane change area i are respectively sorted in time in the figure, that is, corresponding to the sub-regions T with shorter time i than those vertices that are assigned to the subregion T with a longer time i The vertex is further to the left.

[0079] Next, when you can assign a lane vertex V i Sub-region T i When a driving maneuver of the motor vehicle 10 is performed between i The edges (more precisely, directed edges) are connected in pairs (step S6 ).

[0080] Here, if the two sub-areas T i Close to each other, i.e. unoccupied area B b If the time is not equal to the time in which the t is to be determined, the driving maneuver is defined as "feasible". Furthermore, it is natural that a driving maneuver can always only be performed in the positive time direction.

[0081] For the lane vertex V of the other lane 16 i and the lane change area vertex W of the lane change area 21 i Repeat the same process.

[0082] It should be pointed out that in Fig. 9 and Fig.10 For the sake of clarity, the letters "T", "V" and "W" have been omitted. Instead, the sub-regions and vertices are simply numbered accordingly. Fig. 9 and Fig.10 In the figure, the numbers are not reference numerals but indicate the index of the corresponding sub-region or the corresponding vertex.

[0083] Fig. 9 The result of step S6 is shown. The map obtained in step S6 already contains all possible driving maneuvers for motor vehicle 10 in both lanes 14 , 16 and in lane change zone 21 .

[0084] Next, the following lane vertex V of the current lane 14 i With the following lane change area vertex W i Connected by directional edges, that is, the sub-areas T of the current lane 14 or lane change zone 21 corresponding thereto ioverlap each other (step S7). In other words, the lane vertex V i With the following lane change vertex W i connected, that is, its corresponding sub-region T i The intersection is non-empty when the two maps for the current lane 14 and the lane change zone 21 overlap.

[0085] In addition, the vertex W of the lane change area i The lane vertex V of the other lane 16 is as follows i Connected by directional edges, that is, the corresponding lane change zone 21 or the sub-area T of another lane 16 i Therefore, the following lane vertex V i With the following lane change area vertex W i connected, that is, its corresponding sub-region T i The existing intersection is non-empty when the two graphs for the further lane 16 and for the lane change zone 21 overlap.

[0086] In other words, in step S7, the free area B f Some sub-regions of i A distinction is made between a lane change zone, in which a lane change between the two lanes 14 , 16 is possible, and a lane keeping zone, in which a lane change between the two lanes 14 , 16 is not possible.

[0087] Fig.10 The result of step S7 is shown. The map obtained in step S7 includes all possible driving maneuvers for the motor vehicle 10, including a change from the current lane 14 to another lane 16. Each of the possible driving maneuvers corresponds here to Fig.10 An unbroken line of edges in the graph shown.

[0088] The various possible driving maneuvers thus determined are then processed further by another module of control unit 30 or another module of the computer program.

[0089] The further module selects at least one executable driving maneuver from among the various possible driving maneuvers (step S8 ).

[0090] For this purpose, the further module determines whether the motor vehicle 10 can reach the respective spatiotemporal sub-area T at all. i , wherein the current speed of the motor vehicle 10 , the maximum deceleration of the motor vehicle 10 , the maximum acceleration of the motor vehicle 10 and / or possibly the speed limit on the road 12 are taken into account. i is selected by the other module and is therefore no longer considered.

[0091] Next, another module calculates the motion trajectory of the motor vehicle 10, which corresponds to the at least one driving maneuver (step S9). If there are many driving maneuvers to choose from, a corresponding motion trajectory is determined for each of the driving maneuvers.

[0092] Various filters and / or conditions may also be used on or applied to the motion trajectory in order to determine the motion trajectory that should ultimately be considered by controller 30 for controlling motor vehicle 10 .

[0093] For example, the movement trajectory to be executed must be conflict-free and, if necessary, should not require any longitudinal acceleration and / or transverse acceleration of motor vehicle 10 that is greater than a predefined limit acceleration.

[0094] Finally, one of the possible movement trajectories is selected and the motor vehicle 10 is at least partially automatically controlled, in particular fully automatically controlled, by the controller 30 in accordance with the selected driving maneuver (step S10 ).

[0095] Alternatively or additionally, information about the driving maneuver can be displayed based on the selected driving maneuver to the driver of the motor vehicle 10. In particular, a plurality of possible driving maneuvers can be selected and the driver can decide which of the possible driving maneuvers should be performed.

Claims

1. A method of controlling a motor vehicle (10) travelling in a current lane (14) on a road (12), wherein: The road (12) has at least one further lane (16) adjacent to the current lane (14) of the motor vehicle (10), the method comprising the following steps: - determining a free area (B) in at least the current lane (14) of the motor vehicle (10) and in the at least one further lane (16); f ) and / or occupied areas (B ) occupied by other road users (18, 20) b ), wherein the idle area (B f ) and the occupied area (B b ) is the space-time region; - Based on the determined free area (B f ) and / or occupied area (B b ) determines a lane change area where lane change can be performed between the two lanes (14, 16) and / or a lane keeping area where lane change cannot be performed between the two lanes (14, 16), wherein the lane change area and the lane keeping area are respectively the idle area (B f ) a space-time sub-region ( T i );as well as - determining a driving maneuver of the motor vehicle (10) at least between lane change zones and / or lane keeping zones adjoining one another in pairs, wherein at least one space-time polygon corresponding to the current lane (14), at least one space-time polygon corresponding to the at least one other lane (16), and at least one space-time polygon corresponding to the occupied area (B b ), wherein the free area corresponding to the two lanes is determined from the determined space-time polygon by means of a polygon clipping method (B f ), wherein the space-time polygon corresponding to the occupied area is removed from the space-time polygon corresponding to the current lane (14) or the at least another lane (16) to determine the free area (B f ), and wherein a free area (B) is formed corresponding to the current lane (14) and the at least one other lane (16). f ) to determine the lane changing area and the lane keeping area.

2. The method according to claim 1, characterized in that The lane change area is the free area (B) of the current lane (14) and the at least one other lane (16). f ) of the following sub-regions ( T i ), in which subarea neither the current lane (14) nor the at least one further lane (16) has any other road users (18, 20).

3. The method according to claim 1 or 2, characterized in that The lane keeping area is the idle area (B) of the current lane (14) and the at least one other lane (16). f ) of the following sub-regions ( T i ), in which the other of the two lanes (14, 16) is occupied and / or lane change is not possible for other reasons.

4. The method according to claim 1, characterized in that To determine the lane change area, it is determined whether a lane change zone (21) located spatially between the current lane (14) and the at least one further lane (16) is free, occupied by another road user (18, 20) or impassable for other reasons.

5. The method according to claim 1, characterized in that At least the current lane (14) and / or the at least one further lane (16) are transformed into a Frenet-Serret coordinate system.

6. The method according to claim 4, characterized in that The lane change area and / or the lane keeping area of ​​the two lanes are respectively assigned a lane vertex ( V i ), where the lane vertex ( V i ) are connected in pairs by edges when a driving maneuver of the motor vehicle (10) can be realized between corresponding lane change areas and / or lane keeping areas, wherein the lane vertices ( V i ) are sorted by time.

7. The method according to claim 6, characterized in that The lane change area (21) is assigned at least one lane change area vertex ( W i ), wherein the lane change area (21) is divided into a plurality of time bars, each time bar being assigned at least one lane change area vertex ( W i ), wherein if in the corresponding sub-area ( T i ) and the corresponding lane change area or lane keeping area to achieve the driving maneuver of the motor vehicle (10), then at least one lane change area vertex ( W i ) and the lane vertex ( V i ) are connected in pairs by edges.

8. The method according to claim 1, characterized in that A plurality of driving maneuvers of the motor vehicle (10) that are different from one another are determined.

9. The method according to claim 1, characterized in that In determining the idle area (B f ) and / or occupied areas occupied by other traffic participants (B b ) when considering the predicted movement trajectories of the other traffic participants (18, 20).

10. The method according to claim 1, characterized in that Determine whether the motor vehicle (10) can reach each time-space sub-area ( T i ), wherein the current speed of the motor vehicle (10), the maximum deceleration of the motor vehicle (10), the maximum acceleration of the motor vehicle (10) and / or the speed limit are taken into account.

11. The method according to claim 1, characterized in that: A motion trajectory of the motor vehicle (10) corresponding to the driving maneuver is determined.

12. The method according to claim 1, characterized in that At least one sensor (28) detects the current lane (14) and / or the at least one other lane (16) to determine the free area (B f ), the occupied area (B b ) and / or impassability.

13. The method according to claim 1, characterized in that At least one driving maneuver of the possible driving maneuvers is selected and an instruction is issued to the driver based on the at least one driving maneuver.

14. The method according to claim 1, characterized in that A driving maneuver of possible driving maneuvers is selected and the motor vehicle (10) is controlled according to the selected driving maneuver.

15. The method according to claim 4, characterized in that The free area (B) corresponding to the two lanes (14, 16) is formed. f ) to determine whether the lane changing area (21) is idle.

16. A controller (30) for a control system (26) of a motor vehicle (10), wherein: The controller (30) is designed to perform the method according to any one of claims 1 to 15.

17. A control system (26) for a motor vehicle (10) having a controller (30) according to claim 16.

18. A computer-readable data carrier (32) storing a computer program, which, when executed on a computer or a corresponding computing unit, executes the method according to any one of claims 1 to 15.

Citation Information

Patent Citations

  • Road alignment quality assessment method in three-dimensional space

    CN106446335A

  • Vehicle and lane detection method and system used thereby

    CN107909047A

  • Vehicle driving assist system

    JP2016149100A

  • Vehicle control device and vehicle control method

    JP2017154554A

  • Travel control device

    JP2018149915A