Driving assistance device, driving assistance method, and program

The driving assistance device enhances collision prevention by using vehicle-to-vehicle communication to adjust the target area for collision prediction and intervention, addressing the limitations of existing systems on multi-lane roads.

JP7750914B2Active Publication Date: 2025-10-07HONDA MOTOR CO LTD
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
JP2023170822
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2023-09-29
Publication Date
2025-10-07
Estimated Expiration
2043-09-29

AI Technical Summary

Technical Problem

Existing driving assistance devices fail to provide appropriate collision prevention when entering roads with multiple lanes, as stored intersection data may not be included in the target area for assistance.

Method used

A driving assistance device that utilizes vehicle-to-vehicle communication to acquire surrounding vehicle information, predicts collision possibilities by adjusting the target area based on stored intersection positions, and provides assistance through notification or deceleration, without relying on map information.

Benefits of technology

Enables effective collision prevention assistance by dynamically setting the target area for collision prediction and intervention, ensuring timely and appropriate driving assistance even on roads with multiple lanes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007750914000001
    Figure 0007750914000001
  • Figure 0007750914000002
    Figure 0007750914000002
  • Figure 0007750914000003
    Figure 0007750914000003
Patent Text Reader

Abstract

To provide a technique capable of appropriately performing driving assistance for a self-vehicle.SOLUTION: A driving assistance device includes: storage means that stores a plurality of intersection locations each indicating a location where a traveling trajectory of a self-vehicle and a traveling trajectory of another vehicle intersect in the past; acquisition means that acquires surrounding vehicle information of a surrounding vehicle through vehicle-to-vehicle communication; prediction means that predicts a possibility of collision between the self-vehicle and the surrounding vehicle in a target area in front of the self-vehicle on the basis of self-vehicle information and the surrounding vehicle information; and assistance means that performs driving assistance for the self-vehicle on the basis of a prediction result by the prediction means. The prediction means predicts, in a case where none of the plurality of intersection locations is present within a predetermined distance in front of the self-vehicle, the possibility of collision by setting the target area to a first area, and predicts, in a case where at least one intersection location of the plurality of intersection locations is present within the predetermined distance, the possibility of collision by setting the target area to a second area larger than the first area.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

[Technical Field]

[0001] The present invention relates to a driving assistance device, a driving assistance method, and a program. [Background technology]

[0002] There is known a device that provides driving assistance without using map information to prevent collision with other vehicles (surrounding vehicles), etc. Patent Document 1 discloses a driving assistance device that registers in a storage unit position information of an intersection where the travel path of the vehicle and the travel path of another vehicle intersect, and provides driving assistance to the vehicle when passing through the intersection again. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent No. 7054636 Summary of the Invention [Problem to be solved by the invention]

[0004] The driving assistance device can predict the possibility of a collision with the vehicle within a target area ahead of the vehicle and provide driving assistance for the vehicle based on the prediction result. However, for example, when entering a main road including multiple lanes, even if an intersection (intersection) where the driving trajectory of the vehicle and the driving trajectory of another vehicle have previously intersected is stored for the main road, the intersection may not be included in the target area for providing driving assistance, and driving assistance may not be provided appropriately.

[0005] Therefore, an object of the present invention is to provide a technology that can appropriately perform driving assistance for a vehicle. [Means for solving the problem]

[0006] In order to achieve the above object, a driving assistance device according to one aspect of the present invention includes: a storage means for storing a plurality of intersection positions each indicating a position where a travel path of the host vehicle intersected with a travel path of another vehicle in the past; an acquisition means for acquiring, via vehicle-to-vehicle communication, surrounding vehicle information including a current position, speed, and travel path of the surrounding vehicle present around the host vehicle from the surrounding vehicle; a prediction means for predicting a possibility of a collision between the host vehicle and the surrounding vehicle within a target area ahead of the host vehicle, based on the host vehicle information including the current position, speed, and travel path of the host vehicle and the surrounding vehicle information acquired by the acquisition means; and an assistance means for providing driving assistance for the host vehicle, including at least one of notifying an occupant of the host vehicle and assisting in deceleration of the host vehicle, based on the prediction result by the measurement means, wherein the prediction means predicts the possibility of collision by setting the target area to a first area when none of the plurality of intersection positions stored in the storage means is located within a predetermined distance ahead of the host vehicle, and by setting the target area to a second area larger than the first area when at least one of the plurality of intersection positions stored in the storage means is located within the predetermined distance. [Effects of the Invention]

[0007] According to the present invention, for example, it is possible to provide a technique that is capable of appropriately providing driving assistance for a vehicle. [Brief explanation of the drawings]

[0008] [Figure 1] FIG. 1 is a diagram showing an example of the configuration of a driving assistance device according to an embodiment of the present invention; [Figure 2] A diagram showing an example of the configuration of an intersection location database [Figure 3] Diagram for explaining the intersection position [Figure 4] FIG. 1 is a diagram for explaining problems with a conventional driving assistance device. [Figure 5] FIG. 1 is a diagram for explaining changes in the dimensions of a target area for providing driving assistance to a vehicle; [Figure 6]1 is a flowchart showing a driving assistance process according to an embodiment of the present invention; [Figure 7] Flowchart showing a method for predicting the possibility of a collision between a host vehicle (first embodiment) [Figure 8] FIG. 1 is a diagram for explaining a method for predicting the possibility of a collision in the first embodiment. [Figure 9] A diagram showing the relationship between the speed of surrounding vehicles and their stopping time [Figure 10] Flowchart showing a method for predicting the possibility of a collision between a host vehicle (embodiment 2) [Figure 11] FIG. 10 is a diagram for explaining a method for predicting the possibility of a collision in the second embodiment. [Figure 12] Flowchart showing a method for predicting the possibility of a collision between a host vehicle (third embodiment) [Figure 13] FIG. 10 is a diagram for explaining a method for predicting the possibility of a collision in the third embodiment. [Figure 14] Flowchart showing how to register a new intersection location [Figure 15] FIG. 1 is a diagram illustrating an intersection between a host vehicle and a surrounding vehicle; [Figure 16] A diagram for explaining the registration of the driving trajectory (passing points) of surrounding vehicles. DETAILED DESCRIPTION OF THE INVENTION

[0009] Hereinafter, embodiments of the present invention will be described with reference to the drawings. The present invention is not limited to the following embodiments, and includes modifications and variations of the configuration within the scope of the present invention. Furthermore, not all of the combinations of features described in the present embodiments are necessarily essential to the present invention. Note that the same reference numerals are used to designate the same components, and their description will be omitted.

[0010] <Configuration of driving assistance device> FIG. 1 is a diagram illustrating an example of the configuration of a driving assistance device 100 according to an embodiment of the present invention. The driving assistance device 100 is a device mounted on a host vehicle to provide driving assistance for the host vehicle. In this embodiment, the driving assistance device 100 performs collision prevention assistance for preventing (reducing) collisions with surrounding vehicles as driving assistance for the host vehicle without using map information. The driving assistance device 100 according to this embodiment may include a sensor group 11, a GNSS (Global Navigation Satellite System) antenna 12, a vehicle-to-vehicle communication antenna 13, a notification device 14, a braking device 15, and a control device 20. In the following description, the term "other vehicle" generally refers to a vehicle different from the host vehicle, and may be specifically defined as a vehicle with which vehicle-to-vehicle communication has been established with the host vehicle. The term "surrounding vehicle" refers to a vehicle currently present in the vicinity of the host vehicle, and may be specifically defined as a vehicle with which vehicle-to-vehicle communication has been established with the host vehicle.

