JP2002318126A - Navigation apparatus for vehicle and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reproduce a route a user desires without requesting frequent operation from a user. SOLUTION: A navigation apparatus for a vehicle for searching and guiding a route from a starting place to a destination includes a route registering means 11 for registering information of a searched route, and a route searching means 12 for searching a route on the basis of information of the registered route when a starting place and a destination are set within a predetermined range from the starting place and the destination of the route registered by the registering means.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a vehicle navigation device and a program.

[0002]

2. Description of the Related Art FIG. 19 is a diagram for explaining a conventional method for setting a pass point and creating a route. In the vehicle navigation device, a search cost is determined for each road, and, for example, the user sets the departure point S in FIG.
When the destination D is set, the route with the lowest search cost is searched, and here, the route that passes through National Route 11 is searched. If the route searched in this way is not appropriate for the user, the user will be able to see FIG.
As shown in FIG. 9 (b), when passing point 1 is set,
The desired route through the number is searched.

[0003]

In the prior art shown in FIG. 19, when the same or almost the same departure point and destination are set, the cost of the road is determined.
The same route through the number is presented, and every time the user does not want to find the desired route. For this reason, in order to search for a route desired by the user, it is necessary to set a passing point or the like at the same point every time, and a complicated and useless operation is required for the user.

[0004]

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems. When a route desired by a user, such as a passing point, is searched, the route is registered and the departure place and the destination are almost the same. In such a case, the same registered route is searched, so that the route desired by the user can be reproduced without requiring the user to perform frequent operations.

[0005] For this purpose, the present invention provides a vehicle navigation device for searching for and guiding a route from a departure point and a destination, a route registration means for registering information on the searched route, and a route registered by the registration means. And a route search means for searching for a route based on the registered route information when the departure place and the destination are set within a predetermined range from the departure place and the destination. Also, the present invention provides a vehicle navigation device for searching for and guiding a route from a departure place and a destination, a registration unit for registering operation information in the route search, and an operation information in the route search registered by the registration unit. And a route searching means for searching for a route by reproducing the route. Further, the present invention provides a navigation program for searching for and guiding a route from a departure place and a destination, registering information on the searched route, and setting a departure place within a predetermined range from the registered departure place and destination. When a destination is set, a route is searched based on registered route information.

[0006]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a view showing an embodiment of a vehicular navigation device according to the present invention. An input device 1 for inputting information relating to route guidance such as a departure point and a destination, and a current device for detecting information relating to the current position of the own vehicle Position detecting device 2, map data, navigation data necessary for route search, display / voice guidance data necessary for route guidance, and a program (application and / or OS) for displaying a map, searching for a route, and providing guidance ), Etc., a map display process, a route search process, a route information registration process, a route reproduction process, a display / voice guidance process necessary for route guidance, and a whole system as navigator processing means. Central processing unit 4 that performs control of the vehicle, such as road information,
An information transmitting / receiving device 5 for transmitting and receiving traffic information, detecting information on the current position of the vehicle, and transmitting and receiving information on the current position, and a display, a speaker, and other output devices 6 for outputting information on route guidance. Have been.

The input device 1 has a function of selecting a map, inputting a destination, and instructing the central processing unit 4 to perform a navigation process according to a driver's will. As a means for realizing the function, a remote controller such as a touch switch or a jog dial for inputting a destination as a telephone number or coordinates on a map or requesting route guidance can be used. Further, the present invention includes a device for performing a dialogue by voice input, and functions as a voice input device. Further, a recording card reader for reading data recorded on an IC card or a magnetic card can be added. In addition, an information center that stores data necessary for navigation and provides information through a communication line at the request of the driver, and a portable type that has data such as map data, destination data, simple maps, and building shape maps A data communication device for exchanging data with an information source such as an electronic device can also be added.

The current position detecting device 2 obtains the current position information of the vehicle including the height information by using a satellite navigation system (GPS), and determines the traveling direction of the vehicle by using, for example, geomagnetism. An absolute azimuth sensor for detecting the traveling azimuth of the vehicle, for example, a steering sensor, a relative azimuth sensor for detecting the relative azimuth by using a gyro sensor, for example, a distance sensor for detecting the traveling distance of the vehicle from the rotational speed of the wheels, And a sensor for detecting current position information including height information by detecting the acceleration of the vehicle.

