JP2011136662A - Device and method for supporting traveling - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a device and a method for supporting traveling accurately and easily setting a region where a vehicle is scheduled to pass and determining whether an object is present or not in the region. <P>SOLUTION: As a traveling control point Q is a point virtually provided on a traveling route RT1-RT3, an obstacle determining region E in the traveling control point Q is a part of an actual traveling region F1. Therefore, as the region obtained by summing up all the obstacle determining regions E in respective traveling control points Q becomes a part of a traveling region F1 where a vehicle 1 actually travels, a region F3 obtained by summing up all the obstacle determining regions E can be regarded as the traveling region of the vehicle 1. Accordingly, even if a region F2 where the vehicle 1 actually travels is not calculated, the traveling region corresponding to the traveling route RT1-RT3 can be set accurately and easily, and whether the obstacle is present or not on the traveling route corresponding to the traveling route RT1-RT3 can be determined. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a driving support device and a driving support method, and in particular, a driving support device that can easily and accurately set a region where a vehicle is to pass and determine whether or not an object exists in the region. And a driving support method.

  2. Description of the Related Art Conventionally, a driving support device that supports a driving operation of a driver when the driver drives the vehicle and parks the vehicle in a target parking space is known. With regard to this type of driving support device, the following Patent Document 1 discloses that the driver moves the host vehicle to a target parking space if the driver moves the vehicle backward with a minimum turning radius and then moves straight forward. A technology is disclosed that prompts the driver to perform a driving operation by displaying a reverse start position at which the vehicle can travel on a monitor provided in the vehicle.

JP 2006-160147 A (paragraph 0037, etc.)

  However, the driving support device described in Patent Document 1 is inconvenient for the driver because it is necessary for the driver to check an object existing on the driving route of the vehicle while actually driving the vehicle. . Therefore, there is a demand for determining whether or not an object exists on the travel route of the vehicle without actually traveling the vehicle. However, in order to calculate the region through which the vehicle actually passes in order to reach the target position from the initial position, complicated calculation is required and processing costs are increased. Further, if a region having a simple shape including a region through which the vehicle actually passes is regarded as a region through which the vehicle passes so that the region through which the vehicle passes can be easily calculated.

  The present invention has been made to solve the above-described problems, and accurately and easily set an area where a vehicle is to pass, and determines whether or not an object exists in the area. An object of the present invention is to provide a driving support device and a driving support method that can be used.

Means for Solving the Problems and Effects of the Invention

  According to the travel support apparatus of the first aspect, the position information of the travel control point for controlling the vehicle is acquired by the travel control point acquiring means, and the route is estimated that the vehicle occupies the travel control point. The position information of the estimated occupied area in is acquired by the area acquiring means. Then, based on the position information of the object detected by the detection means and the position information of the estimated occupied area, it is determined by the determining means whether an object exists in the estimated occupied area. The estimated occupied area is an area that is estimated to be occupied by a vehicle traveling on the route. Therefore, by determining whether or not an object exists in the estimated occupied area, the estimated occupied area is within the area where the vehicle is actually going to pass. It can be determined whether or not an object exists. Therefore, without accurately calculating the area where the vehicle actually passes, it is possible to easily and accurately set the area where the vehicle will pass and determine whether or not an object exists in that area. .

  According to the driving support apparatus according to claim 2, in addition to the effect achieved by the driving support apparatus according to claim 1, the area acquisition means acquires the position information using the rectangular area as the estimated occupied area. The position information of the estimated occupied area can be obtained more easily than when the shape of the area is complicated. Therefore, there is an effect that it is possible to set a region through which the vehicle is to pass with a small processing cost.

  According to the driving support apparatus according to the third aspect, in addition to the effect exhibited by the driving support apparatus according to the first or second aspect, the following effect is achieved. That is, the travel control point is set by the travel control point acquisition means so that the distance between the adjacent travel control points in the travel route from the initial position to the target position is shorter than the total length of the vehicle. Information is acquired. Therefore, since a part of the estimated occupied area of each traveling control point overlaps with the estimated occupied area of the adjacent traveling control point, when the estimated occupied areas at each traveling control point are respectively overlapped, It becomes an area. Therefore, when the estimated occupied areas at the respective travel control points are superimposed, there is an effect that the area through which the vehicle is to pass can be set more accurately than when the estimated occupied areas are separated.

  According to the driving support method of the fourth aspect, the same operation and effect as the driving support device of the first aspect can be achieved by controlling the driving of the vehicle by the method.

It is the schematic diagram which showed typically the top view of the vehicle by which the driving assistance device which is an example of this invention is mounted. It is a schematic diagram for demonstrating an example of the traveling control point produced | generated with respect to the whole traveling route. It is a schematic diagram which shows an example of the route pattern used in order to produce | generate a pattern driving | running | working part among the whole driving | running routes. It is a schematic diagram for demonstrating the movement destination at the time of moving a vehicle according to a route pattern, and the vehicle azimuth | direction. (A) is a schematic diagram for demonstrating an example of the route point on a driving | running route, (b) is a schematic diagram for demonstrating parking possible conditions. It is the block diagram which showed the electrical structure of the driving assistance apparatus. It is a flowchart which shows the automatic parking process performed by a driving assistance device. It is a flowchart which shows the point path | route production | generation process performed by a driving assistance device. It is a flowchart which shows the pattern driving | running | working part control point production | generation process of a driving assistance device. It is a schematic diagram for demonstrating an example of the traveling control point produced | generated with respect to a pattern traveling part among the whole traveling paths. It is a flowchart which shows the reverse turning part control point production | generation process of a driving assistance device. It is a schematic diagram for demonstrating an example of the traveling control point produced | generated with respect to a reverse turning part among the whole traveling paths. It is a flowchart which shows the last reverse part control point production | generation process of a driving assistance device. It is a schematic diagram for demonstrating an example of the traveling control point produced | generated with respect to the last reverse part among the whole traveling paths. It is a flowchart which shows the confirmation process in a driving | running | working area of a driving assistance device. (A) is a schematic diagram for demonstrating an example of the obstruction determination area | region in each traveling control point, (b) is a schematic diagram which shows an example of the shape of a vehicle and the shape of an obstruction determination area | region. is there. (C) is a schematic diagram for explaining a method of calculating an obstacle determination area of a vehicle when the vehicle position and the vehicle orientation of the vehicle are determined. (A) is a schematic diagram which shows an example of the driving | running | working area | region which is an area | region where a vehicle actually drive | works, (b) shows an example when the strip | belt-shaped area | region formed by a concentric circle is considered as a driving | running | working area | region of a vehicle. It is a schematic diagram. (C) is a schematic diagram illustrating an example of a case where a region in which an obstacle determination region for each traveling control point is added is regarded as a traveling region of the vehicle, and (d) is a diagram in which an interval between the traveling control points is narrowed. It is a schematic diagram for demonstrating an example of the driving | running | working area | region of the vehicle at the time of having performed. It is a schematic diagram for demonstrating the classification | category of 16 types of judgment conditional expressions. It is a schematic diagram for demonstrating the calculation method of the various constants used in a judgment conditional expression.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings. FIG. 1 is a schematic view schematically showing a top view of a vehicle 1 on which a driving support device 100 as an example of the present invention is mounted. Note that arrows UD, LR, and FB in FIG. 1 indicate the up-down direction, the left-right direction, and the front-rear direction of the vehicle 1, respectively.

  First, a schematic configuration of the vehicle 1 will be described with reference to FIG. The vehicle 1 is a vehicle that can be operated by a driver. The vehicle 1 can autonomously travel from the current position to a parking position targeted by the driver, and can park the vehicle 1 at the parking position. A travel support device 100 is provided.

  When the target parking position is set by the driver, the driving support device 100 determines from the current position to the target parking position based on a combination of route patterns PT1 to PT10 (see FIG. 3) stored in advance. The travel routes RT1 to RT3 (see FIG. 5A) of the vehicle 1 are generated. Then, before starting the autonomous traveling of the vehicle 1, it is determined whether there are any obstacles on the traveling routes RT1 to RT3. If there are no obstacles, the generated traveling routes RT1 to RT3 are determined. The vehicle 1 is autonomously driven according to the above, and the vehicle 1 is stopped at the target parking position.

  In the present embodiment, when the vehicle 1 is parked at the target parking position, the left and right rear wheels 2RL, 2RR are on the axles on the x axis, the front and rear axes on the vehicle 1 are on the y axis, and the x axis and y Using the coordinate system with the intersection of the axes as the origin O, the position of the vehicle 1 and the positions of the travel routes RT1 to RT3 are calculated.

  Therefore, in the following description, each position of the vehicle 1 and the travel routes RT1 to RT3 is shown using this coordinate system. Further, the intersection of the front and rear axes of the vehicle 1 and the axles of the left and right rear wheels 2RL and 2RR in the vehicle 1 is used as the reference point of the vehicle 1, and the position of the reference point of the vehicle 1 in the above-described coordinate system is defined as the vehicle of the vehicle 1 Position. Further, the direction in which the vehicle 1 is traveling in the longitudinal axis direction of the vehicle 1 is defined as the traveling direction of the vehicle 1.

  As shown in FIG. 1, the vehicle 1 includes a body frame BF, a plurality of (four wheels in this embodiment) wheels 2FL, 2FR, 2RL, 2RR supported by the body frame BF, and the plurality of wheels 2FL˜ A wheel drive device 3 for rotationally driving a part of 2RR (in this embodiment, left and right front wheels 2FL, 2FR), a suspension device 4 for suspending each wheel 2 on a vehicle body frame BF, and a plurality of wheels 2 Are mainly provided with a steering device 6 and a steering drive device 5 for steering a part (in this embodiment, left and right front wheels 2FL, 2FR).

  Next, the detailed configuration of each part will be described. The vehicle body frame BF forms a skeleton of the vehicle 1, supports the suspension device 4, and supports the wheels 2 via the suspension device 4. The suspension device 4 is a device that functions as a so-called suspension, and is provided on each wheel 2 independently as shown in FIG.

  As shown in FIG. 1, the wheels 2FL and 2FR are left and right front wheels disposed on the front side (arrow F side) of the body frame BF, and are configured as drive wheels that are rotationally driven by the wheel drive device 3. . On the other hand, the wheels 2RL and 2RR are left and right rear wheels disposed on the rear side (arrow B side) of the body frame BF, and are configured as driven wheels that are driven as the vehicle 1 travels.

  The wheel drive device 3 includes a motor 3a (see FIG. 6) that applies a rotational driving force to the left and right front wheels 2FL and 2FR. The motor 3a is connected to the left and right front wheels 2FL, 2FR via a differential gear (not shown) and a pair of drive shafts 31.

  For example, when the driver operates the accelerator pedal 11, a rotational driving force is applied from the motor 3a to the left and right front wheels 2FL and 2FR, and the left and right front wheels 2FL and 2FR are inclined (inclination angle, It is rotationally driven at a speed corresponding to the inclination speed. The difference in rotation between the left and right front wheels 2FL and 2FR is absorbed by the differential gear.

  As shown in FIG. 1, the steering device 6 mainly includes a steering shaft 61, a hook joint 62, a steering gear 63, a tie rod 64, and a knuckle arm 65. In the steering device 6, the steering gear 63 is configured by a rack and pinion mechanism including a pinion (not shown) and a rack (not shown).

  For example, when the driver operates the steering wheel 13, the operation of the steering wheel 13 is transmitted to the hook joint 62 through the steering shaft 61, and the angle is changed by the hook joint 62, and the pinion of the steering gear 63 rotates. As transmitted. Then, the rotational motion transmitted to the pinion is converted into the linear motion of the rack, and the rack moves linearly, whereby the tie rods 64 connected to both ends of the rack move, and the wheel 2 is steered via the knuckle arm 65. The

  A steering sensor device 21 that calculates the steering angle δ of the left and right front wheels 2FL, 2FR and outputs it to the CPU 91 is attached to the steering shaft 61. The steering sensor device 21 calculates the steering angle δ of the left and right front wheels 2FL, 2FR based on the rotation angle of the steering shaft 61 from the reference position, and the calculation result is a CPU 91 (FIG. 6) provided in the travel support device 100. Output).

  Similar to the steering device 6, the steering drive device 5 is a device for steering the left and right front wheels 2FL, 2FR, and includes a motor 5a (see FIG. 6) that applies a rotational driving force to the steering shaft 61. ing. That is, when the motor 5a is driven and the steering shaft 61 rotates, the wheels 2 are steered in the same manner as when the steering wheel 13 is operated by the driver.

  The accelerator pedal 11, the brake pedal 12, and the steering wheel 13 are all operation members controlled by the driver, and the acceleration force of the vehicle 1 according to the inclination state (inclination angle, inclination speed, etc.) of the pedals 11 and 12. And the braking force are determined, and the turning radius and turning direction of the vehicle 1 are determined according to the operation state (operation amount, operation direction) of the steering wheel 13.

  The automatic parking switch 24 is a switch that is pressed by the driver when the vehicle 1 is to be parked at a target parking position by autonomous traveling. A parking process (see FIG. 7) is executed. As a result, the vehicle 1 is autonomously traveled from the current position to the parking position targeted by the driver, and the vehicle 1 is stopped at the parking position.