[0011] The sensor group 11 includes various sensors mounted on the host vehicle to perform driving assistance for the host vehicle. For example, the sensor group 11 may include a speed sensor that detects the speed of the host vehicle, an acceleration sensor that detects the acceleration of the host vehicle, etc. The sensor group 11 may also include external detection sensors such as a camera, millimeter wave radar, and LIDAR (Light Detection and Ranging) that can detect objects around the host vehicle. The sensor group 11 outputs the detection results to the control device 20.

[0012] The GNSS antenna 12 receives radio waves for position measurement transmitted from GNSS satellites. For example, the GNSS antenna 12 can be used to obtain information about the current position of the vehicle. The vehicle-to-vehicle communication antenna 13 is an antenna that transmits and receives various data to and from surrounding vehicles. For example, the vehicle-to-vehicle communication antenna 13 can be used to obtain information about the current positions, speeds, and driving trajectories of surrounding vehicles.

[0013] The notification device 14 is a device that notifies an occupant of the host vehicle (for example, the driver). When there is a possibility that the host vehicle will collide with a surrounding vehicle, the driving assistance device 100 of this embodiment can notify the occupant of the host vehicle of the possibility of a collision with the surrounding vehicle by the notification device 14 as driving assistance. For example, the notification device 14 may include a display unit such as a display, and display information indicating the possibility of a collision with the surrounding vehicle on the display unit, or may include an audio output unit such as a speaker, and output information indicating the possibility of a collision with the surrounding vehicle from the audio output unit by voice or the like.

[0014] The braking device 15 is a device for performing a braking operation of the host vehicle, such as a brake. When there is a possibility that the host vehicle will collide with a nearby vehicle, the driving assistance device 100 of this embodiment operates the braking device 15 to assist in decelerating the host vehicle as driving assistance, thereby making it possible to avoid a collision with the nearby vehicle.

[0015] The control device 20 is a device (computer) that controls driving assistance for the vehicle, and can be configured, for example, by an ECU (Electric Control Unit). The control device 20 of this embodiment performs driving assistance through vehicle-to-vehicle communication with other vehicles (surrounding vehicles) and processing within the vehicle. In other words, the control device 20 performs driving assistance without using map information. The control device 20 includes a processing unit 21, a storage unit 22, a GNSS module 23, and a vehicle-to-vehicle communication module 24, which are connected by a bus (not shown).

[0016] The processing unit 21 is a processor represented by a CPU (Central Processing Unit), and executes programs stored in the storage unit 22. The storage unit 22 includes, for example, a RAM, a ROM, a hard disk, etc., and stores various data in addition to a program (driving assistance program) that the processing unit 21 uses to execute driving assistance processing for the host vehicle. In this embodiment, the storage unit 22 stores a database (information) of multiple intersection positions, each indicating a position where the traveling path of the host vehicle intersected with the traveling path of another vehicle in the past. Furthermore, the GNSS module 23 receives position information and the like of the host vehicle from GNSS satellites via the GNSS antenna 12. Furthermore, the vehicle-to-vehicle communication module 24 receives various information from other vehicles via the vehicle-to-vehicle communication antenna 13.

[0017] The processing unit 21 of this embodiment may include an acquisition unit 21a, a prediction unit 21b, a driving assistance unit 21c, an identification unit 21d, and a registration unit 21e in order to perform driving assistance for the host vehicle (collision prevention assistance in this embodiment). Note that the processing unit 21 is not limited to a configuration including each of the units 21a to 21e, and other units may be added or some units may be omitted depending on the type of driving assistance to be performed on the host vehicle.

[0018] The acquisition unit 21a acquires nearby vehicle information, including the current position, speed, and traveling path of the nearby vehicle, from the nearby vehicle via the vehicle-to-vehicle communication antenna 13 (vehicle-to-vehicle communication module 24). The acquisition unit 21a may also include a function of acquiring host vehicle information, including the current position, speed, and traveling path of the host vehicle, via the sensor group 11 and the GNSS antenna 12 (GNSS module 23).

[0019] The prediction unit 21b predicts the possibility of a collision of the host vehicle within a target area ahead of the host vehicle, based on the host vehicle information and the peripheral vehicle information acquired by the acquisition unit 21a. The target area will be described in detail below, but may also be understood as an area (driving assistance area) where driving assistance is provided to prevent a collision between the host vehicle and peripheral vehicles. Furthermore, the driving assistance unit 21c provides driving assistance to prevent a collision between the host vehicle and peripheral vehicles, based on the prediction result by the prediction unit 21b. In this embodiment, the driving assistance unit 21c can perform at least one of notifying the occupants of the host vehicle by the alarm device 14 and assisting the host vehicle in deceleration by the braking device 15, as driving assistance for the host vehicle.

[0020] The identification unit 21d identifies a position where the host vehicle and the surrounding vehicles intersect as a new intersection position based on the host vehicle information and the surrounding vehicle information acquired by the acquisition unit 21a. Furthermore, when the identification unit 21d identifies a new intersection position, the registration unit 21e registers the new intersection position identified by the identification unit 21d in the storage unit 22 (a database of multiple intersection positions).

[0021] Next, a database of multiple intersection positions stored in storage unit 22 will be described. Fig. 2 shows an example of the configuration of the database of multiple intersection positions stored in storage unit 22. In the following, the database of multiple intersection positions stored in storage unit 22 may be referred to as an "intersection position database," and an intersection position registered in the intersection position database may be referred to as a "registered intersection position." Note that the intersection position database shown in Fig. 2 is merely an example, and the items included in the intersection position database can be changed as appropriate.

[0022] The intersection location database may include information regarding the intersection location ID, registration date and time, coordinates, and passing direction for each registered intersection location. The intersection location ID is an identification number for each registered intersection location. The registration date and time is the date and time when the registered intersection location is registered in the intersection location database. The coordinates are data for identifying the registered intersection location and are represented by, for example, latitude and longitude data. The coordinates may include altitude data such as elevation in addition to latitude and longitude data. The passing direction is the direction (direction, angle) in which the vehicle was facing when passing through the registered intersection location. In this embodiment, the passing direction of the vehicle at a registered intersection location is defined as north being 0°, east being 90°, south being 180°, and west being 270°.

[0023] Here, the intersection position will be described with reference to Fig. 3. Fig. 3 is a diagram for explaining the intersection position. As described above, the intersection position is a position where the travel path of the vehicle and the travel path of another vehicle have intersected in the past. Note that, although the present embodiment will be described taking right-hand traffic as an example, the same applies to left-hand traffic.

[0024] In the example shown in FIG. 3(a), the position where the travel path 31a of the host vehicle SV traveling straight north and the travel path 32a of the other vehicle OVa traveling straight west intersect is identified as the "intersection position CPa" and registered in the intersection position database of the storage unit 22. Note that the timing (time) at which the host vehicle SV passes the intersection position CPa is different from the timing (time) at which the other vehicle OVa passes the intersection position CPa, so no collision occurs between the host vehicle SV and the other vehicle OVa. Furthermore, the travel path 31a of the host vehicle SV is included in the host vehicle information acquired by the acquisition unit 21a via the sensor group 11 and the GNSS antenna 12 (GNSS module 23). The travel path 32a of the other vehicle OVa is included in the other vehicle information acquired by the acquisition unit 21a via the vehicle-to-vehicle communication antenna 13 (vehicle-to-vehicle communication module 24). The other vehicle information may also be understood as nearby vehicle information because the other vehicle OVa is a nearby vehicle present around the host vehicle SV at the time of acquisition.

