JPH0658230B2 - Vehicle route guidance device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION << Industrial Application Field >> The present invention relates to a device mounted on a vehicle to provide route guidance to an occupant.

<< Background of the Invention >> In a vehicle route guidance device, there is a demand for automating the work of setting the shortest route from a departure intersection to a destination intersection.

Conventional EDWARD. F. MOORE "The Shortest P"
"Ath Through a Maze" and "Research Report on Possibility of Introducing Dual-Mode Bus System" by Transport Economics Research Center have some descriptions about shortest route search.

However, the shortest route search processing described in these documents is still only conceptual content, and it cannot be applied as it is to a concrete road where there is a traffic direction rule such as entry prohibition or right turn left prohibition, It has not come to practical use.

<< Object of the Invention >> The object of the present invention is to provide the shortest route from a departure intersection to a destination intersection under certain conditions even when applied to a specific road where there are traffic rules such as no entry or right turn. An object of the present invention is to provide a vehicular route guidance device capable of reliably and automatically setting a route.

<< Structure of the Invention >> In order to achieve the above object, the present invention is configured as shown in FIG. 1 and has adjacent intersection information about each intersection as intersection data, and when a departure place and a destination are set, In a vehicle route guidance device that sets a travel route based on intersection data, obtains the current location of the vehicle as the vehicle progresses, and displays the current location on a map while guiding the vehicle to the destination, In addition, the next-reachable adjacent intersection is distinguished from the next-reachable adjacent intersection by considering traveling direction rules such as entry prohibition and turn prohibition, and the intersection data such as the amount of time correlation to each adjacent intersection is stored. Basic information storage means a
With reference to the intersection data of each intersection stored in the basic information storage means a, only the next reachable adjacent intersection is selected and the next unreachable adjacent intersection is not selected. And a route search means b for searching for the shortest route to the destination intersection.

<< Description of Embodiments >> First, the hardware configuration of the device of this embodiment is described below.
Description will be given with reference to the drawings.

As shown in the figure, this device is mainly composed of a stored program type control device consisting of a CPU 1 mainly composed of a microprocessor, a system ROM 2 storing various control system programs and a RAM 3 used as a working area or the like. Has been done.

Then, by causing the CPU 1 to execute various control programs (details will be described later) stored in the system ROM 2, various functions are realized as shown in the general flowchart of FIG.

The current position coordinates (X, Y) and the traveling distance ∫ΔD required during traveling are detected by the distance sensor 4 for each constant distance ΔD traveling.
In response to the interrupt pulse obtained from the CPU 1, the CPU 1 executes the current position calculation process (see FIG. 23), and the unit vector addition process using the vehicle direction θ obtained from the direction sensor 5,
And the unit distance ΔD is simply accumulated.

Guidance information is transmitted to the driver via the video RAM6, C
VDT (Visual Display Termina) mainly based on RT7
l) (see FIG. 3).

Various commands to the apparatus are issued by using the input operation unit 8 including a numeric keypad or the like, or a known transparent operation panel 10 mounted on the front surface of the VDT 9 as shown in FIG.

As shown in FIG. 3, when the transparent operation panel 10 is pressed by a fingertip or the like, the CPU 1 causes the operation panel interface 1
It is possible to detect the pressed portion via 1.

Storage of various information such as road maps and intersections is performed by an external memory 12 such as a floppy disk, an optical disk, a magnetic tape.

As shown in FIG. 4, the external memory 12 is provided with a plurality of block areas corresponding to the blocks obtained by vertically and horizontally dividing the reference road map 13.

Each block area is further divided into a plurality of intersection areas corresponding to each intersection included in the block.

In each intersection area, intersection mode information indicating a three-dimensional intersection or a level intersection, X coordinate information indicating a position on the map, Y coordinate information, intersection name information are stored, and a plurality of adjacent intersection areas are provided. ing.

In each adjacent intersection area, the intersection number information of the intersection adjacent to the intersection, the road number information of the connecting road, the cubic information of each connecting road viewed from the intersection, and the section travel information from the intersection to the adjacent intersection are stored. Has been done.

Each of the above-mentioned information includes the departure intersection, the destination intersection selection processing, the shortest route search processing, and the guidance display processing (I) to be described later.
It is used in (III) (see Fig. 10).

