JP3944687B2 - Vehicle navigation apparatus and program - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a vehicle navigation apparatus and a program.
[0002]
[Prior art]
FIG. 19 is a diagram for explaining a conventional method for creating a route by setting a passing point.
In the vehicle navigation apparatus, the search cost is determined for each road. For example, when the user sets the departure point S and the destination D in FIG. 19A, the route with the lowest search cost is searched, Here, the route passing through National Route 11 is being searched. If the route searched in this way is not appropriate for the user, the user sets the passing point 1 as shown in FIG. Explored.
[0003]
[Problems to be solved by the invention]
In the prior art shown in FIG. 19, when the same or almost the same starting point and destination are set, the cost of the road is determined, so the same route through National Route 11 is presented, An undesired route will be searched. For this reason, in order to search for the 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]
[Means for Solving the Problems]
The present invention is for solving the above-mentioned problem. When a route desired by a user such as a passing point is searched, the route is registered, and when the starting point and the destination are substantially the same, the registered same route is registered. By searching, the user's desired route can be reproduced without requiring frequent operations from the user.
[0005]
To this end, the present invention provides a vehicle navigation apparatus that searches for and guides a route from a starting point and a destination, and registers the information of the starting point, the destination, and the route, and registration by the route registering unit. Registered when the current departure point is set within a predetermined range from the departure point of the route and the current destination is set within a predetermined range from the destination of the route registered by the route registration means A route search means for searching for a route based on route information is provided.
Further, the present invention provides a vehicle navigation apparatus for searching for and guiding a route from a departure point and a destination, route registration means for registering information on the departure point, destination and route, and registration by the route registration means. Registered when the current departure point is set within a predetermined range from the departure point of the route and the current destination is set within a predetermined range from the destination of the route registered by the route registration means Route search means for searching for a route based on route information; and specifying means for specifying a road used for the registered route; wherein the route search means lowers the search cost of the road specified by the specifying means. And searching for a route.
The present invention also includes a specific position coordinate and a search condition designated by a user for searching for a departure point, a destination, and a route in a vehicle navigation apparatus that searches for and guides a route from the departure point and the destination. Route registration means for registering route information, and the current departure place is set within a predetermined range from the departure place of the route registered by the route registration means, and from the destination of the route registered by the route registration means The present invention is characterized by comprising route search means for searching for a route based on the registered route information when the current destination is set within a predetermined range.
Further, the present invention provides a vehicle navigation apparatus that searches for and guides a route from a departure point and a destination, registration means for registering operation information in the departure point, destination, and route search, and the departure point of this time If it is determined that the current location is within the valid range from the destination registered by the registration means and the current destination is within the valid range from the departure location registered by the registration means, And route search means for searching for a route by reproducing operation information in the route search.
Further, the present invention provides a program for controlling a navigation device that searches for and guides a route from a departure point and a destination, registers a departure point, a destination, and route information, and determines a predetermined route from the departure point of the registered route. When the current departure point is set within the range and the current destination is set within the predetermined range from the registered route destination, a step for searching the route based on the registered route information is stored in the computer. It is characterized by being executed.
[0006]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a diagram showing an embodiment of a vehicle navigation apparatus according to the present invention. An input device 1 for inputting information on route guidance such as a departure point and a destination, and a current state for detecting information on the current position of the host vehicle. Position detection device 2, map data, navigation data necessary for route search, display / audio guidance data necessary for route guidance, and program (application and / or OS) for displaying map, route search, and guidance ) And the like, a map display process as a navigator processing means, a route search process, a route information registration process, a route reproduction process, a display / voice guidance process necessary for route guidance, and the entire system The central processing unit 4 that controls the vehicle, for example, information relating to the traveling of the vehicle, such as road information and traffic information, and the current position of the vehicle And detect the information, and a further current position information transmitting and receiving apparatus 5 that send and receive information relating to, a display and a speaker other output device 6 for outputting information on route guidance.
[0007]
The input device 1 has a function of selecting a map and inputting a destination, or instructing the central processing device 4 to perform navigation processing at the driver's will. As means for realizing the function, a remote controller such as a touch switch or a jog dial for inputting a destination by a telephone number or coordinates on a map or requesting route guidance can be used. Further, the present invention includes a device for performing dialogue by voice input, and functions as a voice input device. A recording card reader for reading data recorded on an IC card or a magnetic card can also be added. In addition, an information center that stores data necessary for navigation and provides information via a communication line at the request of the driver, and a portable type having 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 be added.
[0008]
The current position detection device 2 obtains the current position information of the vehicle including height information using a satellite navigation system (GPS), and detects the traveling direction of the vehicle in absolute direction by using, for example, geomagnetism. An absolute azimuth sensor, a relative azimuth sensor that detects the traveling azimuth of the vehicle in a relative azimuth using, for example, a steering sensor or a gyro sensor, for example, a distance sensor that detects a mileage of a vehicle from the number of rotations of a wheel, and an acceleration of a vehicle. It is comprised from the sensor etc. which detect and detect present position information containing height information.
[0009]
The information storage device 3 is an external storage device that stores a navigation program and data, and includes, for example, a CD-ROM. The program includes a program for performing processing such as route search, a processing program shown in the flowchart described in the present embodiment, a display output control necessary for route guidance, a program for performing interactive guidance by voice input, and necessary for it A program for performing voice output control necessary for voice guidance and necessary data for voice guidance are stored. Data to be stored include map data, search data, searched route data, guidance data, map matching data, destination data, registration point data, road data, image data of intersections such as intersections, data by genre, land data It consists of files such as mark data and stores all data necessary for the navigation device. The map data is divided into blocks for each predetermined unit and stored in a rectangular shape. The present invention can also be applied to a type in which only data is stored in a CD-ROM and the program is stored in a central processing unit. Here, the information storage device may be not only a CD-ROM but also an optical disk such as a DVD-ROM, a magnetic disk such as a floppy disk, and a magneto-optical disk such as MO.
[0010]
The central processing unit 4 includes a route registration unit 11 that registers information on the searched route, and a route search unit 12 that searches for a route based on the registered route information, and a CPU that executes various arithmetic processes. , A flash memory that reads and stores a program from a CD-ROM of the information storage device 3, a ROM that stores a program (program reading means) for performing a program check and update process of the flash memory, a point coordinate of a set destination, a road Name code No. The RAM is a RAM that temporarily stores searched route guidance information and the like and data being processed. In addition, although not shown in the drawings, a frame memory for storing data to be displayed on an output device such as a display, interactive processing by voice input from the input device 1, or a voice output control signal from the CPU A speech processor that synthesizes speech, phrases, single sentences, sounds, etc. read out from the information storage device 3 based on the above, converts them into analog signals and outputs them to a speaker, and communication that exchanges input and output data by communication The interface and the sensor input interface for taking in the sensor signal of the current position detection device 2 and the clock for entering the date and time in the internal diagnosis information are provided. Note that a program for performing the above-described update processing may be stored in an external storage device.
[0011]
The program according to the present invention and other programs for executing navigation may all be stored in a CD-ROM which is an external storage medium, or a part or all of these programs may be stored in the ROM 42 on the main body side. Good. 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.
[0012]
In addition, 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 and vehicles). To the connected communication station). Then, the central processing unit 4 on the terminal side receives information transmitted from the base station by the information transmitting / receiving device, downloads it to a readable / writable memory (for example, RAM, flash memory, hard disk) in the central processing unit 4 and programs By executing the above, 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 / writable memory so that the map data is stored in a RAM, or may be stored in the same readable / writable memory. May be. Alternatively, a part or all of the program and map data can be downloaded from an information center to a removable storage medium (for example, a memory stick or a floppy disk) from a home personal computer, and the storage medium is connected to the central processing unit 4 to store the storage medium. Various navigation functions may be realized by executing the program.
[0013]
The navigation device of the present invention reads a program from a CD-ROM of an external storage device as described above, or performs a startup process of a relatively large-capacity flash memory and CD for reading a program downloaded from an information center or the like. A small-capacity ROM storing a program (program reading means) is incorporated. The flash memory is a non-volatile storage means that retains stored information even when the power is turned off. Then, as a CD start-up process, a program of ROM that is a program reading means is activated and the program stored in the flash memory is checked, and the CD management information of the CD-ROM of the information storage device 3 is read. The program loading process (update process) is performed based on this information and the state of the flash memory.
[0014]
The information transmitter / receiver 5 is a GPS receiver that acquires information using a satellite navigation system (GPS), a VICS information receiver that acquires information using FM multiplex broadcasting, radio wave beacons, optical beacons, etc. By using a telephone, a personal computer, etc., it is composed of an information center (for example, ATIS) and a data transmitting / receiving device for bidirectionally communicating information with other vehicles.
[0015]
The output device 6 has a function of outputting guidance information by voice and / or a screen when the driver needs it, and printing out data subjected to navigation processing by the central processing unit 4. As means for this, a memory for expanding and rendering data processed by the central processing unit 4 and data stored in the information storage unit 3 on a screen, a display for displaying image data rendered in the memory, and the central processing unit 4 A printer that prints out the data processed in step 1 and data stored in the information storage device 3, a speaker that outputs route guidance by voice, and the like.
[0016]
The display is composed of a simple liquid crystal display or the like, and is expanded and drawn based on map display data and guide data processed by the central processing unit 4 and drawn intersection enlarged view screen, destination name, time, distance, progress Display directional arrows, etc. The image data to be displayed on the display is binary image data (bitmap data), using a communication line that uses map display data and guide data processed by the central processing unit 4 in serial communication, etc. The communication line is also received, developed in the memory in the output device 6 and rendered, and then the designated display range is displayed on the display screen.
[0017]
This display is provided in an instrument panel in the vicinity of the driver's seat, and the driver can check the current location of the host vehicle and obtain information on the route from now on by looking at the display. Although not shown in the figure, a tablet including a touch panel, a touch screen, etc. may be used as the display screen of the display so that point input, road input, etc. can be performed by touching the screen or tracing the screen. Good.
[0018]
Next, a configuration example of data used in the vehicle navigation device of the present invention will be described. 2 and 3 are diagrams showing an example of the configuration of main data files stored in the information storage device.
FIG. 2 (A) shows a part of a road map data file. For each number of roads n, road number, length, road attribute data, (road) shape data address, size and guidance data address, Consists of size. The road number is set for each direction (outbound path, return path) for each road between branch points. As shown in FIG. 3 (A), the road attribute data as road guidance auxiliary information data is data indicating information on the number of lanes, whether the road is elevated, next to the elevated, underpass, next to the underpass or not. is there. As shown in FIG. 2B, the shape data has coordinate data including east longitude and north latitude for each of the number of nodes m when each road is divided into a plurality of nodes (nodes). As shown in FIG. 2 (C), the guidance data includes intersection (or branch point) name, attention point data, road name data, road name voice data address, size and destination data address, and size data. It has become. As shown in FIG. 3B, the road name data includes road type information such as highways, urban highways, toll roads, and general roads (national roads, prefectural roads, etc.), highways, urban highways, and tolls. Data indicating information indicating whether a road is a main line or an attachment road, and is composed of road type data and an intra-class number that is individual number data for each road type.
[0019]
Next, registration and reproduction of the 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.
As shown in the figure, when the starting point and destination are set, it is assumed that the route passing through National Route 11 with the lowest search cost is searched from the cost calculation of the route as described in FIG. 19 (FIG. 4). (A)). If this route is not desired by the user, the passing point 1 is set and the search is performed again, as in the conventional case, and a route passing through the national road 1 is searched (FIG. 4B). When the route registration key on the screen is operated, information on the route desired by the user is registered.
[0020]
FIG. 5 is a diagram for explaining reproduction of a registered route.
When the starting point and destination that are the same as the starting point and destination of the registered route or within the predetermined range (almost the same) are set, the route passing through National Route 11 is searched and displayed as a low-cost route. (FIG. 5A). At this time, in addition to the detail key and the enlargement key, a route history key and a route reproduction key are displayed on the screen. If the user does not want this route, the route reproduction key is operated based on the registered route information. A route search is performed, and the route passing through the national highway No. 1 is searched and displayed without setting the passing point 1 (FIG. 5B).
[0021]
The starting point and destination registered as search keys will be described below. The starting point is the current location of the vehicle when the destination is set, the current location of the vehicle when the destination is set and the search is started, and the vehicle Any of the search start point on the road searched based on the current location, the point input by the user as the departure point, and the search start point on the road searched based on the point input by the user may be used. The destination may be either a point designated by the user or a search end point on the road searched based on the point. Further, when the route reproduction key is displayed, the registered departure place, the departure place and the destination to be compared with the destination may be any of the above.
[0022]
Next, the case where the route information 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 coordinate and the destination coordinate, and the search condition is within the departure point Xm and within the destination Ym.
As shown in FIG. 6, from the longitude and latitude coordinates of the departure point to the longitude and latitude coordinates of the destination, the road type such as national road or prefectural road, road numbers such as national road 1 or prefectural road 21 The link type, link shape, etc., in which the vertical line is separated or not separated are registered. If the starting point and destination set for the search are within a predetermined range from the registered starting point and destination, the route is searched and reproduced based on the registered road number.
[0023]
In the example of FIG. 7, the data to be registered is a road number, and all the road numbers constituting the route from the longitude and latitude coordinates of the departure place to the longitude and latitude coordinates of the destination, and the version of the disk (version) Number) is stored. If the starting point and destination set for the search are within a predetermined range from the registered starting point and destination, the route is searched and reproduced based on the registered road number. Note that the version information of the disc is stored because the road number assigned to the road may change before and after the version changes. When the version information is registered in addition to the road number and the route is reproduced, the road number This is because the route reproduction can be performed using the registered road number only when the version information at the time of registering the number and the route reproduction is the same.
[0024]
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 location is searched (steps S1 and S2). Next, all the searched routes are displayed (step S3), and it is determined whether or not a passing point (multiple destinations) has been added (step S4). Since the passing point is equivalent to the destination in the search process, it is treated as an addition of the destination. When the passing point is added, the adding process is performed (step S5), the searching process including the passing point is performed (step S6), and the entire route display in step S3 is performed. If a passing point is not added in step S4, it is determined whether or not there is a change in search conditions (step S7). If there is a change in the search condition, for example, a search condition such as passing through a toll road or passing through an expressway is set (step S8), search processing 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 an entry / exit IC (interchange) setting (step S10). When there is an entry / exit interchange setting, the entry / exit interchange designation process is performed (step S11), a search process including the entry / exit interchange is performed (step S12), and the process returns to step S3 to display all routes. If it is determined in step S10 that no entry / exit interchange is set, it is determined whether or not the route registration key has been pressed (step S13). When the route registration key is pressed, the starting point and the destination coordinates are stored (step S14), and at the same time, the type and shape of the link are stored only for the number of links (the number of roads) of the route from the starting point to the destination ( Step S15). In step S13, if the route registration key is not pressed, or when the process of step S15 is completed, it is determined whether or not the guidance start key is pressed (step S16). If the route registration key is pressed, the process ends and is not pressed. If yes, the process returns to step S4, and the above process is performed again.
The route registration process when the stored data is the road number shown in FIG. 7 is the same as FIG. 8 except that the number of links in step S15 is the number of roads and the road number is stored for this number of roads. .
[0025]
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 starting point and destination, and there are two possible routes via National Route 1 and National Route 11 and the cost (distance) from the starting point to the branch point of the route. ) Is 5 km, the costs from National Route 1 from the junction of the route to the confluence are 100 km and 90 km via National Route 11, and the cost from the confluence of the route to the destination is 5 km. The cost of going through is
5 + 100 + 5 = 110
The cost via Route 11 is
5 + 90 + 5 = 100
The route via National Route 11 is selected. FIG. 9B shows a calculation example when the route reproduction key is pressed. Cost calculation is performed with a multiplication factor of 0.7 so that the route via National Route 1 is easily selected from the two possible routes via National Route 1 and National Route 11. The cost via Route 1 is
5 × 0.7 + 100 × 0.7 + 5 × 0.7 = 77
The cost via Route 11 is
5 × 0.7 + 90 + 5 × 0.7 = 97
Therefore, the route via National Route 1 is chosen because the cost is smaller via National Route 1.
[0026]
In this example, the multiplication factor of each road for route reproduction where the starting point and destination match is 0.7, but the degree of contribution is changed depending on the difference in the distance between the starting point and the destination that are search keys. Also good. 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. By setting the multiplication coefficient in this way, it becomes easier to select the same route as the stored route.
[0027]
Alternatively, 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. The multiplication coefficient is reduced as X + Y approaches 0, and the multiplication coefficient is increased as X + Y increases. The fact that X + Y is close to 0 means that the starting point and the destination are almost the same as the starting point and the destination of the registered route. Therefore, when reproducing the route, the route that meets the user's request is searched for by making the registered route as easy to select as possible. When X + Y is large, the departure place and the destination are slightly different from those registered. Therefore, the registered route is joined in the middle of the route, and a route that branches off in the middle of the route to reach the destination is searched, and the route meets the user's request.
[0028]
FIG. 10 is a diagram showing a route reproduction processing flow when road types and road numbers are stored in route registration.
When the destination is set (step S21), a route search is performed (step S22). Next, all searched routes are displayed (step S23), and it is determined whether or not the search conditions are met (step S24). That is, it is determined whether or not the departure place is within a predetermined range from the stored departure and destination positions. If the conditions are not met, the process ends. If the search conditions match, a route reproduction key is displayed (step S25), and then it is determined whether or not the route reproduction key has been pressed (step S26). When the route reproduction key is pressed, the cost of the link is lowered by the number of stored links (step S29), and the route search is performed (step S30). When the route reproduction key is not pressed, it is determined whether or not the route history key is pressed (step S27). When the route history key is pressed and a route is designated (step S28), the route reproduction key is pressed. Similarly, the processes of steps S29 and S30 are performed. If the route history key is not pressed in step S27, it is determined whether or not the route release key is pressed (step S31). If the route release key is pressed, the original route is displayed (step S32), and then Then, it is determined whether or not the guidance start key has been pressed (step S33). If pressed, the process ends. If not, the process returns to step S23, and the same process as described above is performed.
[0029]
In the above embodiment, when the route registration key is pressed, information that can identify the road such as the road type and road number of the route is stored, and when the route reproduction key is pressed, the stored road and By making the cost of matching roads low, the stored roads are easily passed. There is known a method for remembering and reproducing all the data of a route that has been passed once, but the amount of stored data increases. On the other hand, in the above embodiment, only the information for searching for the route is stored, and the search is performed again. Therefore, the amount of stored data is not so much and even if the destination is slightly shifted. Since a new search is performed, the guidance is surely performed to the newly set destination.
[0030]
FIG. 11 shows a screen when a route is designated in step S28 of FIG.
When a plurality of search keys for the departure point and destination match and the route reproduction key is pressed, it is necessary to determine which route is to be reproduced. Therefore, when a plurality of search keys match, a route history key is displayed as shown in FIG. 5, 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 be used. In the example of FIG. 11, the starting point which is a search key is near point A, the destination is before the silver B, and the past route outline stored is
1. Passage point addition: Via National Route 1
2. Search condition change: via city expressway
3. Passage point 1 Passage point 2 added: Via National Route 11
4). Search condition change, passing point addition: Via general road
By selecting a past route from this screen, it is possible to search for route reproduction using that route. In this way, by pressing the route reproduction key and selecting a route from the route outline, the intention to reflect the previously registered route on the current route is input, and the route is searched based on the input route outline. .
[0031]
If even one piece of route information is registered, a route history key is displayed as shown in FIG. The user may not remember which route information he previously registered. In this case, the user can determine whether or not to reproduce the route by viewing the route outline (FIG. 11) registered by pressing the route history key instead of the route reproduction key. Anything that is not registered with the route registration key, that is, the route searched for can be used later if it is left as a history.
[0032]
Next, an example of memorizing a specific position coordinate such as a passing point set by a user, a getting-on / off interchange, a search condition such as a toll road priority, and performing a route search based on this condition when a route reproduction key is pressed explain.
FIG. 12 is a diagram for explaining stored data such as search conditions.
Similarly, the search key is the departure point coordinate, the destination coordinate, and the search condition is within the departure point Xm and within the destination Ykm. The route storage data stores the coordinates of the passing points and the search conditions from the longitude and latitude coordinates of the departure point to the longitude and latitude coordinates of the destination.
[0033]
FIG. 13 is a diagram illustrating a processing flow for registering search conditions.
When the destination is set (step S41), the route is searched (step S42). Next, all searched routes are displayed (step S43), and it is determined whether or not a passing point has been added (step S44). When a passing point is added, a passing point addition 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 all routes. Further, if there is no passing point addition, it is determined whether or not the search condition is changed (step S47). When the search condition is changed, the search condition is set (step S48), the search process is performed by changing the search condition (step S49), and the process returns to step S43 to display all routes. Furthermore, if there is no change in the search condition, it is determined whether or not there is a setting for getting on and off (step S50). If there is an entry / exit interchange setting, an entry / exit interchange designation process is performed (step S51), a search process including an entry / exit interchange is performed (step S52), and the process returns to step S43 to display all routes. If it is determined in step S50 that no entry / exit interchange is set, it is determined whether or not the route registration key has been pressed (step S53). When the route registration key is pressed, the coordinates of the starting point and destination which are search keys are stored (step S54), and then the destination destination and passing point coordinates corresponding to the number of routes including the destination and passing point are stored. (Step S55), the search conditions for the corresponding route are stored (step S56), and 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 is pressed, the process ends. If not, the process returns to step S44 and the same processing as described above is performed.
[0034]
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, the route reproduction key is displayed (step S65), and then it is determined whether or not the route reproduction key has been pressed (step S66). When the route reproduction key is pressed, passage point search conditions are set for the number of destinations including the stored passage points (step S69), and a route search is performed based on this (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). When the route history key is pressed and a route is designated on the operation history screen shown in FIG. 11 (step S68). ), Steps S69 and S70 are performed. If the route history key is not pressed in step S67, it is determined whether or not the route release key is pressed (step S71). If the route release key is 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 the route release key has been pressed, the route reproduction process is terminated. Returning to S63, the same processing as described above is performed.
[0035]
Next, an example in which the user's operation itself is stored as stored data and route reproduction is performed using this as a key will be described.
FIG. 15 is a diagram for explaining an example in which user operation contents are stored data.
Similarly, the search key is the departure point coordinate, the destination coordinate, and the search condition is within the departure point Xm and within the destination Ym. As stored data, operations such as enlargement scrolling and reduction operated by the user from the longitude and latitude coordinates of the departure place to the longitude and latitude coordinates of the destination are stored as they are.
[0036]
FIG. 16 is a diagram for explaining a route registration processing flow for storing user operation contents.
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 passing point is added, a passing point addition process is performed (step S85), then a search process including the passing point is performed (step S86), and all routes are displayed. If there is no additional passing point, it is determined whether or not the search condition is changed (step S87). If there is a change, the search condition is set (step S88), and the search process is performed by changing the search condition ( Step S89), all routes are displayed. If there is no change in the search condition, it is determined whether or not there is an entry / exit interchange setting (step S90). If there is a setting, an entry / exit interchange designation process is performed (step S91), and a search process including an entry / exit interchange is performed. (Step S92), all routes are displayed. If no entry / exit interchange is set, it is determined whether or not the route registration key has been pressed (step S93). When the route registration key is pressed, the departure point and destination coordinates, which are search keys, are stored (step S94), and the contents of user operations are stored for all key operations after the destination is set and the registration key is pressed. (Step S95). Next, it is determined whether or not the guidance start key has been pressed (step S96). If the key is pressed, the registration process ends. If not, the process returns to step S84, and the same process as described above is performed.
[0037]
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 for the departure point and the destination match (step S104). If they do not match, the process ends. If they match, the route reproduction key is displayed (step S105), and it is determined whether or not the route reproduction key has been pressed (step S106). When the route reproduction key is pressed, operations are reproduced for the number of stored user operations (step S109). When the route reproduction key is not pressed, it is determined whether or not the route history key is pressed (step S107). When the route is designated (step S108), the number of operations operated by the user is similarly reproduced. Route reproduction processing 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 a guidance start key. Is pressed (step S112). If pressed, the route reproduction process ends. If not pressed, the process returns to step S103, and the same process as described above is performed.
[0038]
FIG. 18 is a diagram for explaining search conditions.
In the above example, the search key is the starting point coordinates and the destination coordinates, and within that range, the search condition is used, and even if the starting point or the destination does not match completely, the route is to be reproduced. When the place and the destination are almost the same point, the registered route is made effective. 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 it is within the effective range, the route reproduction matching the search key is possible. Also, the effective radius may be changed according to the distance between the departure point and the destination. For example, when the distance between the departure point and the destination is large, the effective radius is increased and the distance is small. In some cases, the effective radius is reduced. In addition, since it is possible to check the range of the departure point and destination before the first route search, the route search after the destination setting is omitted and the route reproduction key is displayed suddenly in each processing flow described above. good.
Also, in the above, the road type, road number, etc. are stored and read out to search for the route, the search conditions such as toll road are stored, this is read out and the route is searched, Although a method of searching for a route by storing a series of user operations and reading it out has been described, route search may be performed by arbitrarily combining these route search methods. In the above description, the case where various keys are pressed has been described. However, voice input may be performed instead of the key pressing operation or in addition to the key pressing operation. If the route reproduction key is pressed and there are a plurality of items that match the search key for the departure point and destination, the screen of FIG. 11 is displayed in the same manner as when the route history key is pressed.
[0039]
In the above embodiment, the search key is registered as a search condition that the start point and the destination are set as the search condition, and the start point set this time, the destination matches the registered start point and the destination, or is within a predetermined range. Although the route search is performed based on the data, the route search may be performed by deleting this search condition. That is, when a user can register a plurality of route information and route search operations and set a destination, a desired one is designated from the registered route information and route search operations. As a result, the user can perform a search based on an arbitrarily registered route.
[0040]
【The invention's effect】
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 registered route information or operation information, frequent operations are performed for the user. It is possible to search for a route desired by the user without requesting. For example, in the route search, when the searched route is not desired by the user, the desired route can be searched and registered by specifying a passing point or the like. Then, when the user sets a similar destination later, the route desired by the user can be searched based on previously registered information. As a result, it is not necessary to perform complicated operations such as setting a passing point that had to be performed each time, and a route desired by the user can be presented 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 illustrating a configuration example of main data files.
FIG. 3 is a diagram illustrating a configuration example of main data files.
FIG. 4 is a diagram illustrating a route registration operation.
FIG. 5 is a diagram for explaining reproduction of a registered route.
FIG. 6 is an explanatory diagram when information of a route to be registered is a road type and a road shape.
FIG. 7 is an explanatory diagram when information on a route to be registered is a road number.
8 is a diagram showing a route registration processing flow when the stored data is the road information shown in FIG. 6. FIG.
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 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 for explaining 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 for explaining a route registration processing flow;
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 for creating a route by setting a passing point.
[Explanation of symbols]
DESCRIPTION OF SYMBOLS 1 ... Input device, 2 ... Current position detection device, 3 ... Information storage device, 4 ... Central processing unit, 5 ... Information transmission / reception device, 6 ... Output device, 11 ... Route registration part, 12 ... Route search part