The gyro sensor device 22 is a device for detecting a roll angle, a pitch angle, and a yaw angle with respect to a horizontal plane of the vehicle 1 and outputting the detection result to the CPU 91, and a reference axis (see FIG. A gyro sensor (not shown) for detecting rotation angles (roll angle, pitch angle, yaw angle) of the vehicle 1 (body frame BF) around one arrow FB, LR, UD direction axis) An output circuit (not shown) that mainly processes the detection result of the gyro sensor and outputs it to the CPU 91 is provided.

  In the following description, the yaw angle of the vehicle 1 is described as the vehicle orientation of the vehicle 1. Note that the reference axis of the vehicle orientation in the vehicle 1 is the x-axis described above, and the counterclockwise angle from the x-axis to the traveling direction of the vehicle 1 is the vehicle orientation of the vehicle 1.

  The first to third distance sensors 23a to 23c are devices for outputting distance data to an object existing around the vehicle 1 to the CPU 91 (see FIG. 6). Each of the distance sensors 23a, 23b, and 23c is configured by a laser range finder that irradiates a laser beam toward an object and measures the distance to the object with the degree of reflection.

  More specifically, each of the distance sensors 23a to 23c radiates a laser beam radially every 0.5 degrees in the circumferential direction within a range of about 270 degrees, and is located on a radially extending straight line. And the entire scanning within the range of about 270 degrees is completed in about 100 ms. Therefore, by this scanning, points indicating the contour of the object are measured piecewise, and each distance is output to the CPU 91.

  The first distance sensor 23a is attached to the right end of the front surface of the vehicle 1, and scans the range from the front surface of the vehicle 1 to the right side surface in the outward direction to detect the distance to the object. Similarly, the second distance sensor 23b is attached to the left end of the front surface of the vehicle 1, scans the range from the front surface of the vehicle 1 to the left side surface outward, and the third distance sensor 23c is located at the center of the rear surface of the vehicle 1. It is attached, and the rear surface of the vehicle 1 is scanned outward to detect the distance to the object. In the present embodiment, the three distance sensors 23a to 23c can detect the distances to the respective objects existing in an area of at least 60 m square with the vehicle 1 as the center.

  Since the front surface of the vehicle 1 is scanned twice by the first distance sensor 23a and the second distance sensor 23b, an obstacle existing in front of the vehicle 1 can be detected with higher accuracy. That is, when there is only one distance sensor that scans the front surface of the vehicle 1, if there is an obstacle in front of the vehicle 1, the laser light emitted from the distance sensor is reflected by the obstacle in front. The laser beam does not reach the back side of the obstacle, and it is unclear whether the region where the laser beam cannot reach can travel.

  However, by scanning the front surface of the vehicle 1 from different angles with the two distance sensors, even if the laser light of one distance sensor does not reach the back side of the obstacle ahead, the laser of the other distance sensor Light may arrive. Therefore, since the obstacle existing in front of the vehicle 1 can be detected with higher accuracy, the region in which the vehicle 1 can be determined to be able to travel can be increased.

  Scanning around the vehicle 1 by the distance sensors 23a, 23b, and 23c is repeatedly performed at regular intervals (for example, 100 ms), and the scanning results measured by the distance sensors 23a to 23c each time the scanning ends. Are output to the CPU 91 individually. The CPU 91 combines the scanning results output from the processing sensors 23a to 23c into one to generate a scanning result for the entire periphery of the vehicle 1, and the scanning result is stored in the vehicle surrounding information memory 93a in the RAM 93 (see FIG. 6). ).

  The driving support device 100 controls the wheel driving device 3, the steering driving device 5, the brake device (not shown), and the like to cause the vehicle 1 to autonomously travel from the current position to the parking position targeted by the driver. The vehicle 1 is stopped at the parking position.

  In the present embodiment, when the automatic parking switch 24 is pressed by the driver and a target parking position is set by the driver, the driving routes RT1 to RT3 that can reach the target position from the current position by the driving support device 100. Is generated (see FIG. 2). The entire travel routes RT1 to RT3 are composed of three parts: a pattern travel part RT1, a reverse turning part RT2, and a final reverse part RT3.

  The travel routes RT1 to RT3 are continuously configured as lines, but the data indicating the travel routes RT1 to RT3 is composed of data indicating points at predetermined intervals among the points constituting the travel routes RT1 to RT3. Is done. Hereinafter, this point at every predetermined interval is referred to as a route point P, and data indicating the route point P is referred to as route point information. The route point P is a point that should be passed when the vehicle 1 autonomously travels on the travel routes RT1 to RT3. The route point information includes the vehicle position of the vehicle 1 at the route point P and the route point P. And a vehicle orientation θ of the vehicle 1. The route point information of each route point P is stored in a point route memory 93c (see FIG. 6) described later. Although details will be described later, for example, in the case of the travel route RT1, the points at intervals of 2 m among the points constituting the travel route RT1 are set as the route points P.

  In the present embodiment, when the entire travel routes RT1 to RT3 are generated, a travel control point Q, which is a point for controlling the vehicle state of the vehicle 1 when the travel support device 100 causes the vehicle 1 to travel autonomously next. Is virtually generated at intervals of 0.05 m on the travel routes RT1 to RT3. That is, in this embodiment, the traveling state of the vehicle 1 is controlled every 0.05 m.

  A travel control point Q is always generated on each route point P excluding the route point P0 (current position of the vehicle 1). Further, vehicle setting information for setting the vehicle state of the vehicle 1 is generated for each traveling control point Q, and the vehicle setting information for each traveling control point Q is stored in a traveling control point memory 93d (see FIG. 6) described later. Is stored respectively.

  Although details of the vehicle setting information will be described later, the travel control device 100 causes the travel control point Q to reach each travel control point Q when the vehicle 1 autonomously travels along the travel routes RT1 to RT3. The traveling state of the vehicle 1 is set based on the vehicle setting information corresponding to, and the vehicle 1 is autonomously traveled to the parking position targeted by the driver.

  Here, the travel routes RT1 to RT3 generated by the travel support device 100 and the travel control points Q generated for the travel routes RT1 to RT3 will be described with reference to FIG. FIG. 2 is a schematic diagram for explaining an example of the entire travel routes RT1 to RT3, a route point P indicating the travel routes RT1 to RT3, and a travel control point Q generated for the travel routes RT1 to RT3. FIG.

  Hereinafter, in the drawings including the travel routes RT1 to RT3 including FIG. 2, the route point P is indicated by a white circle, and the travel control point Q is indicated by a black circle. Further, the route point P0 indicates the current position of the vehicle 1, and the route point P8 indicates the parking position targeted by the driver. The details of the other route points P1 to P7 will be described later. In addition, the traveling control points Q are originally generated at intervals of 0.05 m, but only a part of the traveling control points Q is shown for easy understanding of the drawing.

  As described above, the entire travel routes RT1 to RT3 are configured by the pattern travel portion RT1, the reverse turning portion RT2, and the final reverse portion RT3. The pattern travel unit RT1 is a travel route generated by a combination of route patterns PT1 to PT10 stored in a route pattern memory 92c (see FIG. 6) described later. In the example shown in FIG. 2, the travel route from the route point P0 to the route point P6 is the pattern travel unit RT1.

  Further, the reverse turning portion RT2 is a travel route following the pattern travel portion RT1, and is a travel route from the end of the pattern travel portion RT1 to the vehicle position where the vehicle 1 can be moved straight back to the target parking position. It is. In the example shown in FIG. 2, the route from the route point P6 to the route point P7 is the backward turning portion RT2. In the reverse turning section RT2, the travel route is determined so that the vehicle 1 makes a reverse turn at the same steering angle δ.

  The final reverse portion RT3 is a travel route that follows the reverse turning portion RT2, and is a travel route from the end of the reverse turning portion RT2 to the target parking position. In the example shown in FIG. 2, the route from the route point P7 to the route point P8 is the final retreat part RT3. Note that the travel path of the final reverse portion RT3 is determined so that the vehicle 1 moves straight backward.

  Here, the path patterns PT1 to PT10 will be described with reference to FIG. FIG. 3 is a schematic diagram showing an example of route patterns PT1 to PT10 used for generating the pattern travel portion RT1 out of the entire travel routes RT1 to RT3.

  In the present embodiment, ten types of fragmented travel routes are preset, and each is stored as a route pattern in a route pattern memory 92c (see FIG. 6) described later. Ten types of route patterns PT1 to PT10 are assigned pattern numbers from “PT1” to “PT10”. In the 10 types of route patterns PT1 to PT10, the trajectories of the respective travel routes are different, but the lengths (namely, travel distances) CL of the respective travel routes are all set to 2 m. The pattern travel unit RT1 is generated by combining travel routes corresponding to the route patterns PT1 to PT10.

  In the pattern travel unit RT1, the start point and the end point of the travel route corresponding to the route patterns PT1 to PT10 are route points P, respectively. That is, the route points P1 to P5 indicate connection points of travel routes corresponding to the route patterns PT1 to PT10.

The route pattern PT1 is a pattern that indicates a travel route that moves the vehicle 1 straight forward from the route point P _i and moves 2 m, and the route pattern PT2 indicates a travel route that moves the vehicle 1 backward from the route point P _i and moves 2 m. It is a pattern.

Pathway pattern PT3 are the turning radius R of the vehicle 1 and 2 times the minimum turning radius, a pattern indicating a travel route to 2m moves to the front left turning of the vehicle 1 from the path points P _i, Similarly, the route pattern PT4 Makes the turning radius R of the vehicle 1 twice the minimum turning radius and turns the vehicle 1 forward right, and the route pattern PT5 sets the turning radius R of the vehicle 1 twice the minimum turning radius and turns the vehicle 1 backward to the left. The route pattern PT6 is a pattern showing a traveling route in which the turning radius R of the vehicle 1 is set to twice the minimum turning radius, the vehicle 1 is turned backward by the turning radius R, and each vehicle is moved 2 m.

The route pattern PT7 is the turning radius R of the vehicle 1 and the minimum turning radius, a pattern indicating a travel route to 2m moves to the front left turning of the vehicle 1 from the path points P _i, following Similarly, the route pattern PT8 is The vehicle 1 is turned to the right and the vehicle 1 is turned to the right with the turning radius R of the vehicle 1 being the minimum turning radius. The route pattern PT9 is turned to the left with the turning radius R of the vehicle 1 being the minimum turning radius and the route pattern PT10 is This is a pattern showing a traveling route in which the turning radius R of the vehicle 1 is set to the minimum turning radius, the vehicle 1 is turned backward, and the vehicle 1 is moved 2 m.

Referring now to FIG. 4, the destination in each path points P and vehicle direction θ corresponding explaining the case of moving the vehicle 1 from the path points P _i in accordance with the route pattern PT1～PT10. FIG. 4 is a schematic diagram for calculating each route point P and vehicle orientation θ corresponding to the destination when the vehicle 1 is moved according to the route patterns PT1 to PT10. Here, the route point P _i (x _i , y _i ) indicates the vehicle position of the vehicle 1 before movement. Further, the vehicle orientation of the vehicle 1 at the route point P _i is denoted by θ _i, and the traveling direction of the vehicle 1 is denoted by an arrow.

First, the route point P _A (x _A , y _A ) corresponding to the destination when the vehicle 1 is moved from the route point P _i according to the route pattern PT8 and the vehicle direction θ _A at the route point P _A are obtained. A calculation method will be described.

If the travel distance of the vehicle 1 and CL, the turning radius of the vehicle 1 and R, which further includes a vehicle direction theta _A in the route point P _A, and Δθ the variation of the vehicle direction theta _i in the route point P _i, The amount of change Δθ is
Δθ = CL / R
Can be calculated. Therefore, the route point P _A (x _A , y _A ) and the vehicle orientation θ _{A at the} route point P _A are:
θ _A = θ _i −Δθ
x _A = x _i + 2R · sin (Δθ / 2) · cos (θ _i −Δθ / 2)
y _A = y _i + 2R · sin (Δθ / 2) · sin (θ _i −Δθ / 2)
Can be calculated. Similarly, for the route pattern PT4, the route point P and the vehicle orientation θ can be calculated by this equation.

Next, the route point _{P B (x B, y B} ) corresponding to the destination when moving the vehicle 1 from the path points _{P i} in accordance with the route pattern PT7 and, heading theta _B at the path point _{P B} A method for calculating the value will be described. The change amount Δθ in the vehicle direction theta _B in the path point P _B, and heading theta _i in the route point P _i can be calculated similarly by the above expression. Therefore, the route point P _B (x _B , y _B ) and the vehicle orientation θ _{B at the} route point P _B are:
θ _B = θ _i + Δθ
x _B = x _i + 2R · sin (Δθ / 2) · cos (θ _i + Δθ / 2)
y _B = y _i + 2R · sin (Δθ / 2) · sin (θ _i + Δθ / 2)
Can be calculated. Similarly, for the route pattern PT3, the route point P and the vehicle orientation θ can be calculated by this equation.

Similarly, path points corresponding to the destination when moving the vehicle 1 from the path points P _i in accordance with the route pattern _{PT9 P C (x C, y} C) and, heading θ at that path points P _{C With C}
θ _C = θ _i −Δθ
x _C = x _i + 2R · sin (Δθ / 2) · cos (θ _i −Δθ / 2−π)
y _C = y _i + 2R · sin (Δθ / 2) · sin (θ _i −Δθ / 2−π)
Can be calculated. Similarly, for the route pattern PT5, the route point P and the vehicle orientation θ can be calculated by this equation.

The route point _{P D (x D, y D} ) that corresponds to the destination when moving the vehicle 1 from the path points _{P i} in accordance with the route pattern PT10 and the vehicle direction theta _D at the path point _{P D} Is
θ _D = θ _i + Δθ
x _D = x _i + 2R · sin (Δθ / 2) · cos (θ _i + Δθ / 2−π)
y _D = y _i + 2R · sin (Δθ / 2) · sin (θ _i + Δθ / 2−π)
Can be calculated. Similarly, for the route pattern PT6, the route point P and the vehicle orientation θ can be calculated by this equation.

Further, although not shown, the route point _{P E (x E, y E} ) that corresponds to the destination when moving the vehicle 1 from the path points P _i in accordance with the route pattern PT1 and, the route point P the vehicle direction theta _E in _E,
θ _E = θ _i
x _E = x _i + CL · cos (θ _i )
y _E = y _i + CL · sin (θ _i )
Can be calculated. The route point _{P F (x F, y F} ) that corresponds to the destination when moving the vehicle 1 from the path points _{P i} in accordance with the route pattern PT2 and a vehicle direction theta _F at the route point _{P F} Is
θ _F = θ _i
x _F = x _i + CL · cos (θ _i + π)
y _F = y _i + CL · sin (θ _i + π)
Can be calculated.

By using the equations described with reference to FIG. 4 described above, the path points P corresponding to the destination when moving the vehicle 1 from the path points P _i in accordance with the route pattern PT1～PT10, the vehicle direction θ can be calculated. Therefore, the pattern running part RT1 can be generated.

  In the present embodiment, the temporary travel route RT1 is generated by combining the route patterns PT1 to PT10 in a predetermined order. When this temporary travel route RT1 is generated, it is next determined whether or not there is a reverse turning portion RT2 following the temporary traveling route RT1 and a final reverse portion RT3 following the reverse turning portion RT2. . This determination condition is referred to as a parking condition in the present embodiment.

  In addition, when the parking possible condition is satisfied here, the temporary traveling route RT1 is set as the pattern traveling unit RT1, and based on the established parking enabled condition, the reverse turning unit RT2 and the final reverse unit RT3 are determined, and the traveling The entire paths RT1 to RT3 are generated. On the other hand, if the parking available condition is not satisfied, another temporary travel route RT1 is generated, and it is determined again whether the parking available condition is satisfied. The generation of the provisional travel route RT1 and the determination of the parking available condition are repeated until the parking available condition is satisfied or until all combinations of predetermined route patterns PT1 to PT10 are generated.

  Here, parking conditions will be described with reference to FIGS. FIG. 5A is a schematic diagram for explaining an example of a route point P on the travel routes RT1 to RT3, and FIG. 5B is a schematic diagram for explaining parking conditions. In FIG. 5A, the travel route to the route points P0 to P6 corresponds to the pattern travel portion RT1, the travel route to the route points P6 to P7 corresponds to the reverse turning portion RT2, and the route points P7 to P8. The travel route up to corresponds to the final reverse portion RT3.

  In the present embodiment, every time a provisional travel route RT1 is generated, it is determined whether or not the parking condition is satisfied at the route point P corresponding to the end of the provisional travel route RT1 (FIG. 8). If the parking condition is not satisfied, another temporary travel route RT1 is generated.

  This parking condition is composed of two conditions. The first condition is that the vehicle 1 is turned backward by the same turning radius R from the route point P corresponding to the terminal end of the temporary travel route RT1, and continues. This is a condition that it is possible to stop the vehicle 1 at the target parking position by moving the vehicle 1 backward and straight.

  For example, as shown in FIG. 5A, at the route point P0 that is the departure point of the vehicle 1, ten temporary travel routes RT1 indicated by dotted lines and solid lines are generated one by one in order, Every time RT1 is generated, it is determined whether or not a parking condition is satisfied. However, since the parking condition is not satisfied in any case, the temporary travel route RT1 is next extended so that the travel route is extended in 10 directions from the end of each of the 10 travel routes RT1 generated earlier. Is generated. Then, it is determined whether each parking condition is satisfied.

  Thereafter, similarly, the generation of another travel route and the determination of the establishment of the parking condition are repeated, and finally, in the example of FIG. 5A, travel routes to route points P0 to P6 are generated. In the route point P6, two parking conditions are satisfied.

  Here, with reference to FIG.5 (b), the route point P and vehicle direction (theta) in which parking conditions are satisfied are demonstrated. As described above, the first parking condition is that the vehicle 1 is turned backward from the route point P by the same turning radius R, and then the vehicle 1 is moved backward and straight, so that the vehicle 1 is brought to the target parking position. It is a condition that it is possible to stop the vehicle.

FIG. 5B is a schematic diagram for explaining the parking condition, and the path point P _v0 (x _v0 , y _v0 ) indicates the vehicle position of the vehicle 1 that determines whether the parking condition is satisfied. The path point P _Vn (x _vn , y _vn ) is the parking position targeted by the driver. Further, the vehicle orientation of the vehicle 1 at the route point P _v0 is denoted by θ _v, and the vehicle orientation of the vehicle 1 at the route point P _vn is denoted by θ _p .

When the change amount between the vehicle orientation θ _{v at the} route point P _v0 and the vehicle orientation θ _p at the route point P _vn is Δθ, the change amount Δθ is
Δθ = tan ⁻¹ ((y _v0 −y _vn ) / (x _v0 −x _vn ))
Can be calculated. Therefore, if the distance parallel to the x axis from the path point P _v0 to the path point P _vn is P _x and the distance parallel to the y axis from the path point P _v0 to the path point P _vn is P _y ,
P _x = | ((x _v0 −x _vn ) ² + (y _v0 −y _vn ) ² ) ^1/2 · cos (Δθ + π / 2−θ _p ) |
P _y = | ((x _v0 −x _vn ) ² + (y _v0 −y _vn ) ² ) ^1/2 · sin (Δθ + π / 2−θ _p ) |
Can be calculated. Further, an angle formed by a straight line drawn perpendicularly from the turning center K of the vehicle 1 toward the y-axis and a straight line drawn from the turning center K of the vehicle 1 toward the route point P _V0 of the vehicle 1 is _defined as θ _vp . The angle θ _vp is
θ _vp = θ _v0 −θ _vn
Can be calculated. Therefore, from these equations, the turning radius Rp of the vehicle 1 can be calculated by the following equation.