The information storage device 3 is an external storage device that stores navigation programs and data, and is composed of, for example, a CD-ROM. The program includes a program for performing a process such as a route search, a processing program shown in a flowchart described in the present embodiment, a display output control required for the route guidance, a program for performing an interactive guidance by voice input, and a program for performing the guidance. Data, a program for performing voice output control necessary for voice guidance, and data necessary for the program are stored. The data to be stored include map data, search data, searched route data, guidance data, map matching data, destination data, registered point data, road data, image data of intersections such as intersections, genre-specific data, and land data. It consists of files such as mark data, and stores all data necessary for the navigation device. The map data is stored in the form of a rectangle divided into blocks of a predetermined unit. The present invention is also applicable to a type in which only data is stored in a CD-ROM and a program is stored in a central processing unit. Here, as the information storage device,
Not only CD-ROMs but also optical disks such as DVD-ROMs, magnetic disks such as floppy disks, and magneto-optical disks such as MOs may be used.

The central processing unit 4 includes a route registration unit 11 for registering information on a searched route and a route search unit 12 for searching for a route based on the information on the registered route. CPU to be executed, flash memory for reading and storing a program from the CD-ROM of the information storage device 3, ROM for storing a program (program reading means) for performing a program check and update process of the flash memory, and a set destination point Coordinates, road name code No. The RAM is configured to temporarily store the searched route guidance information and the data being processed. Although not shown, a frame memory for storing data to be displayed on an output device such as a display, an interactive process by voice input from the input device 1, and a voice output control signal from the CPU. , A phrase read from the information storage device 3 based on the
A voice processor for synthesizing a single sentence, sound, etc., converting it into an analog signal and outputting it to a speaker, a communication interface for exchanging input / output data by communication, and a sensor for capturing a sensor signal of the current position detection device 2 It has a sensor input interface, a clock for writing the date and time in the internal diagnostic information, and the like. Note that a program for performing the above-described update processing may be stored in an external storage device.

The program according to the present invention and other programs for executing navigation may all be stored in a CD-ROM as an external storage medium, or a part or all of these programs may be stored in a ROM 42 of the main body. May be. Various navigation functions are realized by inputting data and programs stored in the external storage medium as external signals to the central processing unit of the navigation apparatus main body and performing arithmetic processing.

Also, the program according to the present invention, other programs for executing navigation, and part or all of the map data are transmitted from an information center (Internet server, navigation server) to a plurality of base stations (Internet provider terminals or vehicles). And a communication station connected by communication). Then, the central processing unit 4 on the terminal side receives the information transmitted from the base station by the information transmitting / receiving device, downloads the information to a readable / writable memory (for example, a RAM, a flash memory, or a hard disk) in the central processing unit 4 and executes the program. , Various navigation functions may be realized. Here, the program may be stored in a flash memory, and the map data may be stored in a separate readable and writable memory such that the program and map data are stored in a RAM, or may be stored in the same readable and writable memory. You may. Alternatively, a program or map data may be partially or entirely downloaded from an information center to a removable storage medium (for example, a memory stick or a floppy (registered trademark) disk) using a personal computer at home.
By connecting the storage medium to the central processing unit 4 and executing a program in the storage medium, various navigation functions may be realized.

The navigation apparatus according to the present invention reads a program from the CD-ROM of the external storage device or starts a relatively large-capacity flash memory or CD for reading a program downloaded from an information center or the like as described above. A small-capacity ROM storing a program for performing processing (program reading means) is built-in.
The flash memory retains stored information even when the power is turned off, that is, is a nonvolatile storage unit. And C
As a start-up process of D, the program of the ROM which is the program reading means is started, the program stored in the flash memory is checked, and the C of the information storage device 3 is checked.
The disk management information of the D-ROM is read. The program loading process (update process) is performed based on this information and the state of the flash memory.