[0025] In the example shown in FIG. 3(b), the position where a travel path 31b of the host vehicle SV, which travels straight north and turns left, intersects with a travel path 32b of another vehicle OVb, which travels straight south, is identified as an "intersection position CPb" and registered in the intersection position database of the storage unit 22. Note that the timing (time) at which the host vehicle SV passes the intersection position CPb is different from the timing (time) at which the other vehicle OVb passes the intersection position CPb, so no collision occurs between the host vehicle SV and the other vehicle OVb. Furthermore, the travel path 31b of the host vehicle SV, like the travel path 31a, is included in the host vehicle information acquired by the acquisition unit 21a via the sensor group 11 and the GNSS antenna 12 (GNSS module 23). The travel path 32b of the other vehicle OVb, like the travel path 32a, is included in the other vehicle information (neighboring vehicle information) acquired by the acquisition unit 21a via the vehicle-to-vehicle communication antenna 13 (vehicle-to-vehicle communication module 24).

[0026] The functions of the control device 20 can be realized by either hardware or software. For example, the functions of the control device 20 may be realized by the processing unit 21 (CPU) executing a driving assistance program as described above, or may be realized by a known semiconductor device such as a PLD (Programmable Logic Device) or an ASIC (Application Specific Integrated Circuit). In addition, although the control device 20 is shown as a single element in this embodiment, it may be divided into two or more elements as necessary.

[0027] As described above, the processing unit 21 (prediction unit 21b, driving assistance unit 21c) in the driving assistance device 100 predicts the possibility of collision of the host vehicle SV within a target area TA ahead of the host vehicle SV, and provides driving assistance for the host vehicle SV based on the prediction result. However, for example, when entering a main road including multiple lanes, as shown in Fig. 4, even if a registered intersection position CP exists on the main road, the registered intersection position CP may not be included in the target area TA where driving assistance is provided, and appropriate driving assistance may not be provided.

[0028] Therefore, as shown in FIG. 5(a), when none of the multiple registered intersection positions stored in the memory unit 22 is located within a predetermined distance D ahead of the host vehicle SV, the driving assistance device 100 of this embodiment sets the target area TA to a first area TA1 and provides driving assistance for the host vehicle SV. On the other hand, as shown in FIG. 5(b), when at least one registered intersection position CP among the multiple registered intersection positions stored in the memory unit 22 is located within a predetermined distance D ahead of the host vehicle SV, the driving assistance device 100 sets the target area TA to a second area TA2 and provides driving assistance for the host vehicle SV. The second area TA2 is larger than the first area TA1 and is set to be longer than the first area TA1 in at least the traveling direction of the host vehicle SV. The second area TA2 may be set to be longer than the first area TA1 in the vehicle width direction of the host vehicle SV. The predetermined distance D may be understood as a predetermined range (search range) for searching for the registered intersection position CP ahead of the host vehicle SV. The predetermined distance D can be set arbitrarily, for example, to a distance (range) that can cover the maximum road width expected for a main road including multiple lanes.

[0029] <Driving assistance processing> The driving assistance process of this embodiment will be described below. Fig. 6 is a flowchart showing the driving assistance process of this embodiment. The driving assistance process shown in the flowchart of Fig. 6 is executed by the processing unit 21 in the driving assistance device 100 in accordance with a driving assistance program read from the storage unit 22. The flowchart of Fig. 6 can be repeatedly executed, for example, until the driving assistance setting is turned off or the ignition of the host vehicle SV is turned off.

[0030] In step S101, the processing unit 21 (prediction unit 21b) determines whether or not a registered intersection position CP exists within a predetermined area D ahead of the host vehicle SV by referring to a plurality of registered intersection positions CP stored in the memory unit 22. For example, the processing unit 21 can determine whether or not a registered intersection position CP exists within the predetermined area D ahead of the host vehicle SV by comparing the current position of the host vehicle SV acquired by the acquisition unit 21a via the GNSS antenna 12 (GNSS module 23) with the coordinates (latitude, longitude) of each registered intersection position CP stored in the memory unit 22. If a registered intersection position CP does not exist within the predetermined area D, the process proceeds to step S102, where the processing unit 21 (prediction unit 21b) sets a target area TA for providing driving assistance ahead of the host vehicle SV to a first area TA1. On the other hand, if a registered intersection position CP exists within the predetermined area D, the process proceeds to step S103, where the processing unit 21 (prediction unit 21b) sets the target area TA to a second area TA2. That is, the processing unit 21 changes the target area TA from the first area TA1 to the second area TA2.

[0031] In step S104, the processing unit 21 determines whether or not there is a surrounding vehicle RV. As described above, a surrounding vehicle RV is a vehicle that is currently present around the host vehicle SV. For example, the processing unit 21 can determine that there is a surrounding vehicle RV when vehicle-to-vehicle communication can be performed via the vehicle-to-vehicle communication antenna 13 (vehicle-to-vehicle communication module 24). If it is determined that there is no surrounding vehicle RV, the processing unit 21 proceeds to step S101, and if it is determined that there is a surrounding vehicle RV, the processing unit 21 proceeds to step S105.

[0032] In step S105, the processing unit 21 (acquisition unit 21a) acquires host vehicle information and surrounding vehicle information. For example, the processing unit 21 acquires surrounding vehicle information including the current position, speed, and traveling trajectory of the surrounding vehicle RV from the surrounding vehicle RV via the vehicle-to-vehicle communication antenna 13 (vehicle-to-vehicle communication module 24). The processing unit 21 also acquires host vehicle information including the current position, speed, and traveling trajectory of the host vehicle SV via the sensor group 11 and the GNSS antenna 12 (GNSS module 23).

[0033] In step S106, the processing unit 21 (prediction unit 21b) predicts the possibility of a collision between the host vehicle SV and the peripheral vehicle RV within the target area TA based on the host vehicle information and the peripheral vehicle information acquired in step S105. The target area TA in which the prediction of the possibility of a collision between the host vehicle SV and the peripheral vehicle RV is performed is set to the first area TA1 in step S102 or to the second area TA2 in step S103. The prediction of the possibility of a collision within the target area TA will be described in detail later.

[0034] In step S107, the processing unit 21 (driving support unit 21c) determines whether there is a possibility of a collision between the host vehicle SV and the surrounding vehicle RV based on the prediction result in step S106. If it is determined that there is no possibility of a collision, the process proceeds to step S101, and if it is determined that there is a possibility of a collision, the process proceeds to step S108.

[0035] In step S108, the processing unit 21 (driving assistance unit 21c) determines whether the speed of the surrounding vehicle RV is within a specified range based on the surrounding vehicle information acquired in step S105. The specified range may be set in advance by a lower limit speed value and an upper limit speed value for the speed of the surrounding vehicle RV. If the speed of the surrounding vehicle RV is equal to or less than the lower limit speed value of the specified range, the driver of the surrounding vehicle RV is likely to notice the host vehicle SV and decelerate the surrounding vehicle RV without colliding with the host vehicle SV. In other words, the lower limit speed value of the specified range for the speed of the surrounding vehicle RV may be set to a value that allows the surrounding vehicle RV to decelerate without colliding with the host vehicle SV. Furthermore, if the speed of the surrounding vehicle RV is equal to or greater than the upper limit speed value of the specified range, the surrounding vehicle RV is likely not a vehicle traveling on the road into which the host vehicle SV is entering, such as traveling on an expressway near the road into which the host vehicle SV is entering. In other words, the upper limit of the specified range for the speed of the nearby vehicle RV can be set to a value that makes it possible to distinguish whether the nearby vehicle RV is traveling on the road into which the host vehicle SV is entering or a vehicle traveling on an expressway near the road. In this way, by performing / suppressing driving assistance depending on whether the speed of the nearby vehicle RV is within the specified range, it is possible to reduce the annoyance felt by the driver of the host vehicle SV due to the driving assistance.