_Rp = _Px / (1-cos ([theta] _Vp ))
Note that when the turning radius _Rp is equal to or larger than the minimum turning radius of the vehicle 1, the first parking condition described above is satisfied. That is, this equation is the first parking condition. When the distance parallel to the y-axis from the path point P _v0 to the turning center K of the vehicle 1 is P _ry , the distance P _ry is
P _ry = R _p · sin (θ _vp )
Can be calculated. Here, if the distance parallel to the y-axis from the entrance of the parking space to the route point P _vn is PL,
_{P y -PL>} P _ry
Only when the above is established, the vehicle 1 can move backward and go straight into the parking space. That is, this equation is the second parking condition. The traveling control device 100 sets the temporary traveling route as the pattern traveling portion RT1 and the reverse turning portion RT2 if the above two parking conditions are satisfied at the route point P corresponding to the end of the temporary traveling route RT1. And the final reverse portion RT3 are determined, and the entire travel routes RT1 to RT3 are generated.

Note that the path point P corresponding to the connection position of the backward revolving part RT2 and the final retreating part RT3 is (x _v0 −P _x , y _v0 −P _ry ), so two paths indicating the reverse revolving part RT2 The point P becomes a path point P _V0 and a path point P (x _v0 −P _x , y _v0 −P _ry ), and the two path points P indicating the final retreat part RT3 are the path point P (x _v0 − P _x , y _v0 −P _ry ) and path point P _vn .

  Next, with reference to FIG. 6, the detailed structure of the driving assistance apparatus 100 is demonstrated. FIG. 6 is a block diagram showing an electrical configuration of the driving support device 100. The driving support apparatus 100 includes a CPU 91, a flash memory 92, and a RAM 93, which are connected to the input / output port 95 via the bus line 94. The input / output port 95 includes a wheel driving device 3, a steering driving device 5, a steering sensor device 21, a gyro sensor device 22, first to third distance sensors 23a to 23c, an automatic parking switch 24, and other devices. An input / output device 99 or the like is connected.

  The CPU 91 is an arithmetic unit that controls each unit connected by the bus line 94, and the flash memory 92 is a non-rewritable nonvolatile memory for storing a control program executed by the CPU 91, fixed value data, and the like. . In addition, the automatic parking process shown in the flowchart of FIG. 7 to be described later, the point route generation process shown in the flowchart of FIG. 8, the pattern travel part control point generation process shown in the flowchart of FIG. 9, and the reverse turning part control point shown in the flowchart of FIG. The flash memory 92 stores each program that executes the generation process, the final reverse portion control point generation process shown in the flowchart of FIG. 13, and the traveling region confirmation process shown in the flowchart of FIG. 15.

  The flash memory 92 is provided with a vehicle information memory 92a, an obstacle determination area memory 92b, a route pattern memory 92c, and a determination condition expression memory 92d. The vehicle information memory 92a stores the vehicle length L of the vehicle 1 and the lateral width W of the vehicle 1 (see FIG. 16B). Further, the distance from the reference point of the vehicle 1 to the rear surface of the vehicle 1 on the longitudinal axis of the vehicle 1 is stored as the center rear surface distance Lg of the vehicle 1 (see FIG. 16B). Further, the distance between the axles of the front wheels 2FL and 2FR in the vehicle 1 and the axles of the rear wheels 2RL and 2RR in the vehicle 1 is stored as a wheel base WL (not shown).

  When the vehicle position and vehicle orientation of the vehicle 1 are determined, the obstacle determination region memory 92b is a region occupied by the vehicle 1 at the vehicle position (hereinafter referred to as “obstacle determination region E”) (FIG. 16 ( b) a memory in which various constants for calculating (see) are stored. The obstacle determination area E is configured by a rectangular area surrounding the entire vehicle 1, the distance in the front-rear direction of the vehicle 1 is set to “L + ΔL”, and the distance in the side surface direction of the vehicle 1 is set to “W + ΔW”. Is set.

  More specifically, the obstacle determination area E is longer by “ΔL / 2” from the front and rear surfaces of the vehicle 1 to the front and rear of the vehicle 1, and from the left and right sides of the vehicle 1 to the left side of the vehicle 1. In the surface direction and the right side surface direction, the distance is “ΔW / 2” longer. This is a margin provided to allow the vehicle 1 to autonomously travel safely without contacting the obstacle. In the present embodiment, the area occupied by the obstacle determination area E of the vehicle 1 while traveling is not the area that the vehicle 1 itself occupies while traveling, but is the travel area of the vehicle 1.

  The obstacle determination area memory 92b stores a distance “L + ΔL” in the traveling direction of the vehicle 1 in the obstacle determination area E and a distance “W + ΔW” in the side direction of the vehicle 1 in the obstacle determination area E. Further, a straight line distance M1 (see FIG. 16B) from the reference point of the vehicle 1 to the right front vertex in the obstacle determination area E, and an angle formed by the straight line and the axles of the left and right rear wheels 2RL and 2RR in the vehicle 1 α, a straight line distance M2 (see FIG. 16B) from the reference point of the vehicle 1 to the right rear apex in the obstacle determination area E, and the axles of the straight line and the left and right rear wheels 2RL and 2RR in the vehicle 1 The angle β to be formed is stored.

  Although details will be described later, each value stored in the vehicle information memory 92a and the obstacle determination area memory 92b is an obstacle corresponding to the vehicle position when the vehicle position and the vehicle direction of the vehicle 1 are determined. In order to calculate the position information of the four vertices of the determination area E, it is used by the CPU 91.

  The route pattern memory 92c is a memory that stores the above-described ten types of route patterns PT1 to PT10. The determination conditional expression memory 92d is a memory that stores 16 types of determination conditional expressions used for determining whether or not an obstacle exists on the travel routes RT1 to RT3. The determination conditional expression is a primary inequality for determining whether or not there is an obstacle in the obstacle determination area E corresponding to the traveling control point Q. The details of the 16 types of judgment condition formulas will be described later with reference to FIG. 18, but when the judgment condition formulas are satisfied at the travel control point Q, they are within the obstacle judgment area E corresponding to the travel control point Q. If there is an obstacle and the judgment condition formula is not established, it indicates that there is no obstacle in the obstacle determination area E.

  In the present embodiment, before the vehicle 1 autonomously travels, one kind of judgment condition formula is selected for each travel control point Q on the travel routes RT1 to RT3, and the inside of the obstacle judgment area E using the judgment condition formula. It is judged whether there is an obstacle. If no obstacles enter the obstacle determination area E of all the traveling control points Q, the vehicle 1 is autonomously driven along the traveling routes RT1 to RT3, and the vehicle 1 is stopped at the target parking. Let In addition, when an obstacle enters the obstacle determination area E of any of the travel control points Q, another travel route is generated, and again within the obstacle determination area E of all the travel control points Q. A determination is made as to whether there are any obstacles.

  In general, whether or not an obstacle exists on the travel routes RT1 to RT3 is determined by actually running the vehicle 1 and checking the obstacle in the obstacle determination area E of the vehicle 1 while the vehicle 1 is traveling. Judgment is made based on whether or not there is. In this case, since the obstacle determination area E is set based on the vehicle position of the vehicle 1, the obstacle determination area E is always fixed at the same position when viewed from the vehicle 1 regardless of whether the vehicle is running or stopped. It becomes a state.

  However, when checking whether there is an obstacle on the travel routes RT1 to RT3 before starting the autonomous traveling as in the present embodiment, when viewed from the vehicle 1 before the autonomous traveling is started, The obstacle determination area E is appropriately rotated according to the vehicle position and the vehicle direction where the vehicle 1 is scheduled to travel. Therefore, the obstacle determination area E is calculated according to the vehicle position and vehicle direction on the travel routes RT1 to RT3, and it is determined whether an obstacle exists in the obstacle determination area E.

  In this embodiment, in order to simplify the determination process, 16 types of primary inequalities for determining whether an obstacle exists in the obstacle determination area E are provided as determination condition expressions. It is stored in the expression memory 92d.

Details of the 16 types of judgment condition formulas will be described later with reference to FIG. 18, but when judgment is made using the judgment condition formulas, the vehicle orientation θ _v of the vehicle 1 at the travel control point Q, and the travel control According to the position information I _{1 to} I _{4 of the four} vertices of the obstacle determination area E at the point Q, one type of judgment condition formula is selected from the 16 types of conditional formulas, and the selected judgment condition formula Inside, constants a ₁₂ , a ₂₃ , a ₃₄ , a ₄₁ , b ₁₂ , b ₂₃ , b ₃₄ , b ₄₁ based on the positions of the four vertices of the obstacle determination area E at the traveling control point Q, Substitute location information. As a result of the substitution, if the judgment condition formula is satisfied, it is determined that there is an obstacle in the obstacle determination area E. If the determination condition formula is not satisfied, it is determined that there is no obstacle. In this manner, by providing the determination conditional expression in advance, the process for determining whether or not there is an obstacle in the obstacle determination area E can be simplified, so that the control burden can be reduced.

  The RAM 93 is a rewritable volatile memory, and is a memory for temporarily storing various data when the control program executed by the CPU 91 is executed. The RAM 93 is provided with a vehicle surrounding information memory 93a, a point route pattern memory 93b, a point route memory 93c, and a travel control point memory 93d.

  The vehicle surrounding information memory 93a is a memory in which position information of obstacles existing around the vehicle 1 is stored. In the present embodiment, the scan results output from the first to third distance sensors 23 a to 23 c are combined into one scan result by the CPU 91, and the scan results for the entire periphery of the vehicle 1 are created. And the scanning result of the perimeter of the vehicle 1 is memorize | stored in the vehicle surrounding information memory 93a. In addition, the scanning result memorize | stored in the vehicle surrounding information memory 93a is updated whenever the scanning by each distance sensor 23a-23c is complete | finished (for example, 100 ms).

  The scanning result stored in the vehicle surrounding information memory 93a is obtained on the travel route before the autonomous driving is started when the vehicle 1 autonomously travels from the current position to the target parking position. Referenced to confirm that no obstacle is present (see FIG. 15).

  The point route pattern memory 93b is a memory in which combinations of route pattern numbers “PT1 to PT10” indicating the pattern traveling unit RT1 are stored. The point route pattern memory 93b is cleared by the CPU 91 when an automatic parking process (see FIG. 7) described later is executed. Each time the CPU 91 generates the entire travel routes RT1 to RT3 from the current position to the target parking position, the combination of the route pattern numbers “PT1 to PT10” indicating the pattern travel portion RT1 is stored.

  The combination of the route pattern numbers “PT1 to PT10” stored in the point route pattern memory 93b obtains the state of whether the vehicle 1 is moving forward or backward at each route point P on the travel routes RT1 to RT3. Or when acquiring the state of presence / absence of switching (see S59 in FIG. 9, S80 in FIG. 11, and S99 in FIG. 13). It is also referred to when calculating the position of the route point P in the pattern travel unit RT1 (see FIG. 4).

  The point route memory 93c is a memory in which route point information of each route point P indicating the travel routes RT1 to RT3 is stored. As described above, the route point information is configured by the vehicle position of the vehicle 1 at the route point P and the vehicle orientation θ of the vehicle 1 at the route point P. Further, as described above, in the pattern travel unit RT1 among the travel routes RT1 to RT3, the start point and the end point of the travel route corresponding to the route patterns PT1 to PT10 are set as the route points P, respectively. Further, in the backward turning portion RT2 and the final backward portion RT3, the starting point and the ending point of each traveling route RT2, RT3 are set as the route point P.

  When the CPU 91 generates the entire travel routes RT1 to RT3, the route point information of the route point P in the pattern travel unit RT1, the route point information of the route point P in the reverse turning unit RT2, and the route point in the final retreat unit RT3. The route point information of P is stored in the point route memory 93c (see S44 in FIG. 8). The route point information of each route point P stored in the point route memory 93c is referred to in order to generate the travel control point Q.

  The travel control point memory 93d is a memory in which vehicle setting information of each travel control point Q, which is a point generated for the travel routes RT1 to RT3, is stored. As described above, the travel control point Q is a point for controlling the travel state of the vehicle 1 such as the traveling direction when the travel support device 100 causes the vehicle 1 to travel autonomously along the travel routes RT1 to RT3. .

  In the present embodiment, when the travel control point Q is generated for the travel routes RT1 to RT3, the travel control is virtually performed on the travel routes RT1 to RT3 at intervals of 0.05 m from the current position to the target parking position. A point Q is generated (see S7, S8, and S9 in FIG. 7). Further, vehicle setting information is generated for each traveling control point Q, and the generated vehicle setting information of each traveling control point Q is stored in the traveling control point memory 93d. A travel control point Q is always generated on each route point P excluding the route point P0 (current position of the vehicle 1).

  The vehicle setting information of each traveling control point Q includes the vehicle position of the vehicle 1 at the traveling control point Q, the vehicle orientation of the vehicle 1 at the traveling control point Q, the steering angle δ of the vehicle 1 at the traveling control point Q, and the traveling control. The traveling direction flag at the point Q and the switching determination flag at the traveling control point Q are configured. When starting the autonomous traveling, the CPU 91 sets the traveling state of the vehicle 1 based on the vehicle setting information of the reached traveling control point Q every time the traveling control point Q is reached, and reaches the target parking position. To run.

  The traveling direction flag is a flag indicating whether the vehicle 1 moves forward or backward at the traveling control point Q, and is set to “1” when the vehicle 1 moves forward at the traveling control point Q. Is set to "-1" when the vehicle moves backward. The switching determination flag is a flag indicating whether the vehicle 1 switches between forward and reverse at the travel control point Q, and is set to be off when the vehicle 1 travels while maintaining forward or reverse at the travel control point Q. It is set to ON when the vehicle 1 switches forward to backward, or when the vehicle 1 switches backward to forward.

  The vehicle setting information of each traveling control point Q stored in the traveling control point memory 93d is referred to by the CPU 91 when determining whether or not an obstacle exists on the traveling routes RT1 to RT3. Although details will be described later, when any of the traveling control points Q is determined by the CPU 91 that there is an obstacle in the obstacle determining area E, the traveling control point memory 93d is cleared.

  Next, the automatic parking process executed by the CPU 91 of the travel support device 100 mounted on the vehicle 1 will be described with reference to the flowcharts of FIGS. 7 to 19 and schematic diagrams. FIG. 7 is a flowchart showing an automatic parking process executed by the driving support device 100. In the automatic parking process, the vehicle 1 is autonomously driven from the current position to the parking position targeted by the driver, and the vehicle 1 is stopped at the parking position, and the automatic parking switch 24 is pressed by the driver. To be executed.

  In the automatic parking process, first, the point route pattern memory 93b in the RAM 93 is cleared (S1). Next, a driver's target parking position is acquired as the final destination, and when the vehicle 1 is parked at the final destination, the left and right rear wheels 2RL, 2RR are set on the axles of the x-axis. The front-rear axis is the y-axis, and the intersection of the x-axis and the y-axis is determined as the origin O (S2). For example, a surrounding image of the vehicle 1 is displayed on a touch panel (not shown) provided in the vehicle 1 to notify the driver to input the parking position. When the display screen is touched by the driver, the parking position corresponding to the touched screen position is calculated and set as the origin O.

  Next, the point route generation process is executed with the current point as the departure point (S3) (S4). Here, with reference to FIG. 8, a point route generation process executed by the CPU 91 of the travel support device 100 mounted on the vehicle 1 will be described. FIG. 8 is a flowchart showing a point route generation process executed by the driving support device 100. The point route generation process is a process for generating the entire travel routes RT1 to RT3 from the departure point to the final destination.

  In the point path generation process, it is determined whether path pattern numbers “PT1 to PT10” are stored in the point path pattern memory 93b of the RAM 93 (S31). If the determination in S31 is negative (S31: No), 0 is set in the variable a, 6 is set in the variable m, the variables a and m are initially set (S32), and the process proceeds to S33. Transition. On the other hand, if the determination in S31 is affirmative (S31: Yes), after starting the automatic parking process, the travel routes RT1 to RT3 are generated by the point route generation process, but on the travel routes RT1 to RT3. This is a case where another traveling route RT1 to RT3 is to be generated because there is an obstacle. Therefore, in this case, the process of S32 is skipped and the process proceeds to S33.

  In the processing of S33, one permutation is acquired from among the duplication permutations composed of a path pattern numbers that allow duplication among the ten route pattern numbers “PT1 to PT10” (S33). Here, one duplication permutation is acquired in order from the smallest path pattern number. For example, if a = 0, nothing is acquired, “PT1” is acquired first, “PT2” is acquired second, a duplicate permutation is acquired in the same manner when a = 1. Is done. In the case of a = 2, “PT1, PT1” is acquired first, “PT1, PT2” is acquired second, “PT1, PT3” is acquired third, and so on. An overlapping permutation is acquired, and “PT10, PT10, PT10, PT10, PT10, PT10” is acquired at the end when a = 6.

  Next, a travel route RT1 corresponding to the overlapping permutation acquired in the process of S33 is generated, and the arrival point is acquired (S34). As described above, in the present embodiment, the route point P indicating the travel route is generated. Then, it is determined whether or not parking conditions are satisfied at the arrival point (S35).

  In this embodiment, in the process of S32, the initial setting is performed with a = 0 without performing the initial setting with a = 1. This is because it is determined by the process of S35 whether parking conditions are satisfied at the departure point. If a = 1 is initially set, the travel route RT1 is always generated, and if the parking condition is satisfied at the departure point, the useless travel route RT1 is generated. Therefore, by initially setting a = 0, generation of a useless travel route RT1 can be suppressed, and processing costs can be suppressed.

  If the determination in S35 is negative (S35: No), it is determined whether all overlapping permutations composed of a route pattern numbers have been acquired (S36). If the determination in S36 is negative (S36: No), the process returns to S33. If the determination in S36 is affirmative (S36: Yes), it is determined whether the value of the variable a is less than the value of the variable m (S37). If the determination in S37 is affirmative (S37: Yes), 1 is added to the variable a (S38), and the process returns to S33.

  If the determination in S37 is negative (S37: No), all of the predefined duplication permutations have been acquired, but since the travel routes RT1 to RT3 have not been found, the point route memory 93c in the RAM 93 is cleared. (S39), the point route generation process is terminated, and the process returns to the automatic parking process (see FIG. 7).

  On the other hand, if the determination in S35 is affirmative (S35: Yes), the overlapping permutation of the route pattern numbers acquired in the processing in S33 is stored in the point route pattern memory 93b in the RAM 93 (S40), and the processing in S34. The generated travel route (route point P) is set as a pattern travel unit RT1 (S41).

  Next, as described with reference to FIG. 5B, the route point P of the backward revolving part RT2 is determined (S42), and the route point P of the final backward part RT3 is determined (S43). Then, the route point information (vehicle position and direction) of each route point P corresponding to the series of travel routes RT1 to RT3 is stored in the point route memory 93c (S44), the point route generation process is terminated, and automatic parking is performed. Return to the process (see FIG. 7).

  Here, the description returns to FIG. When the point route generation process (S4) is completed, it is next determined whether or not the travel routes RT1 to RT3 are generated by the process of S4 (S5). If the determination in S5 is negative (S5: No), the travel route to the final destination is not found, so the driver is informed that there is no travel route to the final destination (S11). The automatic parking process is terminated.

  On the other hand, when the determination in S5 is affirmative (S5: Yes), the pattern traveling unit control point generation process (S6), the reverse turning unit control point generation process (S7), and the final reverse unit control point generation process ( S8) is executed in order to generate a travel control point Q for the travel routes RT1 to RT3 generated in the process of S4.

  Thus, in the present embodiment, the above-described point route generation process (S4) is executed, and each process of S6 to S8 is executed only when the travel routes RT1 to RT3 are generated (S5: Yes). Thus, a travel control point Q for the travel routes RT1 to RT3 is generated.

  Therefore, when the travel route RT1 in which the vehicle 1 cannot reach the target parking position is generated, the process of generating the travel control point Q is not executed. Therefore, it is possible to suppress unnecessary processing that is irrelevant for causing the vehicle 1 to autonomously travel to the target parking position.

  Further, as described above with reference to FIG. 2, in the present embodiment, not only the position corresponding to each route point P among the travel routes RT <b> 1 to RT <b> 3, but also virtually travels between each route point P. A control point Q is generated. Ideally, if a travel control point Q is virtually generated only at a position corresponding to each route point P and the vehicle 1 is autonomously traveled based on the travel control point Q, the vehicle 1 travels along the travel route RT1. Although the vehicle can travel on RT3, the vehicle position may actually deviate from the travel routes RT1 to RT3 due to various disturbances such as the road surface condition, the number of passengers and the load of the vehicle 1, and the like.

  Therefore, in the present embodiment, a travel control point Q is virtually generated between the route points P in addition to the position corresponding to each route point P, and the vehicle 1 such as the traveling direction is determined for each travel control point Q. It is possible to correct the running state of. Therefore, when the travel support device 100 causes the vehicle 1 to travel autonomously and travel on the travel routes RT1 to RT3, the travel state of the vehicle 1 is set so that the vehicle 1 can travel smoothly on the travel routes RT1 to RT3. Can be controlled.

  Here, with reference to FIG. 9 to FIG. 14, the pattern travel part control point generation process (S6), the reverse turning part control point generation process (S7), and the final reverse part control point generation process (S8) will be described.

  First, the pattern traveling unit control point generation process (S6) will be described with reference to FIG. FIG. 9 is a flowchart showing a pattern travel unit control point generation process executed by the travel support device 100.

  The pattern travel part control point generation process is a process for generating a travel control point Q for the pattern travel part RT1 among the travel routes RT1 to RT3 generated in the process of S4. Travel control points Q are generated at intervals of 0.05 m. In the pattern travel unit RT1, since the travel distance CL between the adjacent route points P is all 2 m, 41 travel control points Q are always required between the adjacent route points P. In the point generation process, 40 traveling control points Q are generated.

  More specifically, of the two adjacent route points, the route point P closer to the departure point is set as the first route point P, and the route point P closer to the final destination is set as the second route point P. In this case, the travel control point Q is not generated on the first route point P, and the first travel control point Q is generated from the first route point P by one second route point P. And the traveling control point Q is produced | generated in order, and the 40th traveling control point Q is made to overlap with the 2nd path | route point P. FIG.

  In the pattern traveling unit control point generation process, first, the variable j is set to 0, the variable n is set to 40, and the variables a and n are initially set (S51). Next, the jth route point P from the departure point is set as the first route point P, and the (j + 1) th route point P is set as the second route point P (S52). For example, in the travel route RT1 shown in FIG. 2, seven route points P from P0 to P6 are provided. Here, when the variable j is 0, the route point P0 is the first route point P, and the route point P1 is the second route point P.

  Next, the vehicle position and vehicle direction, which are the route point information of the first route point P, are obtained from the point route memory 93c of the RAM 93 (S53), and similarly, the vehicle position which is the route point information of the second route point P. The vehicle direction is acquired from the point route memory 93c (S54).

Then, the steering angle δ of the vehicle 1, the turning center K of the vehicle 1, and the turning radius R of the vehicle 1 for calculating the vehicle 1 from the first route point P to the second route point P are calculated (S55). . In the process of S55, the steering angle δ, the turning center K, and the turning radius R are calculated based on the overlapping permutations of the route pattern numbers stored in the point route pattern memory 93b. Since the pattern travel portion RT1 is obtained by connecting travel routes corresponding to the route patterns PT1 to PT10, the travel distance CL and the turning radius R are originally determined. As a result, the steering angle δ and the turning center K The turning radius R is uniquely determined. When the turning radius of the vehicle 1 is R and the wheel base of the vehicle 1 is WL, the steering angle δ of the vehicle 1 is
δ = tan ⁻¹ (WL / R)
Is calculated by Further, a change amount Δθ in the vehicle direction when the vehicle 1 moves from the first route point P to the second route point P is calculated (S56). An expression for calculating the change amount Δθ will be described later.

  The variable i is set to 1 and the variable i is initialized (S57). Next, among the travel control points Q provided on the route from the first route point P to the second route point P, the position (vehicle position) of the i-th travel control point Q from the first route point P, and The vehicle direction is calculated (S58). The first travel control point Q is a travel control point Q from the first route point P to one second route point P, and the 40th travel control point Q is overlapped with the second route point P. ing.

Here, with reference to FIG. 10, the position of the traveling control point Q generated with respect to the pattern traveling unit RT1 and the vehicle direction thereof will be described. FIG. 10 is a schematic diagram for explaining an example of the travel control point Q generated for the pattern travel unit RT1 among the travel routes RT1 to RT3, and illustrates between two adjacent route points P. It is a thing. Here, the first path point is indicated as P _v0 (x _v0 , y _v0 ), and the second path point is indicated as P _vn (x _vn , y _vn ).

Since the pattern travel unit RT1 is generated based on the travel route corresponding to the route patterns PT1 to PT10, the travel distance CL and the turning radius R are determined in the first place. Therefore, the turning radius R and the turning center K (x _k , y _k ) when the vehicle 1 moves from the first route point P _v0 to the second route P _vn are determined in advance. Further, the travel distance CL of the vehicle 1 from the first route point P _v0 to the second route P _vn is all 2 m. Therefore, the vehicle direction theta _v0 at the first path point P _v0, when the Δθ the variation of the vehicle direction theta _vn at the second path point P _vn, the amount of change Δθ is
Δθ = CL / R
Is calculated by In the process of S56 of FIG. 9, the change amount Δθ is calculated by this equation. If the i-th travel control point from the first route point P is Q (x _vi , y _vi ) and the vehicle direction is θ _i ,
θ _i = i · Δθ / 40
x _vi = x _k + R · cos (θ _v0 −π / 2 + θ _i )
y _vi = y _k + R · sin (θ _v0 −π / 2 + θ _i )
Is calculated by Here, the first travel control point Q from the first route point P becomes a travel control point Q from the first route point P to one second route point P, and the 40th travel control point Q is the second travel control point Q. It overlaps with the route point P.

By using the mathematical formula described with reference to FIG. 10 above, between each route point P of the pattern travel unit RT1, the position of the 40 travel control points Q and the vehicle orientation θ _i of the vehicle 1 at that position Therefore, it is possible to generate all the travel control points Q corresponding to the pattern travel unit RT1.

  In the present embodiment, even if the route point P is generated roughly at intervals of 2 m and the travel route RT1 is generated based on the combination of the route patterns PT1 to PT10, thereafter, between the route points P of the travel route RT1, 0 is generated. Travel control points Q can be generated virtually at intervals of .05 m. Although details will be described later, also for the travel routes RT2 and RT3, the travel control points Q can be virtually generated at intervals of 0.05 m between the route points P of the travel routes RT2 and RT3.

  Therefore, the length CL of each travel route corresponding to the route patterns PT1 to PT10 is shortened (for example, 0.05 m, etc.), the travel route RT1 is generated in detail, or the pattern types of the route patterns PT1 to PT10 Since it is not necessary to store and store a large number of processes, the processing cost can be suppressed. Therefore, according to the driving assistance device 100, the driving routes RT1 to RT3 of the vehicle from the initial position to the target position can be provided to the driver with a small processing cost.

  Returning to the description of FIG. Then, the steering angle δ from the first path point P to the i-th travel control point Q, the traveling direction (forward or reverse), and the presence / absence of turning back are acquired (S59). In the process of S59, the steering angle δ is acquired for the steering angle δ that is the same as that of the first path point P, regardless of the travel control point Q. Further, as the traveling direction, a value indicating the same direction (forward or backward) as the traveling direction of the first path point P is acquired except for the travel control point Q overlapping the second path point P. As for the presence / absence of switching, a value indicating no switching is acquired except for the traveling control point Q that overlaps the second route point P.

  In addition, about the traveling control point Q which overlaps with the 2nd path | route point P, the advancing direction and the presence or absence of a return are acquired based on the content of the point path | route pattern memory 93b. More specifically, if the route patterns PT1 to PT10 from the second route point P to the next route point P are route patterns PT1, PT3, PT4, PT7, and PT8 for moving the vehicle 1 forward, the second route. As the traveling direction of the traveling control point Q that overlaps the point P, a value indicating forward movement is acquired. On the other hand, in the case of the route patterns PT2, PT5, PT6, PT9, and PT10 that cause the vehicle 1 to move backward, a value indicating backward is acquired as the traveling direction of the travel control point Q that overlaps the second route point P.

  Further, the route patterns PT1 to PT10 from the first route point P to the second route point P and the route patterns PT1 to PT10 from the second route point P to the next route point P together advance the vehicle 1. If the route pattern PT1, PT3, PT4, PT7, PT8, or the route pattern PT2, PT5, PT6, PT9, PT10 that causes the vehicle 1 to move backward, the traveling control point Q that overlaps the second route point P is determined to be turned over. , A value indicating no reversal is obtained.

  On the other hand, one of the route patterns PT1 to PT10 from the first route point P to the second route point P and the route patterns PT1 to PT10 from the second route point P to the next route point P move forward in the vehicle 1. If the route patterns PT1, PT3, PT4, PT7, and PT8 to be caused and the other is the route patterns PT2, PT5, PT6, PT9, and PT10 that cause the vehicle 1 to move backward, the travel control point Q that overlaps the second route point P is switched back. As a presence / absence of the value, a value indicating that there is a return is obtained.

  When the processing of S59 is completed, the vehicle setting information (vehicle position, vehicle direction, steering angle δ, travel direction flag, turn-back flag) corresponding to the i-th travel control point Q is stored in the travel control point memory 93d of the RAM 93. (S60). In the process of S59, if a value indicating forward is acquired as the traveling direction, here, if the traveling direction flag is set to “1” and a value indicating backward is acquired as the traveling direction, the traveling is progressed. The direction flag is set to “−1”.

  Also, in the process of S59, if a value indicating no return is acquired as the presence / absence of return, here, the return flag is set to OFF, and if the value indicating return is indicated as the presence / absence of return, The switchback flag is set on.

  Further, in the process of S60, when the vehicle setting information of the traveling control point Q is stored in the traveling control point memory 93d, each traveling control point Q is not overwritten so as to overwrite the vehicle setting information of the other traveling control points Q. Each vehicle setting information is stored individually.

  When the process of S60 is completed, it is next determined whether the value of the variable i is less than the value of the variable n (S61). If the determination of S61 is affirmative (S61: Yes), the variable i is set. 1 is added (S62), and the process returns to S58. Then, 40 traveling control points Q are sequentially generated on the route from the first route point P to the second route point P.

  On the other hand, when the determination of S61 is negative (S61: No), since 40 travel control points Q are set between the first route point P and the second route point P, the pattern travel unit RT1 It is determined whether all travel control points Q have been generated (S63).

  If the determination in S63 is negative (S63: No), 1 is added to the variable j (S64), the process returns to S52, and 40 driving control points Q between the next route points P are also returned. Is generated. If the determination in S63 is affirmative (S63: Yes), the pattern traveling unit control point generation process (S6) is terminated and the process returns to the automatic parking process (see FIG. 7).

  Next, with reference to FIG. 11, the reverse turning part control point generation process (S7) will be described. FIG. 11 is a flowchart showing the reverse turning unit control point generation process executed by the driving support device 100.

  The reverse turning part control point generation process is a process for generating a traveling control point Q for the reverse turning part RT2 among the traveling routes RT1 to RT3 generated in the process of S4. Travel control points Q are generated between the route points P at intervals of 0.05 m. Note that the traveling distance CL of the reverse turning portion RT2 is not constant like the pattern traveling portion RT1, and therefore, the number of traveling control points Q corresponding to the traveling distance CL is generated between the two route points P.

  In the reverse turning part control point generation process, as in the pattern traveling part control point generation process (see FIG. 9), the route point P closer to the departure point is selected as the first route point from the two adjacent route points. When the route point P closer to the final destination is the second route point P, the travel control point Q is not generated on the first route point P, and the second route point P is one second from the first route point P. A first traveling control point Q is generated from the route point P. And the traveling control point Q is produced | generated in order, and the last traveling control point Q is made to overlap with the 2nd path | route point P. FIG.

  In the reverse turning portion control point generation process, first, two route points P indicating the reverse turning portion RT2 are specified among the route points P indicating the traveling routes RT1 to RT3 (S71). For example, in the case of the travel routes RT1 to RT3 shown in FIG. 2, the route point P6 and the route point P7 are specified.

  Next, of the two specified route points P, the route point P closer to the departure point on the travel routes RT1 to RT3 is set as the first route point P, and the route point P closer to the final destination is set as the second route point P. A route point P is set (S72). Then, the vehicle position and vehicle direction that are the route point information of the first route point P are acquired from the point route memory 93c of the RAM 93 (S73), and similarly, the vehicle position and the vehicle point that is the route point information of the second route point P and The vehicle direction is acquired from the point route memory 93c (S74).

Next, the steering angle δ of the vehicle 1, the turning center K of the vehicle 1, and the turning radius R of the vehicle 1 for calculating the vehicle 1 from the first route point P to the second route point P are calculated (S75). ). Incidentally, the turning center K of the vehicle 1 here, the turning radius R of the vehicle 1, and the turning center K calculated when the available parking condition is satisfied, it is the turning radius R _p. When the turning radius of the vehicle 1 is R and the wheel base of the vehicle 1 is WL, the steering angle δ of the vehicle 1 is
δ = tan ⁻¹ (WL / R)
Is calculated by Further, a change amount Δθ in the vehicle direction when the vehicle 1 moves from the first route point P to the second route point P is calculated (S76). An expression for calculating the change amount Δθ will be described later.

  Then, the number of travel control points Q generated between the first route point P and the second route point P is calculated and substituted for the variable n (S77). A formula for calculating the number of travel control points Q will also be described later.

  Next, the variable i is set to 1 and the variable i is initialized (S78). Among the travel control points Q generated for the travel route from the first route point P to the second route point P, the position (vehicle position) of the i-th travel control point Q from the first route point P and Then, the vehicle orientation is calculated (S79). The first travel control point Q is a travel control point Q closer to the second route point P from the first route point P, and the nth travel control point Q is overlapped with the second route point P. ing.