The information transmitting / receiving device 5 is a GPS receiving device that obtains information using a satellite navigation system (GPS);
Using a VICS information receiving device, a mobile phone, a personal computer, etc. to obtain information using FM multiplex broadcasting, radio wave beacon, optical beacon, etc., enables bidirectional information exchange with an information center (for example, ATIS) and other vehicles. It is composed of a data transmitting / receiving device for communicating with the device.

The output device 6 has a function of outputting guidance information by voice and / or screen when the driver needs it, and a function of printing out data or the like subjected to navigation processing by the central processing unit 4. As means for this, the data processed by the central processing unit 4 and the information storage device 3
A memory for developing and drawing the data stored in the memory on the screen, a display for displaying the image data drawn in the memory, and printing out the data processed by the central processing unit 4 and the data stored in the information storage device 3 A printer and a speaker for outputting route guidance by voice are provided.

The display is composed of a simplified liquid crystal display and the like, and is an intersection enlarged map screen developed and drawn based on map display data and guidance data processed by the central processing unit 4, a destination name, a time, The distance, the traveling direction arrow and the like are displayed. The image data displayed on the display is 2
It is value image data (bitmap data), and the display data and the guidance data of the map processed by the central processing unit 4 are received using a communication line used for serial communication or the like, and are also used as other communication lines. After rendering and drawing in the memory in the output device 6, the designated display range is displayed on the screen of the display.

This display is provided in the instrument panel near the driver's seat, and the driver can check the current position of the own vehicle by looking at the display and obtain information on a route from now on. . Also,
Although illustration is omitted, using a tablet including a touch panel, a touch screen, etc. on the display screen of the display,
By touching or tracing the screen, a point input, a road input, or the like may be performed.

Next, an example of the structure of data used in the vehicle navigation device of the present invention will be described. FIG. 2 and FIG. 3 are diagrams showing a configuration example of main data files stored in the information storage device. FIG. 2A shows a part of a road map data file. For each of the number n of roads, a road number, a length, road attribute data, an address of (road) shape data, an address of size and guidance data, Consists of size. The road number is set for each direction (outbound and return) for each road between the branch points. As shown in FIG. 3A, the road attribute data as the road guidance auxiliary information data is data indicating whether the road is an elevated road, next to an elevated road, an underpass, or an underpass, or the number of lanes. is there. As shown in FIG. 2B, when each road is divided into a plurality of nodes (nodes), the shape data has coordinate data including east longitude and north latitude for each of the number m of nodes. As shown in FIG. 2 (C), the guide data includes intersection (or branch point) name, caution data, road name data, address of road name voice data, size, address of destination data, and data of destination data. Has become. The road name data includes, as shown in FIG.
Information on road types such as urban expressways, toll roads, and general roads (national roads, prefectural roads, and other roads) and data indicating whether highways, urban expressways, and toll roads are main roads or attachment roads. , And further includes a type number which is individual number data for each road type.

Next, registration and reproduction of a route created by the user will be described with reference to FIGS. FIG. 4 is a diagram for explaining a route registration operation according to the present invention. When the departure point and the destination are set as shown in the figure, it is assumed that a route that passes through Route 11 with the lowest search cost has been searched from the cost calculation of the route as described with reference to FIG. 19 (FIG. 4). (A)). If this route is not what the user desires, the passing point 1 is set and the search is repeated, as in the past, to search for a route that passes through National Highway No. 1 (FIG. 4).
(B)). Then, when a route registration key on the screen is operated, information on a route desired by the user is registered.

FIG. 5 is a diagram for explaining the reproduction of a registered route. When a departure point and a destination that are the same as the departure point and the destination of the registered route or within a predetermined range (substantially the same) are set, a route that passes through National Route 11 is searched for and displayed as a low-cost route. (FIG. 5A). At this time, a route history key and a route reproduction key are displayed on the screen in addition to the detail key and the enlargement key. If the user does not want this route, the user operates the route reproduction key to display the information on the registered route. A route search is performed, and as a result, a route passing through National Highway No. 1 is searched and displayed without setting the passing point 1 (FIG. 5B).

Below, the departure place registered as a search key,
Describing the destination, the departure point is the current position of the vehicle when the destination is set, the current position of the vehicle when the destination is set and the search is started, and the search on the road searched based on the current position of the vehicle Any of a start point, a point input by the user as a departure place, and a search start point on a road searched based on the point input by the user may be used. The destination may be a point designated by the user or a search end point on a road searched based on the point. When displaying the route reproduction key, the registered departure place and destination may be the same as those described above.