[0036] If it is determined in step S108 that the speed of the surrounding vehicle RV is not within a specified range, i.e., is outside the specified range, the process proceeds to step S101. That is, in this embodiment, the processing unit 21 does not provide driving assistance for the host vehicle SV if the speed of the surrounding vehicle RV is outside the specified range, regardless of the collision possibility predicted in steps S106 to S107. On the other hand, if it is determined that the speed of the surrounding vehicle RV is within the specified range, the process proceeds to step S109, and the processing unit 21 (driving assistance unit 21c) provides driving assistance for the host vehicle SV. As driving assistance for the host vehicle SV, the processing unit 21 can notify the occupants of the host vehicle SV of the possibility of a collision using the alarm device 14, or perform a braking operation for the host vehicle SV using the braking device 15.

[0037] <Method for predicting the possibility of collision> Next, a method for predicting the collision possibility of the host vehicle SV in the above step S106 will be described. Examples of the collision possibility prediction method include the following Examples 1 to 3. The processing unit 21 can predict the collision possibility of the host vehicle SV using a prediction method of an example selected from Examples 1 to 3 depending on the situation and settings.

[0038] [Example 1] Hereinafter, a first embodiment of a method for predicting the collision possibility of the host vehicle SV will be described. In the first embodiment, an example of predicting the collision possibility of the host vehicle SV using a time to collision (TTC: Time To Collision) will be described. FIG. 7 is a flowchart showing a method (first embodiment) for predicting the collision possibility of the host vehicle SV in step S106. The flowchart in FIG. 7 can be executed by the processing unit 21 (prediction unit 21b). Also, FIG. 8 is a diagram for explaining the collision possibility prediction method in the first embodiment.

[0039] In step S201, the processing unit 21 estimates a route along which the host vehicle SV will travel in the future (future travel route) based on the host vehicle information acquired in step S105. For example, as shown in Fig. 8, the processing unit 21 can estimate a future travel route 41b of the host vehicle SV by extending a past travel route 41a of the host vehicle SV included in the host vehicle information along the travel route 41a.

[0040] In step S202, the processing unit 21 estimates a route along which the nearby vehicle RV will travel in the future (future travel route) based on the nearby vehicle information acquired in step S105. For example, as shown in Fig. 8, the processing unit 21 can estimate a future travel route 42b of the nearby vehicle RV by extending a past travel route 42a of the nearby vehicle RV included in the nearby vehicle information along the travel route 42a.

[0041] In step S203, the processing unit 21 determines whether the future traveling path 41b of the host vehicle SV estimated in step S201 and the future traveling path 42b of the peripheral vehicle RV estimated in step S202 intersect. If it is determined that the future traveling path 41b of the host vehicle SV and the future traveling path 42b of the peripheral vehicle RV do not intersect, the process proceeds to step S209, where the processing unit 21 determines that there is no possibility of a collision between the host vehicle SV and the peripheral vehicle RV, and then proceeds to step S107 of the flowchart in Fig. 6. On the other hand, if it is determined that the future traveling path 41b of the host vehicle SV and the future traveling path 42b of the peripheral vehicle RV will intersect, the process proceeds to step S204.

[0042] In step S204, the processing unit 21 determines, as an estimated intersection position CPe, the position where the future traveling path 41b of the host vehicle SV estimated in step S201 intersects with the future traveling path 42b of the peripheral vehicle RV estimated in step S202. The estimated intersection position CPe is a position where the host vehicle SV and the peripheral vehicle RV will both pass through, and if the estimated intersection position CPe is within the target area TA, it can be determined that there is a possibility that the host vehicle SV and the peripheral vehicle RV will collide at the estimated intersection position CPe. As described above, the target area TA is an area (driving assistance area) where driving assistance is provided to prevent a collision between the host vehicle SV and the peripheral vehicle RV, and is set to the first area TA1 in step S102 or the second area TA2 in step S103 of the flowchart in FIG. 6.

[0043] In step S205, the processing unit 21 determines whether the estimated intersection position CPe obtained in step S204 is within the target area TA. If it is determined that the estimated intersection position CPe is not within the target area TA, the processing proceeds to step S209, where the processing unit 21 determines that there is no possibility of a collision between the host vehicle SV and the surrounding vehicle RV, and then proceeds to step S107 in the flowchart of Fig. 6. On the other hand, if it is determined that the estimated intersection position CPe is within the target area TA, the processing proceeds to step S206. Note that Fig. 8 shows an example in which the estimated intersection position CPe is within the target area TA.

[0044] In step S206, the processing unit 21 predicts, as a collision possibility, the arrival time required for the surrounding vehicle RV to reach the estimated intersection position CPe, based on the surrounding vehicle information acquired in step S105. For example, the processing unit 21 can predict the arrival time (hereinafter, sometimes simply referred to as "arrival time") of the surrounding vehicle RV to the estimated intersection position CPe by dividing the distance between the surrounding vehicle RV and the estimated intersection position CPe by the speed of the surrounding vehicle RV, based on the current position and speed of the surrounding vehicle RV included in the surrounding vehicle information.

[0045] In step S207, the processing unit 21 determines whether the arrival time obtained in step S206 is equal to or less than a time threshold value. The time threshold value can be set by an occupant of the host vehicle SV. If the arrival time is equal to or less than the time threshold value, the processing unit 21 proceeds to step S208, where the processing unit 21 determines that there is a possibility of a collision between the host vehicle SV and the surrounding vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6. On the other hand, if the arrival time is greater than the time threshold value, the processing unit 21 proceeds to step S209, where the processing unit 21 determines that there is no possibility of a collision between the host vehicle SV and the surrounding vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6.

[0046] Here, the processing unit 21 may change the time threshold value according to the speed of the surrounding vehicle RV included in the surrounding vehicle information. FIG. 9 is a diagram showing the relationship between the speed of the surrounding vehicle RV and the stopping time of the surrounding vehicle RV. The stopping time of the surrounding vehicle RV is the time it takes for the surrounding vehicle RV to stop at a deceleration rate (e.g., 0.4 G) due to a typical braking operation. FIG. 9 shows a specified range (upper speed limit, lower speed limit) for the speed of the surrounding vehicle RV and an upper time limit and a lower time limit for the time to collision (TTC). As described above in step S108, the specified range is the speed range of the surrounding vehicle RV within which driving assistance is provided for the host vehicle SV. The upper time limit is the upper limit of the time to collision arbitrarily set by the driver or the like, and the lower time limit is the lower limit of the time to collision set based on the measurement position accuracy of the GNSS.

[0047] The processing unit 21 sets the stopping time corresponding to the speed of the surrounding vehicle RV as the time threshold based on the "relationship between the speed and the stopping time of the surrounding vehicle RV" represented by line 50 in FIG. 9. In a region 51 above the line 50, the arrival time is longer than the stopping time, and if the driver of the surrounding vehicle RV performs a typical braking operation (e.g., deceleration of 0.4 G), the surrounding vehicle RV can be stopped before reaching the estimated intersection position CPe. Therefore, if the arrival time is longer than the time threshold (stopping time), driving assistance for the host vehicle SV may be suppressed. On the other hand, in a region 52 below the line 50, the arrival time is shorter than the stopping time, and even if the driver of the surrounding vehicle RV performs a typical braking operation (e.g., deceleration of 0.4 G), the surrounding vehicle RV may reach the estimated intersection position CPe before stopping. Therefore, if the arrival time is equal to or shorter than the time threshold (stopping time), driving assistance for the host vehicle SV may be executed. Note that the processing unit 21 may change the time threshold continuously or stepwise according to the speed of the surrounding vehicle RV.