Here, with reference to FIG. 12, the position of the traveling control point Q generated for the reverse turning portion RT2 and the vehicle direction thereof will be described. FIG. 12 is a schematic diagram for explaining an example of the traveling control point Q generated for the reverse turning portion RT2 among the traveling routes RT1 to RT3, and between the two route points P indicating the reverse turning portion RT2. Is illustrated. Here, of the two route points P, the first route point is indicated as P _v0 (x _v0 , y _v0 ), and the second route point is indicated as P _vn (0, y _vn ). At the second path point P _vn , the longitudinal axis of the vehicle 1 necessarily overlaps with the y-axis, so that the x value becomes 0 and the vehicle orientation becomes π / 2.

The reverse turning portion RT2 is a traveling route following the pattern traveling portion RT1, and the traveling route is determined so that the vehicle 1 makes a reverse turn at the same steering angle δ from the end of the pattern traveling portion RT1 to the target parking position. (See S42 in FIG. 8). Therefore, when the backward turning portion RT2 is determined, the turning center K (x _k , y _k ) and the turning radius R are determined.

Accordingly, when the amount of change between the vehicle direction θ _{v0 at} the first path point P _v0 and the vehicle direction π / 2 at the second path point P _vn is Δθ, the amount of change Δθ is
Δθ = θ _v0 −π / 2
Is calculated by In the process of S77 in FIG. 11, the change amount Δθ is calculated by this equation. The travel distance CL from the first route point P _v0 to the second route point P _vn is
CL = R · Δθ
Is calculated by Therefore, when the traveling control points Q are generated at intervals of 0.05 m between the first path point P _v0 and the second path point P _vn , the total number n is
n = R · Δθ / 0.05
It becomes. If the total number n does not become an integer, the decimal point is rounded up to an integer. In the process of S77 in FIG. 11, the total number n calculated by this equation is substituted into the variable n. If the i-th travel control point from the first route point P _v0 is Q (x _vi , y _vi ) and the vehicle direction is θ _i ,
θ _i = Δθ · (n−i) / n
x _vi = x _k + R · cos (θ _i )
y _vi = y _k + R · sin (θ _i )
Is calculated by Here, the first travel control point from the first path point _{P v0} Q is, n-th driving control point Q next to one second path point P closer, from the first path point _{P v0} from the first path point _{P v0} The travel control point Q overlaps with the second path point _Pvn .

