Determining the absence of risk of collision between vehicles based on a graph
Patent Information
- Application Number
- FR2023005063
- Authority / Receiving Office
- FR · FR
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-23
- Publication Date
- 2024-11-29
Smart Images

Figure 00000000_0000_ABST
Abstract
Description
Title of the invention: Determination of the absence of risk of collision between vehicles based on a graph technical field
[0001] This disclosure relates to a method implemented by a telematics system in a vehicle and a vehicle telematics system. Technical background
[0002] Vehicles equipped with telematics systems now exist, allowing them to exchange information with each other and with other roadside equipment. For example, these telematics systems can use V2X communication technology (Vehicle-to-Everything), which allows a vehicle to exchange information with any other system using this technology. For example, a V2X telematics system can exchange information with the telematics systems of other vehicles, roadside equipment such as traffic lights or camera systems, or pedestrians' smartphones.
[0003] The information exchanged makes it possible, in particular, to detect a risk of collision between two vehicles. For example, the two vehicles can exchange location information, and, by calculating the trajectories of the vehicles, the telematics system can detect a risk of collision between the vehicles when their trajectories intersect.
[0004] However, the detected collision risks may be erroneous. Indeed, the calculated trajectories for two vehicles may intersect even though the vehicles are traveling on separate lanes that do not intersect. This situation can occur, in particular, in the presence of a bridge or tunnel. In such a structure, the trajectories of vehicles arriving at the same point, but passing over each other, may intersect when calculated by projection onto the same 2D plane, even though in reality the two vehicles do not cross. Variations in road elevation therefore lead to false collision detections between vehicles.
[0005] There is therefore a need to improve collision detection between vehicles. Summary
[0006] A method implemented by a telematics system in a vehicle is proposed for this purpose. The method includes providing a collision risk detection system between the vehicle and another vehicle. The method includes providing a graph comprising arcs representing traffic lanes at the collision point and Nodes between arcs represent connections between the depicted lanes. The method includes identifying the arc representing the lane in which the vehicle is traveling from a given position of the vehicle. The method also includes determining the absence of collision risk when the other vehicle is not traveling in the lane represented by an arc connected on the graph to the identified arc.
[0007] The determination may include identifying one or more nodes of the graph connected to the arc representing the lane on which the vehicle is traveling. The determination may include verifying that the other vehicle is not traveling on a lane represented by an arc connected to one or more identified nodes.
[0008] The one or more identified nodes may represent one or more connections which are located at a distance less than or equal to 500 meters from the vehicle, preferably less than or equal to 300 meters.
[0009] Each arc of the graph can include a direction of travel. Identifying one or more nodes can involve determining a path through the graph from the arc representing the lane on which the vehicle is traveling, according to the direction of travel of the arcs. The one or more nodes can be one or more nodes of the path.
[0010] At least one arc can be connected to one or more identified nodes. The verification may include checking for the absence of another vehicle traveling on a lane represented by at least one arc.
[0011] The collision risk detection system may include providing, for each vehicle, a projected vehicle path in a 2D plane. The collision risk detection system may include determining an encounter in the 2D plane between the vehicle's path and the path of the other vehicle.
[0012] The provision of the paths may include, for at least one of the vehicles, a calculation of the vehicle's path from the speed, acceleration, yaw rate, steering angle and / or dimensions of the vehicle, preferably without using the vehicle's altitude.
[0013] A computer program for a vehicle telematics system is also proposed. The computer program comprises instructions which, when the program is executed by a processor, cause the processor to implement the method.
[0014] A computer-readable storage medium is also proposed on which the computer program is recorded.
[0015] A vehicle telematics system is also proposed. The telematics system includes the storage medium. The system is configured to perform the process. Brief description of the figures
[0016] Non-limiting examples will be described with reference to the following figures:
[0017] [Fig. 1] shows a flowchart of an example implementation of the process.
[0018] [Fig. 2] and [Fig. 3] illustrate an example of a situation in which the process makes it possible to determine the absence of risk of collision.
[0019] Figure 4 shows an example of a graph representing traffic lanes at the level of a collision. Detailed description
[0020] With reference to [Fig. 1], a method implemented by a telematics system in a vehicle is proposed. The method includes a provision S10 of a collision risk detection between the vehicle and another vehicle. The method includes a provision S20 of a graph comprising arcs representing traffic lanes at the collision point and nodes between the arcs representing connections between the represented lanes. The method includes an identification S30 of the arc representing the lane in which the vehicle is traveling from a position of the vehicle. The method includes a determination S40 of the absence of collision risk when the other vehicle is not traveling in the lane represented by an arc connected on the graph to the identified arc.
[0021] The method provides an improved solution for detecting collisions between vehicles.
[0022] Indeed, the method makes it possible to better eliminate detected collision risks that are not real, i.e., those whose detection is erroneous. In particular, the method uses the graph representing the traffic lanes at the collision point to deduce whether the risk of collision is real or not, taking into account the traffic lanes on which the vehicles are traveling and the intersections that exist at the potential collision point. When the traffic lanes do not intersect, the graph allows it to deduce that the risk is not real. Thus, in the presence of a structure allowing the simultaneous passage of several vehicles (for example, a bridge), the method will make it possible to eliminate detected collision risks between vehicles arriving on different lanes at the structure.The process uses the graph to eliminate the risk of collision whenever the lanes on which vehicles are traveling do not intersect.
[0023] The vehicle that includes the telematics system performing the method can be a so-called EGO vehicle, that is, one whose behavior in interactions with other vehicles involved in a situation is to be controlled. The vehicle can be any type of vehicle configured to include such a telematics system (for example, a car, a truck, or a motorcycle). The other vehicle in the method can be a so-called remote vehicle, that is, another vehicle that is located at a certain time given in the vicinity of the vehicle known as EGO.
[0024] The method can be executed while the vehicle is in motion. Steps S10 to S40 can be repeated by the method while the vehicle is in motion. For example, the method can include repeating steps S10 to S40 each time another vehicle's path intersects that of the vehicle. Steps S10 to S40 are then repeated for this new vehicle. The detected collision risk is, in this case, a collision risk with the new vehicle encountered at each repetition. The details given below apply to each repetition of steps S10 to S40 for each new vehicle encountered.
[0025] The S10 collision risk detection provision may include an SI 1 provision, for each vehicle, of a vehicle path projected onto a 2D plane. The vehicle path may represent on the 2D plane a simulation of the movement the vehicle will follow given a current vehicle situation (for example, given its position, speed, and / or steering angle). The 2D plane may represent the space around the collision. For example, the 2D plane may be a map representing a projection onto a 2D plane of the lanes around the collision.
[0026] The path of each vehicle can represent the movement of the vehicle over a predetermined future period (for example, a period of less than 10 minutes and / or more than 10 seconds, for example, a period of approximately 1 minute). Alternatively or additionally, the path can represent the movement of the vehicle over a predetermined length (for example, a length of less than 10 kilometers and / or more than 100 meters, for example, a length of approximately 300 meters).
[0027] The method may include repeating the calculation of the path (for example, the length and direction of the path) for each vehicle (i.e., the so-called EGO vehicle and the so-called remote vehicle). For example, the method may repeat the calculation of each vehicle's path every 100 milliseconds. At each repetition, the method can determine whether there is an encounter between the new paths calculated for the two vehicles. For one of these repetitions, the method can determine that there is an encounter between the path of the vehicle and the path of the other vehicle (determination in step S12). For each vehicle, the path provided in step S10 is therefore the path calculated for the vehicle at the time of the repetition for which it is determined that there is an encounter.The process can calculate the path of the so-called EGO vehicle from the same parameters as for calculating the path of the other vehicle (speed, acceleration, yaw rate, steering angle and / or vehicle dimensions). The length of the path can depend on these parameters (for example, the length can increase proportionally with speed).
[0028] The path can represent the spatial movement of the vehicle. For example, the path can represent the vehicle's movement in the 2D plane over the entire predetermined duration. Alternatively, the path can represent the vehicle's spatial and temporal movement. In this case, the path can also represent the evolution of the vehicle's movement over time.
[0029] Each path may include a line on the 2D plane, for example, representing the movement of the vehicle's center (e.g., the center of gravity). Alternatively, each path may represent the movement of a footprint of the vehicle on the ground in the 2D plane. In this case, the path may include a set of points, each representing a space on the ground occupied by the vehicle at a given time. For example, the path may include a line of a certain thickness representing the movement of the entire vehicle (i.e., considering its width), or two lines extending from two ends of the front of the vehicle.
[0030] Alternatively, the path of the other vehicle can be calculated. For example, the SI 1 provision may include a calculation of the path of the other vehicle based on one or more parameters of the other vehicle. For example, the path calculation may be a function of the speed, acceleration, yaw rate, steering angle, and / or dimensions of the other vehicle. Preferably, the path calculation may not use the altitude of the other vehicle. For example, the calculated path may be in a 2D plane, i.e., it may represent the evolution of the footprint of the other vehicle in a 2D plane. The parameters may have been sent by the other vehicle. In this case, the SU provision may include, prior to the calculation, the reception of these parameters by the telematics system, and the calculation may be performed on the received parameters. For example, the parameters may be sent by the other vehicle during a V2X exchange.The transmission and reception of these parameters can be achieved using V2X communication technology. For example, the other vehicle may also have a telematics system, and the telematics systems of both vehicles can be configured to regularly exchange values for these parameters (every 100 milliseconds, for example) when they are within a certain distance of each other (for example, a distance of 1 kilometer or less, or 600 meters or 300 meters or less). The values of these parameters used to calculate the other vehicle's route can be the values sent by the other vehicle during one of these V2X exchanges.
[0031] As with the other vehicle, the route of the vehicle equipped with the system implementing the method can be directly provided by the vehicle (for example, by another system of the vehicle), or it can be calculated by the telematics system. For example, the route calculation can be based on the same parameters as for the other Vehicle (speed, acceleration, yaw rate, steering angle, and / or vehicle dimensions). The vehicle dimensions may have been measured on the vehicle, for example, before the procedure was carried out. The other parameters (e.g., speed, acceleration, yaw rate, steering angle, and position) may be provided by other control units (e.g., a speed sensor or a GPS).
[0032] The S10 supply may then include a determination of a meeting on the A 2D plane is defined between the path of one vehicle and the path of the other vehicle. For example, the determination may include inferring the collision risk when the intersection of the path of one vehicle and the path of the other vehicle is non-zero. In this case, the determination may include calculating the intersection of the two paths. The determination can then deduce the location of the collision risk (the point of intersection). When the paths are lines, the intersection may be a point where the lines intersect. When the paths are dashes, the intersection may be a surface (the area where the two dashes intersect).
[0033] Determining the collision can consider only the spatial motion of the two vehicles. In this case, each path can represent the purely spatial motion of the vehicle. The calculation of the paths, and therefore of the collision points which are the points where the paths meet, takes into account several dynamic parameters (speed, acceleration). This allows us to know the evolution in space and time. Therefore, the evolution in time is not an alternative, but it is calculated every 100 ms.
[0034] The S20 graph provision may include a download of the graph from a database. For example, the provided graph may correspond to a portion of a general graph stored in the database. In this case, the S20 provision may include an extraction of the graph from the general graph stored in the database. The database on which the graph (or the general graph) may be stored on the vehicle. In this case, the vehicle may include memory on which the database is stored, and the S20 provision may include an extraction of the graph from the vehicle's memory. Alternatively, the graph may be stored elsewhere than in the vehicle. For example, the graph may be stored in a remote database. For example, the graph may be stored in memory in a road unit (e.g., such as a traffic light).In this case, the S20 provision may include a reception of the graph by the vehicle's telematics system sent by the roadside unit to the vehicle, for example after sending a request by the vehicle to the roadside unit.
[0035] The graph can represent the roads within a perimeter around the vehicle. For example, the graph can represent all the roads that are located within 10 kilometers of the vehicle (for example, less than 1 kilometer or less than 500 meters from the vehicle). The general graph can represent all the roads in a given area through which the vehicle is traveling. For example, the general graph can represent all the roads in a region or country in which the vehicle is traveling. The general graph can be a Horizon HD Map of the area. The provided graph can therefore correspond to a portion of a Horizon HD Map of the area.
[0036] The provided graph can represent the road network within the perimeter around the vehicle. The graph includes arcs representing the traffic lanes at the point of collision. For example, the graph can include a respective arc for each traffic lane within the perimeter around the vehicle. For each connection that exists between at least two lanes of the road network, the graph can include a node between the at least two arcs representing the at least two connected lanes. The at least two arcs can be connected to this node in the graph. The endpoints of each arc can be connected to a node of the graph.
[0037] Each arc of the graph can be oriented. The arc's orientation can represent the direction of travel of the vehicle on the lane that the arc represents. Each lane can correspond to a portion of the road on which a vehicle can travel. In the case of a road with several lanes of traffic in the same direction, the graph can include a separate arc for each lane of the road. Alternatively, a single arc can represent the several lanes of traffic going in the same direction. In this case, the graph can then include, for each arc, a variable representing the number of lanes on the road. In some examples, the graph can also include parameters representing the angle of rotation between the lanes represented by the arcs that are connected by a node. These angle of rotation parameters can also be stored in the database.
[0038] The S30 identification of the arc representing the lane in which the vehicle is traveling may include determining the vehicle's position and calculating the distance between that position and each traffic lane within the perimeter around the vehicle. Next, the S30 identification may include determining the nearest traffic lane among all traffic lanes (this lane being then identified as the lane in which the vehicle is traveling). After determining the nearest lane, the S30 identification may include deducing the arc associated with that lane on the graph. For example, arcs and lanes may have unique identifiers, and the database may store the associations between arc identifiers and lane identifiers.The S30 identification can then include a search for the arc based on the identifier of the nearest lane and the associations stored in the database. Alternatively, the arc on which the vehicle is traveling can be known in real time by the vehicle. For example, another... The process executed by the vehicle can calculate the vehicle's real-time position and deduce the arc on which the vehicle is traveling at any given time. In this case, the S30 identification may include a search for the arc on which the vehicle is traveling at the time the S30 step is executed.
[0039] After identification S30, the method includes determining S40 the absence of collision risk. Determining S40 is based on the provided graph; that is, the absence of collision risk is deduced from reading the graph. Determining S40 may, for example, include verifying the absence of a lane at the collision site.
[0040] In examples, the S40 determination may include a check for the absence of a lane on the side of the vehicle (left or right) from which the other vehicle is approaching. For example, the S40 determination may include determining the side of the vehicle (left or right) from which the other vehicle is approaching (for example, from the trajectories of both vehicles), and then checking for the absence of an arc on that side. For example, the check may include identifying all arcs in the vicinity of the collision (for example, among the arcs connected to the arc on which the vehicle is traveling), and then checking that no identified arc is located on the side of the other vehicle. This check may be based on the angle of rotation between the arc on which the vehicle is traveling and the identified arc. For example, a lane approaching from the right may be represented by a negative angle of rotation.In this case, when the other vehicle arrives from the right, the S40 determination may include a check that the angle of rotation with each identified arc is negative.
[0041] Alternatively or additionally, the S40 determination may include a check of the road type of arcs near the collision (for example, for all arcs located on the other vehicle's side). In this case, the graph may further include, for each arc, the road type of the lane represented by the arc (for example, from a set of potential road types including at least tunnel and / or bridge). The S40 determination may include an inference of the absence of collision risk when each arc located on the other vehicle's side represents a tunnel or bridge lane.
[0042] In examples, the determination S40 may include an identification S41 of one or more nodes in the graph connected to the arc representing the lane on which the vehicle is traveling, followed by a check S42 that the other vehicle is not traveling on a lane represented by an arc connected to the one or more identified nodes. These steps S41 and S42 may be performed after the check for the absence of a lane on the vehicle's side and / or the road type check described previously (for example, when these checks fail).
[0043] The S41 identification of one or more nodes can be done by reading the graph. The one or more identified nodes may represent one or more connections located at a distance of 500 meters or less from the vehicle, preferably 300 meters or less. The one or more identified nodes may include the next node traversed (i.e., the node at the end of the arc on which the vehicle travels), and optionally the one or more nodes connected by an arc to this next node.
[0044] The S41 identification may include determining a path through the graph from the arc representing the lane on which the vehicle is traveling (and optionally according to the direction of travel of the arcs when each arc of the graph has a direction of travel). The one or more identified nodes may then be one or more nodes of the determined path. The determined path may consist of all the arcs on which the vehicle can travel from the current position and following the arcs that are connected in the graph. The path may be determined according to the direction of travel of the arcs. The determined path may have a predetermined length (for example, 500 meters, or 300 meters). For example, the S41 identification may stop when the distance of the determined path becomes greater than this predetermined distance.
[0045] The S42 check may include identifying all arcs connected to one or more identified nodes (i.e., in addition to the arc on which the vehicle is traveling). For example, the S42 check may include identifying at least one arc connected to one or more identified nodes. Then, the S42 check may include verifying that the other vehicle is not traveling on a lane represented by at least one arc.
[0046] The control of the absence of the other vehicle on an arc is now discussed in general terms. The method can repeat this control for each of the at least one arc connected to the one or more identified nodes. In examples, the control may consist of verifying that the other vehicle is not located within a given perimeter around the lane represented by the arc (for example, an ellipse around the arc). For example, the control may include calculating the position of the nodes located at the ends of the arc and determining a segment between the calculated positions of these end nodes. The calculation of the positions may include transforming the GPS coordinates of the nodes into Cartesian coordinates relative to the vehicle (for example, by exploiting the angle of rotation between the two arcs). The control may include calculating the position, in Cartesian coordinates relative to the vehicle, of the center of the determined segment.The check may then include calculating the equation of an ellipse centered at the midpoint of the determined segment and with a predefined distance as its minor arc length. The check may also include calculating, in Cartesian coordinates relative to the vehicle, the position of the other vehicle and a... A predetermined number of points in the other vehicle's route history (for example, the last three points in the history). The route history may have been sent by the other vehicle during a V2X exchange (and received by the vehicle). The history may include a set of successive positions occupied by the other vehicle over a past period (before the process execution). The control may then include a check that the other vehicle's position and the predetermined number of points in its route history do not lie within the calculated ellipse.
[0047] After determining S40 that there is no risk of collision, the method may include canceling a normally programmed alert in case of a risk of collision with another vehicle (for example, a visual or audible alert to the driver of the vehicle). Alternatively or additionally, the method may include canceling the execution of a collision avoidance procedure with the other vehicle (such as emergency braking or a change of trajectory for the vehicle). The method may include deprogramming the alert and / or the execution of the collision avoidance procedure.
[0048] Examples will now be described with reference to Figures 2 to 4.
[0049] Figure 2 illustrates an example of a situation in which the process makes it possible to de The method concludes with the absence of a collision risk. Figure 3 illustrates a close-up view of the situation shown in Figure 2. In this example, the method is implemented by the telematics system of vehicle 101. However, the method can also be implemented in the same way on vehicle 102. The method includes providing S20 with collision risk detection between vehicle 101 and another vehicle (vehicle 102 in this example). A collision risk is detected between vehicle 101 and vehicle 102 because the projected trajectories of the two vehicles on a 2D plane intersect at intersection 103. This collision risk is erroneous because vehicle 101 is actually crossing a bridge, and the two vehicles can therefore pass each other without colliding. The method determines the absence of a collision risk between the two vehicles 101 and 102.
[0050] The method includes providing S20 a graph comprising arcs representing traffic lanes at the collision point and nodes between the arcs representing connections between the represented lanes. The provided graph includes, in this example, at least one arc representing lane 111 on which vehicle 102 is traveling and one arc representing lane 112 on which vehicle 102 is traveling. The provided graph does not include a node connecting arcs 101 and 102 since the lane represented by arc 101 passes over the lane represented by arc 102 (since a bridge is present). The method includes identifying arc 111 representing the lane on which vehicle 101 is traveling from a position of vehicle 101. The method includes the determination S40 of the absence of risk of collision since the other vehicle 102 is not travelling on the lane represented by an arc connected on the graph to the identified arc (the other vehicle 102 travelling on the lane represented by arc 112 which is not connected to arc 111 on the graph provided).
[0051] Figure 4 shows an example of a graph 200 representing traffic lanes at a collision. The graph includes arcs 201, each representing a respective traffic lane. In particular, the graph includes arc 214, representing the lane in which vehicle 221 is traveling. The graph includes nodes 202 connecting the arcs 201 at the intersections of the lanes represented by the arcs 201. At a lane intersection, the arcs of the different lanes arriving at the intersection are connected to the same node in the graph (representing the intersection). Specifically, the lane represented by arc 214 intersects the lane represented by arc 213. The graph therefore includes node 212, and arcs 214 and 213 are connected to this node 212. Node 212 is the next node traversed by vehicle 221.
[0052] The graph includes parameters representing the rotation angle 203 between the lanes represented by the arcs that are connected by a node (arcs 214 and 213 in this example). The graph also includes information for each arc. For example, the graph may include for each arc an identifier (e.g., "path Id = 2" for arc 213), information on the speed limit on the lane represented by the arc, information on a starting offset ("startOffset"), information on an ending offset ("endOffset"), information on a final ending offset ("endOffsetFinal"), information on the direction ("Direction"), and / or information on the type of road of the lane represented by the arc (e.g., from a set of potential road types including at least city, tunnel, and / or bridge).
[0053] For arc 214 representing the lane on which vehicle 221 travels, the graph may include information on the offset 223 between the position of vehicle 221 and the position materialized by node 222 representing the beginning of arc 214.
[0054] The method is implemented by a telematics system in vehicle 221. The method includes providing S10 a collision risk detection between the vehicle and another vehicle (not shown here because it is traveling on a lane not shown). For example, the other vehicle may be traveling on a lane passing under the lane represented by arc 214. The method includes providing S20 the graph 200. The method includes identifying arc 214, representing the lane on which vehicle 221 is traveling, from a position of vehicle 221.
[0055] The method includes the determination S40 of the absence of collision risk. The determination S40 includes the identification S41 of the node 212 of the graph connected to the arc 214 representing the lane in which the vehicle is traveling, and then, a verification S42 that the other vehicle is not travelling on a lane represented by an arc connected to the identified node 212 (such as arc 211 or arc 213).
[0056] The S41 identification of node 212 is done by reading the graph. The identified node 212 represents a connection located at a distance less than or equal to 500 meters from vehicle 221, preferably less than or equal to 300 meters. The identified node 212 is the next node traversed (i.e., the node at the end of arc 214 on which vehicle 221 travels).
[0057] The S42 check includes identifying all arcs connected to the identified node 212 (i.e., in addition to the arc on which the vehicle is traveling). The S42 check includes identifying arcs 211 and 213 that are connected to the identified node 212. Then, the S42 check includes verifying that the other vehicle is not traveling on the identified arcs 211 and 213.
[0058] The check for the absence of the other vehicle on arc 213 is now discussed in general terms and can be applied in the same way to any identified arc (such as arc 211 in this example). The method can repeat this check for each of the identified arcs 211 and 213.
[0059] The check may consist of verifying that the other vehicle is not located within a given perimeter around the lane represented by arc 213. In this example, the perimeter is materialized by an ellipse 206 around arc 213. The check includes calculating the position of nodes 212 and 204, which are located at the ends of arc 212, and determining a segment between the calculated positions of these end nodes 212 and 204. The calculation of the positions includes transforming the GPS coordinates of nodes 212 and 204 into Cartesian coordinates relative to the vehicle (for example, by exploiting the rotation angle 203 between the two arcs 214 and 213). The check includes calculating the position, in Cartesian coordinates relative to the vehicle, of a midpoint 205 of the determined segment.The check may then include calculating the equation of the ellipse 206, centered at the midpoint 205 of the determined segment and with a predefined distance (e.g., the lane width) as its minor arc. The check includes calculating, in Cartesian coordinates relative to the vehicle, the position of the other vehicle and a predetermined number of points in the other vehicle's route history (e.g., the last three points in the history). The check may then include verifying that the position of the other vehicle and the predetermined number of points in the other vehicle's route history are not located within the calculated ellipse 206. The absence of the other vehicle within the ellipse's perimeter clearly indicates that the collision risk is incorrect. The procedure therefore allows the detected collision risk to be ruled out.
Claims
Claims
1. Method implemented by a telematics system in a vehicle, the method comprising: • a provision (S 10) of a detection of risk of collision between the vehicle and another vehicle; • a provision (S20) of a graph comprising arcs representing traffic lanes at the collision and nodes between the arcs representing connections between the represented lanes; • an identification (S30) of the arc representing the lane on which the vehicle is traveling from a position of the vehicle; and • a determination (S40) of the absence of risk of collision when the other vehicle is not traveling on a lane represented by an arc connected on the graph to the identified arc.
2. Method according to claim 1, in which the determination (S40) comprises: • an identification (S41) of one or more nodes of the graph connected to the arc representing the lane on which the vehicle is traveling; and • a verification (S42) that the other vehicle is not traveling on a lane represented by an arc connected to the one or more identified nodes.
3. The method of claim 2, wherein the one or more identified nodes represent one or more connections that are located at a distance less than or equal to 500 meters from the vehicle, preferably less than or equal to 300 meters.
4. A method according to claim 2 or 3, wherein each arc of the graph comprises a direction of travel, the identification (S41) of the one or more nodes comprising determining a path of the graph from the arc representing the lane on which the vehicle is traveling and according to the direction of travel of the arcs, the one or more nodes being the one or more nodes of the path.
5. A method according to any one of claims 2 to 4, wherein at at least one arc is connected to the one or more identified nodes, the verification (S42) comprising a check of the absence of circulation of the other vehicle on a lane represented by the at least one arc.
6. Method according to any one of claims 1 to 5, in which the provision (S 10) of the collision risk detection comprises: • a provision (SI 1), for each vehicle, of a path of the vehicle projected in a 2D plane; and • a determination (S 12) of an encounter on the 2D plane between the path of the vehicle and the path of the other vehicle.
7. A method according to claim 6, wherein the provision (SI 1) of the routes comprises, for at least one of the vehicles, a calculation of the route of the vehicle from the speed, acceleration, yaw rate, steering angle and / or dimensions of the vehicle, preferably without using the altitude of the vehicle.
8. A computer program for a vehicle telematics system comprising instructions which, when the program is executed by a processor, cause the latter to implement the method according to any one of claims 1 to 7.
9. A computer-readable storage medium on which the computer program according to claim 8 is recorded.
10. A vehicle telematics system comprising the storage medium of claim 9, the system being configured to perform the method of any one of claims 1 to 7.
Citation Information
Patent Citations
Driving assistance apparatus
US20170132930A1
ADAS horizon and vision supplemental v2x
US20180052005A1