[0048] [Example 2] Hereinafter, a second embodiment of the method for predicting the collision possibility of the host vehicle SV will be described. In the second embodiment, an example will be described in which the collision possibility of the host vehicle SV is predicted using the time to collision (TTC), as in the first embodiment. However, in the second embodiment, when at least one registered intersection position CP exists within the target area TA, the collision possibility is predicted using information related to the registered intersection position CP. The method of the second embodiment can predict the collision possibility by simpler (easier) processing compared to the method of the first embodiment. FIG. 10 is a flowchart showing a method (second embodiment) for predicting the collision possibility of the host vehicle SV in step S106. The flowchart of FIG. 10 can be executed by the processing unit 21 (prediction unit 21b). Also, FIG. 11 is a diagram for explaining the collision possibility prediction method in the second embodiment. In the following, an example will be described in which only one registered intersection position CP exists within the predetermined distance D.

[0049] Here, the method of the second embodiment requires that at least one registered intersection position CP exists within the predetermined distance D and that the target area TA has been set to the second area TA2 via step S103. Furthermore, the method of the second embodiment requires that the nearby vehicle RV exists (is located) on the travel path of the other vehicle OV that was used when registering the registered intersection position CP within the target area TA (second area TA2) in the intersection position database of the storage unit 22. The travel path of the other vehicle OV is stored in the storage unit 22 in association with the registered intersection position CP, and the processing unit 21 can determine whether the nearby vehicle RV exists on the travel path of the other vehicle OV based on the travel path of the other vehicle OV and the nearby vehicle information (the current position of the nearby vehicle RV). If these conditions are not met, the processing unit 21 may predict the possibility of a collision using another prediction method, such as the above-described first embodiment.

[0050] In step S301, the processing unit 21 calculates the distance 43 between the nearby vehicle RV and the registered intersection position CP based on the nearby vehicle information acquired in step S105 and the registered intersection position CP within the target area TA (second area TA2). For example, the memory unit 22 stores the travel trajectory 32 of the other vehicle OV used when registering the registered intersection position CP in association with the registered intersection position CP. Based on the travel trajectory 32 of the other vehicle OV stored in association with the registered intersection position CP, the processing unit 21 can calculate the distance 43 between the nearby vehicle RV and the registered intersection position CP on the travel trajectory 32.

[0051] In step S302, the processing unit 21 predicts, as a collision possibility, the arrival time required for the surrounding vehicle RV to reach the registered intersection position CP, based on the distance 43 obtained in step S301 and the surrounding vehicle information acquired in step S105. For example, the processing unit 21 can predict the arrival time (hereinafter, sometimes simply referred to as "arrival time") of the surrounding vehicle RV to the registered intersection position CP by dividing the distance 43 by the speed of the surrounding vehicle RV included in the surrounding vehicle information.

[0052] In step S303, the processing unit 21 determines whether the arrival time obtained in step S302 is equal to or shorter than a time threshold. If the arrival time is equal to or shorter than the time threshold, the processing unit 21 proceeds to step S304, where the processing unit 21 determines that there is a possibility of a collision between the host vehicle SV and the surrounding vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6. On the other hand, if the arrival time is greater than the time threshold, the processing unit 21 proceeds to step S305, where the processing unit 21 determines that there is no possibility of a collision between the host vehicle SV and the surrounding vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6. Here, the time threshold can be set by an occupant of the host vehicle SV. Furthermore, the processing unit 21 may change the time threshold depending on the speed of the surrounding vehicle RV included in the surrounding vehicle information, as in the first embodiment.

[0053] [Example 3] Hereinafter, a third embodiment of the method for predicting the collision possibility of the host vehicle SV will be described. In the third embodiment, an example of predicting the collision possibility of the host vehicle SV using the stopping position of the surrounding vehicle RV will be described. FIG. 12 is a flowchart showing a method (third embodiment) for predicting the collision possibility of the host vehicle SV in step S106. The flowchart in FIG. 12 can be executed by the processing unit 21 (prediction unit 21b). Also, FIG. 13 is a diagram for explaining the collision possibility prediction method in the third embodiment.

[0054] In step S401, the processing unit 21 estimates a route (future driving route) that the host vehicle SV will travel in the future based on the host vehicle information acquired in step S105. Next, in step S402, the processing unit 21 estimates a route (future driving route) that the surrounding vehicle RV will travel in the future based on the surrounding vehicle information acquired in step S105. Note that steps S401 to S402 are similar to steps S201 to S202 in the flowchart of Fig. 7, and therefore detailed description thereof will be omitted here.

[0055] In step S403, the processing unit 21 determines whether the future traveling route of the host vehicle SV estimated in step S401 intersects with the future traveling route of the peripheral vehicle RV estimated in step S402. If it is determined that the future traveling route of the host vehicle SV and the future traveling route of the peripheral vehicle RV do not intersect, the process proceeds to step S409, where the processing unit 21 determines that there is no possibility of a collision between the host vehicle SV and the peripheral vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6. On the other hand, if it is determined that the future traveling route of the host vehicle SV and the future traveling route of the peripheral vehicle RV will intersect, the process proceeds to step S404. Note that step S403 is the same process as step S203 in the flowchart of FIG. 7, and therefore a detailed description thereof will be omitted here.

[0056] In step S404, the processing unit 21 determines, as an estimated intersection position CPe, the position where the future traveling path of the host vehicle SV estimated in step S401 intersects with the future traveling path of the peripheral vehicle RV estimated in step S402. Next, in step S405, the processing unit 21 determines whether the estimated intersection position CPe determined in step S404 is within the target area TA. If it is determined that the estimated intersection position CPe is not within the target area TA, the processing unit 21 proceeds to step S409, where it determines that there is no possibility of a collision between the host vehicle SV and the peripheral vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6. On the other hand, if it is determined that the estimated intersection position CPe is within the target area TA, the processing unit 21 proceeds to step S406. Note that steps S404 to S405 are similar to steps S204 to S205 in the flowchart of FIG. 7, and therefore detailed description thereof will be omitted here.

[0057] In step S406, the processing unit 21 predicts, as a collision possibility, a stopping position 44 where the nearby vehicle RV will decelerate from its current position at a predetermined deceleration, based on the nearby vehicle information acquired in step S105. The predetermined deceleration may be a deceleration caused by a typical brake operation (e.g., 0.4 G). For example, the processing unit 21 calculates, based on the current position and speed of the nearby vehicle RV included in the nearby vehicle information, a distance from its current speed until the nearby vehicle RV decelerates at the predetermined deceleration and stops, and adds this distance to the current position of the nearby vehicle RV, thereby predicting a stopping position 44 of the nearby vehicle RV (hereinafter, may be simply referred to as "stopping position 44") as shown in FIG. 13.

[0058] In step S407, the processing unit 21 determines whether the stop position 44 is ahead of the estimated intersection position CPe in the traveling direction of the peripheral vehicle RV. If the stop position 44 is ahead of the estimated intersection position CPe in the traveling direction of the peripheral vehicle RV, the process proceeds to step S408, where the processing unit 21 determines that there is a possibility of a collision between the host vehicle SV and the peripheral vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6. On the other hand, if the stop position 44 is not ahead of the estimated intersection position CPe in the traveling direction of the peripheral vehicle RV, that is, if the stop position 44 is behind (closer to) the estimated intersection position CPe in the traveling direction of the peripheral vehicle RV, the process proceeds to step S409, where the processing unit 21 determines that there is no possibility of a collision between the host vehicle SV and the peripheral vehicle RV, and then proceeds to step S107 in the flowchart of FIG. 6. Note that FIG. 13 shows an example in which the stop position 44 is behind the estimated intersection position CPe in the traveling direction of the peripheral vehicle RV.