Next, a case where the information of the route to be registered is a road type and a road shape or a road number will be described with reference to FIGS. The search key is the departure point coordinates and the destination point coordinates, and the search conditions are within the departure point Xm and the destination point Y.
m. As shown in FIG. 6, the road 1 constituting the route from the coordinates of the departure point to the coordinates of the destination
Road type such as national road or prefectural road, national highway No. 1, prefectural road 2
A line number such as Route 1, a link type indicating whether the upper and lower lines are separated or not separated, a link shape, and the like are registered. If the departure point and destination set for the search are within a predetermined range from the registered departure point and destination, a route is searched and reproduced based on the registered road number.

In the example of FIG. 7, the data to be registered is a road number, and all the road numbers and road data constituting the route from the coordinates of the departure point to the coordinates of the destination are stored in the disk. The version (version number) is stored. If the departure point and destination set for the search are within a predetermined range from the registered departure point and destination, a route is searched for and reproduced based on the registered road number.
It should be noted that storing the version information of the disc is because the road number assigned to the road may change before and after the version is changed. When the version information is registered in addition to the road number and the route is reproduced, the road number is stored. This is because the route can be reproduced using the registered road number only when the version information when the number is registered and the version information when the route is reproduced are the same.

FIG. 8 is a diagram showing a route registration processing flow when the stored data is the road information shown in FIG. When the destination is set, a route from the departure point or the current position is searched (steps S1 and S2). Next, all searched routes are displayed (step S3), and it is determined whether or not a passing point (multiple destinations) has been added (step S4).
Passing points are equivalent to destinations in the search processing and are therefore treated as additional destinations. When a passing point is added, the additional process is performed (step S5), a search process including the passing point is performed (step S6), and step S3 is performed.
Is displayed. In step S4, if the passing point is not added, it is determined whether there is a change in the search condition (step S7). If there is a change in the search condition, for example, a search condition such as passing on a toll road or a highway is set (step S8), and a search process is performed by changing the search condition (step S9), and the process returns to step S3. All routes are displayed. In step S7,
If there is no change in the search condition, it is determined whether or not there is a setting for the getting on / off IC (interchange) (step S1).
0). If there is an entry / exit interchange setting, an entry / exit interchange designation process is performed (step S1).
1) A search process including the getting-in / out interchange is performed (step S12), and the process returns to step S3 to display the entire route. If it is determined in step S10 that the entry / exit interchange has not been set, it is determined whether the route registration key has been pressed (step S13). When the route registration key is pressed, the coordinates of the departure point and the destination are stored (step S14), and at the same time, the link type and the shape of the number of links (the number of roads) of the route from the departure point to the destination are stored ( Step S15). If it is determined in step S13 that the route registration key has not been pressed, or if the processing in step S15 has been completed, it is determined whether or not the guidance start key has been pressed (step S16). If so, the process returns to step S4, and the above processing is performed again. The route registration processing when the stored data is the road number shown in FIG. 7 is the same as that in FIG. 8 except that the number of links is the number of roads in step S15 and the road numbers are stored for this number of roads. .

FIG. 9 is a diagram for explaining an example of cost calculation in the case of route reproduction. FIG. 9A shows an example of cost calculation immediately after setting the departure point and the destination. There are two possible routes via the national highway No. 1 and the national highway No. 11, and the cost (distance from the departure point to the branch point of the route) ) Is 5km, the cost of each via Route 1 and Route 11 from the junction of the route to the junction is 100km and 90km, and the cost from the junction of the route to the destination is 5km.
The cost via National Highway 1 is 5 + 100 + 5 = 110 The cost via National Highway 11 is 5 + 90 + 5 = 100, and the route via National Highway 11 is selected. Here, FIG. 9B shows a calculation example when the route reproduction key is pressed. The cost calculation is performed with a multiplication factor of 0.7 so that the route via the national highway 1 is easily selected from the two possible routes via the national highway 1 and the national highway 11. The cost via National Highway 1 is 5 × 0.7 + 100 × 0.7 + 5 × 0.7 = 77 The cost via National Highway 11 is 5 × 0.7 + 90 + 5 × 0.7 = 97, and the cost via National Highway 1 is better. Because the cost is small,
The route via National Route 1 is selected.