By using the mathematical formula described above with reference to FIG. 12, the position of each of the n traveling control points Q and the vehicle orientation θ _i of the vehicle 1 at that position between the route points P of the reverse turning portion RT2 Therefore, it is possible to generate all the travel control points Q corresponding to the reverse turning portion RT2.

  Here, it returns to description of FIG. Next, the steering angle δ from the first path point P to the i-th travel control point Q, the traveling direction (forward or reverse), and the presence / absence of turning back are acquired (S80). Note that, in the processing of S80, the steering angle δ is acquired as the same steering angle δ as that of the first route point P regardless of the travel control point Q. In addition, as the traveling direction, a value indicating reverse is acquired. In addition, for the presence / absence of reversion, a value indicating that there is no reversion is acquired.

  When the processing of S80 is completed, the vehicle setting information (vehicle position, vehicle direction, steering angle δ, travel direction flag, turn-back flag) corresponding to the i-th travel control point Q is stored in the travel control point memory 93d of the RAM 93. (S81). Here, all the traveling direction flags are set to “−1”, and all the turn-back flags are set to off. Further, when the vehicle setting information of the traveling control point Q is stored in the traveling control point memory 93d, the vehicle setting information of each traveling control point Q is not overwritten so that the vehicle setting information of other traveling control points Q is overwritten. Remember each separately.

  Next, it is determined whether the value of the variable i is less than the value of the variable n (S82). If the determination in S82 is affirmative (S82: Yes), 1 is added to the variable i (S83). ), The process returns to S79. Then, n traveling control points Q are sequentially generated on the route from the first route point P to the second route point P. On the other hand, when the determination of S82 is negative (S82: No), since all the n traveling control points Q are generated, the reverse turning portion control point generating process (S7) is terminated, and the automatic parking process ( Return to FIG.

  Next, with reference to FIG. 13, the final retreat part control point generation process (S8) will be described. FIG. 13 is a flowchart showing the final reverse portion control point generation processing executed by the driving support device 100.

  The final reverse part control point generation process is a process for generating a travel control point Q for the final reverse part RT3 among the travel routes RT1 to RT3 generated in the process of S4. Travel control points Q are generated between the route points P at intervals of 0.05 m. Note that the travel distance CL is not constant in the final reverse portion RT3 as in the reverse turning portion RT2, and therefore, the number of travel control points Q corresponding to the travel distance CL is generated between the two route points P.

  In the final retreat part control point generation process, as in the pattern travel part control point generation process (see FIG. 9), the route point P closer to the departure point is selected as the first route point from the two adjacent route points. When the route point P closer to the final destination is the second route point P, the travel control point Q is not generated on the first route point P, and the second route point P is one second from the first route point P. A first traveling control point Q is generated from the route point P. And the traveling control point Q is produced | generated in order, and the last traveling control point Q is made to overlap with the 2nd path | route point P. FIG.

  Each process of S92 to S95 in the final retreat part control point generation process is the same as each process of S72 to S75 in the retreat turning part control point generation process of FIG. 11 described above, and in the final retreat part control point generation process. Each process of S97-S102 is the same process as each process of S78-S83 in the backward turning part control point generation process of FIG. 11 mentioned above. Therefore, the description of similar processing is omitted, and only different portions are described.

  In the final retreat portion control point generation process, first, two route points P indicating the final retreat portion RT3 are specified from among the route points P indicating the travel routes RT1 to RT3 (S91). For example, in the case of the travel routes RT1 to RT3 shown in FIG. 2, the route point P7 and the route point P8 are specified. And each process of S92-S95 is performed, Next, the number of the traveling control points Q produced | generated between the 1st route point P and the 2nd route point P is calculated, and it substitutes for the variable n (S96). A formula for calculating the number of travel control points Q will be described later.

  And each process of S97-101 is performed. In the final retreating part RT3, the vehicle 1 always moves backward with the front-rear axis of the vehicle 1 overlapping the y-axis, so the vehicle direction is always π / 2. Therefore, in the process of S99, all 0 is acquired as the steering angle δ regardless of the travel control point Q. In addition, as the traveling direction, a value indicating reverse is acquired. In addition, for the presence / absence of reversion, a value indicating that there is no reversion is acquired. Therefore, in the process of S100, all the traveling direction flags are set to “−1”, and all the turn-back flags are set to off.

  If the determination in S101 is affirmative (S101: Yes), the process of S102 is executed, and the process returns to S98. Then, n traveling control points Q are sequentially generated on the route from the first route point P to the second route point P. On the other hand, when the determination in S101 is negative (S101: No), since all the n traveling control points Q have been generated, the final retreat control point generation process (S8) is terminated, and the automatic parking process ( Return to FIG.

Here, with reference to FIG. 14, the position of the traveling control point Q generated for the final reverse portion RT3 and the vehicle direction thereof will be described. FIG. 14 is a schematic diagram for explaining an example of the travel control point Q generated for the final reverse portion RT3 among the travel routes RT1 to RT3, between the two route points P indicating the final reverse portion RT3. Is illustrated. Here, of the two route points P, the route point P on the side closer to the departure point on the travel routes RT1 to RT3 is indicated as the first route point P _v0 (x _v0 , y _v0 ) and is closer to the final destination. _Is shown as a second route point P _vn (x _vn , y _vn ).

In both the first path point P _v0 and the second path point P _vn , the longitudinal axis of the vehicle 1 always overlaps the y axis, so that the x value becomes 0, the vehicle direction becomes π / 2, and the steering angle δ Becomes 0.

The final reverse portion RT3 is a travel route that follows the reverse turning portion RT2, and the travel route is determined so that the vehicle 1 can be moved straight from the end of the reverse turning portion RT2 to the target parking position and stopped. (See S43 in FIG. 8). Therefore, the travel distance CL from the first route point P _v0 (x _v0 , y _v0 ) to the second route point P _vn (x _vn , y _vn ) is
CL = ((x _v0 −x _vn ) ² + (y _v0 −y _vn ) ² ) ^1/2
Is calculated by In this embodiment, since both x _v0 and x _vn are 0, it may be calculated as “CL = | y _v0 −y _vn |”.

Therefore, when the travel control points Q are generated at intervals of 0.05 m between the first route point P _v0 and the second route point P _vn , the total number n is
n = CL / 0.05
It becomes. If the total number n does not become an integer, the decimal point is rounded up to an integer. In the process of S96 of FIG. 13, the total number n calculated by this equation is substituted into the variable n. If the i-th travel control point from the first route point P _v0 is Q (x _vi , y _vi ) and the vehicle direction is θ _i ,
θ _i = π / 2
x _vi = 0
y _vi = y _v0 −0.05 · n
Is calculated by Here, the first travel control point Q from the first route point P _v0 is the travel control point Q closer to the second route point P from the first route point P, and the nth travel control point Q from the first route point P _v0 . The traveling control point Q is overlapped with the second path point _Pvn .

By using the mathematical formula described with reference to FIG. 14 above, the position of each of the n travel control points Q and the vehicle orientation θ _i of the vehicle 1 at that position between the route points P of the final retreat part RT3 Therefore, it is possible to generate all the travel control points Q corresponding to the final reverse portion RT3.

  Here, the description returns to FIG. After the processing of S6 to S8 is executed and the travel control points Q for the travel routes RT1 to RT3 are generated, next, the travel region confirmation processing is performed (S9). Here, the traveling region confirmation process (S9) will be described with reference to FIGS. FIG. 15 is a flowchart illustrating the in-travel area confirmation process executed by the travel support device 100.

  The travel area confirmation process is a process for confirming whether or not an obstacle exists on the travel routes RT1 to RT3 when the travel control points Q for the travel routes RT1 to RT3 are generated. Q is a vehicle position of the vehicle 1 and whether or not there is an obstacle in the obstacle determination area E of the vehicle 1 is checked for each traveling control point Q.

  Here, the obstacle determination area E at each travel control point Q will be described with reference to FIG. FIG. 16A is a schematic diagram for explaining an example of the obstacle determination area E at each traveling control point Q, and the traveling direction of the vehicle 1 is indicated by an arrow with respect to some traveling control points Q. . FIG. 16A shows an obstacle determination area E of the travel control point Q whose position overlaps with the route point P0 as an example.

  In the present embodiment, when the vehicle position of the vehicle 1 and the traveling direction of the vehicle 1 (that is, the vehicle orientation θ) are determined, the obstacle determination area E is determined (see FIG. 16B). However, as shown in FIG. 16A, the traveling direction of the vehicle 1 (that is, the vehicle orientation θ) changes for each traveling control point Q, so that the obstacle determination area E is appropriately set for each traveling control point Q. Will rotate. Therefore, in the present embodiment, the obstacle determination area E is calculated for each traveling control point Q on the traveling routes RT1 to RT3, and it is determined whether there is an obstacle in the obstacle determination area E. .

  In general, whether or not there are obstacles in the travel routes RT1 to RT3 is actually checked by the driver by visually driving the vehicle 1 or by actually driving the vehicle 1 The determination was made based on whether or not an obstacle entered the obstacle monitoring area E set around 1. However, in both cases, it is not known whether or not there is an obstacle on the travel routes RT1 to RT3 unless the vehicle 1 is actually traveled and travels on the travel routes RT1 to RT3. Therefore, it was unclear whether the target parking position could be reached.

  On the other hand, in the present embodiment, the in-travel area confirmation process (S9) is executed, and before the vehicle 1 autonomously travels, it is determined whether there are obstacles on the travel routes RT1 to RT3. . If no obstacle exists on the travel routes RT1 to RT3 as a result of the check in S9, the vehicle 1 is autonomously driven according to the generated travel routes RT1 to RT3, and the vehicle 1 is stopped at the target parking. .

  Returning to the description of FIG. In the traveling region confirmation process (S9), first, all the obstacle position information stored in the vehicle surrounding information memory 93a of the RAM 93 is acquired (S111). Then, vehicle information is acquired from the vehicle information memory 92a (S112), and various constants for calculating the obstacle determination area E are acquired from the obstacle determination area memory 92b (S113).

  Next, the travel control point Q corresponding to the departure point is set as a travel propriety determination point (S114), and the vehicle position and the vehicle direction, which are the vehicle setting information of the travel feasibility determination point, are acquired from the travel control point memory 93d (S115). . Then, four vertices indicating the position of the obstacle determination area E at the travel feasibility determination point are calculated (S116).

In the process of S116, the constants a ₁₂ , a ₂₃ , a ₃₄ , a ₄₁ , b ₁₂ , b ₂₃ , based on the positions of the four vertices in the obstacle determination area E, together with the four vertices in the obstacle determination area E, b ₃₄ and b ₄₁ are also calculated. Although details of these constants will be described later, the constants calculated here are substituted into the judgment condition formula in the process of S119.

Here, with reference to FIG.16 (b) and FIG.16 (c), four vertexes which show the position of the obstacle determination area | region E are demonstrated. FIG. 16B is a schematic diagram showing an example of the shape of the vehicle 1 and the shape of the obstacle determination area E, and FIG. 16C shows the case where the vehicle position and the vehicle orientation of the vehicle 1 are determined. FIG. 6 is a schematic diagram for explaining a method of calculating an obstacle determination area E of the vehicle 1. In FIG. 16 (b), (c) , the vehicle position of the vehicle 1 indicated as P _i, the traveling direction of the vehicle 1 indicated by straight arrows extending from the vehicle position P _i, the vehicle direction of the vehicle 1 indicated as theta _V ing. As described above, the vehicle position Pi of the vehicle 1 is the position of the reference point of the vehicle 1.

As shown in FIG. 16 (b), the obstacle determination area E is composed of a rectangular area surrounding the entire vehicle 1 with reference to the vehicle position _Pi and the vehicle direction (the traveling direction of the vehicle 1) of the vehicle 1. ing. More specifically, in the obstacle determination area E, the distance in the traveling direction of the vehicle 1 is set to “L + ΔL”, and the distance in the side surface direction of the vehicle 1 is set to “W + ΔW”. The obstacle determination area E is longer by “ΔL / 2” from the front and rear surfaces of the vehicle 1 to the front and rear of the vehicle 1, and from the left and right sides of the vehicle 1 to the left and right directions of the vehicle 1. Each distance is “ΔW / 2” long.

Here, if the distance from the vehicle position of the vehicle 1 (reference point of the vehicle 1) _Pi to the rear end of the obstacle determination area E on the longitudinal axis of the vehicle 1 is the center rear end distance Lg, the obstacle determination is performed. from the apex of the right front of the vehicle 1 of the four vertices of the area E, and the vehicle position linear distance M1 to P _i (reference point of the vehicle 1) of the vehicle 1, the angle α which the straight line and the x-axis forms the
M1 = ((L + ΔL−Lg) ² + ((W + ΔW) / 2) ² ) ^1/2
α = tan ⁻¹ ((L + ΔL−Lg) / ((W + ΔW) / 2))
Is calculated by M1 and α are calculated in advance and stored in the obstacle determination area memory 92b (see FIG. 6). Further, from the apex of the right rear of the vehicle 1 of the four vertexes of the obstacle determining region E, the linear distance M2 to the P _i (reference point of the vehicle 1) the vehicle position of the vehicle 1, the linear and x-axis forms the The angle β is
M2 = (Lg ² + ((W + ΔW) / 2) ² ) ^1/2
β = tan ⁻¹ (Lg / ((W + ΔW) / 2))
Is calculated by M2 and β are also calculated in advance and stored in the obstacle determination area memory 92b (see FIG. 6). Therefore, as shown in FIG. 16C, when the vehicle position of the vehicle 1 is P _i (x _v , y _v ) and the vehicle direction is θ _v , four apexes indicating the position of the obstacle determination area E Among them, the vertex I ₁ (x _i1 , y _i1 ) located in the right front of the vehicle 1 is
x _i1 = x _v + M1 · cos (θ _v − (π / 2−α))
y _i1 = y _v + M1 · sin (θ _v − (π / 2−α))
Can be calculated. Similarly, I ₄ (x _i2 , y _i2 ) is a vertex located on the left front side of the vehicle 1 among the four vertices indicating the position of the obstacle determination area E.
x _i2 = x _v + M1 · cos (θ _v + (π / 2−α))
y _i2 = y _v + M1 · sin (θ _v + (π / 2−α))
Can be calculated. In addition, the vertex I ₃ (x _i3 , y _i3 ) located at the left rear of the vehicle 1 is
x _i3 = x _v + M2 · cos (θ _v + (π / 2 + β))
y _i3 = y _v + M2 · sin (θ _v + (π / 2 + β))
Can be calculated. In addition, the vertex I ₄ (x _i4 , y _i4 ) located at the right rear of the vehicle 1 is
x _i4 = x _v + M2 · cos (θ _v + (3π / 2−β))
y _i4 = y _v + M2 · sin (θ _v + (3π / 2−β))
Can be calculated. When the vehicle position and the vehicle orientation of the vehicle 1 are determined by using the mathematical expressions described with reference to FIGS. 16B and 16C, the obstacle determination area E of the vehicle 1 is determined. Each of the four vertices indicating the position can be calculated.

  As described above, in the present embodiment, the obstacle determination area E is a rectangular area. When the obstacle determination area E has a complicated shape, the boundary of the obstacle determination area E has to be obtained, so the processing becomes complicated. However, since the obstacle determination area E has a rectangular shape, four vertices Only by calculating the position of the obstacle determination area E of the vehicle 1, the processing cost can be suppressed.

  As a process for determining whether or not an obstacle exists on the travel routes RT1 to RT3 when the travel control point Q is the vehicle position of the vehicle 1 and the four vertices of the obstacle determination area E are calculated, The CPU 91 determines whether there is an obstacle in the obstacle determination area E of the vehicle 1. This determination is performed for each traveling control point Q.

  Here, a method for determining whether or not an obstacle exists on the travel routes RT1 to RT3 will be described with reference to FIG. FIG. 17A is a schematic diagram showing an example of a travel area F1 where the vehicle 1 actually travels, and FIG. 17B shows a case where a belt-shaped area formed by concentric circles is regarded as the travel area F2 of the vehicle. It is a schematic diagram which shows an example. FIG. 17C is a schematic diagram illustrating an example of a case where the traveling region F3 of the vehicle 1 is regarded as a region obtained by adding the obstacle determination regions E for the respective traveling control points Q. FIG. It is a schematic diagram for demonstrating an example of the driving | running | working area | region F4 of the vehicle 1 at the time of narrowing the space | interval of each traveling control point Q.

17 (a) to 17 (d) show an obstacle determination area E of the vehicle 1 that moves as the vehicle 1 travels from the path point P _i to the next path point P _{i + 1.} Show. In any case, the turning center K and the turning radius R are the same.

As described above, in the present embodiment, since the area occupied by the obstacle determination area E of the vehicle 1 during traveling is the traveling area of the vehicle 1, the vehicle 1 from the path point P _i to the next path point P _{i +} 1. Is actually traveled, the travel region F1 has a shape as shown in FIG. Note that the gently swelled region G1 is a region that occurs in the structure of the vehicle 1 when the steering angle δ of the vehicle 1 is changed, and the obstacle determination region E by turning the vehicle 1 to the right. The left rear vertex I3 is an area that is generated due to movement outward (left toward the drawing).

  Thus, in order to calculate the actual travel area F1 of the vehicle 1, sections in which the steering angle δ (traveling direction) of the vehicle 1 is the same must be obtained, and the travel area must be calculated for each section. However, the calculation amount may be enormous or the calculation may be complicated. Therefore, when the actual travel region F1 is calculated over the entire travel route RT1 to RT3, a large load is applied to the CPU 91 and it may take time until the calculation is possible.

  On the other hand, in order to reduce the control burden on the calculation of the travel area, it may be considered that a belt-shaped area formed by concentric circles is regarded as the travel area F2 of the vehicle. For example, as shown in FIG. 17B, the radii of the two concentric circles are determined so that the actual travel region F1 of the vehicle 1 is sandwiched between the two concentric arcs having the turning radius K as the center. In FIG. 17B, the width of the band-like region formed by two concentric circles is T. In this way, if the belt-like region formed by concentric circles is regarded as the vehicle travel region F2, the control burden on the travel region calculation can be reduced.

  However, since the travel region F2 includes regions H1 and H2 in which the vehicle 1 does not actually travel, if there are obstacles in the regions H1 and H2, there are obstacles on the travel routes RT1 to RT3. If there is an object, the CPU 91 determines it.

  Therefore, it is determined that the vehicle cannot travel on the travel routes RT1 to RT3 even though it can actually travel, and as a result, a process for generating another travel route RT1 to RT3 or on the other travel routes RT1 to RT3. A process for determining whether or not an obstacle exists is executed, and there is a possibility that a useless process may be executed. Therefore, an unnecessary load is applied to the CPU 91, and it may take time until another traveling routes RT1 to RT3 are found. Further, there is a possibility that another traveling route RT1 to RT3 is not found and the final destination cannot be reached.

  Therefore, in the present embodiment, as shown in FIG. 17 (c), for each traveling control point Q, by determining whether there is an obstacle in the obstacle determination area E of the vehicle 1, It is determined whether or not an obstacle exists on the travel routes RT1 to RT3. Since the traveling control point Q is a point virtually provided on the traveling routes RT1 to RT3, the obstacle determination area E at the traveling control point Q is a part of the actual traveling area F1.

  Therefore, the region F3 obtained by adding all the obstacle determination regions E at the respective traveling control points Q becomes a part of the traveling region F1 where the vehicle 1 actually travels, and thus can be regarded as the traveling region of the vehicle 1. Accordingly, the travel area corresponding to the travel routes RT1 to RT3 can be accurately and easily set without calculating the area where the vehicle 1 actually travels, and within the travel path corresponding to the travel routes RT1 to RT3. In addition, it can be determined whether there is an obstacle.

  In the present embodiment, since it is not necessary to calculate the travel region F1 where the vehicle 1 actually travels, it is not necessary to calculate a complicated region, and the processing cost can be suppressed. Therefore, it is possible to determine whether or not there is an obstacle in the travel route corresponding to the travel routes RT1 to RT3 while suppressing the processing cost. Further, the travel area F3 does not include the areas H1 and H2 in which the vehicle 1 does not actually travel, unlike the travel area F2, so there are obstacles in the travel areas corresponding to the travel routes RT1 to RT3. It is possible to accurately determine whether or not it exists.

  In FIG. 17C, since the interval between two adjacent traveling control points Q is shorter than the vehicle length L of the vehicle 1, all the obstacle determination areas E at the respective traveling control points Q are added together. The region F3 is a series of regions. However, if the interval between two adjacent traveling control points Q is longer than the vehicle length L of the vehicle 1, even if all the obstacle determination regions E at each traveling control point Q are added together, the region is a series of regions. Don't be.

  Therefore, when the interval between two adjacent traveling control points Q is shorter than the vehicle length L of the vehicle 1, the obstacle at each traveling control point Q is greater than when the interval is longer than the vehicle length L of the vehicle 1. Since the region F3 obtained by adding all the object determination regions E approaches the actual travel region F1, it can be accurately determined whether or not there are obstacles in the travel regions corresponding to the travel routes RT1 to RT3.

  Even when the interval between two adjacent travel control points Q is longer than the vehicle length L of the vehicle 1, if the obstacle determination region E is increased, the obstacle determination region E at each travel control point Q A region obtained by adding all of the above can be made into a series of regions. However, as a result, the travel area eventually includes an area where the vehicle 1 does not actually travel, and thus it cannot be accurately determined whether there is an obstacle on the travel routes RT1 to RT3.

  Further, as shown in FIG. 17 (d), the obstacle determination areas E in the respective travel control points Q are all generated as many travel control points Q as possible (at short intervals) are generated for the travel routes RT1 to RT3. Since the added area F4 approaches the actual travel area F1, it can be accurately determined whether or not an obstacle exists on the travel routes RT1 to RT3. Further, the travel area F4 does not include the areas H1 and H2 where the vehicle 1 does not actually travel, unlike the travel area F2, and therefore there are obstacles in the travel areas corresponding to the travel routes RT1 to RT3. It is possible to accurately determine whether or not it exists.

  Therefore, compared to the case where the travel area F2 is set as shown in FIG. 17B, the process of generating other travel routes RT1 to RT3 in spite of the fact that the vehicle 1 can actually travel, or another travel route RT1. It can suppress that the process etc. which determine whether an obstruction exists on -RT3 are performed excessively. Therefore, the control burden can be reduced and the time until the travel routes RT1 to RT3 are found can be reduced. In addition, the possibility of arrival at the final destination can be improved.

  Further, as described above, four vertices indicating the position of the obstacle determination area E can be calculated based on the vehicle position and the vehicle direction of the travel control point Q. The process of calculating the four vertices of the obstacle determination area E at each travel control point Q is easier than the process of calculating the actual travel area F1 of the vehicle 1 because it can be easily calculated by the above-described mathematical formula. Therefore, the control burden can be reduced and the calculation time can be reduced.

  Returning to the description of FIG. When the processing of S116 is completed, 16 types of determinations including primary inequalities are next performed based on the vehicle orientation at the travel propriety determination point and the four vertices indicating the position of the obstacle determination area E calculated in S116. One kind of judgment conditional expression is selected from the conditional expressions (S117).

Here, with reference to FIG. 18 and FIG. 19, 16 types of judgment conditional expressions will be described. FIG. 18 is a schematic diagram for explaining the classification of 16 types of judgment condition expressions. In FIG. 18, of the four vertices indicating the position of the obstacle determination area E, the vertex located on the right front side of the vehicle 1 is denoted by I _1, and the vertex located on the left front side of the vehicle 1 is denoted by I _2. A vertex located at the left rear of 1 is denoted by I _3, and a vertex located at the right rear of the vehicle 1 is denoted by I ₄ . Also it shows the traveling direction of the vehicle 1 corresponding to the obstacle determining region E by a straight line arrows indicate a vehicle direction of the vehicle 1 and theta _v.

In the present embodiment, as shown in FIG. 18, the vehicle direction theta _v of the vehicle 1, in accordance with the positional relationship of four apexes of the obstacle determining region E, first to the pattern of the obstacle determining region E The patterns are classified into up to 16 patterns HP1 to HP16, and the first to sixteenth judgment conditional expressions are provided according to the classification.

As described above, the judgment condition formula is a primary inequality for judging whether or not there is an obstacle in the obstacle judgment area E corresponding to the traveling control point Q. When the determination is performed using the conditional expression, the vehicle orientation θ _V of the vehicle 1 at the travel control point Q, and the position information I _{1 to} I _{4 of the four} vertices of the obstacle determination area E at the travel control point Q Accordingly, one kind of judgment condition expression is selected from the 16 kinds of condition expressions, and based on the positions of the four vertices of the obstacle judgment area E at the travel control point Q in the selected judgment condition expression. Constants a ₁₂ , a ₂₃ , a ₃₄ , a ₄₁ , b ₁₂ , b ₂₃ , b ₃₄ , b ₄₁ and the position information of the obstacle are substituted (see S119 in FIG. 15). As a result of the substitution, if the judgment condition formula is satisfied, it is determined that there is an obstacle in the obstacle determination area E. If the determination condition formula is not satisfied, it is determined that there is no obstacle.

  As described above, in the present embodiment, the obstacle is obtained by a simple process of substituting various constants based on the positions of the four vertices of the obstacle determination area E and the position information of the obstacle into the judgment conditional expression. Since it can be determined whether or not an obstacle exists in the determination area E, the processing cost can be suppressed.

Also, may be provided 16 kinds of judgment condition is selected and the vehicle orientation theta _v of the vehicle 1, the obstacle determining region 4 based on the positional relationship of the vertex determination condition of E. If only one type of judgment condition expression is used, the judgment condition expression becomes complicated and it takes time to make a decision. However, as in the present embodiment, a judgment condition expression is provided according to conditions. Since each determination conditional expression can be simplified, the time required for determination can be shortened.

Hereinafter, the first to sixteenth determination conditional expressions will be described one by one, but in the following description, the patterns HP1 to HP16 of the obstacle determination region E are simply referred to as determination patterns HP1 to HP16. Further, the position ( _xob , _yob ) where the obstacle exists is described as an obstacle ( _xob , _yob ).

First, before describing each judgment conditional expression, referring to FIG. 19, various constants a ₁₂ , a ₂₃ , a ₃₄ , a ₄₁ , b ₁₂ , b ₂₃ , b ₃₄ to be substituted into the judgment conditional expression. , B ₄₁ and a method for calculating various constants will be described. The constant a ₁₂ and the constant b ₁₂ are a coefficient a ₁₂ and an intercept b of a linear line (y = a ₁₂ · x + b ₁₂ ) passing through the vertex I ₁ and the vertex I ₂ among the four vertices of the obstacle determination region E. ₁₂ is shown.

Similarly, the constant a ₂₃ and the constant b ₂₃ indicate the coefficient a ₂₃ and the intercept b ₂₃ of the linear line (y = a ₂₃ · x + b ₂₃ ) passing through the vertex I ₂ and the vertex I ₃ , and the constant a ₃₄ and the constant b _34. Denotes the coefficient a ₃₄ and intercept b ₃₄ of the linear straight line (y = a ₃₄ · x + b ₃₄ ) passing through the vertex I ₃ and the vertex I ₄ , and the constant a ₄₁ and the constant b ₄₁ represent the vertex I ₄ and the vertex I ₁ . A coefficient a ₄₁ and an intercept b ₄₁ of a linear straight line (y = a ₄₁ · x + b ₄₁ ) are shown.

FIG. 19 is a schematic diagram for explaining a method of calculating various constants used in the judgment condition formula. In FIG. 19, of the four vertices indicating the position of the obstacle determination area E, the vertex located on the right front side of the vehicle 1 is denoted as I ₁ (x ₁ , y ₁ ), and the vertex located on the left front side of the vehicle 1 Is represented as I ₂ (x ₂ , y ₂ ), a vertex located at the left rear of the vehicle 1 is designated as I ₃ (x ₃ , y ₃ ), and a vertex located at the right rear of the vehicle 1 is represented by I ₄ (x ₄ , Y ₄ ).

In this case, if a linear line passing through the vertex I ₁ and the vertex I ₂ is y = a ₁₂ · x + b ₁₂ , the coefficient a ₁₂ and the intercept b ₁₂ are
_{a 12 = (y 1 -y 2} ) / (x 1 -x 2)
b ₁₂ = y ₁ −a ₁₂ · x ₁
Can be calculated. Similarly, if the linear line passing through the vertex I ₂ and the vertex I ₃ is y = a ₂₃ · x + b ₂₃ , the coefficient a ₂₃ and the intercept b ₂₃ are
_{a 23 = (y 2 -y 3} ) / (x 2 -x 3)
b ₂₃ = y ₂ −a ₂₃ · x ₂
Can be calculated. Further, if a linear line passing through the vertex I ₃ and the vertex I ₄ is y = a ₃₄ · x + b ₃₄ , the coefficient a ₃₄ and the intercept b ₃₄ are
a ₃₄ = (y ₃ −y ₄ ) / (x ₃ −x ₄ )
b ₃₄ = y ₃ −a ₃₄ · x ₃
Can be calculated. Further, if a linear line passing through the vertex I ₄ and the vertex I ₁ is y = a ₄₁ · x + b ₄₁ , the coefficient a ₄₁ and the intercept b ₄₁ are
a ₄₁ = (y ₄ −y ₁ ) / (x ₄ −x ₁ )
b ₄₁ = y ₄ −a ₄₁ · x ₄
Can be calculated.

Here, the description returns to FIG. The first determination pattern HP1 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “θ _V = 0”. In other words, at least one of “x ₁ = x ₂ ”, “x ₃ = x ₄ ”, “y ₁ = y ₄ ”, and “y ₂ = y ₃ ” is satisfied, one of x ₃ and _{x 4} <one of _{x 1} and _{x 2} "is a pattern that has been established.

In this case, if an obstacle (x _ob , y _ob ) exists in the obstacle determination area E,
x ₃ ≦ x _ob ≦ x ₂ and y ₄ ≦ y _ob ≦ y ₃
The following linear inequality holds. Therefore, this expression is set as a first determination condition expression corresponding to the first determination pattern HP1. Incidentally, in this determination condition, it may be replaced by x ₃ to x _4. Similarly, x ₂ may be replaced with x ₁ , y ₄ may be replaced with y ₁ , and y ₃ may be replaced with y ₂ .

The CPU 91 determines that the vehicle orientation θ _v of the vehicle 1 at the travel control point Q and the position information I _{1 to} I _{4 of the four} vertexes of the obstacle determination area E at the travel control point Q satisfy the conditions of the first determination pattern HP1. If the condition is satisfied, the first determination condition expression is selected from the 16 kinds of determination condition expressions. If the first determination condition formula is satisfied, it is determined that an obstacle exists in the obstacle determination area E. If the first determination condition expression is not satisfied, the obstacle determination area E is determined. It is determined that there are no obstacles.

Note that the vehicle orientation θ _v of the vehicle 1 at the travel control point Q and the position information I _{1 to} I _{4 of the four} vertices of the obstacle determination area E at the travel control point Q satisfy the conditions of the determination patterns HP 2 to HP 16. If the condition is satisfied, a determination condition expression corresponding to the determination pattern is selected.

As illustrated in FIG. 18, the fifth determination pattern HP5, the ninth determination pattern HP9, and the thirteenth determination pattern HP13 are similar to the first determination pattern HP1. That is, the fifth determination pattern HP5 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “θ _V = π / 2”, and “x ₁ = x ₄ ”, “x ₂ = x ₃ ”, “ At least one of “y ₁ = y ₂ ” and “y ₃ = y ₄ ” is satisfied, and “one of x ₂ and x ₃ < _one of x ₁ and x ₄ ” is satisfied. Pattern.

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
x ₂ ≦ x _ob ≦ x ₁ , and y ₃ ≦ y _ob ≦ y ₂
The following linear inequality holds. Therefore, this expression is set as a fifth determination condition expression corresponding to the fifth determination pattern HP5. Incidentally, in this determination condition, it may be replaced by x ₂ to x _3. Similarly, x ₁ may be replaced with x ₄ , y ₃ may be replaced with y ₄ , and y ₂ may be replaced with y ₁ .

The ninth determination pattern HP9 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “θ _V = π”, and “x ₁ = x ₂ ”, “x ₃ = x ₄ ”, “y ₁ = Y ₄ ”and“ y ₂ = y ₃ ”, and a pattern in which“ _one of x ₁ and x ₂ <one of x ₃ and x ₄ ”is further established. It is.

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
x ₁ ≦ x _ob ≦ x ₄ and y ₂ ≦ y _ob ≦ y ₁
The following linear inequality holds. Therefore, this expression is the ninth determination condition expression corresponding to the ninth determination pattern HP9. Incidentally, in this determination condition, it may be replaced with x ₁ to x _2. Similarly, the _{x 4} in _{x 3,} the _{y 2} to _{y 3,} may be replaced with _{y 1} to _{y 4.}

The thirteenth determination pattern HP13 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “θ _V = 3π / 2”, and “x ₁ = x ₄ ”, “x ₂ = x ₃ ”, “ At least one of “y ₁ = y ₂ ” and “y ₃ = y ₄ ” is satisfied, and “ _one of x ₁ and x ₄ <one of x ₂ and x ₃ ” is satisfied. Pattern.

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
x ₁ ≦ x _ob ≦ x ₂ and y ₁ ≦ y _ob ≦ y ₄
The following linear inequality holds. Therefore, this expression is the thirteenth determination condition expression corresponding to the thirteenth determination pattern HP13. Incidentally, in this determination condition, it may be replaced with x ₁ to x _4. Similarly, a _{x 2} to _{x 3,} the _{y 1} to _{y 2,} may be replaced with _{y 4} to _{y 3.}

Second determination pattern HP2 is heading theta _V of the vehicle 1, "0 <θ _V <π / 2" and and a pattern to be _"x 4 _{<x 2".} In this case, as shown in the figure, when a straight line parallel to the y-axis (broken line in the figure) is drawn at each vertex I _{1 to} I ₄ of the obstacle determination area E, the obstacle determination area E is In order to the right, a triangular first region corresponding to I ₃ to I ₄ , a parallelogram second region corresponding to I ₄ to I ₂ , and a triangle corresponding to I ₂ to I ₁ The third region is divided into three regions.

Therefore, if it is determined whether an obstacle ( _xob , _yob ) exists for each of the three areas, it is determined whether the obstacle ( _xob , _yob ) exists in the obstacle determination area E. it can. Specifically, if there is an obstacle in the first area, if there is an obstacle in the second area, if there is an obstacle in the third area, respectively,
x ₃ ≦ x _ob <x ₄ and a ₃₄ · x _ob + b ₃₄ ≦ y _ob ≦ a ₂₃ · x _ob + b ₂₃
x ₄ ≦ x _ob ≦ x ₂ and a ₄₁ · x _ob + b ₄₁ ≦ y _ob ≦ a ₂₃ · x _ob + b ₂₃
x ₂ <x _ob ≦ x ₁ and a ₄₁ · x _ob + b ₄₁ ≦ y _ob ≦ a ₁₂ · x _ob + b ₁₂
The following linear inequality holds. Therefore, if at least one of these three expressions holds, it is determined that an obstacle exists in the obstacle determination area E. These three expressions are used as a second determination condition expression corresponding to the second determination pattern HP2.

As illustrated in FIG. 18, the sixth determination pattern HP6, the tenth determination pattern HP10, and the fourteenth determination pattern HP14 are similar to the second determination pattern HP2. That is, the sixth determination pattern HP6 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “π / 2 <θ _V <π” and “x ₃ <x ₁ ”. As shown in the figure, the obstacle determination area E includes, in order from left to right, a triangular first area corresponding to I ₂ to I ₃ and parallel sides corresponding to I ₃ to I _1. It is divided into three regions, a second region of the shape and a third region of the triangle corresponding to I ₁ to I ₄ .

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 2 ≦ x ob <x 3} , _{and, a 23 · x ob + b} 23 ≦ y ob ≦ a 12 · x ob + b 12
x ₃ ≦ x _ob ≦ x ₁ and a ₃₄ · x _ob + b ₃₄ ≦ y _ob ≦ a ₁₂ · x _ob + b _{12
x 1 <x ob ≦ x 4} , _{and, a 34 · x ob + b} 34 ≦ y ob ≦ a 41 · x ob + b 41
At least one of the three primary inequalities holds. Accordingly, these three expressions are set as a sixth determination condition expression corresponding to the sixth determination pattern HP6.