[0059] <Registering a new intersection location> Next, a method for registering a new intersection position in the intersection position database of the memory unit 22 will be described. The new intersection position is a position where the host vehicle SV and the surrounding vehicle RV intersect, and is identified by the identification unit 21d of the processing unit 21 and registered in the intersection position database of the memory unit 22 by the registration unit 21e. FIG. 14 is a flowchart showing a method for registering a new intersection position. The flowchart of FIG. 14 can be executed by the processing unit 21 in parallel with the flowchart of FIG. 6. Note that the flowchart of FIG. 14 can be repeatedly executed, for example, until the driving assistance setting is turned off or the ignition of the host vehicle SV is turned off.

[0060] In step S501, the processing unit 21 determines whether or not there is a nearby vehicle RV. If it is determined that there is no nearby vehicle RV, step S501 is repeated, and if it is determined that there is a nearby vehicle RV, the processing unit 21 proceeds to step S502. Note that step S501 is the same process as step S104 in the flowchart of FIG. 6, and therefore a detailed description thereof will be omitted here. Furthermore, step S501 may be performed together with step S104 in the flowchart of FIG. 6. That is, step S501 may use the determination result in step S104 in the flowchart of FIG. 6.

[0061] In step S502, the processing unit 21 (acquisition unit 21a) acquires host vehicle information and surrounding vehicle information. Note that step S502 is the same process as step S105 in the flowchart of Fig. 6, and therefore a detailed description thereof will be omitted here. In addition, in this step S502, the host vehicle information and surrounding vehicle information acquired in step S105 in the flowchart of Fig. 6 may be used.

[0062] In step S503, the processing unit 21 (identification unit 21d) determines whether or not the host vehicle SV and the peripheral vehicle RV have intersected, based on the host vehicle information and the peripheral vehicle information acquired in step S502. An intersection between the host vehicle SV and the peripheral vehicle RV means that the host vehicle SV and the peripheral vehicle RV pass a common position at different times, and no collision has occurred between the host vehicle SV and the other vehicle OVa. For example, the processing unit 21 can determine whether or not the host vehicle SV and the peripheral vehicle RV have intersected, based on the travel path of the host vehicle SV included in the host vehicle information and the travel path of the peripheral vehicle RV included in the peripheral vehicle information. If it is determined that the host vehicle SV and the peripheral vehicle RV have not yet intersected, the processing proceeds to step S504, and if it is determined that the host vehicle SV and the peripheral vehicle RV have intersected, the processing proceeds to step S505.

[0063] In step S504, the processing unit 21 (identification unit 21d) determines whether or not an intersection between the host vehicle SV and the peripheral vehicle RV will not occur in the future, based on the host vehicle information and the peripheral vehicle information. For example, as shown in FIG. 15(a), when the host vehicle SV and the peripheral vehicle RV have passed each other and are moving away from each other, the processing unit 21 can determine that an intersection between the host vehicle SV and the peripheral vehicle RV will not occur in the future. Also, as shown in FIG. 15(b), when the peripheral vehicle RV is traveling in a parking lot or the like and the host vehicle SV and the peripheral vehicle RV are moving away from each other, the processing unit 21 can determine that an intersection between the host vehicle SV and the peripheral vehicle RV will not occur in the future. If it is determined that an intersection between the host vehicle SV and the peripheral vehicle RV will not occur in the future, the processing unit 21 proceeds to step S501, and if it is determined that an intersection between the host vehicle SV and the peripheral vehicle RV may occur in the future, the processing unit 21 proceeds to step S502.

[0064] In step S505, the processing unit 21 (identification unit 21d) identifies the position where the host vehicle SV and the peripheral vehicle RV intersect as a new intersection position CPn based on the host vehicle information and the peripheral vehicle information acquired in step S502. For example, the processing unit 21 can identify the position where the traveling trajectory of the host vehicle SV and the traveling trajectory of the peripheral vehicle RV intersect as a new intersection position CPn based on the traveling trajectory of the host vehicle SV included in the host vehicle information and the traveling trajectory of the peripheral vehicle RV included in the peripheral vehicle information.

[0065] In step S506, the processing unit 21 (registration unit 21e) registers the new intersection position CPn identified in step S505 in the intersection position database of the storage unit 22. If there is a limit to the number of registered intersection positions that can be registered in the intersection position database of the storage unit 22, the processing unit 21 deletes the oldest registered intersection positions from the intersection position database, and registers the new intersection position CPn in the intersection position database.

[0066] In step S507, the processing unit 21 (registration unit 21e) registers the travel locus of the nearby vehicle RV up to the new intersection position CPn in the intersection position database of the storage unit 22, in association with the new intersection position CPn, based on the nearby vehicle information acquired up to that point. For example, as shown in FIG. 16, the travel locus of the nearby vehicle RV is composed of a data string of multiple pass points 45 passed by the nearby vehicle RV, i.e., a data string of the current position included in the nearby vehicle information acquired up to that point. The multiple pass points 45 are sometimes called a pass history (path history) of the nearby vehicle RV. The processing unit 21 (registration unit 21e) registers pass points among the multiple pass points 45 that satisfy predetermined conditions as the travel locus of the nearby vehicle RV in association with the new intersection position CPn in the intersection position database of the storage unit 22, and does not register (i.e., delete) the other pass points. The specified conditions may include, for example, a first condition that the passing point 45 is within a specified distance from the new intersection position CPn, and a second condition that the difference between the orientation (passing orientation) of the surrounding vehicle RV when passing the passing point 45 and the orientation (passing orientation) of the surrounding vehicle RV when passing the new intersection position CPn is less than a threshold value.

[0067] 16, three of the multiple pass points 45a-45e, 45c-45e, are within the specified distance 46 from the new intersection position CPn and therefore satisfy the first condition. Furthermore, when the passing direction of the peripheral vehicle RV at the new intersection position CPn is taken as the reference direction 47, the difference between the reference direction 47 and two of the passing directions 48a-48e of the peripheral vehicle RV at each of the pass points 45a-45e, 48d-48e, is less than the threshold value. Therefore, the pass points 45d-45e corresponding to the passing directions 48d-48e, respectively, satisfy the second condition. In this case, the processing unit 21 (registration unit 21e) registers the pass points 45d-45e that satisfy the predetermined conditions (first and second conditions) among the multiple pass points 45 in the intersection position database of the storage unit 22 in association with the new intersection position CPn, and deletes the other pass points 45a-45c. This makes it possible to reduce (cut) the amount of data stored in the intersection position database of the storage unit 22. Note that the threshold value for the difference between the passing direction (reference direction) of the peripheral vehicle RV at the new intersection position CPn and the passing direction of the peripheral vehicle RV at each passing point can be set arbitrarily according to the amount of data in the storage unit 22. Also, although five passing points 45 are illustrated in Fig. 16, the number of passing points 45 is not limited to five and may be greater than five.