In this case, the multiplication coefficient of each road in the route reproduction where the departure point and the destination match each other is set to 0.7. However, the degree of contribution is determined by the difference between the search key and the distance between the departure point and the destination. May be changed. For example, if the distance between the destination and the departure point is the same as the stored route, the distance is made smaller than 0.7, and if the distance is different, it is made closer to 1. Setting the multiplication coefficient in this way makes it easier to select the same route as the stored route.

The distance between the registered departure point and the current departure point may be X, the distance between the registered destination and the current destination may be Y, and the multiplication coefficient may be changed by X + Y. As X + Y approaches 0, the multiplication coefficient is reduced,
The multiplication coefficient is increased as X + Y increases. X
The fact that + Y is close to 0 means that the departure place and the destination are substantially the same as the departure place and the destination of the registered route. Therefore, when reproducing a route, the registered route is selected as easily as possible, so that a route desired by the user is searched. When X + Y is large, the departure place and the destination are slightly different from those registered. Therefore, the route merges with the registered route in the middle of the route, and a route that branches off in the middle of the route to the destination is searched for, and the route that is desired by the user is obtained.

FIG. 10 is a diagram showing a route reproduction processing flow when a road type and a road number are stored in the route registration. When the destination is set (step S2
1) A route search is performed (step S22). Next, all searched routes are displayed (step S2).
3) It is determined whether the search condition is satisfied (step S24). That is, it is determined whether the departure place is within a predetermined range from the stored departure place and destination position, and if the conditions are not met, the process ends. If the search conditions match, a root playback key is displayed (step S25), and it is then determined whether the root playback key has been pressed (step S26). When the route reproduction key is pressed, the link cost is reduced by the stored number of links (step S).
29), a route search is performed (step S30). If the route reproduction key is not pressed, it is determined whether or not the route history key is pressed (step S27). If the route history key is pressed and a route is specified (step S28), the case where the route reproduction key is pressed is determined. Similarly, step S29,
30 processes are performed. In step S27, if the route history key has not been pressed, it is determined whether or not the route release key has been pressed (step S31). If the route release key has been pressed, the original route is displayed (step S3).
2) Next, it is determined whether or not the guidance start key has been pressed (step S33). If the key has been pressed, the process ends. If not, the process returns to step S23, and the same processing as described above is performed. Will be

In the above embodiment, when the route registration key is pressed, information that can specify the road, such as the road type and the road number of the route, is stored. When the route reproduction key is pressed, the information is stored in the route search. By reducing the cost of a road that coincides with the road that has been set, it is easier to pass through the stored road. A method of recalling and playing back all the data of the route once passed is known, but the amount of stored data increases. On the other hand, in the above embodiment, only the information for searching the route is stored and the search is performed again, so that the storage data amount is not so necessary, and even if the destination is slightly shifted. Since a new search is performed, guidance is reliably performed to the newly set destination.

FIG. 11 shows a screen when a route is specified in step S28 of FIG. When a plurality of search keys for the departure place and the destination match, and the route reproduction key is pressed, it is necessary to determine which route is to be reproduced. Therefore, if multiple search keys match,
As shown in FIG. 5, a key of the route history is displayed, and when the key is pressed, a transition is made to the route history screen of FIG. By selecting a past route from the transitioned screen, the past route can also be used. In the example of FIG. 11, the departure place serving as the search key is near point A, the destination is in front of Silver B, and the stored past route outline is as follows. 1. Passing point added: Via National Route 1 2. 2. Change search conditions: via city expressway. Passing point 1 Passing point 2 added: Via National Route 11 4. Change of search condition, addition of passing point: Via general road is shown, and by selecting a past route from this screen, search for route reproduction can be performed using that route. As described above, by pressing the route reproduction key and selecting a route from the route outline, an intention to reflect the route registered in the past on the current route is input, and the route is searched based on the input route outline. .