In addition to the intersection information described above, various types of information are stored in the external memory 12 as shown in FIGS.

That is, in the external memory 12, as shown in FIG.
Each area name information storage area, reduced map information storage area corresponding to each area name, enlarged map information storage area corresponding to each zone of each reduced map, point name information included in each enlarged map, and other A table for storing each area name in association with a reduced map number (see FIG. 6), a table for storing each zone of the reduced map in association with an enlarged map number (see FIG. 7), each of the enlarged map A table (see FIG. 8) that stores the Zone and its center coordinates in association with each other and a table (see FIG. 9) that stores the name of the destination such as a resort and the point coordinates of the destination in association with each other are stored. Has been done.

The meaning of each of these pieces of information will be described later in the process of identifying the starting point and the destination.

The description centering on the hardware is completed above, and then the software configuration of the apparatus of this embodiment will be described with reference to the drawings starting from FIG.

As shown in the general flow chart of FIG. 10, the software configuration of the apparatus of this embodiment has a starting point / destination specifying process (step 1001), a starting intersection and a destination intersection selecting process (step 1002), and a shortest route searching process. (Step 1003), guidance display process I (Step 100
4), guidance display processing II (step 1005) and guidance display processing III (step 1006).

Of these processes, the shortest path search process (step 1003) is directly related to the present invention.
Other five processes (steps 1001, 1002, 100
4, 1005 and 1006), there is no direct relationship.

However, although these five processes have already been filed, they are still unpublished (for example, Japanese Patent Application No. 59-2204).
No. 81 (Japanese Patent Publication No. 03-16675), Japanese Patent Application No. 59-2
20484 (Japanese Patent Laid-Open No. 61-100811), Japanese Patent Application No. 59-242435 (Japanese Patent Laid-Open No. 61-121200)
Japanese Patent Application No. 60-57476 (Japanese Patent Laid-Open No. 61-215).
922), Japanese Patent Application No. 60-57478 (Japanese Patent Application Laid-Open No. 61-
216100), Japanese Patent Application No. 60-70622 (Japanese Patent Application Laid-Open No. 61-229196), Japanese Patent Application No. 60-70623 (Japanese Patent Application Laid-Open No. 61-229197), August 30, 1985.
Japanese patent application (Japanese Patent Application No. 60-191208, Japanese Patent Laid-Open No. 62-62)
-51000) etc.

Therefore, in the following description, the shortest path search process will be described in detail in sentences, and the other five processes will be described in detail instead of attaching flowcharts and various charts in which each process content is specifically described in sentences. The text explanation inside should be kept to the minimum necessary.

(A) Determining Place of Departure / Destination In this process, the screen of VDT 9 is used to interact with the operator to finally identify the place of departure / destination.