[0068] As described above, the driving assistance device 100 of this embodiment sets the target area TA to the first area TA1 and provides driving assistance for the host vehicle SV when none of the multiple registered intersection positions stored in the memory unit 22 is located within a predetermined distance ahead of the host vehicle SV. On the other hand, when at least one registered intersection position CP among the multiple registered intersection positions stored in the memory unit 22 is located within a predetermined distance ahead of the host vehicle SV, the driving assistance device 100 sets the target area TA to the second area TA2, which is larger than the first area TA1, and provides driving assistance for the host vehicle SV. This allows appropriate driving assistance for the host vehicle to be provided.

[0069] <Summary of the embodiment> 1. The driving assistance device (e.g., 100) of the above embodiment includes: a storage means (e.g., 22) for storing a plurality of intersection positions (e.g., CPs) each indicating a position where a travel path of a vehicle (e.g., SV) has intersected with a travel path of another vehicle (e.g., OV) in the past; Acquisition means (e.g., 21a) for acquiring surrounding vehicle information including a current position, speed, and travel path of a surrounding vehicle (e.g., RV) present around the host vehicle from the surrounding vehicle through vehicle-to-vehicle communication; a prediction means (e.g., 21b) for predicting a possibility of a collision between the host vehicle and the surrounding vehicle within a target area (e.g., TA) ahead of the host vehicle based on host vehicle information including a current position, speed, and travel trajectory of the host vehicle and the surrounding vehicle information acquired by the acquisition means; a support means (e.g., 21c) that provides driving support for the host vehicle, including at least one of notifying an occupant of the host vehicle and supporting deceleration of the host vehicle, based on the prediction result by the prediction means; Equipped with The prediction means If none of the plurality of intersection positions stored in the storage means is within a predetermined distance (e.g., D) ahead of the host vehicle, the target area is set to a first area (e.g., TA1) and the possibility of collision is predicted; If at least one of the plurality of intersection positions stored in the memory means is within the predetermined distance, the target area is set to a second area (e.g., TA2) larger than the first area, and the possibility of collision is predicted. According to this embodiment, when a crossing point where the travel path of the host vehicle and the travel path of another vehicle have previously intersected is stored for a road or the like including multiple lanes, the crossing point can be placed within a target area for driving assistance, thereby appropriately providing driving assistance to the host vehicle. In other words, the safety of the host vehicle can be improved.

[0070] 2. In the above embodiment, the storage means stores each of the plurality of intersection positions in association with a travel path of the other vehicle; When the at least one intersection position is present within the predetermined distance, the prediction means predicts the possibility of collision based on the driving trajectory of the other vehicle stored in the memory means in association with the at least one intersection position. According to this embodiment, it is possible to predict the possibility of a collision of the subject vehicle with a simpler (easier) process based on the travel path of the other vehicle stored in the storage means.

[0071] 3. In the above embodiment, the prediction means determines a position where a future travel path of the surrounding vehicle estimated based on the surrounding vehicle information acquired by the acquisition means intersects with a future travel path of the host vehicle estimated based on the host vehicle information as an estimated intersection position (e.g., CPe), and predicts an arrival time for the surrounding vehicle to arrive at the estimated intersection position as the collision probability; The assistance means performs the driving assistance when the arrival time is equal to or less than a time threshold, and does not perform the driving assistance when the arrival time is greater than the time threshold. According to this embodiment, it is possible to accurately predict the possibility of a collision of the host vehicle with a surrounding vehicle, and to appropriately provide driving assistance for the host vehicle in accordance with the collision possibility.

[0072] 4. In the above embodiment, the storage means stores each of the plurality of intersection positions in association with a travel path of the other vehicle; When the at least one intersection position is within the predetermined distance, the prediction means calculates a distance (e.g., 43) between the at least one intersection position and the surrounding vehicle based on a travel trajectory of the other vehicle stored in the storage means in association with the at least one intersection position, and predicts, as the collision possibility, an arrival time required for the surrounding vehicle to arrive at the at least one intersection position based on the distance and the surrounding vehicle information; The assistance means performs the driving assistance when the arrival time is equal to or less than a time threshold, and does not perform the driving assistance when the arrival time is greater than the time threshold. According to this embodiment, it is possible to accurately predict the possibility of collision of the host vehicle with a surrounding vehicle, and to appropriately provide driving assistance for the host vehicle according to the collision possibility. Furthermore, it is possible to predict the possibility of collision of the host vehicle with a surrounding vehicle through simpler (easier) processing based on the traveling trajectory of the other vehicle stored in the storage means.

[0073] 5. In the above embodiment, The assistance means changes the time threshold in accordance with the speed of the nearby vehicle in the nearby vehicle information. According to this embodiment, the possibility of a collision of the subject vehicle can be predicted with high accuracy in accordance with the speed of surrounding vehicles.

[0074] 6. In the above embodiment, The time threshold is configurable by an occupant of the host vehicle. According to this embodiment, the possibility of a collision of the host vehicle can be predicted with high accuracy in response to the request of the occupant of the host vehicle.

[0075] 7. In the above embodiment, the prediction means determines a position where a future travel path of the surrounding vehicle estimated based on the surrounding vehicle information acquired by the acquisition means intersects with a future travel path of the host vehicle estimated based on the host vehicle information as an estimated intersection position (e.g., CPe), and predicts a stopping position (e.g., 44) when the surrounding vehicle decelerates from its current position at a predetermined deceleration as the collision possibility; The assistance means provides the driving assistance when the stopping position is ahead of the estimated intersection position in the direction of travel of the surrounding vehicle, and does not provide the driving assistance when the stopping position is behind the estimated intersection position in the direction of travel of the surrounding vehicle. According to this embodiment, it is possible to accurately predict the possibility of a collision of the host vehicle with a surrounding vehicle, and to appropriately provide driving assistance for the host vehicle in accordance with the collision possibility.

[0076] 8. In the above embodiment, Regardless of the collision possibility predicted by the prediction means, the assistance means does not provide the driving assistance if the speed of the nearby vehicle in the nearby vehicle information is outside a specified range. According to this embodiment, driving assistance for the vehicle can be appropriately performed according to the speed of surrounding vehicles.

[0077] 9. In the above embodiment, an identification means (e.g., 21d) for identifying a position where the host vehicle and the surrounding vehicle intersect as a new intersection position (e.g., CPn) based on the host vehicle information and the surrounding vehicle information; The apparatus further comprises a registration means (for example, 21e) for registering the new intersection position identified by the identification means in the storage means. According to this embodiment, a newly identified intersection position can be stored in the storage means, and the plurality of intersection positions stored in the storage means can be appropriately updated.

[0078] 10. In the above embodiment, The traveling trajectory of the surrounding vehicle in the surrounding vehicle information is configured by a plurality of passing points (e.g., 45) through which the surrounding vehicle has passed, the registration means registers a passing point among the plurality of passing points that satisfies a predetermined condition in the storage means in association with the new intersection position; The specified conditions include a condition that the passing point is within a specified distance from the new intersection position, and a condition that the difference between the orientation of the surrounding vehicle when passing the passing point and the direction of the surrounding vehicle when passing the new intersection position is less than a threshold value. According to this embodiment, a passing point that satisfies a predetermined condition is selected from the plurality of passing points acquired and stored in the storage means, so that the amount of data stored in the storage means can be reduced.

[0079] 11. In the above embodiment, The second area is longer than the first area at least in the traveling direction of the host vehicle. According to this embodiment, the size of the target area can be changed so as to include the intersection position that exists ahead of the host vehicle, thereby improving the safety of the host vehicle.

[0080] The present invention is not limited to the above-described embodiments, and various changes and modifications can be made without departing from the spirit and scope of the present invention. [Explanation of symbols]

