Determining absence of risk of collision between vehicles at intersection
By using the intersection diagram provided by the roadside unit in the vehicle telematics system, combining arcs and nodes to represent the lane, calculating whether the vehicle path is in the lane, the problem of false detection risks in the prior art is solved and the collision between vehicles is improved Accuracy of detection.
Patent Information
- Application Number
- CN202410632740.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2023-05-23
- Filing Date
- 2024-05-21
- Publication Date
- 2024-11-26
AI Technical Summary
When existing vehicle telematics systems detect collision risks between vehicles, false detection is prone to false detection, especially when structures such as bridges or tunnels exist, resulting in actual collisions but detection risks.
By setting up roadside units at intersections, a diagram representing the intersection is provided, the vehicle exchanges information with the roadside units, determines the collision risk between vehicles based on the diagram, uses arcs and nodes to represent lanes, and calculates the elliptical equation to check whether the vehicle path is in lanes. Inside, determine whether there is a collision risk.
Effectively eliminate the collision risk of false detection, improve the accuracy of collision detection between vehicles, and avoid false alarms caused by road height changes.
Smart Images

Figure CN119028173A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to a method implemented by a telematics system in a vehicle and a telematics system for a vehicle. Background Art
[0002] Currently existing vehicles are equipped with telematics systems that allow vehicles to exchange information with each other and with other roadside equipment. For example, these telematics systems may use V2X (“Vehicle-to-Everything”) communication technology, which allows vehicles to exchange information with any other system that uses this technology. For example, a V2X telematics system may exchange information with another vehicle’s telematics system, roadside equipment (such as traffic lights or systems with integrated cameras), or a passerby’s smartphone.
[0003] The information exchanged in particular allows the detection of a risk of collision between two vehicles. For example, two vehicles can exchange position information and, by calculating the trajectories of the vehicles, the telematics system can detect a risk of collision between the vehicles when the trajectories of the vehicles cross.
[0004] However, the detected collision risk may be false. In reality, the trajectories calculated for two vehicles may cross when they are travelling on corresponding lanes that do not cross. This situation is particularly noticeable in the presence of bridges or tunnels. In fact, in the presence of such a structure, the trajectories of vehicles that arrive at the structure at the same time but pass one above the other may cross when calculated by projection onto the same 2D plane, while in reality the two vehicles do not cross. Thus, changes in the road height can lead to false detections of collisions between vehicles. This situation is particularly noticeable at intersections, for example, when a bridge or a tunnel appears near the intersection.
[0005] Therefore, there is a need for improved collision detection between vehicles. Summary of the invention
[0006] To this end, a method implemented by a telematics system in a vehicle is proposed. The vehicle is traveling on a lane leading to an intersection. The intersection includes a roadside unit. The roadside unit includes a memory storing a graph representing the intersection. The graph includes arcs connected to a central node. Each arc represents a lane of traffic leading to the intersection. The method includes providing a detection of a collision risk at the intersection between the vehicle and another vehicle. The method includes the roadside unit sending the stored graph to the vehicle. The method includes determining that there is no collision risk between the vehicle and the other vehicle based on the graph.
[0007] Each arc may connect a central node to a corresponding node representing a position on a lane represented by an arc upstream of the intersection. Determining that there is no risk of collision may include another vehicle transmitting a position and path history of the other vehicle. Determining that there is no risk of collision may include checking that the other vehicle is not on a lane represented by an arc connected to the central node based on the transmitted position and path history.
[0008] For each respective node, the checking may include calculating an equation of an ellipse having as its major arc the segment defined between the central node and the respective node, and checking based on the calculated equation that the sent position and path history are not within the ellipse.
[0009] The path history may include a set of consecutive positions occupied by another vehicle during a previous period of time.
[0010] Roadside units can be integrated into intersection traffic lights.
[0011] Providing the detection of the risk of collision may include providing, for each vehicle, a vehicle path projected in a 2D plane. Providing the detection of the risk of collision may include determining an encounter point between a vehicle path and another vehicle path on the 2D plane.
[0012] Providing the path may include, for at least one vehicle, calculating the path of the vehicle based on a speed, acceleration, yaw rate, turning angle and / or size of the vehicle, preferably without using a height of the vehicle.
[0013] A computer program for a vehicle telematics system is also proposed. The computer program comprises instructions which, when executed by a processor, cause the processor to implement the method.
[0014] A computer-readable storage medium storing a computer program is also proposed.
[0015] A telematics system for a vehicle is also provided. The telematics system includes a storage medium. The system is configured to execute the method. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] Non-limiting examples will be described with reference to the following drawings:
[0017] Figure 1 A flowchart showing an example of implementing the method is shown;
[0018] Figure 2 and Figure 3 An example is shown in which it is determined that there is no risk of collision between the vehicle and another vehicle. DETAILED DESCRIPTION
[0019] refer to Figure 1, a method implemented by a telematics system in a vehicle is proposed. The vehicle is traveling on a lane leading to an intersection. The intersection includes a roadside unit. The roadside unit includes a memory storing a graph representing the intersection. The graph includes arcs connected to a central node. Each arc represents a lane leading to the intersection. The method includes providing S10 detection of a collision risk at an intersection between the vehicle and another vehicle. The method includes the roadside unit sending S20 the stored graph to the vehicle. The method includes determining S30 based on the graph that there is no collision risk between the vehicle and the other vehicle.
[0020] This method provides an improved solution for detecting collisions between vehicles.
[0021] In practice, the method allows the elimination of false detections of collision risks, that is, of erroneously detected collision risks. It is noteworthy that the method uses a graph representing the intersection in order to infer from it whether the collision risk is real or not, taking into account the traffic lanes in which the vehicle is travelling and any intersections present at the intersection. The graph is used to infer that the risk is not real when the other vehicle is not travelling on an arc connected to the central node. Therefore, in the presence of a structure that allows the passage of several vehicles at the same time (such as a bridge), the method will allow the elimination of collision risks detected between vehicles for vehicles arriving in different lanes on the structure. The method uses the graph to eliminate the collision risk each time the lanes in which the vehicles are travelling do not cross.
[0022] The vehicle comprising the telematics system executing the method may be an "EGO" vehicle, i.e. a vehicle whose behavior is to be monitored in terms of interaction with another vehicle involved in the situation. The vehicle may be any type of vehicle (e.g. a car, truck or motorcycle) configured to include such a telematics system. The other vehicle in the method may be a "remote" vehicle, i.e. another vehicle that is in the vicinity of the "EGO" vehicle at a given moment.
[0023] The method can be executed when the vehicle is traveling. When the vehicle is traveling, the method can repeat steps S10 to S30. For example, whenever a new vehicle is on a path that meets the path of the vehicle (at the same intersection), steps S10 to S30 can be repeated. Then, steps S10 to S30 are repeated for the new vehicle. In this case, for each repetition, the collision risk detected is the collision risk at the intersection with the newly encountered vehicle. Alternatively or in addition, whenever the vehicle arrives at a new intersection equipped with a roadside unit (and another vehicle is on a path that meets the vehicle at the new intersection), steps S10 to S30 can be repeated. In this case, for each repetition, the collision risk detected is the collision risk at the new intersection with another vehicle encountered at the new intersection. The details provided below apply to each repetition of steps S10 to S30 for each new vehicle encountered at each new intersection.
[0024] The step S10 of providing collision risk detection may include a step S11 of providing a vehicle path for each vehicle projected into a 2D plane. The vehicle's path may represent a simulation of the movement that the vehicle will follow on a 2D plane, taking into account the vehicle's current situation (e.g., taking into account the vehicle's position, speed, and / or steering wheel angle). The 2D plane may represent the space around the collision. For example, the 2D plane may be a map representing a projection of lanes around the collision on a 2D plane.
[0025] The path of each vehicle may represent the movement of the vehicle within a predetermined upcoming duration (e.g., a duration less than 10 minutes and / or greater than 10 seconds, such as a duration of about 1 minute). The method may calculate the length of the path and its orientation at regular time intervals. For example, the method may include repeatedly calculating the path (e.g., the length and orientation of the path) of each vehicle (e.g., every 100 milliseconds). For each repetition, the method may determine whether there is an encounter point between the new paths calculated for the two vehicles. For one of these repetitions, the method may determine that there is an encounter point between the path of the vehicle and the path of the other vehicle (determination of step S12). Therefore, for each vehicle, the path provided in step S10 is the path calculated for the vehicle when the repetition of the encounter has been determined. The method may calculate the path of the "EGO" vehicle based on the same parameters as the path of the other vehicle (vehicle speed, acceleration, yaw rate, steering angle and / or size). The path may represent the movement of the vehicle over a predetermined length (e.g., a length less than 10 kilometers and / or greater than 100 meters, such as a length of about 300 meters). The length of the path may depend on the parameters used for its calculation (e.g., the length may increase proportionally with the speed).
[0026] The path may represent the spatial motion of the vehicle. For example, the path may represent the motion of the vehicle on a 2D plane over a predetermined duration. Alternatively, the path may represent the spatial and temporal motion of the vehicle. In this case, the path may also represent the evolution of the vehicle's motion over time.
[0027] For example, each path may comprise a line on a 2D plane indicating the evolution of the center of mass (e.g., center of gravity) of the vehicle. Alternatively, each path may indicate the motion of a trajectory of the vehicle in a 2D plane. In this case, the path may comprise a set of points, each representing the space occupied by the vehicle on the ground at a given moment. For example, a path may comprise a dashed line with a thickness indicating the motion of the entire vehicle (i.e., taking into account its width), or two lines starting at either end of the front of the vehicle.
[0028] Alternatively, the path of the other vehicle may be calculated. For example, providing step S11 may include calculating the path of the other vehicle based on one or more parameters of the other vehicle. For example, the calculation of the path may be a function of the speed, acceleration, yaw rate, steering angle and / or size of the other vehicle. Preferably, the calculation of the path may not use the height of the other vehicle. For example, the calculated path may be in a 2D plane, that is, it may represent the evolution of the trajectory of the other vehicle in the 2D plane. The parameters may be sent by another vehicle. In this case, providing step S11 may include that, before the calculation, the telematics system receives these parameters and may calculate the received parameters. For example, during a V2X exchange, the parameters may be sent by another vehicle. These parameters may be sent and received using V2X communication technology. For example, another vehicle may also include a telematics system, and the telematics systems of the two vehicles may be configured to periodically exchange the values of these parameters with each other (e.g., every 100 milliseconds) when they are at a certain distance from each other (e.g., a distance less than or equal to 1 kilometer, such as less than or equal to 600 meters or 300 meters). The values of these parameters used to calculate the path of the other vehicle may be values sent by the other vehicle during one of these V2X exchanges.
[0029] As for the other vehicle, the path of the vehicle equipped with the system implementing the method may be provided directly by the vehicle (for example by another system of the vehicle) or may even be calculated by the telematics system. For example, the calculation of the path may be based on the same parameters as for the other vehicle (vehicle's speed, acceleration, yaw rate, steering angle and / or dimensions). For example, the dimensions of the vehicle may have been measured on the vehicle before the method was performed. Other parameters (such as speed, acceleration, yaw rate, steering angle and position) may be provided by other computers (such as speed sensors or GPS).
[0030] Providing step S10 may then include determining an intersection point between the path of the vehicle and the path of the other vehicle on a 2D plane. For example, the determination may include inferring the intersection point when the intersection point of the path of the vehicle and the path of the other vehicle is non-zero. In this case, the determination may include calculating the intersection point of the two paths. Determining a location (the location of the intersection point) from which a collision risk can be inferred. When the path is a straight line, the intersection point may be an intersection point between the straight lines. When the path is a dashed line, the intersection point may be a surface (the intersection area of the two dashed lines).
[0031] Determining the meeting point can take into account only the spatial movement of the two vehicles. In this case, each path can only represent the spatial movement of the vehicles. The calculation of the paths (and the calculation of the collision point, which is the meeting point of the calculated paths) takes into account several dynamic parameters (speed, acceleration), which make the evolution in space and time known. Therefore, the evolution over time is calculated every 100 milliseconds.
[0032] The collision risk detection provided is at an intersection. This means that the collision is detected near the intersection. In other words, the meeting point between the paths of the two vehicles is located near the intersection. For example, the collision is located within a specific perimeter around the center of the intersection, such as a circular perimeter around the intersection (e.g., with a diameter less than or equal to 500 meters, such as less than or equal to 300 meters). For example, the collision can be located at a distance less than or equal to the arc distance, that is, the collision can be the same or closer to the center of the intersection than the points on the lanes indicated by the corresponding nodes of the arcs representing them.
[0033] The graph may represent all lanes leading to an intersection. For each lane at an intersection, the graph may include a corresponding arc connected to a central node (indicating the center of the intersection). The central node may represent the center of the intersection. Each arc in the graph may connect the central node to a corresponding node representing a position on the lane represented by the arc. Each arc may include a first end connected to the central node and a second end connected to a corresponding node. The corresponding node may indicate the position of the center of the lane represented by the arc. The position indicated by the corresponding node may be upstream of the intersection. For example, for each arc, the corresponding node may indicate a position less than or equal to 500 meters from the center of the intersection (e.g., a distance less than or equal to 300 meters from the intersection).
[0034] This map may correspond to a portion of the overall map itself representing all lanes of the area the vehicle is currently traveling in. For example, the overall map may represent all lanes of a region or country through which the vehicle is traveling.
[0035] Each arc in the graph may be oriented. The orientation of the arc may represent the direction of travel of a vehicle in the lane represented by the arc. Each arc of the graph may be oriented toward a central node (the lanes represented by the graph may always be oriented toward a traffic light). Each lane may correspond to a section of road on which a vehicle may travel. In the case where a road includes multiple lanes in the same direction, the graph may include a corresponding arc for each lane of the road. Alternatively, the same arc may represent multiple lanes in the same direction. In this case, for each arc, the graph may include a variable representing the number of lanes on the road.
[0036] The map may be sent before the vehicle arrives at the intersection. For example, the roadside unit may continuously send the map stored in its memory to each vehicle that arrives at the intersection. For example, the roadside unit may send the map when the vehicle is less than or equal to 1 kilometer from the intersection and / or greater than or equal to 150 meters from the intersection (e.g., approximately 300 meters from the intersection). The map may have been pre-stored in the memory before the method is performed. For example, the map may be stored just before the method is performed. In this case, the map may have been downloaded by the roadside unit (e.g., from a remote server) and then stored in its memory. Alternatively, the map may have been stored in the memory of the roadside unit memory long before the vehicle arrives (e.g., when the vehicle is being built).
[0037] The map may be determined taking into account the current configuration of lanes at the intersection. If the configuration of lanes at the intersection changes, the map may be updated to take into account the change in the intersection configuration (eg, adding lanes and / or removing lanes).
[0038] After the map has been sent S20, the method comprises determining S30 based on the map that there is no risk of collision between the vehicle and another vehicle. The determining step S30 is based on the sent map, ie inferring from reading the map that there is no risk of collision.
[0039] In some examples, determining step S30 may include checking that there is no lane at the intersection on one side of the vehicle (left-hand side or right-hand side) where another vehicle is arriving. For example, determining step S30 may include determining the side of the vehicle (left-hand side or right-hand side) where another vehicle is arriving (e.g., based on the trajectories of the two vehicles, and / or the other vehicle sending its position and its path history, for example, via V2X exchange), and then checking that there are no arcs at the intersection on that side. For example, the check may include identifying all arcs that arrive at the intersection (e.g., except for the arcs traveled by the vehicle). For example, the check may include identifying one or more arcs that arrive at the intersection (except for the arcs traveled by the vehicle). Next, the check may include checking that no arcs are located on the side of the other vehicle.
[0040] Checking that no arc is located to the side of another vehicle may be based on the position of the corresponding node of each arc. For example, the check may include calculating the position of the corresponding node of each arc, and then checking that the calculated position of each corresponding node is not to the side of another vehicle. For example, the check may include, for each arc of the intersection, calculating the Cartesian position of the corresponding node of the arc relative to the vehicle, and then checking that the calculated Cartesian position is not to the side of another vehicle.
[0041] In some examples, the determining step S30 may include the other vehicle sending S31 the position and path history of the other vehicle, followed by a step S32 of checking that the other vehicle is not traveling on a lane represented by an arc connected to the central node. These steps S31 and S32 may be performed after checking that no arc is located to the side of the other vehicle (e.g. when this check fails).
[0042] The step S31 of sending the position and path history of the other vehicle may be performed when there is a V2X exchange between the two vehicles. For example, the V2X exchange may be performed before the detection risk is detected (e.g., while providing the parameter values of the other vehicle used to calculate the route, i.e., during the same exchange). Alternatively, the sending step S31 may be performed immediately after the risk is detected. For example, the other vehicle may be configured to continuously send its position and path history to the vehicle (e.g., through continuous V2X exchanges).
[0043] The transmitted path history may include a set of consecutive positions occupied by the other vehicle in a previous period. The set of consecutive positions may have been stored by the other vehicle. For example, the other vehicle may be configured to periodically store its position in a memory and transmit the stored position to other vehicles (e.g., during a V2X exchange with these other vehicles). The number of consecutive positions transmitted may be less than or equal to 10 and / or greater than or equal to 2. For example, the number of consecutive positions may be greater than or equal to 3.
[0044] After the position and path history have been sent S31, the determination step S30 may include a step S32 of checking that another vehicle is not traveling on a lane represented by an arc connected to the central node based on the sent position and path history. The checking step S32 may include checking for each arc connected to the central node (e.g. except the arc on which the vehicle is traveling) that another vehicle is not present near the lane. For example, the checking may include determining a perimeter around the lane and then checking that the other vehicle is not within the perimeter. The absence of another vehicle may be checked based on the position sent by the other vehicle and its path history.
[0045] The step S32 of checking that another vehicle is not traveling in the lane represented by the arc will now be discussed generally. When there is only one arc connected to the central node (other than the central node in which the vehicle is traveling), the determining step may perform this check only once for the single arc. In the case where multiple arcs are connected to the central node (other than the one in which the vehicle is traveling), the method may repeat this check for each of these arcs. In some examples, the method may only perform this check on arcs located to the side of another vehicle. For example, when at least one arc is not located to the side of another vehicle, the method may not perform the check on the at least one arc.
[0046] In some examples, the monitoring step S32 may include checking that another vehicle is not located in a given perimeter around a lane represented by an arc (e.g., an ellipse around the arc). For example, the checking step S32 may include a step S33 of calculating an equation of an ellipse having a segment defined between a center node and a corresponding node as its long arc. For example, the calculation may include calculating the positions of nodes located at the ends of the arc (the center node of the arc and the corresponding node). The calculation may then include determining the segment between the calculated positions of these end nodes. The calculation of the position may include converting the GPS coordinates of the node into Cartesian coordinates relative to the vehicle (e.g., by using the rotation angle between the arcs at the intersection). The calculation may include calculating the position of the center of the determined segment in Cartesian coordinates relative to the vehicle. The checking step may then include calculating the equation of an ellipse having the determined segment as a major arc and a predetermined distance (e.g., the width of the lane) as a minor arc.
[0047] After the calculation step S33, the checking step S32 may include checking that the position and path history sent by S34 are not within the ellipse. For example, the checking step S34 may include checking that a predetermined number of points in the path history are not within the ellipse (e.g. the last 5 points in the history, or even preferably the last 3 points). The checking step S34 may fail when at least one of the position and the point in the history is within the ellipse.
[0048] Checking step S34 may comprise converting the position and the predetermined number of points in the path history of the other vehicle into Cartesian coordinates relative to the vehicle. Checking step S34 may then comprise checking that the position of the other vehicle and the predetermined number of points in the path history of the other vehicle are not within an ellipse calculated in a space defined relative to the vehicle (i.e. using the coordinates of the points in this space defined relative to the vehicle and the equation of the ellipse).
[0049] After step S30 of determining that there is no risk of collision, the method may include cancelling a normally programmed alarm (e.g. a visual or audible alarm for the driver of the vehicle) in the event of a risk of collision with another vehicle. Alternatively or in addition, the method may include cancelling the execution of a method for avoiding a collision with another vehicle (e.g. emergency braking or modifying the trajectory of the vehicle). The method may include deprogramming an alarm and / or executing a method for avoiding a collision.
[0050] Now refer to Figure 2 and 3 Describe some examples.
[0051] Figure 2A first example of determining that there is no risk of collision between a vehicle and another vehicle is shown. In this first example, three lanes 101, 102, 103 lead to an intersection 100. Therefore, a diagram 120 representing the intersection 100 includes three arcs 121, 122, 123, representing the three lanes 101, 102, 103 leading to the intersection. Each arc 121, 122, 123 is connected to a central node 124 ("b") and a corresponding node ("a", "d", and "c" of arcs 121, 122, 123, respectively). Each corresponding node represents the center of a lane at a certain distance from the center of the intersection. Vehicle 141 travels on lane 101 and includes a telematics system that implements the method.
[0052] Another lane 104 is located near the intersection. The other lane 104 passes adjacent to the intersection 100 but does not lead to the intersection 100. For example, the other lane 104 is located on a bridge passing through the lane 103. Alternatively, the other lane 104 is located in a tunnel passing under the lane 103. Another vehicle (vehicle 142) travels on the other lane 104.
[0053] The intersection includes a first roadside unit integrated into a traffic light 160. The roadside unit of the traffic light 160 includes a memory storing a map 120 representing the intersection 100. Optionally, the intersection may include a second unit integrated into a traffic light 161 (e.g. for vehicles arriving from lane 102). Alternatively, the same roadside unit may be used for all lanes.
[0054] The method implemented by the telematics system of the vehicle 141 includes a step S10 of providing detection of a risk of collision at an intersection between the vehicle 141 and another vehicle 142. The detection of the risk of collision is caused by the fact that the trajectories of the two vehicles 141, 142 (respectively 181 and 182) projected in the same 2D plane meet. Therefore, the collision detection method based on the projected trajectories of the vehicles detects the risk of collision between the two vehicles. However, in reality, the vehicles do not collide. In fact, the actual trajectories of the two vehicles are not at the same height because the lane 104 in which the vehicle 142 travels passes above or below the lane in which the vehicle 141 travels (lane 101, which becomes lane 103 after the intersection) due to a bridge or a tunnel. Therefore, the detected risk of collision is wrong because the vehicle 141 does not collide with the vehicle 142 despite the fact that their trajectories meet.
[0055] Before reaching the intersection, the method includes step S20 of the roadside unit 160 sending the map 120 stored in the memory of the roadside unit 160 to the vehicle 141. For example, when the vehicle 141 arrives at the position indicated by the corresponding node "a" (e.g., about 500 or 300 meters before the traffic light 160), the map can be sent to the vehicle 141. Sending the map includes sending the stored information about the intersection. The information sent may include the GPS location of one or more nodes in the map (e.g., at least nodes "b" and "c"). The information sent may include the number of lanes and the lane width.
[0056] After sending the graph 120, the method comprises a step S30 of determining that there is no risk of collision between the vehicle 141 and the other vehicle 142 based on the sent graph 120. In this first example, the determination step S30 comprises checking that there is no lane at the intersection on the side of the vehicle 141 (in this example, the right-hand side) where the other vehicle 142 arrives. For example, the determination step S30 may comprise determining that the other vehicle 142 is arriving to the right of the vehicle 141. For example, the determination of the side may be based on the trajectories 181 and 182 of the two vehicles 141 and 142, and / or another vehicle 142 that sends its position and position history 143 (via V2X exchange). The determination step S30 may then comprise checking that there are no arcs at the intersection on the determined side. For example, the check may comprise identifying all arcs 102, 103 that arrive at the intersection (except the one on which the vehicle 101 is traveling). Next, the check comprises checking that none of these arcs 102 and 103 are located on the side of the vehicle 141 that the other vehicle 142 arrives (in this example, the right-hand side).
[0057] The check that neither of these arcs 102 and 103 is located on the right-hand side of the vehicle 141 is based on the positions of the respective nodes “c” and “d” of the two arcs 102 and 103. This check consists in calculating the respective positions of the two respective nodes “c” and “d” and then checking that the calculated position of each respective node “c” and “d” is not on the right-hand side of the vehicle 141. To this end, for each of the arcs 102 and 103, the check consists in calculating the Cartesian position of the respective node of the arc (“c” and “d” respectively) relative to the vehicle 141 and then checking that the calculated Cartesian position is not located on the side of the other vehicle 142.
[0058] Figure 3A second example of determining that there is no risk of collision between the vehicle and another vehicle is shown. In this second example, the situation at intersection 200 is different from that at intersection 100, since one of the lanes is to the side of another vehicle 142 (lane 202 is now on the right-hand side of vehicle 141). Therefore, the above-mentioned first check fails (checking that there is no lane at the intersection to the side of vehicle 141). In this second example, determining step S30 therefore includes a second check. The second check can also be performed in addition to the first check, or even without this first previous check, i.e. first when a risk of collision is detected.
[0059] In this second example, the determining step S30 comprises the other vehicle 142 sending S31 its position and path history 143 and then checking S32 that the other vehicle 142 is not travelling on the lane represented by the arc connected to the central node 124. In this second example, the graph sent is the graph 220 and the check is performed on this graph 220.
[0060] In some examples, these steps S31 and S32 may be performed after performing the above-mentioned check that no arc is located to the side of the other vehicle 142. In other examples, these steps may be performed first (without first performing the above-mentioned check that no arc is located to the side of the other vehicle 142).
[0061] After the step S31 of the other vehicle 142 sending the position and the path history 143 , the determining step S30 comprises checking S32 that the other vehicle 142 is not travelling on the lane represented by the arc connected to the central node 124 based on the sent position and the path history 143 .
[0062] In this example, the method performs this checking step S32 only for arc 202 that is located to the side of another vehicle 142. In fact, arc 103 is not located to the side of another vehicle 142, and vehicle 141 travels on arc 101. Therefore, map 220 does not include any other arcs that are both to the side of another vehicle and also represent lanes that the vehicle is not traveling on.
[0063] The step S32 of checking arc 103 includes checking that another vehicle 142 is not located within a given perimeter around the lane represented by the arc (an ellipse in this example). The checking step S32 includes calculating S33 the equation of an ellipse 210 having a segment 212 defined between the center node 124 and the corresponding node 225 of the arc 222 as its long arc. For example, the calculation may include calculating the positions of the nodes located at the ends of the arc (the center node "b" and the corresponding node "c" of the arc 222). The calculation may then include determining the segment 212 between the calculated positions of these end nodes. The calculation of the node positions may include converting the GPS coordinates of the nodes into Cartesian coordinates relative to the vehicle (e.g. using the GPS position of the "EGO" vehicle and the positions of the nodes, such as at least "b" and "c"). The calculation may include calculating the position of the center of the determined segment in Cartesian coordinates relative to the vehicle. Then, the checking may include calculating the equation of an ellipse 210 having the determined segment as the long arc 212 and a predefined distance as the small arc 211 (e.g. approximately equal to the width of the lane 202).
[0064] After the calculation step S33, the checking step S32 includes a step S34 of checking that the position and the first three points of the transmitted past history 143 are not located within the ellipse 210. The checking step S34 fails when at least one of the position of the other vehicle and the last three points of the history is located within the ellipse 210. In this example, the checking step S34 succeeds because the position of the vehicle 142 and the first three points of the history 143 are both located within the ellipse 210.
[0065] The checking step S34 comprises converting the position of the other vehicle and the first three points of the path history 143 into Cartesian coordinates relative to the vehicle 141. The checking step S34 then comprises checking that the position of the other vehicle 142 and the first three points are not located within the ellipse 210 calculated in the space defined relative to the vehicle (i.e. using the coordinates of the points and the equation of the ellipse in this space defined relative to the vehicle 141).
[0066] After step S30 of determining that there is no risk of collision, the method comprises cancelling a warning that is usually programmed in the event of a risk of collision with another vehicle (e.g. a visual or audible warning for the driver of the vehicle). Alternatively or in addition, the method comprises cancelling the execution of a method for avoiding a collision with another vehicle (e.g. emergency braking or modifying the trajectory of the vehicle). The method comprises deprogramming a warning and / or executing a method for avoiding a collision.
Claims
1. A method implemented by a telematics system in a vehicle, the vehicle traveling on a lane leading to an intersection, the intersection including a roadside unit, the roadside unit including a memory storing a graph representing the intersection, the graph including arcs connected to a central node, each arc representing a lane leading to the intersection, the method comprising: Provides collision risk detection at intersections between a vehicle and another vehicle; The roadside unit sends the stored map to the vehicle; as well as Determining based on the graph that there is no risk of collision between the vehicle and another vehicle.
2. The method according to claim 1, wherein: Each arc connects the central node to a corresponding node representing a location on a lane represented by an arc upstream of the intersection, wherein determining that there is no risk of collision comprises: the other vehicle transmits the other vehicle's position and path history; and Based on the sent position and path history, check if another vehicle is not traveling in the lane represented by the arc connected to the central node.
3. The method according to claim 2, wherein: For each corresponding node, the checks include: · calculating the equation of an ellipse having as its major arc the segment defined between the central node and the corresponding node; and Check that the sent position and path history are not within the ellipse based on the calculated equations.
4. The method according to claim 2 or 3, wherein: The path history includes a set of consecutive positions occupied by the other vehicle over a previous period of time.
5. The method according to any one of claims 1 to 4, wherein: The roadside units are integrated into traffic lights at intersections.
6. The method according to any one of claims 1 to 5, wherein: Collision risk detection includes: Provide a vehicle path projected into a 2D plane for each vehicle; and • Determine the meeting point between the path of the vehicle and the path of another vehicle on a 2D plane.
7. The method according to claim 6, wherein: Providing the path comprises, for at least one vehicle, calculating the path of the vehicle based on a speed, acceleration, yaw rate, turning angle and / or size of the vehicle, preferably without using a height of the vehicle.
8. A computer program for a vehicle telematics system comprising instructions which, when executed by a processor, cause the processor to implement the method according to any one of claims 1 to 7.
9. A computer-readable storage medium storing the computer program according to claim 8. 10 . A telematics system for a vehicle, comprising the storage medium according to claim 9 , the system being configured to execute the method according to any one of claims 1 to 7 .