That is, a list of area names is displayed on the screen (12th
(See the figure), wait for the transparent operation panel to be pressed, and detect the designated area.

Then, a reduced map of the designated area is displayed (see FIG. 13), the transparent operation panel is pressed, and the limited area is detected.

Then, an enlarged map of the limited area is displayed (see FIG. 14), the transparent operation panel is pressed, the final designated area is obtained, and its central coordinates are specified as the starting point or the destination.

In addition, for those who are unfamiliar with geography, a list of spot names is displayed (see FIG. 15), the pressing of the transparent operation panel is waited for, the designated spot name is detected, and the coordinates of the start point,
Recognize as the destination.

The above processing is performed by executing the starting point / destination specifying processing shown in the flowchart of FIG.

The relationship between the pressed area and the reduced map number and the relationship between the pressed area and the enlarged map number are obtained by referring to the tables in FIGS. 6 and 7, and each image information is shown in FIG. What is stored in the external memory is used as shown in FIG.

Further, the relationship between the pressed portion and the center coordinates of each Zone and the relationship between the pressed portion and the point coordinates can be obtained by referring to the tables in FIGS. 8 and 9.

(B) Selection processing of departure intersection and destination intersection This processing is based on the taught departure point coordinates (Xs, Ys) and destination coordinates (Xd, Yd), and XY of each intersection shown in FIG. The coordinate information is searched, and as shown in FIG. 17, the registered intersection which is in the direction of the destination from the point of departure and which is closest to the point of departure outside the circle of the predetermined radius is selected as the point of departure. As shown in the figure, the registered intersection closest to the destination is selected as the destination intersection.

This is performed by executing the selection process of the departure intersection and the destination intersection shown in the flowchart of FIG.

(C) Regarding the shortest route search process In this process, the shortest route to each intermediate intersection is stored while searching for the target intersection from the vicinity of the departure intersection to the distance on the road map, and when the target intersection is detected. , The shortest route from the departure intersection to the destination intersection is selected by returning to the departure intersection, relying on the information about the route to each intersection.

Particularly, in the present invention, the road map information includes a traffic direction rule such as prohibition of entry or prohibition of right or left turn, so that the route to each intermediate intersection can be obtained along the actually travelable route.

Therefore, the contents of the road map information, which is the premise of this processing, will be described first with reference to FIGS. 19B to 19L.

FIG. 19B is a diagram showing a relationship between a flat intersection figure on a general road without a traffic direction restriction such as entry prohibition or right or left prohibition, and an intersection position on the road map information, and FIG. 19C is the corresponding road. It is a memory map which shows the format of map information.

Fig. 19B shows the Funakoshi Bridge 3-chome intersection (tentative name) where the roads No. 3 and No. 10 intersect at right angles to each other. It is possible to go straight and turn left or right in the other three directions as indicated by the middle arrow.

In the north, south, east, and west, there are No. 11, No. 13, and No. 13, respectively.
Adjacent intersections corresponding to intersection No. 2 and intersection No. 22 are arranged.

In the case of such an intersection, the number of intersections is counted as one on the road map information, and its position is the center of the intersection. In this example, the intersection No. 12 indicated by a circle in the figure corresponds to this.

The road map information corresponding to No. 12 is represented as shown in FIG. 19C. That is, in the intersection mode, the X coordinate, the Y coordinate, and the intersection name area, “planar intersection”,
Information corresponding to “X ₁₂ ”, “Y ₁₂ ”, and “Funakoshi Bridge 3-chome” is stored. Here, the X coordinate and the Y coordinate of the intersection No. ₁₂ are abbreviated as X ₁₂ and Y ₁₂ , respectively.

Next, the contents of the adjacent intersection areas 1 to 3 will be described. Adjacent intersection areas ~ are sequentially assigned to the four roads extending from No. 12 in the clockwise direction from the north.

That is, the adjacent intersection area ~ is intersection NO.22, intersection N.
It is assigned in order to the road heading to O.13 and KO NO.11.

Then, corresponding information is stored in the road No. area, the road direction area, and the section route area of each area.

That is, in each road No. area from area to the corresponding road No. “10”, “3”, “10”, “3”,
In addition, in the road direction area, "0", "90", "18"
"0", "270", and "D
" ₁₂₂₂ ", " _D1213 ", " _D1202 ", and " _D1211 " are stored respectively.

Incidentally, as the road orientation In this example, we use those 360 divided clockwise north starting and D ₁₂₂₂ a section journey between exchange NO.12~ exchange NO.22 as sections journey
Is abbreviated.

In this way, by writing the road direction information in each of the adjacent intersection areas ~, and reading it in reverse,
Four roads extend from No. 12, and it is possible to know which direction each road is facing. Then, the road direction information is used in an intersection graphic drawing process (described later) performed before each intersection.

On the other hand, the most important point in the present invention is a state in which no intersection data is written or nothing is written in the intersection intersection areas NO.
Whether to write F.

That is, in the present invention, it is necessary to identify the next actually reachable adjacent intersection for each intersection from all the adjacent intersections, and this identification is written in the intersection NO. Area, or the intersection NO. Depending on whether or not to do it.

In the case of the intersection shown in FIG. 19B, the intersection No. 2 which is the adjacent intersection
Since the intersection No. 2, intersection No. 13, intersection No. 2, and intersection No. 11 are all practically reachable adjacent intersections, the corresponding intersection NO.
"2", "13", "2", and "11" are stored respectively.

Next, FIG. 19D is a diagram showing a relationship between a plane intersection figure on a general road where a right turn is prohibited and a traffic direction is restricted, and FIG. 19E to FIG. It is a memory map which shows the format of the corresponding road map information.

The intersection shown in Fig. 19D is the Nakayama Kita 3-chome intersection (tentative name) where roads No. 9 and No. 8 intersect at a right angle, and this intersection is indicated by the arrow in the drawing. As such, only straight and left turns are allowed, and all right turns are prohibited.

Also, as the adjacent intersection, intersection NO.28, intersection NO.54, intersection
There are four intersections, No. 39 and No. 43.

In the case of such intersections, the number of intersections is counted as 4, and each is positioned at the road entrance to each intersection. In this example, the intersection NO.61, the intersection NO.62, and the intersection N indicated by the circles in the figure
O.63 and No.64 correspond to them.

And each individual intersection is No.61, No.62,
Road map information is stored for each of the intersection No. 63 and the intersection No. 64, as shown in FIGS. 19E to 19H.

In the road map information shown in FIGS. 19E to 19H, the contents of the intersection mode area, the X coordinate area, the Y coordinate area, and the intersection name area are the same as those of the intersection without the traffic direction regulation described in FIG. 19C. The contents of the road No. area, the road direction area, and the section road area of each adjacent intersection area to the adjacent intersection area are the same as those of the intersection without the traffic direction regulation described in FIG. 19C.

On the other hand, among the adjacent intersection areas 1 to 3, only the intersection NO. Area is remarkably different from the case of the intersection without the traffic direction regulation shown in FIG. 19C.

That is, to explain in the case of intersection NO.61 shown in FIG. 19D, intersection NO.61 is the intersection NO.28, intersection NO.
There are four intersections, No. 54, No. 39, and No. 43, but the ones that can actually be reached are No. 2
Limited to No. 43 with 8

To express this, as shown in Figure 19E,
Adjacent intersection area corresponding to intersection No.54, intersection No.39,
In the intersection No. area of No., no intersection No. is written and no data is stored.

Therefore, by referring to the road map information shown in FIG. 19E, although there are four roads around the intersection No. 61, the road that can actually be reached is the intersection No. 2
It is possible to confirm that there is only a road heading to No. 43.

Similarly, from FIG. 19F, the only intersections that can actually be reached from intersection NO.62 are intersection NO.28 and intersection NO.54, and from FIG. 19G, intersection NO.63. Exchange No.5
4, It is an intersection that only intersection No.39 can reach,
Furthermore, from FIG. 19H, it is from NO.64 to NO.39,
It is possible to confirm that only intersection No. 43 is a reachable intersection.

Next, FIG. 19I shows an intersection figure in which an ordinary road, an expressway, a descending road from the expressway to the ordinary road, and an ascending road from the ordinary road to the expressway, and an intersection on the road map information. FIG. 19J, which shows the relationship with the position, is a memory map showing the format of the road map information corresponding to this.

The intersection shown in Fig. 19I is a one-way road for going up to the expressway, and one for going down from the expressway, where the ordinary road of road NO.16 and the expressway of road NO.45 make a three-dimensional intersection. The traffic road is a grade separation intersection that intersects the general road at a right angle, and the reachable adjacent intersections on this grade intersection are intersection No. 102 and intersection No. on the general road.
103 and No. 95 on the highway.

In the case of such an intersection, on the road map information, one intersection (Cross NO.85) is provided at the intersection center where the general road and the highway intersect, as indicated by a circle in the figure.

As shown in FIG. 19J, on the road map information corresponding to the intersection NO.85, the intersection NO.
Road information for each of No. 102, No. 103, and No. 95 is stored, and the fourth adjacent intersection area shows an empty state by writing 0 at the intersection No.

Therefore, it is possible to confirm that the intersection No. 85 has three intersections as the adjacent intersections and can reach each of the intersections by storing the road direction information in each of the areas.

In addition, the road heading to the intersection No. 93 on the expressway shown in FIG. 19I is not likely to be detected in the information shown in FIG. 19J, and therefore, there is a route that reverses the one-way road. It will not be selected.

Next, FIG. 19K is a diagram for explaining an intersection (interchange NO.25) on the highway on an interchange where an ordinary road and the highway intersect, and FIG. 19L is a corresponding road map information format. Is a memory map showing.

Intersection on the expressway shown in Figure 19K
5) is an intersection on the highway as an adjacent intersection (Crossing NO.
6, intersection No. 19), as well as intersections on the general road (Communication No. 2)
9, No. 20).