[0081] 11: Sensor group, 12: GNSS antenna, 13: Vehicle-to-vehicle communication antenna, 14: Notification device, 15: Braking device, 20: Control device, 21: Processing unit, 22: Storage unit, 23: GNSS module, 23: Vehicle-to-vehicle communication module, 100: Driving assistance device

Claims

1. a storage means for storing a plurality of intersection positions each indicating a position where a travel path of the vehicle and a travel path of another vehicle have intersected in the past; an acquisition means for acquiring surrounding vehicle information including current positions, speeds, and travel paths of surrounding vehicles present around the host vehicle from the surrounding vehicles via vehicle-to-vehicle communication; a prediction means for predicting a possibility of a collision between the host vehicle and the surrounding vehicle within a target area ahead of the host vehicle, based on host vehicle information including a current position, speed, and traveling trajectory of the host vehicle and the surrounding vehicle information acquired by the acquisition means; an assistance means for providing driving assistance for the host vehicle, including at least one of notifying an occupant of the host vehicle and assisting in deceleration of the host vehicle, based on the prediction result by the prediction means; Equipped with The prediction means If none of the plurality of intersection positions stored in the storage means is present within a predetermined distance ahead of the host vehicle, the target area is set to a first area and the possibility of collision is predicted; When at least one of the plurality of intersection positions stored in the storage means is present within the predetermined distance, the target area is set to a second area larger than the first area, and the possibility of collision is predicted. A driving assistance device characterized by:

2. the storage means stores each of the plurality of intersection positions in association with a travel path of the other vehicle; 2. The driving assistance device according to claim 1, wherein, when the at least one intersection position is within the predetermined distance, the prediction means predicts the possibility of collision based on a travel trajectory of the other vehicle that is stored in the storage means in association with the at least one intersection position.

3. the prediction means determines, as an estimated intersection position, a position where a future travel path of the surrounding vehicle estimated based on the surrounding vehicle information acquired by the acquisition means intersects with a future travel path of the host vehicle estimated based on the host vehicle information, and predicts, as the collision possibility, an arrival time for the surrounding vehicle to arrive at the estimated intersection position; The driving assistance device according to claim 1 , wherein the assistance means performs the driving assistance when the arrival time is equal to or less than a time threshold, and does not perform the driving assistance when the arrival time is greater than the time threshold.

4. the storage means stores each of the plurality of intersection positions in association with a travel path of the other vehicle; the prediction means, when the at least one intersection position is within the predetermined distance, calculates a distance between the at least one intersection position and the surrounding vehicle based on a travel trajectory of the other vehicle stored in the storage means in association with the at least one intersection position, and predicts, as the collision possibility, an arrival time required for the surrounding vehicle to arrive at the at least one intersection position based on the distance and the surrounding vehicle information; The driving assistance device according to claim 1 , wherein the assistance means performs the driving assistance when the arrival time is equal to or less than a time threshold, and does not perform the driving assistance when the arrival time is greater than the time threshold.

5. 5. The driving assistance device according to claim 3, wherein the assistance means changes the time threshold value in accordance with the speed of the nearby vehicle in the nearby vehicle information.

6. 5. The driving assistance device according to claim 3, wherein the time threshold can be set by an occupant of the host vehicle.

7. the prediction means determines, as an estimated intersection position, a position where a future travel path of the surrounding vehicle estimated based on the surrounding vehicle information acquired by the acquisition means intersects with a future travel path of the host vehicle estimated based on the host vehicle information, and predicts, as the collision possibility, a stopping position of the surrounding vehicle when it decelerates at a predetermined deceleration from its current position; 2. The driving assistance device according to claim 1, wherein the assistance means performs the driving assistance when the stop position is ahead of the estimated intersection position in the direction of travel of the surrounding vehicle, and does not perform the driving assistance when the stop position is behind the estimated intersection position in the direction of travel of the surrounding vehicle.

8. 2. The driving assistance device according to claim 1, wherein the assistance means does not provide the driving assistance when the speed of the surrounding vehicle in the surrounding vehicle information is outside a specified range, regardless of the collision possibility predicted by the prediction means.

9. an identification means for identifying a position where the host vehicle and the surrounding vehicle intersect as a new intersection position based on the host vehicle information and the surrounding vehicle information; a registering means for registering the new intersection position identified by the identifying means in a storage means; The driving assistance device according to claim 1, further comprising:

10. the travel path of the surrounding vehicle in the surrounding vehicle information is configured by a plurality of passing points through which the surrounding vehicle has passed, the registration means registers a passing point among the plurality of passing points that satisfies a predetermined condition in the storage means in association with the new intersection position; 10. The driving assistance device according to claim 9, wherein the predetermined conditions include a condition that the passing point is within a specified distance from the new intersection position, and a condition that a difference between the orientation of the surrounding vehicle when passing the passing point and the orientation of the surrounding vehicle when passing the new intersection position is less than a threshold value.

11. The driving assistance device according to claim 1 , wherein the second area is longer than the first area at least in the traveling direction of the host vehicle.

12. A driving assistance method in which a computer assists a vehicle in driving, comprising: a storage step of storing a plurality of intersection positions each indicating a position where a travel path of the host vehicle and a travel path of another vehicle have intersected in the past; an acquisition step of acquiring surrounding vehicle information including current positions, speeds, and travel paths of surrounding vehicles present around the host vehicle from the surrounding vehicles via vehicle-to-vehicle communication; a prediction step of predicting a possibility of a collision between the host vehicle and the surrounding vehicle within a target area ahead of the host vehicle based on host vehicle information including a current position, speed, and traveling trajectory of the host vehicle and the surrounding vehicle information acquired in the acquisition step; an assistance step of providing driving assistance for the host vehicle, the driving assistance step including at least one of notifying an occupant of the host vehicle and assisting in deceleration of the host vehicle, based on a prediction result in the prediction step; Including, In the prediction step, If none of the plurality of intersection positions stored in the storage step is present within a predetermined distance ahead of the host vehicle, the target area is set to a first area and the possibility of collision is predicted; When at least one of the plurality of intersection positions stored in the storing step is present within the predetermined distance, the target area is set to a second area larger than the first area, and the possibility of collision is predicted. A driving assistance method comprising:

13. A program for causing a computer to execute a driving assistance method, The driving assistance method includes: a storage step of storing a plurality of intersection positions each indicating a position where a travel path of the host vehicle and a travel path of another vehicle have intersected in the past; an acquisition step of acquiring surrounding vehicle information including current positions, speeds, and travel paths of surrounding vehicles present around the host vehicle from the surrounding vehicles via vehicle-to-vehicle communication; a prediction step of predicting a possibility of a collision between the host vehicle and the surrounding vehicle within a target area ahead of the host vehicle based on host vehicle information including a current position, speed, and traveling trajectory of the host vehicle and the surrounding vehicle information acquired in the acquisition step; an assistance step of providing driving assistance for the host vehicle, the driving assistance step including at least one of notifying an occupant of the host vehicle and assisting in deceleration of the host vehicle, based on a prediction result in the prediction step; Including, In the prediction step, If none of the plurality of intersection positions stored in the storage step is present within a predetermined distance ahead of the host vehicle, the target area is set to a first area and the possibility of collision is predicted; When at least one of the plurality of intersection positions stored in the storing step is present within the predetermined distance, the target area is set to a second area larger than the first area, and the possibility of collision is predicted. A program characterized by:

Citation Information

Patent Citations

  • Drive support device

    JP2017091502A

  • Driving support apparatus

    JP2017111576A

  • Driving support device

    JP2017126219A

  • Drive support device

    JP2019159975A

  • Driving assistance device, vehicle, and driving assistance method

    JP2022138596A