When at least one piece of route information is registered, a route history key is displayed as shown in FIG. Users may not remember which route they have registered before. In this case, the user can determine whether or not to reproduce the route by looking at the registered route outline (FIG. 11) by pressing not the route reproduction key but the route history key. It is to be noted that all items not registered with the route registration key, that is, items searched for the route, can be used later if they are left as histories.

Next, the coordinates of a specific position such as a passing point or an entry / exit interchange set by the user, search conditions such as priority for a toll road, and the like are stored. When the route reproduction key is pressed, a route search is performed based on these conditions. An example will be described. FIG. 12 is a diagram illustrating stored data such as search conditions. The same applies to the case where the search key is the departure point coordinates and the destination coordinates, and the search conditions are within the departure point Xm and the destination Ykm. The route storage data stores the coordinates of the passing point and the search conditions from the longitude and latitude coordinates of the starting point to the longitude and latitude coordinates of the destination.

FIG. 13 is a diagram for explaining a processing flow for registering a search condition. When the destination is set (step S
41), a route is searched (step S42). Next, all the searched routes are displayed (step S4).
3) It is determined whether a passing point has been added (step S44). When a passing point is added, a passing point adding process is performed (step S45), a search process including the passing point is performed (step S46), and the process returns to step S43 to display the entire route. Further, if there is no additional passing point, it is determined whether or not the search condition has been changed (step S47). When there is a change in the search condition, the search condition is set (step S48), a search process based on the change in the search condition is performed (step S49), the process returns to step S43, and the entire route is displayed. Further, if there is no change in the search condition, it is determined whether or not there is an entry / exit interchange setting (step S50). If there is a setting for the getting on / off interchange, a process for designating the getting on / off interchange is performed (step S51), a search process including the getting on / off interchange is performed (step S52), and step S4 is performed.
Returning to 3, all routes are displayed. If it is determined in step S50 that the getting-in / out interchange has not been set, it is determined whether the route registration key has been pressed (step S50).
53). When the route registration key is pressed, the coordinates of the departure place and the destination, which are the search keys, are stored (step S54), and then the destination and the passing point coordinates of the applicable route by the number of routes including the destination and the passing point (Step S5)
5) and store the search condition of the corresponding route (step S)
56), route registration is performed. Next, it is determined whether or not the guidance start key has been pressed (step S57). If the guidance start key has been pressed, the process is terminated. If not, the process returns to step S44 and the same processing as described above is performed.

FIG. 14 is a diagram showing a route reproduction processing flow. When the destination is set (step S61), a route search is performed (step S62). Next, all searched routes are displayed (step S63), and it is determined whether or not the search conditions match (step S64). If the search conditions do not match, the route reproduction process ends. If the search conditions match, a route reproduction key is displayed (step S6).
5) Then, it is determined whether or not the route reproduction key has been pressed (step S66). When the route reproduction key is pressed, pass point search conditions are set for the number of destinations including the stored pass points (step S69), and a route search is performed based on the pass point search conditions (step S70). If the route reproduction key has not been pressed, it is determined whether or not the route history key has been pressed (step S67). If the route history key has been pressed and a route has been designated on the operation history screen shown in FIG. 11 (step S68). ), Step S69, Step S70
Is performed. In step S67, if the route history key has not been pressed, it is determined whether or not the route release key has been pressed (step S71). If the route release key has been pressed, the original route is displayed. If the route release key has not been pressed, it is determined whether or not the guidance start key has been pressed (step S73). If it has been pressed, the route reproduction process ends. Returning to S63, the same processing as described above is performed.

Next, an example will be described in which a user operation itself is stored as stored data, and route reproduction is performed using the key as a key. FIG. 15 is a diagram illustrating an example in which the contents of a user operation are stored data. Search key is departure point coordinates, destination coordinates, search condition is within departure point Xm, destination Y
m is the same. As stored data,
The operations such as enlargement scrolling and reduction performed by the user from the coordinates of the departure point to the coordinates of the destination are stored as they are.