Of these four intersections, only three intersections that can actually be reached are intersection No. 19, intersection No. 29, intersection No. 20, and intersection No. 6 cannot be reached.

Therefore, as shown in FIG. 19L, no data is stored in the intersection NO. Area of the adjacent intersection area corresponding to the intersection NO.

Therefore, from the stored information in FIG. 19L, intersection NO.25 has four intersections as adjacent intersections, and the only intersections that can be reached are intersection NO.29, intersection NO.20, intersection NO.19. You can confirm that there is.

As described above with reference to FIGS. 19B to 19L, the next reachable intersection and the next reachable intersection are considered in the in-vehicle storage device in consideration of the traffic direction rules such as entry prohibition and turn prohibition. The required time correlation amount (in this example, the distance to the adjacent intersection) is stored for each intersection, and based on these information, the shortest route search processing, the intersection graphic display processing, and the intersection passage will be described later. Confirmation processing is performed.

Next, details of the shortest route search process from the departure intersection to the destination intersection will be described with reference to FIG. 19A.

When the departure intersection and the destination intersection are specified, first, all reachable intersections (that is, primary intersections) next to the departure intersection are searched (step 1901).

Here, in order to check the reachable intersections among all the adjacent intersections, as described above, each adjacent intersection area ~
The intersection No. area is referred to, and it is determined whether or not the intersection number is stored therein or there is no data, and only the intersection where the intersection number is stored may be the reachable adjacent intersection.