Further, the tenth determination pattern HP10 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “π <θ _V <3π / 2” and “x ₂ <x ₄ ”. As shown in the figure, the obstacle determination area E includes, in order from left to right, a triangular first area corresponding to I ₁ to I ₂ and parallel sides corresponding to I ₂ to I _4. It is divided into three regions, a second region of the shape and a third region of the triangle corresponding to I ₄ to I ₃ .

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 1 ≦ x ob <x 2} , _{and, a 12 · x ob + b} 12 ≦ y ob ≦ a 41 · x ob + b 41
x ₂ ≦ x _ob ≦ x ₄ , and a ₂₃ · x _ob + b ₂₃ ≦ y _ob ≦ a ₄₁ · x _ob + b _{41
x 4 <x ob ≦ x 3} , _{and, a 23 · x ob + b} 23 ≦ y ob ≦ a 34 · x ob + b 34
At least one of the three primary inequalities holds. Therefore, these three expressions are used as the tenth determination condition expression corresponding to the tenth determination pattern HP10.

The fourteenth determination pattern HP14 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “3π / 2 <θ _V <2π” and “x ₁ <x ₃ ”. As shown in the figure, the obstacle determination area E includes, in order from left to right, a triangular first area corresponding to I ₄ to I ₁ and parallel four sides corresponding to I ₁ to I _3. The shape is divided into three regions, a second region of the shape and a third region of a triangle corresponding to I ₃ to I ₂ .

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 4 ≦ x ob <x 1} , _{and, a 41 · x ob + b} 41 ≦ y ob ≦ a 34 · x ob + b 34
_{x 1 ≦ x ob ≦ x 3} , _{and, a 12 · x ob + b} 12 ≦ y ob ≦ a 34 · x ob + b 34
x ₃ <x _ob ≦ x ₂ , and a ₁₂ · x _ob + b ₁₂ ≦ y _ob ≦ a ₂₃ · x _ob + b ₂₃
At least one of the three primary inequalities holds. Therefore, these three expressions are used as the 14th determination condition expression corresponding to the 14th determination pattern HP14.