FIG. 16 is a diagram for explaining a route registration processing flow for storing the contents of a user operation. When a destination is set (step S81), a route search is performed (step S82), then, all routes are displayed (step S83), and it is determined whether or not a passing point (multiple destinations) has been added (step S83). Step S84). When a pass point is added, pass point addition processing is performed (step S85), and then search processing including the pass point is performed (step S86), and all routes are displayed. If there is no additional passing point, it is determined whether there is a change in the search condition (step S87). If there is a change, the search condition is set (step S8).
8) A search process is performed by changing the search conditions (step S89), and all routes are displayed. If there is no change in the search conditions, it is determined whether or not there is an interchange setting for getting on and off (step S90). If there is a setting, a process for specifying the interchange for getting on and off is performed (step S9).
1) A search process including the getting-in / out interchange is performed (step S92), and the entire route is displayed. If there is no further entry / exit interchange, it is determined whether the route registration key has been pressed (step S9).
3). When the route registration key is pressed, the coordinates of the departure point and the destination, which are search keys, are stored (step S94), and the contents of the user operation are stored for all key operations after the destination is set until the registration key is pressed. (Step S9
5). Next, it is determined whether or not the guidance start key has been pressed (step S96). If the key has been pressed, the registration process ends. If not, the process returns to step S84, and the same processing as described above is performed.

FIG. 17 is a diagram showing a route reproduction processing flow. When the destination is set (step S101), a route search is performed (step S102). Next, all the searched routes are displayed (step S103), and it is determined whether or not the search conditions of the departure place and the destination match (step S104). If they do not match, the process ends. If they match, a root playback key is displayed (step S
105), it is determined whether or not the route reproduction key has been pressed (step S106). When the route reproduction key is pressed, the operations are reproduced by the stored number of operations of the user (step S109). When the route reproduction key is not pressed, it is determined whether or not the route history key is pressed (step S107), and when a route is designated (step S10).
8) Similarly, the operations are reproduced by the number of times operated by the user, and the route reproduction process is performed. If the route history key has not been pressed, it is determined whether or not the route release key has been pressed (step S110). If the release key has been pressed, the original route is displayed (step S111), and then the guidance start key Is determined (step S1).
12) If the button is pressed, the route reproduction processing ends. If the button is not pressed, the process returns to step S103, and the same processing as described above is performed.

FIG. 18 is a view for explaining search conditions. In the above example, the search key is the departure point coordinates and the destination coordinates, and the search conditions are within a predetermined range from the coordinates. Even if the departure point or the destination does not completely match, the user wants to reproduce the route. When the place and destination are almost the same point, the registered route is made valid. That is, as shown in the figure, the effective radius of the departure place and the effective radius of the destination are set, and if within the effective range, the route reproduction matching the search key can be performed. Further, the effective radius may be changed according to the distance between the departure place and the destination. For example, when the distance between the departure place and the destination is large, the effective radius is increased, and the distance is small. In such a case, the effective radius is reduced. In addition, since the range check of the departure place and the destination can be performed before the first route search, the route search after setting the destination may be omitted and the route reproduction key may be displayed immediately in each of the above processing flows. good. In the above description, a method of searching for a route by reading the road type, the road number, and the like, a method of storing a search condition of a toll road and the like, reading the same, and searching for a route, Although a method of searching for a route by reading a series of user operations has been described, a route search may be performed by arbitrarily combining these route search methods. Although the case of pressing various keys has been described above, voice input may be performed instead of the key pressing operation or in addition to the key pressing operation. When the route reproduction key is pressed and there are a plurality of search keys that match the departure place and destination search keys, the screen shown in FIG. 11 is displayed in the same manner as when the route history key is pressed.

In the above embodiment, the retrieval key is used as the departure place and the destination, and the departure place to be set this time and the registered departure place and the destination are coincident with or within a predetermined range. Although the route search is performed based on the registered data, the search condition may be deleted and the route search may be performed. In other words, the user can register a plurality of pieces of route information and route search operations, and when a destination is set, a desired one is specified from the registered route information and route search operations. This allows the user to perform a search based on the arbitrarily registered route.

[0040]

As described above, according to the present invention, by providing means for registering route information or operation information and means for searching for a route based on the registered route information or operation information, It is possible to search for a route desired by the user without requiring the user to perform frequent operations. For example, when searching for a route, if the searched route is not what the user desires, the user can search for the desired route and specify it by designating a passing point or the like. Then, when the user sets a similar destination later, a route desired by the user can be searched based on the information registered before. This eliminates the need to perform a complicated operation such as setting a passing point, which has to be performed every time, and makes it possible to present a route desired by the user with a simple operation.