Then, as shown in FIG. 20, the route from the departure intersection to the primary intersection is stored in the route storage area corresponding to each intersection, and at the same time, the departure intersection is stored as the previous intersection (step 1902).

Thereafter, the value of the intersection counter N is set to the initial value (step 190
While sequentially updating from 3) (step 1911), all intersections next to each Nth-order intersection, that is, (N +
1) The next intersection is searched (step 1904), the route from the departure intersection to each (N + 1) th intersection is calculated each time (step 1905), and the route is already stored in the route storage area of the (N + 1) th intersection. If so, (step 19
06), as shown in FIG. 20, the rewriting of the journey information and the rewriting of the previous intersection are performed only when the distance is shorter than the already stored journey area (step 190).
7) If no route has been stored yet (No at Step 1906), the route from the starting intersection is stored in the route storage area corresponding to each intersection as shown in FIG. The previous intersection is stored (step 1908).

While the above operation is repeated, if the target intersection is detected in the (N + 1) th-order intersections during that time (step 190
9 affirmative), relying on the previous intersection information of each intersection, the second
As shown in FIG. 1, intermediate passing intersections of the shortest route from the target intersection to the starting intersection are stored in order (step 1910).

As a result, as shown in FIG. 21, when the above processing is completed, the shortest route from the departure intersection to the destination intersection is set and stored in the form of the passing intersection and the passing order.

What is particularly important in the present invention is that, as described above, the next reachable intersection and the required time correlation amount up to that time are taken into consideration in consideration of the traffic direction rules such as entry prohibition and turn prohibition in the storage device. However, it is stored for each intersection, and as a result of performing the shortest route search process using this, the obtained shortest route is actually a vehicle that can be passed, so it is prohibited to turn right or left or enter. Therefore, it is possible to prevent the possibility of becoming impassable.

In the above embodiment, the vehicle side is stored in advance with the travel distance information of the intersection section. However, instead of this, the required time correlation amount information calculated on the assumption of the speed limit of each road, that is, the expressway is short. Of course, the present invention can be applied to the case where the information that the city road is long or the required time correlation amount information calculated on the assumption that all roads are traveling at the same speed is stored.

(D) Guide display processing (I) This processing is for guiding the travel route from the departure point to the departure intersection, and as shown in FIG. 25, until the vehicle approaches within a radius of 300 m from the departure intersection, as shown in FIG. The direction of the departure intersection is displayed using the and arrow-shaped segments, and after approaching within 300 m, the departure route is filled in by using the intersection figure with the vehicle traveling direction right above, as shown in FIG. By displaying it, the departure route direction, that is, the route at the intersection is displayed, and at the same time, the traveling locus is drawn on the screen.