The third determination pattern HP3 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “0 <θ _V <π / 2” and “x ₄ = x ₂ ”. In this case, as shown in the figure, when a straight line parallel to the y-axis (broken line in the figure) is drawn at each vertex I _{1 to} I ₄ of the obstacle determination area E, the obstacle determination area E is In order toward the right, the region is divided into two regions: a triangular first region corresponding to I ₃ to I ₄ and a triangular second region corresponding to I ₄ to I ₁ .

Therefore, if it is determined whether an obstacle ( _xob , _yob ) exists for each of the two areas, it is determined whether the obstacle ( _xob , _yob ) exists in the obstacle determination area E. it can. Specifically, when there are obstacles in the first area and obstacles in the second area, respectively,
x ₃ ≦ x _ob <x ₄ and a ₃₄ · x _ob + b ₃₄ ≦ y _ob ≦ a ₂₃ · x _ob + b _{23
x 4 ≦ x ob ≦ x 1} , _{and, a 41 · x ob + b} 41 ≦ y ob ≦ a 12 · x ob + b 12
The following linear inequality holds. Therefore, if at least one of these two expressions holds, it is determined that an obstacle exists in the obstacle determination area E. Note that these two expressions are the third determination condition expression corresponding to the third determination pattern HP3. Further, in this determination condition, it may be replaced by x ₄ in x _2.

As shown in FIG. 18, the seventh determination pattern HP7, the eleventh determination pattern HP11, and the fifteenth determination pattern HP15 are similar to the third determination pattern HP3. That is, the seventh determination pattern HP7 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “π / 2 <θ _V <π” and “x ₁ = x ₃ ”. As shown in the figure, the obstacle determination area E includes, in order from left to right, a triangular area corresponding to I ₂ to I ₃ and a triangular area corresponding to the areas I ₃ to I ₄ . The area is divided into two areas.

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 2 ≦ x ob <x 3} , _{and, a 23 · x ob + b} 23 ≦ y ob ≦ a 12 · x ob + b 12
_{x 3 ≦ x ob ≦ x 4} , _{and, a 34 · x ob + b} 34 ≦ y ob ≦ a 41 · x ob + b 41
At least one of the two primary inequalities holds. Accordingly, these two expressions are used as the seventh determination condition expression corresponding to the seventh determination pattern HP7. Incidentally, in this determination condition, it may be replaced by x ₃ to x _1.

The eleventh determination pattern HP11 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “π <θ _V <3π / 2” and “x ₂ = x ₄ ”. As shown in the figure, the obstacle determination area E corresponds to a triangular first area corresponding to I ₁ to I ₂ and an area from I ₂ to I _{3 in} order from left to right. It is divided into two areas, a triangular second area.

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 1 ≦ x ob <x 2} , _{and, a 12 · x ob + b} 12 ≦ y ob ≦ a 41 · x ob + b 41
x ₂ ≦ x _ob ≦ x ₃ and a ₂₃ · x _ob + b ₂₃ ≦ y _ob ≦ a ₃₄ · x _ob + b ₃₄
At least one of the two primary inequalities holds. Therefore, these two expressions are used as the eleventh determination condition expression corresponding to the eleventh determination pattern HP11. Incidentally, in this determination condition, it may be replaced by x ₂ in x _4.

The fifteenth determination pattern HP15 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “3π / 2 <θ _V <2π” and “x ₁ = x ₃ ”. As shown in the figure, the obstacle determination area E corresponds to a triangular first area corresponding to I ₄ to I ₁ and an area from I ₁ to I _{2 in} order from left to right. It is divided into two areas, a triangular second area.

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 4 ≦ x ob <x 1} , _{and, a 41 · x ob + b} 41 ≦ y ob ≦ a 34 · x ob + b 34
_{x 1 ≦ x ob ≦ x 2} , _{and, a 12 · x ob + b} 12 ≦ y ob ≦ a 32 · x ob + b 32
At least one of the two primary inequalities holds. Therefore, these two expressions are used as a fifteenth determination condition expression corresponding to the fifteenth determination pattern HP15. Incidentally, in this determination condition, it may be replaced with x ₁ to x _3.

Fourth determination pattern HP4 is heading theta _V of the vehicle 1, "0 <θ _V <π / 2" and and a pattern to be a _"x 2 _{<x 4".} In this case, as shown in the figure, when a straight line parallel to the y-axis (broken line in the figure) is drawn at each vertex I _{1 to} I ₄ of the obstacle determination area E, the obstacle determination area E is in order to the right, a triangle corresponding to a first region of the triangle corresponding to the I ₃ to I _2, and a second region of the parallelogram corresponding to the I ₂ to I _4, from I ₄ to I ₁ The third region is divided into three regions.

Therefore, if it is determined whether an obstacle ( _xob , _yob ) exists for each of the three areas, it is determined whether the obstacle ( _xob , _yob ) exists in the obstacle determination area E. it can. Specifically, if there is an obstacle in the first area, if there is an obstacle in the second area, if there is an obstacle in the third area, respectively,
_{x 3 ≦ x ob <x 2} , _{and, a 34 · x ob + b} 34 ≦ y ob ≦ a 23 · x ob + b 23
x ₂ ≦ x _ob ≦ x ₄ and a ₃₄ · x _ob + b ₃₄ ≦ y _ob ≦ a ₁₂ · x _ob + b ₁₂
x ₄ <x _ob ≦ x ₁ and a ₄₁ · x _ob + b ₄₁ ≦ y _ob ≦ a ₁₂ · x _ob + b ₁₂
The following linear inequality holds. Therefore, if at least one of these three expressions holds, it is determined that an obstacle exists in the obstacle determination area E. These three formulas are used as a fourth judgment condition formula corresponding to the fourth judgment pattern HP4.

As shown in FIG. 18, the eighth determination pattern HP8, the twelfth determination pattern HP12, and the sixteenth determination pattern HP16 are similar to the fourth determination pattern HP4. That is, the eighth determination pattern HP8 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “π / 2 <θ _V <π” and “x ₁ <x ₃ ”. As shown in the figure, the obstacle determination area E includes a triangular area corresponding to I ₂ to I ₁ and a parallelogram corresponding to I ₁ to I _{3 in} order from left to right. The area is divided into three areas: a triangular area corresponding to the area from I ₃ to I ₄ .

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
x ₂ ≦ x _ob <x ₁ and a ₂₃ · x _ob + b ₂₃ ≦ y _ob ≦ a ₁₂ · x _ob + b _{12
x 1 ≦ x ob ≦ x 3} , _{and, a 23 · x ob + b} 23 ≦ y ob ≦ a 41 · x ob + b 41
x ₃ <x _ob ≦ x ₄ and a ₃₄ · x _ob + b ₃₄ ≦ y _ob ≦ a ₄₁ · x _ob + b ₄₁
At least one of the three primary inequalities holds. Therefore, these three expressions are used as the eighth determination condition expression corresponding to the eighth determination pattern HP8.

Further, twelfth judgment patterns HP12 is heading theta _V of the vehicle 1, "π <θ _V <3π / 2" and and a pattern to be _"x 4 _{<x 2".} As shown in the figure, the obstacle determination area E includes a triangular area corresponding to I ₁ to I ₄ and a parallelogram corresponding to I ₄ to I _{2 in} order from left to right. The area is divided into three areas: a triangular area corresponding to the area from I ₂ to I ₃ .

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 1 ≦ x ob <x 4} , _{and, a 12 · x ob + b} 12 ≦ y ob ≦ a 41 · x ob + b 41
_{x 4 ≦ x ob ≦ x 2} , _{and, a 12 · x ob + b} 12 ≦ y ob ≦ a 34 · x ob + b 34
_{x 2 <x ob ≦ x 3} , _{and, a 23 · x ob + b} 23 ≦ y ob ≦ a 34 · x ob + b 34
At least one of the three primary inequalities holds. Therefore, these three expressions are used as a twelfth determination condition expression corresponding to the twelfth determination pattern HP12.

The sixteenth determination pattern HP16 is a pattern in which the vehicle orientation θ _V of the vehicle 1 is “3π / 2 <θ _V <2π” and “x ₃ <x ₁ ”. As shown in the figure, the obstacle determination area E includes a triangular area corresponding to I ₄ to I ₃ and a parallelogram corresponding to I ₃ to I _{1 in} order from left to right. The area is divided into three areas: a triangular area corresponding to the area from I ₁ to I ₂ .