Claims (8)

In a vehicle navigation device that searches and guides a route from a starting point and a destination,
Route registration means for registering information on the departure point, destination and route;
The current departure point is set within a predetermined range from the departure point of the route registered by the route registration unit, and the current destination is set within a predetermined range from the route destination registered by the route registration unit. A route search means for searching for a route based on the registered route information;
A vehicle navigation apparatus comprising: In a vehicle navigation device that searches and guides a route from a starting point and a destination,
Route registration means for registering information on the departure point, destination and route;
The current departure point is set within a predetermined range from the departure point of the route registered by the route registration unit, and the current destination is set within a predetermined range from the route destination registered by the route registration unit. A route search means for searching for a route based on the registered route information;
A specifying means for specifying the road used for the registered route,
The vehicle navigation apparatus characterized in that the route search means searches for a route by reducing the search cost of the road specified by the specifying means. In a vehicle navigation device that searches and guides a route from a starting point and a destination,
Route registration means for registering information on a route including a starting position, a destination, and specific position coordinates designated by the user for route search and a search condition;
The current departure point is set within a predetermined range from the departure point of the route registered by the route registration unit, and the current destination is set within a predetermined range from the route destination registered by the route registration unit. And a route searching means for searching for a route based on the registered route information.   The route search means searches for a route based on registered route information on condition that an intention to reflect a previously registered route on a current route is input. Any one of the vehicle navigation devices.   3. The vehicle navigation apparatus according to claim 2, wherein the specifying unit specifies a road by at least one of road type, road shape, and road number information.   The vehicle navigation apparatus according to any one of claims 1 to 3, wherein the predetermined range from the departure place and the destination is changed according to a distance between the departure place and the destination. In a vehicle navigation device that searches and guides a route from a starting point and a destination,
Registration means for registering operation information in the departure point, destination and route search;
When it is determined that the current departure point is within the effective range from the departure point registered by the registration unit and the current destination is within the effective range from the destination registered by the registration unit , Route search means for searching for a route by reproducing operation information in the route search registered by the registration means;
A vehicle navigation apparatus comprising: In a program for controlling a navigation device that searches and guides a route from a starting point and a destination,
Registering departure, destination and route information;
Based on the registered route information when the current departure point is set within a predetermined range from the departure point of the registered route and the current destination is set within the predetermined range from the registered route destination Searching for a route,
A program characterized by causing a computer to execute.

Images