This is performed by executing the processes of FIGS. 22, 24, and 26, respectively.

(E) Guide display processing (II) In this processing, while confirming that the current position is not out of the planned traveling route, the approach to the next passing intersection is monitored, and the current position is confirmed each time the arrival at the intersection is confirmed. To fix
The above operation is repeated with the intersection to be passed next as a new target.

Also, in front of each intersection, Figs. 35, 37, 3
As shown in FIG. 8, the route at the intersection is guided and displayed by using the intersection graphic and the route arrow. Even when the figure of the intersection where the right and left turns are prohibited is displayed, as described above, since the road direction information is stored even at the adjacent intersection that cannot be reached as the intersection information, the figure of the intersection can be accurately displayed.

If the intersection to be bent is a grade separation, the 41st
As shown in the figure, the central part of the intersection figure is outlined,
A route arrow is added to this to guide and display the route at the intersection.

Further, while traveling, the traveling locus is always displayed on the road map in a superimposed manner.

This is performed by executing the respective processes shown in the flow charts of FIGS. 28, 29, 34, 36, 39 and 40.

(F) Guide display processing (III) In this processing, as shown in FIG. 43, the direction of the destination is displayed using the automobile figure and the arrow-shaped segment, and when the destination is approached, Notifies the driver of this with an arrival notification text, as shown in FIG.

This is performed by executing the processing shown in the flowchart of FIG.

<Effects of the Invention> As is apparent from the above description of the embodiments, according to the vehicle route guidance device of the present invention, the departure intersection reaches the destination intersection according to the traffic direction rules such as entry prohibition and right / left turn prohibition. The shortest route can be automatically set, and the practicality and usability of this type of device can be further improved.

[Brief description of drawings]