Therefore, if an obstacle ( _xob , _yob ) exists in the obstacle determination area E,
_{x 4 ≦ x ob <x 3} , _{and, a 41 · x ob + b} 41 ≦ y ob ≦ a 34 · x ob + b 34
_{x 3 ≦ x ob ≦ x 1} , _{and, a 41 · x ob + b} 41 ≦ y ob ≦ a 23 · x ob + b 23
x ₁ <x _ob ≦ x ₂ , and a ₁₂ · x _ob + b ₁₂ ≦ y _ob ≦ a ₂₃ · x _ob + b ₂₃
At least one of the three primary inequalities holds. Therefore, these three expressions are set as the sixteenth determination condition expression corresponding to the sixteenth determination pattern HP16.

Returning to the description of FIG. When the process of S117 is completed, next, one piece of position information is extracted from the position information of the obstacle acquired in the process of S111 (S118), and the extracted position information is selected by the process of S117. Substitute into the conditional expression (S119). In the process of S119, the various constants _a 12 calculated in the processing in _{S116, a 23, a 34,} a 41, b 12, b 23, b 34, b 41 also substitutes.

  Next, it is determined whether any inequality is established in the determination conditional expression substituted with a numerical value (S120). If the determination in S120 is affirmative (S120: Yes), the obstacle determination area E is entered. Since there is an obstacle, the traveling control point memory 93d of the RAM 93 is cleared (S124), the traveling region confirmation processing is terminated, and the processing returns to the automatic parking processing (see FIG. 7).

  On the other hand, if the determination in S120 is negative (S120: No), it is determined whether all the obstacle position information acquired in the process of S111 has been acquired (S121). If the determination in S121 is negative (S121: No), the process returns to S118, and the position information of another obstacle is substituted into the determination conditional expression. On the other hand, if the determination in S121 is affirmative (S121: Yes), it is determined whether the travel allowance determination point is the final destination (S122). If the determination in S122 is affirmative (S122: Yes), since no obstacle is found on the travel routes RT1 to RT3, the confirmation process in the travel area is terminated and the process returns to the automatic parking process (see FIG. 7). .

  If the determination in S122 is negative (S122: No), the travel control point Q that passes next is set as a travel propriety determination point (S123), the process returns to S115, and the fault corresponding to the next travel control point Q is reached. It is confirmed whether an obstacle exists in the object determination area E.

  According to the travel area confirmation process shown in FIG. 15 described above, the travel control point Q is set as the vehicle position of the vehicle 1, and whether each obstacle is present in the obstacle determination area E of the vehicle 1 is determined. The control point Q can be determined. As described above, since the traveling control point Q is a point virtually provided on the traveling routes RT1 to RT3, the obstacle determination region E at the traveling control point Q is the actual traveling region F1 (FIG. 17). (See (a)).

  Therefore, the region obtained by adding all the obstacle determination regions E at the respective traveling control points Q becomes a part of the traveling region F1 where the vehicle 1 actually travels, and therefore can be regarded as the traveling region of the vehicle 1 (see FIG. 17 (a), FIG. 17 (d)). Therefore, for each travel control point Q, it is determined whether there is an obstacle in the obstacle determination area E of the vehicle 1, so that there is an obstacle in the travel area corresponding to the travel routes RT1 to RT3. It can be determined whether or not it exists.

  Thus, in this embodiment, the obstacle determination area | region E is calculated for every traveling control point Q, and the presence or absence of an obstacle is determined. Therefore, since it is not necessary to calculate the travel region F1 in which the vehicle 1 actually travels along the travel routes RT1 to RT3, it is not necessary to calculate a complicated region, the determination can be easily performed, and the processing cost is reduced. Can be suppressed. Therefore, it can be determined with a small processing cost whether there is an obstacle in the travel route corresponding to the travel routes RT1 to RT3.

  On the other hand, when the travel region F1 where the vehicle 1 actually travels is calculated and the presence or absence of an obstacle is determined, the vehicle 1 actually travels as the travel route RT1 becomes more complicated. The calculation of the travel area F1 becomes complicated. As a result, the amount of calculation becomes enormous, which places a heavy load on the CPU 91 and may take time until the calculation is completed. However, in the present embodiment, the obstacle determination area E is calculated for each traveling control point Q and the presence / absence of the obstacle is determined. Therefore, even if the travel routes RT1 to RT3 are complicated, the determination of the presence / absence of the obstacle is easily performed. It can be performed.

  Accordingly, the present invention is suitable particularly when the travel routes RT1 to RT3 are complicated. In addition, although this embodiment demonstrates the form which stops the vehicle 1 in the target parking position by autonomous driving | running | working, this invention is applicable also when making the vehicle 1 drive | work long distance by autonomous driving | running | working. In that case, the present invention is suitable because the travel route is likely to be complicated.

  In addition, it is possible to determine whether there is an obstacle in the travel area corresponding to the travel routes RT1 to RT3 before the vehicle 1 autonomously travels, so there is no obstacle in the travel area and the vehicle travels to the target parking position. Autonomous driving can be started only when possible. Therefore, although the vehicle 1 has started autonomous traveling, it is possible to suppress the fact that obstacles actually exist on the traveling routes RT1 to RT3 and cannot reach the final destination.

  Here, the description returns to FIG. Once the in-travel area confirmation process is executed, it is next determined whether there is an obstacle in the travel area corresponding to the travel routes RT1 to RT3 (S10). As described above, when the in-travel area confirmation process (S10) is executed, if there is an obstacle in the travel area corresponding to the travel routes RT1 to RT3, the travel control is performed by the process of S124 in FIG. The point memory 93d is cleared. Therefore, in the process of S10, if the traveling control point Q is not stored in the traveling control point memory 93d, it is determined that there is an obstacle. If the traveling control point Q is stored, there is no obstacle. It is determined that

  If the determination in S10 is affirmative (S10: Yes), the process returns to S4 to search for another travel route RT1 to RT3. If the determination in S10 is negative (S10: No), the vehicle 1 is allowed to travel autonomously and the driver is notified that the vehicle 1 can be parked at the target parking position. (S12). Then, it is determined whether the driver has instructed to start autonomous driving and park the vehicle 1 at the parking position, or whether the driver has instructed to stop parking by autonomous driving (S13). When the driver gives an instruction to stop the parking due to traveling (S13: No), the automatic parking process is terminated.

  On the other hand, when the driver has instructed to start autonomous traveling and park the vehicle 1 at the parking position (S13: Yes), the traveling control point Q corresponding to the departure point is set as the current point (S14), The vehicle setting information of the current location is acquired from the travel control point memory 93d (S15). Then, the travel control point Q that the vehicle 1 is scheduled to pass next is set as the target point (S16), and the vehicle setting information of the target point is acquired from the travel control point memory 93d (S17).

  Next, the vehicle 1 is run based on the vehicle setting information at the current location, and the vehicle 1 is moved to the target location (S18). In the process of S18, the steering drive device 5 is controlled and the steering shaft 61 is rotated so that the steering angle δ of the vehicle 1 detected by the steering sensor device 21 matches the steering angle δ of the vehicle setting information. If the traveling direction flag is “1”, the wheel driving device 3 is controlled so that the vehicle 1 moves forward. If the traveling direction flag is “−1”, the wheel driving device is moved so that the vehicle 1 moves backward. 3 is controlled.

  When the processing of S18 is completed, it is next determined whether or not the final destination has been reached (S19). If the determination of S19 is negative (S19: No), the vehicle setting information of the target location is set to the current location. As vehicle setting information (S20), the process returns to S16. Then, the vehicle 1 travels to the next target point. If the determination in S19 is affirmative (S19: Yes), the vehicle 1 is stopped, the driver is notified that the vehicle has arrived at the final destination (S21), and the automatic parking process is terminated.

  The “scanning by the first to third distance sensors 23a to 23c” described in the above embodiment corresponds to the “detecting step” described in the claims. The “automatic parking process (see FIG. 7) executed by the CPU 91” described in the above embodiment corresponds to the “driving support method” described in the claims.

  The present invention has been described above based on the embodiments. However, the present invention is not limited to the above embodiments, and various improvements and modifications can be made without departing from the spirit of the present invention. It can be easily guessed.

  For example, in the above embodiment, the size of the obstacle determination area E is set to one size, but a plurality of sizes such as large, medium, and small are provided, and each dimension value is set as an obstacle of the flash memory 92. It may be stored in the object determination area memory 92b. And you may comprise so that the magnitude | size of the obstacle determination area | region E may be changed automatically according to the width | variety of a travel path, the presence or absence of a pedestrian, etc. For example, a human sensor may be provided in the vehicle 1, and the size of the obstacle determination area E may be increased when a pedestrian is detected, and may be decreased when there is no pedestrian. Thereby, the vehicle 1 can be traveled safely for pedestrians. Further, when the travel path is narrow, the size of the obstacle determination area E may be narrowed. Thereby, since the travel area of the vehicle 1 becomes small, the possibility that the travel routes RT1 to RT3 can be generated can be increased, and the possibility that the vehicle can reach the target parking position can be increased. In addition, the driver may arbitrarily set the size of the obstacle determination area E. In addition, what is necessary is just to memorize | store the value set by the driver | operator in the obstruction determination area | region memory 93b. Even if an obstacle is found on the travel routes RT1 to RT3 and it is determined that the vehicle cannot travel, the travel region corresponding to the travel routes RT1 to RT3 can be reduced if the size of the obstacle determination region E can be reduced. There is a high possibility that it is determined that there is no obstacle, and there is a high possibility that the travel routes RT1 to RT3 can be traveled.

  Moreover, in the said embodiment, after the vehicle 1 starts autonomous driving | running | working, it is comprised so that the vehicle 1 may drive | work until it arrives at the target parking position, but the human body sensor is provided in the vehicle 1 beforehand. The vehicle 1 may be configured to stop when a pedestrian or the like enters the travel region corresponding to the travel routes RT1 to RT3. Thereby, the vehicle 1 can be traveled safely for pedestrians.

  Further, in the above embodiment, when the vehicle 1 is stopped at the target parking position, the travel routes RT1 to RT3 so that the vehicle 1 is finally moved backward and straight and the vehicle 1 is stopped at the target parking position. However, the travel routes RT1 to RT3 may be generated so that the vehicle 1 is finally moved straight forward and stopped at the target parking position.

  Moreover, in the said embodiment, although 10 types of path | route patterns PT1-PT10 are provided, the number of patterns is not restricted to 10 types, You may reduce or increase. Moreover, although all the distance CL of each driving | running route corresponding to each route pattern PT1-PT10 is 2 m, what is necessary is just to set a numerical value suitably. Further, the shape of the travel route corresponding to the route patterns PT1 to PT10 may be set as appropriate.

  In the above embodiment, the travel control point Q is virtually generated on the travel routes RT1 to RT3 at intervals of 0.05 m from the current position to the target parking position, but the interval at which the travel control point Q is provided. May be set as appropriate, such as 0.01 m intervals, 0.1 m intervals, and 0.5 m intervals. Note that, as the interval at which the travel control points Q are provided is narrowed, the region F4 (see FIG. 17D) in which all the obstacle determination regions E at the respective travel control points Q are added closer to the actual travel region F1. It can be accurately determined whether or not an obstacle exists on the travel routes RT1 to RT3.

  Moreover, in the said embodiment, although the three distance sensors 23a-23c are attached to the vehicle 1, you may make the number of sensors attached to two. By reducing the number of sensors, component costs can be suppressed. When the number of sensors is two, for example, the first distance sensor 23 a is attached to the front right of the vehicle 1, and the second distance sensor 23 b is attached to the left rear of the vehicle 1. If attached in this way, the entire periphery of the vehicle 1 can be scanned by the two distance sensors.

  Moreover, in the said embodiment, although the three distance sensors 23a-23c are attached to the vehicle 1, you may each attach to four places etc. of four corners of the vehicle 1. In other words, the number and location of the distance sensors may be any number and location. In particular, since the obstacles can be measured from various angles by installing the distance sensors in a distributed manner, the obstacles can be measured with higher accuracy.

  The travel control device 100 of the above embodiment is configured to autonomously travel the vehicle 1 from the current position to the parking position targeted by the driver and park the vehicle 1 at the parking position. The vehicle speed of 1 may be configured so that the driver can operate with the accelerator pedal 11 and the brake pedal 12, and the traveling control device 100 may be configured to control only the steering 13 of the vehicle 1.

  The travel control device 100 of the above embodiment is configured to autonomously travel the vehicle 1 from the current position to the parking position targeted by the driver and park the vehicle 1 at the parking position. 1 may be configured so that the driver is notified of the travel route from the current position to the parking position targeted by the driver, without performing the autonomous traveling. For example, the travel routes RT1 to RT3 may be displayed on a monitor in the vehicle 1. Alternatively, the driving operation of the driver may be guided by voice so that the vehicle 1 travels on the travel routes RT1 to RT3.

  Further, in the above embodiment, when the vehicle 1 is parked at the target parking position, the left and right rear wheels 2RL, 2RR have the x-axis on the front and rear axes of the vehicle 1 as the y-axis, and the x-axis. Further, the position of the vehicle 1 and the positions of the travel routes RT1 to RT3 are calculated using a coordinate system having the intersection point of the y-axis and the origin O, but the left and right rear wheels 2FL at the current vehicle position of the vehicle 1 , 2FR may be used as a coordinate system in which the x axis is the x axis, the front and rear axes of the vehicle 1 are the y axis, and the intersection of the x axis and the y axis is the origin O. Alternatively, a coordinate system in which an x-axis and a y-axis are arbitrarily provided and the intersection point of the x-axis and the y-axis is the origin O may be used.

  Moreover, in the said embodiment, although it has comprised so that the driving | running | working control point Q may be produced | generated at intervals of 0.05 m for every between adjacent route points P, between arbitrary two route points P, it is 0.05 m intervals. You may comprise so that the traveling control point Q may be produced | generated. For example, when three or more route points P are arranged in order on the travel route, among the three or more route points P, the first route point P (the side closest to the departure point) and the third You may comprise so that the driving | running | working control point Q may be produced | generated by 0.05 m space | interval between the last (point nearest to the final objective) route point P among two or more route points.

  Moreover, in the said embodiment, although it has comprised so that the obstacle determination area | region E may be calculated about all the traveling control points Q on driving | running route RT1-RT3, and the presence or absence of an obstruction may be determined, driving | running route RT1- For some travel control points Q on RT3, an obstacle determination area E may be calculated to determine the presence or absence of an obstacle. For example, every other traveling control point Q may be acquired, the obstacle determination area E may be calculated, and the presence / absence of an obstacle may be determined.

  In the above embodiment, the travel routes RT1 to RT3 of the vehicle 1 from the current position to the target parking position are generated, and the vehicle 1 is autonomously traveled according to the travel routes RT1 to RT3, and the target parking position is reached. Although the vehicle 1 is stopped, a configuration in which the vehicle 1 autonomously travels from the current position to the target position may be employed. For example, the target position may be set far and the vehicle 1 may be traveled for a long distance by autonomous travel.

  In the above embodiment, the travel control point Q is not provided on the route point P0 (departure point). However, the travel control point Q is also provided on the route point P0, and the vehicle 1 is referred to when traveling autonomously. You may comprise as follows.

  Moreover, although the said embodiment is embodiment in case the vehicle 1 is a four-wheeled vehicle, this invention is applicable if it is a vehicle irrespective of the number of wheels, and also to construction machines, such as a shovel car, etc. Applicable.

1 Vehicles 23a to 23c Distance sensor (detection means)
100 Driving support device E Obstacle determination area (estimated occupation area)
Q travel control points S6 to S8 travel control point acquisition means, travel control point acquisition process S116 area acquisition means, area acquisition process S120 determination means, determination process

Claims (4)

A travel support device that controls a vehicle to travel along an arbitrary route from an initial position to a target position,
Travel control point acquisition means for acquiring position information of a travel control point for controlling the vehicle;
Area acquisition means for acquiring position information of an estimated occupied area on the route estimated to be occupied by the vehicle with respect to the travel control point;
Detecting means for detecting position information of the object;
A driving support apparatus comprising: a determination unit that determines whether the object exists in the estimated occupied area based on the position information of the object and the position information of the estimated occupied area.   The driving support device according to claim 1, wherein the area acquisition unit acquires position information using a rectangular area as the estimated occupied area.   The travel control point acquisition means sets the travel control point such that distances between adjacent travel control points in the travel route from the initial position to the target position are shorter than the total length of the vehicle, respectively. The travel support apparatus according to claim 1, wherein the travel support apparatus acquires position information. A driving support method for controlling a vehicle to travel along an arbitrary route from an initial position to a target position,
A travel control point acquisition step of acquiring position information of a travel control point for controlling the vehicle;
An area acquisition step of acquiring position information of an estimated occupied area on the route estimated to be occupied by the vehicle with respect to the travel control point;
A detection step of detecting position information of the object;
And a determination step of determining whether the object is present in the estimated occupied area based on the position information of the object and the position information of the estimated occupied area.

Images