[Brief description of the drawings]

FIG. 1 is a diagram showing an embodiment of a vehicle navigation device.

FIG. 2 is a diagram showing a configuration example of a main data file.

FIG. 3 is a diagram showing a configuration example of a main data file.

FIG. 4 is a diagram illustrating a route registration operation.

FIG. 5 is a diagram illustrating reproduction of a registered route.

FIG. 6 is an explanatory diagram in a case where information of a route to be registered is a road type and a road shape.

FIG. 7 is an explanatory diagram in a case where information of a route to be registered is a road number.

8 is a diagram showing a flow of a route registration process when stored data is the road information shown in FIG. 6;

FIG. 9 is a diagram illustrating an example of cost calculation when a route is reproduced.

FIG. 10 is a diagram showing a route reproduction processing flow when road characteristic data is stored in the route registration.

FIG. 11 is a diagram showing a route designation screen in step S28 of FIG.

FIG. 12 is a diagram illustrating stored data such as search conditions.

FIG. 13 is a diagram illustrating a route registration processing flow.

FIG. 14 is a diagram showing a route reproduction processing flow.

FIG. 15 is a diagram showing the contents of stored data.

FIG. 16 is a diagram illustrating a flow of a route registration process.

FIG. 17 is a diagram showing a route reproduction processing flow.

FIG. 18 is a diagram illustrating search conditions.

FIG. 19 is a diagram illustrating a conventional method of creating a route by setting a passing point.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 ... Input apparatus, 2 ... Current position detection apparatus, 3 ... Information storage apparatus, 4 ... Central processing apparatus, 5 ... Information transmission / reception apparatus, 6 ... Output apparatus, 11 ... Route registration part, 12 ... Route search part.

──────────────────────────────────────────────────の Continued on the front page (51) Int.Cl. ⁷ Identification code FI Theme coat ゛ (Reference) G09B 29/10 G09B 29/10 A F-term (Reference) 2C032 HB02 HB08 HB22 HB23 HB24 HB25 HC16 HC24 HC25 HC31 HD21 2F029 AA02 AB01 AB07 AB13 AC01 AC02 AC08 AC09 AC14 AC18 AC20 5B075 ND20 PR08 QM08 UU16 5H180 AA01 BB13 FF04 FF12 FF14 FF22 FF25 FF27 FF33

Claims (8)

[Claims] 1. Search for a route from a departure place and a destination,
In a vehicle navigation device for guiding, when a departure point and a destination are set within a predetermined range from a departure point and a destination of a route registered by the registration means, the route registration means for registering information of a searched route. And a route searching means for searching for a route based on the registered route information. 2. The method according to claim 1, wherein the route search means searches for a route based on information on the registered route, on condition that an intention to reflect a previously registered route on the present route is input. The vehicle navigation device according to claim 1. 3. The method according to claim 1, wherein the information on the route is road information for specifying the route, and the route search means searches the route by lowering a search cost for a road that matches the registered route. Or the vehicle navigation device according to 2. 4. The road information includes at least a road type,
The vehicle navigation device according to claim 3, wherein the navigation device includes one of a road shape and road number information. 5. The route information is a specific position coordinate on the route and a search condition, and the route searching means searches the route based on the registered specific position coordinate and the search condition. Item 3. The vehicle navigation device according to item 1 or 2. 6. The vehicle navigation device according to claim 1, wherein the predetermined range from the departure point and the destination is changed according to a distance between the departure point and the destination. 7. Search for a route from a departure place and a destination,
The navigation apparatus for a vehicle, comprising: registration means for registering operation information in a route search; and route search means for searching for a route by reproducing the operation information in the route search registered by the registration means. Characteristic vehicle navigation device. 8. Search for a route from a departure place and a destination,
In the navigation program for guiding, the information of the searched route is registered, and when the departure place and the destination are set within a predetermined range from the departure place and the destination of the registered route, the route is set based on the registered route information. A program characterized by searching for.