1 is a block diagram showing the hardware configuration of the apparatus of this embodiment, and FIG. 3 is a VD.
FIG. 4 is a perspective view showing a state in which a transparent operation panel is attached to T.
The figure shows a memory map showing the contents of the intersection information area provided in the external memory. Fig. 5 shows the area name information storage area, reduced map information storage area, enlarged map information storage area, spot name information provided in the external memory. A memory map showing a storage area, and FIG. 6 is a memory map showing the contents of a table in which each area name and the number of the reduced map are stored in association with each other,
FIG. 7 is a memory map showing the contents of a table that stores each Zone of the reduced map in association with the number of the corresponding enlarged map, and FIG. 8 shows each Zone of the enlarged map and the center coordinates of the corresponding Zone stored in association with each other. 9 is a memory map showing the contents of a table, FIG. 9 is a memory map showing the contents of a table that stores the relationship between each spot name and the corresponding spot coordinates in association with each other, and FIG. 10 is a general flow chart of the route guidance device. FIG. 11 is a flow chart showing the details of the process of identifying the departure point and the destination, FIG. 12 is an explanatory view showing a state in which the area names are collectively displayed on the VDT screen, and FIG. 13 is a reduced map displayed on the VDT screen. FIG. 14 is an explanatory diagram showing a state, and FIG. 14 is an explanatory diagram showing a state in which an enlarged map is displayed on the VDT screen,
FIG. 15 is an explanatory view showing a state in which a place name list is displayed on the VDT screen, FIG. 16 is a flow chart showing a selection process of a departure intersection and a destination intersection, and FIG. 17 is an explanatory diagram showing an algorithm for selecting a departure intersection, FIG. 18 is an explanatory view showing an algorithm for selecting a target intersection, FIG. 19A is a flow chart showing details of the shortest route search processing, and FIG. 19B is an intersection graphic without a traffic direction restriction such as entry prohibition or right / left turn prohibition. Explanatory drawing showing the relationship with the position of the intersection on the map information, FIG. 19C is a memory map showing the format of road map information corresponding to FIG. 19B,
FIG. 19D is a diagram showing a relationship between an intersection graphic with a right-turn prohibition traffic direction regulation and an intersection on road map information, FIG. 19E to FIG.
FIG. 19H is a memory map showing a format of road map information corresponding to each intersection shown in FIG. 19D, and FIG. 19I is an intersection figure where a general road, a highway, and a one-way road intersect, and road map information. FIG. 19J is a memory map showing the format of road map information corresponding to FIG. 19I.
FIG. 9K is a diagram showing the relationship between the figure of the intersection on the highway at the interchange where the highway intersects with the general road and the intersection position on the road map information. FIG.
FIG. 20 shows a memory map showing the format of road information corresponding to FIG. 9K, FIG. 20 shows a memory map showing details of a route storage area provided in the RAM, and FIG. 21 shows details of an intersection number area provided in the RAM. Memory map shown, second
FIG. 2 is a flow chart showing the details of the guidance display process (I), FIG. 23 is a flow chart showing the contents of the present location calculation process executed by an interrupt, and FIG. 24 is a flow chart showing the details of the departure intersection direction display process. FIG. 25 is an explanatory view showing a display example on the VDT screen on the way from the departure place to the departure intersection, FIG. 26 is a flowchart showing details of the departure road direction display processing, and FIG. 27 is the VDT when approaching the departure intersection. FIG. 28 is an explanatory diagram showing a display example on the screen, FIG. 28 is a flowchart showing details of the guidance display process (II), FIG. 29 is a flowchart showing details of route guidance preparation process to the next passing intersection, and FIG. Example of a road map showing the relationship between the test circle A, the test circle B, the error test oval, etc. when going to the straight intersection, Fig. 31 is the test circle B, the error test when going to the bent intersection. Road map example, the 3, which shows a circle of relationship
Fig. 2 is an explanatory view showing the inspection area when entering a bent overpass, Fig. 33 is an explanatory view showing the state of each inspection area when exiting a bent overpass, and Fig. 34 is a course when passing straight through an intersection. 35 is a flow chart showing details of the guidance display processing and the current position correction processing, FIG. 35 is an explanatory diagram showing a display example of a VDT screen when approaching a straight intersection, and FIG. 36 is a route guidance display processing at the time of passing a normal intersection and present FIG. 37 is an explanatory diagram showing a display example of a VDT screen when approaching a folding plane intersection, and FIG. 38 is an explanatory diagram showing a display example of a VDT screen when approaching a folding plane intersection. 39 and 40 are flow charts showing details of route guidance display processing and current position correction processing at the time of passing through a normal intersection, and FIG. 41 is at the time of approaching a three-dimensional intersection. Explanatory view showing a display example of DT screen,
FIG. 42 is a flow chart showing details of the guidance display processing (III), FIG. 43 is an explanatory view showing a display example of a VDT screen when approaching a destination intersection, and FIG. 44 is a display example of a VDT screen when approaching a destination. It is an explanatory view shown. a: Basic information storage means b: Route search means

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Kazuhiko Yoshida 2 Takaracho, Kanagawa-ku, Yokohama, Kanagawa Nissan Motor Co., Ltd. (56) Reference JP-A-58-223017 (JP, A)

Claims (2)

[Claims] 1. An adjacent intersection information about each intersection is provided as intersection data, and when a departure place and a destination are set, a traveling route is set based on the intersection data, and the current position of the vehicle is set as the vehicle advances. In the vehicle route guidance device that guides the vehicle to the destination while displaying the current location on the map, the next reachable intersection at each intersection and the traffic direction such as no entry or no left or right turn In consideration of the rules, it distinguishes between unreachable adjacent intersections, basic information storage means that stores intersection data such as required time correlation amount to each adjacent intersection, and the intersections stored in the basic information storage means. Referring to the intersection data, select only the next reachable adjacent intersection and not the next unreachable adjacent intersection,
A route search device for a vehicle, comprising: a route search unit that searches for a shortest route from a departure intersection to a destination intersection. 2. The intersection data stored in the basic information storage means is such that, at an intersection on an expressway at an interchange where an ordinary road intersects with an expressway, a next intersection on the expressway in the traveling direction and an exit to the ordinary road. The route guidance device for a vehicle according to claim 1, wherein the next intersection is a reachable adjacent intersection, and the previous passing intersection on the expressway is an unreachable adjacent intersection. .