WO2008032354A1

WO2008032354A1 - Route search device, route search method, and others

Info

Publication number: WO2008032354A1
Application number: PCT/JP2006/317982
Authority: WO
Inventors: Ippei Nambata
Original assignee: Pioneer Corporation
Priority date: 2006-09-11
Filing date: 2006-09-11
Publication date: 2008-03-20
Also published as: JPWO2008032354A1; JP4909993B2

Abstract

A route search device, a route search method, a route search processing program, etc., in which the intention of the user of designating an en-route point is incorporated in operation to enable search for the optimum route that the user intends to take. After a destination and an en-route point are set in an in-vehicle navigation device (S), the device search for a route running from a start point, through the en-route point on a preset road or through an on-road point on a road present near the en-route point not on the preset road, up to the destination point. When the en-route point or on-road point on the road is an allowed point at which the vehicle is allowed to turn back, the navigation device allows the vehicle to turn back at the en-route point or on-road point on the road and, at the same time, searches for a route up to the destination.

Description

Specification

Route search device, route search method, etc.

Technical field

The present invention relates to a technical field such as a route search apparatus and method for searching for a route from a departure point to a destination point through a waypoint.

Background art

[0002] Conventionally, for each of a plurality of route candidates from a departure point to a destination point, a link cost set for each link (for example, road attributes such as distance and road width in a section corresponding to the link are considered) In-vehicle navigation devices are known that calculate the total link cost by calculating the total link cost and search for the route candidate with the minimum total link cost as the optimal route.

[0003] Further, in the navigation device disclosed in Patent Document 1, the total cost (total link cost and total node cost) is also considered in consideration of the node cost at a node connecting a plurality of links connected by the link cost. To find the optimal route.

[0004] In searching for such an optimal route, an in-vehicle navigation device is also known in which a user can designate a route point in the middle from a departure point to a destination point. Patent Document 1: Japanese Unexamined Patent Publication No. 2000-329574

Disclosure of the invention

Problems to be solved by the invention

[0005] By the way, the intention of the user to specify the waypoint is assumed to be two ways: when the user wants to stop by the route point (location) and when he wants to pass (pass) the route point. For example, if you want to go through the waypoint, you should search for the optimal route so that you can go through the waypoint without turning back.

[0006] However, if the user wants to drop in at the waypoint, there is a case where there is no problem even if the optimum route is searched so as to return at the waypoint. In conventional in-vehicle navigation devices, it is not possible to automatically distinguish whether a user wants to pass through without turning back at the waypoint, or whether the user can turn back at the waypoint. Therefore, there is an inconvenience in searching for the optimum route that the user really intends.

[0007] Therefore, a route search device and a route search method that can solve such inconveniences and reflect the intention of the user specifying the waypoint and can search for the optimum route intended by the user. An object is to provide a route search processing program and the like. Means for solving the problem

[0008] In order to solve the above-mentioned problem, the invention according to claim 1 is a setting means for setting a destination point and a waypoint, and is not located on a set waypoint or on a set road from the departure point. Route search means for searching for a route to the destination point through a point on the road existing in the vicinity of the waypoint, and the route search means makes the route point on the road or the point on the road return. If it is a permissible point that allows the route, the route to the destination point is searched while allowing the route point on the road or the point on the road to be turned back.

[0009] The invention according to claim 9 exists in the vicinity of the setting step for setting the destination point and the waypoint, and the waypoint on the set road or the waypoint not on the set road from the departure point. A route search step for searching for a route to a destination point through a road point on a certain road, and in the route search step, the route point on the road or the road point is allowed to be turned back. If it is a point, the route to the destination point is searched while allowing the route point or the point on the road to be turned back.

[0010] The route search processing program according to claim 10 sets a destination point and a waypoint.

A computer that searches for a route from the departure point to the destination point through a road point on a certain road that is in the vicinity of a route point on the set road or a route point that is not on the set road. When the waypoint or the roadside point is an allowable point that allows a turnaround, the route point to the destination point is allowed to search while allowing the routepoint or the roadpoint on the road to be turned back. It is characterized by.

[0011] A recording medium according to claim 11 is characterized in that the route search processing program according to claim 10 is recorded so as to be readable by a computer. [0012] The invention according to claim 12 is the setting means for setting the destination point and the waypoint, and when a point not on the road on the map is set as the waypoint, it exists in the vicinity of the waypoint Route search means for searching for a route to the destination point so as to pass through a road point on a certain road, the route search means corresponding to a position on the map of a via point that is not on the set road In addition, a search for a route that turns back the road point or a search for a path that passes through the road point without turning back is performed.

Brief Description of Drawings

FIG. 1 is a diagram showing a schematic configuration example of an in-vehicle navigation device according to the present embodiment.

FIG. 2 is a flowchart showing route search processing of the in-vehicle navigation device S according to the first embodiment.

FIG. 3 is a diagram showing an example of an optimum route (only the vicinity of a waypoint) searched and displayed by route search processing.

FIG. 4 is a flowchart showing a route search process of the in-vehicle navigation device S according to the second embodiment.

FIG. 5 is a diagram showing an example of the entire optimum route searched and displayed by route search processing when the waypoint is an unacceptable point.

FIG. 6 is a diagram showing an example of the entire optimum route searched and displayed by route search processing when the waypoint is an allowable point.

Explanation of symbols

[0014] 1 GPS receiver

2 Sensor section

3 Traffic information receiver

4 Information storage

5 Display section

6 Audio output section

7 Operation unit

8 System controller s Car navigation system

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, the best embodiment of the present application will be described with reference to the accompanying drawings. The embodiment described below is an embodiment when the present application is applied to an in-vehicle navigation device.

First, with reference to FIG. 1 and the like, the configuration and functions of the in-vehicle navigation device in the present embodiment will be described.

[0018] As shown in FIG. 1, the in-vehicle navigation device S includes a GPS (Global Positioning System) receiving unit 1, a sensor unit 2, a traffic information receiving unit 3, an information storage unit 4, a display unit 5, The audio output unit 6, the operation unit 7, and the system control unit 8 are provided.

[0019] The GPS receiver 1 receives a navigation radio wave output from a GPS satellite that is arranged in a satellite orbit and orbits the earth via an antenna (not shown), and based on the received signal, position information (longitude and Latitude) is detected and output to the system controller 8 as GPS data.

[0020] The sensor unit 2 detects, for example, a speed sensor that detects the speed of the vehicle based on a vehicle speed pulse, a direction sensor (gyro sensor) that detects the traveling direction of the vehicle using geomagnetism, and detects the acceleration of the vehicle. It is equipped with an acceleration sensor, a distance sensor that detects the mileage of the vehicle, etc., and outputs each data (speed data, bearing data, acceleration data, mileage data, etc.) detected by these sensors to the system control unit 8 It is supposed to be.

[0021] The traffic information receiving unit 3 has, for example, a VICS (Vehicle Information and Communication System) receiver, FM multiplex broadcasting, and light (infrared rays) installed on roads (main highways and highways) Beacon, radio wave (quasi-microwave) beacon, etc. Powered road traffic information (for example, information on traffic conditions such as traffic jams) is received and output to the system control unit 8.

[0022] The information storage unit 4 includes, for example, a CD (Compact Disc) ROM drive, a DVD (Digital Versatile Disc) —ROM drive, or an HD (Hard Disc) drive. Under the control of Buka System Control Unit 8, data and programs for route search and route guidance (route guidance) recorded on recording media such as CD-ROM, DVD-ROM, or HD are read. Output to system control unit 8. Furthermore, the HD or the like in the information storage unit 4 stores history information related to the route searched in the past and the guided route.

[0023] Here, the data for performing route search, route guidance, etc. include, for example, map data, PO I (Point Of Interest) data, link data, node data, route guidance data, and further to the user. Data (for example, menu data) for prompting an input instruction or selection instruction is included.

[0024] The map data includes image data for displaying a map on the display screen in the display unit 5, and coordinates of each point (coordinates (Χ, Υ) on the map corresponding to latitude and longitude). For example, multiple administrative boundary data (including addresses corresponding to each administrative division) indicating the boundaries of multiple administrative divisions on the map, road data indicating roads on the map (each road name) , Each intersection name, and the name of each junction (junction), etc.), multiple houses showing a house shape as an example of multiple flat sections on the map (for example, sections where facilities, buildings, etc. are installed) Shape data (including address, postal code, and telephone number corresponding to each house shape) and shape data (including names of rivers and mountains) showing the shape of rivers and mountains, etc. Contains. Note that data indicating coordinates are associated with addresses, road names, intersection names, and the like in the map data.

[0025] In addition, the above ΡΟΙ data indicates the contents of the points on the map (for example, facilities (amusement parks, theme parks, etc.) and buildings (houses, condominiums, hotels, buildings, offices, etc.)) , Address, telephone number, postal code, and 座標 coordinates (coordinates on the map corresponding to latitude and longitude (Χ, Υ)), etc. are included and can be associated with house shape data .

[0026] Further, the road indicated by the road data is also configured with a link force as a plurality of line segments, and at least two links are connected by one node. This node corresponds to, for example, a connecting portion including a contact point (a node) such as an intersection, a turning point, a branch point, a junction (junction) of each road, or an intern of a toll road. [0027] The link data includes, for each link, the link ID of the link, the node IDs of the two nodes to which the link is connected, the distance of the road corresponding to the link (distance of the road section), the attribute And information such as direction (the information is associated with each link). The road attributes include, for example, information such as the width of the road, the number of lanes of the road, whether one-way or two-way, and whether there is a right / left turn lane.

Furthermore, a link cost is set for each link as a weight that takes into account the distance of the road corresponding to the link, the attribute of the road, and the like. For example, when the road distance is short or the road width is wide, the time required for traveling in the section is shortened, so the link cost is set small. In addition, the link cost varies depending on traffic conditions such as traffic jams obtained by the traffic information receiving unit 3 (for example, in the case of traffic jams, the link cost power S corresponding to the link is set to be small). .

[0029] Further, the node data includes, for each of the above nodes, the node ID of the node and the coordinates of the node.

(Coordinates (地図, Υ) on the map corresponding to latitude and longitude) and information such as the link ID of the link connected to the node.

[0030] Further, it is difficult for each node to move (straight, turn left, right, etc.) from the road corresponding to one link to the road corresponding to the other link through the connecting portion corresponding to the node. The node cost is set as a weight that represents this. For example, when a vehicle turns right from a wide road to a narrow road via an intersection, it is difficult to turn, so the node cost is set high.

[0031] These link data and node cost are calculated based on the optimum route (for example, the shortest distance route from the departure point (for example, the current point or the current point point) to the destination point, and from the departure point to the destination point. Used to calculate the shortest time route). Details of the return cost will be described later.

[0032] The route guidance data includes image data, character data, voice data, and the like used for route guidance described later.

[0033] It should be noted that data and programs for performing route search and route guidance (route guidance) are not recorded in the information storage unit 4, for example, the Internet and mobile communication networks (including wireless base stations). Stored in a predetermined server connected to a communication network including Alternatively, it may be configured to be transmitted from the server and output to the system control unit 8 as appropriate.

The display unit 5 includes, for example, a drawing processing unit, a noffer memory, a display (for example, a liquid crystal display or an organic EL display), and the drawing processing unit is under the control of the system control unit 8. The map data and the image data related to route guidance are developed in the buffer memory, rendered, and then displayed on the display screen (for example, map display, route display, list display of route distances and charges, etc.) It ’s like that. In addition, on the display screen, for example, a menu for prompting the user to input or select is displayed under the control of the system control unit 8.

[0035] The audio output unit 6 includes, for example, a DAC (digital Z analog signal converter), an amplifier, and a speech power. The audio data related to the route guidance output from the system control unit 8 is converted to DZA by DAC. After conversion, it is amplified by an amplifier and output as sound waves from a speaker.

[0036] The operation unit 7 has a plurality of operation buttons for receiving an input instruction or a selection instruction (for example, a destination point instruction) from the user, and corresponds to the operation button pressed by the user. The instruction signal is output to the system control unit 8. In addition, the map displayed on the display screen in the above display can be scrolled by an instruction via the operation unit 7 of the user power, and the user can select an arbitrary point on the map by the operation unit 7. It is possible to designate as a destination point or a waypoint via.

[0037] The system control unit 8 includes a CPU having a calculation function, a working RAM, a ROM for storing various data programs, and the like, and performs overall control of all components in the navigation device S. ing. Then, by reading and executing a program (including the route search processing program of the present application) for CPU search of the system control unit 8 such as route search and route guidance stored in the information storage unit 4, the map display of the present application is displayed. It functions as control means, setting means, route search means, and the like.

More specifically, in the route search process, the system control unit 8 sets a destination point and a waypoint specified via the operation unit 7 from the user (setting of the waypoint is arbitrary) From a point (for example, the current point) to the destination point ( On a road that is on a set road or on a road that is not in the vicinity of a set road (e.g. It searches for the optimal route (through the upper) point on the road (hereinafter referred to as the “near-by location”).

[0039] Here, the destination point or the waypoint is, for example, a POI search (for example, a search from the POI name registered in the POI data in advance), a menu power displayed on the display screen of the display unit 5, and an address. Search (for example, search for address power registered in map data or POI data in advance), phone number search (for example, search from phone numbers registered in map data or POI data in advance! /), Road search ( The user searches through the operation unit 7 in the road name search that is registered in the map data in advance, or in the intersection search, etc. (also searches for the name of the intersection and the name of the junction registered in the map data in advance). By specifying the conditions, the retrieved content can be specified. In addition, the user can designate any point on the map displayed on the display screen in a scrollable manner via the operation unit 7 as a destination point or a via point. Of course, the user can also specify a destination point or waypoint by inputting characters of a desired name via the operation unit 7. The position information (coordinates (Χ, Υ) on the map corresponding to the latitude and longitude) of the destination point and waypoint specified in this way is recognized by the system control unit 8. A transit point is not limited to a single point (dot), but a predetermined range (for example, in the case of a road search, a range of a certain distance corresponding to the searched road name). Also show.

[0040] Further, the position information of the current location (coordinates (Χ, Υ) on the map corresponding to the latitude and longitude) is obtained by the system control unit 8 from the speed data, direction data, and acceleration data from the sensor unit 2. Etc. and the GPS data from the GPS receiver 1 are calculated and recognized. Since the method for calculating the position information of the current location of the vehicle is a known technique, further detailed description is omitted.

[0041] Then, in searching for the optimum route from the departure point to the destination point, the system control unit 8 calculates, for example, the link cost of each of a plurality of links constituting the route candidate from the departure point to the destination point. Based on these link costs. And the node cost of each of a plurality of nodes connecting the at least two or more links is obtained, and the total node cost of each path candidate is calculated based on these node costs. Then, the system control unit 8 calculates a total cost that is the sum of the calculated total link cost and the total node cost for each route candidate, and the total cost is small (for example, the minimum cost). ) Search for a route candidate as an optimum route.

[0042] Further, when searching for the optimum route, when a waypoint is set, the system control unit 8 sets the route point on the set road or in the vicinity of the waypoint not on the set road. In the case where a nearby point on the road is permitted to turn around, the route point on the road or the point near the waypoint is permitted to be turned back to the destination point. The route is to be searched. On the other hand, the system control unit 8 determines the waypoint on the road or the place near the waypoint if the waypoint on the road or the place near the waypoint is not allowed to turn back. The route to the destination point is searched while suppressing the return.

[0043] As an example, if the set waypoint is a stopover point that the user wants to stop by, the route point on the road or a point near the waypoint is an allowable point that allows the user to turn back (that is, the purpose of the user If the total cost of the route to be turned back is the minimum (it is less than the total cost of the route), the route to be turned back is optimal. It is searched as a route (route search that allows the route point on the road or the point near the route point to be turned back without considering the direction at the route point on the road or near the route point). On the other hand, for example, when the user wants to pass through the road or near the waypoint (passing straight through without turning around), the route point on the road or near the waypoint The point becomes a non-permissible point that is not allowed to be turned back (that is, it is considered that the user wants to go to the destination point through the waypoint on the road or near the waypoint) (for example, it is easy to drive) Even if the total cost of the return route is the smallest, the return route is not searched as the optimum route (in consideration of the direction at the waypoint on the road or near the waypoint, the route point on the road or Route search that does not allow turning around the above-mentioned waypoints). An acceptable point is a single point (dot ) May be a predetermined range (for example, in the case of road search, it may indicate a certain distance range corresponding to the searched road name).

[0044] As another example, for a set waypoint, a return cost is set as a weight indicating the difficulty of returning, and the return cost is added to the total cost. It may be configured such that the route having the smallest sum of and is searched as the optimum route. In this case, for example, if the set waypoint is a stopover point, by setting the return cost small, it is allowed to turn around at the waypoint on the road or near the waypoint, As a result, if the “sum of the total cost and the return cost” of the route to be turned back is minimum, the route to be turned back is searched for as the optimum route. On the other hand, if the waypoint on the road or the place near the waypoint is a passing point, the return cost can be substantially increased by setting the return cost to a large value (for example, such a size that the return route is not searched as the optimum route). In addition, it is not allowed to return at the waypoint on the road or near the waypoint, and the turnback route is not searched as the optimum route.

[0045] By the way, whether or not the waypoint on the set road or the place near the waypoint is the allowable point (in other words, the waypoint set etc. is a stop point or a passage point) Is determined, for example, according to the waypoint designation method (the power designated by the user).

[0046] Specific examples are shown below.

(1) When a route point on the road or a point near the route point is allowed to turn back (cases (i) to (iv) below)

(i) When a desired point (e.g., a point on a house shape, road power is specified) other than a road (a road constituting a route) is designated as a transit point on the displayed map, or a road The desired point above is specified as a transit point, and the house number is also specified.

/ Mouth

(ii) When a desired POI is specified as a transit point by POI search

(iii) When the address of the desired facility or building is specified as a transit point by address search

(iv) The point corresponding to the desired phone number is specified as a transit point by phone number search. Mouth

Even in the cases (i) to (iv) above, if the designated waypoint is not on the road, the waypoint and the vicinity of the waypoint on the road that exists in the vicinity of the waypoint If the distance to the point is shorter than a preset reference distance, the nearby point may be set as a non-permissible point.

(2) When the waypoint on the road or near the above-mentioned waypoint is an unacceptable point that does not allow turning back (in the case of (V) to (vii) below)

(V) When a desired point on the road is designated as a transit point on the displayed map

(Vi) When a desired road is specified as a transit point by road search

(vii) When a desired intersection or merging point is designated as a transit point by searching for an intersection, etc.Even in the cases of (V) to (Vii) above, what can be done by passing through the transit point without turning back? Since it is not reasonable to make a detour route of 10 km, in this case, if the distance difference between the return route and the non-return route is, for example, a predetermined distance (for example, 5 km), the route point is determined. It is desirable to configure it to allow folding as an allowable point.

Next, route search processing in the in-vehicle navigation device S will be described.

[0048] (Example 1)

First, the route search process of the in-vehicle navigation device S according to the first embodiment will be described with reference to FIG.

FIG. 2 is a flowchart showing a route search process of the in-vehicle navigation device S according to the first embodiment. Note that the route search process shown in FIG. 2 is a process when a destination point and a waypoint are designated by the user.

[0050] First, the user designates an arbitrary point on the displayed map by designating the content point via the POI search, address search, telephone number search, road search, intersection, or the like described above. When the route point is specified and the destination point is specified and the search execution button in the operation unit 7 is pressed, the route search process shown in FIG. 2 is started. Specified The route point and the destination point are stored in a predetermined area in the RAM.

[0051] When the route search process shown in FIG. 2 is started, the system control unit 8 sets the specified via point and destination point (step S1).

[0052] Next, the system control unit 8 calculates a distance between the set waypoint and a point on the road that is closest to the waypoint (step S2), and calculates the calculated distance. (If the set waypoint is on the road, the distance is “0”), it is determined whether or not the distance is shorter than a preset reference distance (step S3).

[0053] If the calculated distance is not shorter than the reference distance (greater than or equal to the reference distance) (step S3: N), the waypoint neighboring point that is closest to the waypoint is the above-mentioned allowable distance. As described above, the system control unit 8 performs a route search that allows the route vicinity point to be turned back as described above (for example, sets the return cost for the route point to the minimum and performs the route search. Execute (step S4), search for the optimum route, and terminate the process.

[0054] On the other hand, if the calculated distance is shorter than the reference distance (if the set waypoint is on the road or the set waypoint is not on the road, it is shorter than the reference distance). (Step S3: Y), it is assumed that the waypoint on the road or the place near the waypoint is not allowed to be turned around, and the system control unit 8 Execute a route search that does not allow (turns back) the route point above or near the route point (for example, execute a route search with a large return cost for the route point) (step S5), search for the optimum route and end the process.

[0055] When the optimum route is searched in this way, the system control unit 8 executes route guidance processing and recognizes the position information of the current location of the vehicle while checking whether the current location of the vehicle is on the road. Consistency or failure, so-called map matching processing, and using the searched optimum route, information on the route (route (route) guidance (guidance) of the optimum route, distance and fee of the optimum route, etc.) Is displayed to the user, that is, the information is displayed on the display screen of the display unit 5 or is output from the audio output unit 6 as audio.

[0056] In the above processing, the set waypoints not on the road and the waypoints The return cost setting is changed by determining whether or not the distance to the waypoint nearby point on the road existing in the vicinity of the point is shorter than a preset reference distance. Even if the comparison with the reference distance is not performed, the return cost may be changed according to the distance between the waypoint not on the road and the place near the waypoint. For example, prepare data TB indicating the relationship between the distance between the set waypoint that is not on the road and the point near the waypoint and the return cost, and set the return cost that the calculated distance applies to. For example, if the corresponding distance does not exist in the data TB, it is possible to extract and change the return cost of the nearest distance.

FIGS. 3 (A) and 3 (B) are diagrams showing an example of the optimum route (showing only the vicinity of the waypoint) searched and displayed by the route search process shown in FIG.

[0058] In the example shown in Fig. 3 (A), the distance XI between a waypoint 51 that is not on the set road and a point 52 on the road that is in the vicinity of the waypoint 51 (for example, the nearest) XI Is shorter than the reference distance Y, the optimal route that has passed without turning around at the point 52 is displayed (the same applies when the route point 51 and the point 52 match). On the other hand, in the example shown in Fig. 3 (B), the distance X2 between the waypoint 51 that is not on the set road and the point 52 on the road that is in the vicinity of the waypoint 51 (for example, the nearest) is Since it is more than the reference distance Y, the optimum route turned back at the point 52 is displayed.

[Example 2]

Next, with reference to FIG. 4 and the like, route search processing of the in-vehicle navigation device S according to the second embodiment will be described.

FIG. 4 is a flowchart showing a route search process of the in-vehicle navigation device S according to the second embodiment. The route search process shown in FIG. 4 is also a process when the destination point and waypoint are specified by the user.

[0061] First, in the same manner as in the first embodiment, the user designates or displays a content via point searched by the above-mentioned POI search, address search, telephone number search, road search, or intersection on the displayed map. When an arbitrary point is designated as a waypoint, a destination point is designated, and the search execution button in the operation unit 7 is pressed, the route search process shown in FIG. 4 is started. It is.

When the route search process shown in FIG. 4 is started, the system control unit 8 sets the specified via point and destination point (step S11).

[0063] Next, the system control unit 8 determines whether the set waypoint is a force specified from the displayed map (step S12), and the waypoint specified from the map. If it is a point (step S12: Y), it is further determined whether or not it exists on the road on the map where the via force is displayed (determined by coordinates (Χ, Υ)) (step S13). .

[0064] And when the above-mentioned via-point power is present on the road on the displayed map,

(Step S13: Υ), it is assumed that the waypoint on the road is a non-permitted point that does not allow a turnaround, and the process proceeds to step S18 (route search that suppresses the turnaround). If it does not exist on the road on the displayed map (Step S1 3: N), it is assumed that the waypoint nearby point on the road that is in the vicinity of the waypoint is a tolerable point that allows a turnaround. Moved to S 19 (route search allowed to wrap around).

[0065] On the other hand, if the map force is not specified at step S12 (step S12: N), the system control unit 8 uses the POI search (through POI search) to determine that the set via point is ) Determine whether the force is specified or not (Step S14). If it is not specified by POI search (Step S14: N), go to Step S15 and specify it by POI search. If it is a thing (step S14: Y), it is assumed that the route point on the road or the vicinity point of the route point is allowed to be turned back, and step S 19 (route search permitted to turn back) is used. To be migrated.

[0066] In step S15, the system control unit 8 determines whether or not the set waypoint is the one specified by the road search, and if it is not the one specified by the road search, (Step S15: N) Further, it is determined whether or not the address or telephone number of the facility or building is designated as a transit point by address search or telephone number search (Step S16).

[0067] On the other hand, if it is designated by road search in step S15 (step S15: Y), the system control unit 8 determines whether or not a house number (address) is designated. Otherwise (step S 17), if the house number is specified! (Step S 17: N), it is assumed that the via point is a non-permissible point that is not allowed to be turned back, and step S18 (turn back If the house number is specified (step S17: Y), the route point is considered to be an allowable point that is allowed to return, and step S19 (return Route search that allows

[0068] On the other hand, when the address or telephone number of the facility or building is specified as a waypoint in step S16 (step S16: Y), the waypoint on the road or the place near the place above Is a permissible point that is allowed to return, and the process proceeds to step S19 (Route search that allows return), and if the address or telephone number of the facility or building is not designated as a waypoint (step S16: N), the route point on the road or the vicinity point of the route point is not allowed to return, and the process proceeds to step S18 (route search that suppresses turning).

[0069] If the address or telephone number of the facility or building is not designated as a transit point (Step S16: N), whether or not it has been designated by another method (such as an intersection search). It may be configured to discriminate whether to perform a route search that allows the return or whether to perform a route search that does not allow the return.

[0070] In the route search process in the second embodiment, as in the first embodiment, the waypoints on the set road and the waypoint nearby points on the road existing in the vicinity of the waypoint A configuration may be added in which the distance is calculated and it is determined whether or not the calculated distance is shorter than a preset reference distance. For example, when a waypoint is specified through POI search, address search, or telephone number search, whether or not the calculated distance is shorter than a preset reference distance is allowed to return. It may be configured to determine whether to perform a route search without performing a route search to be performed or returning.

[0071] Then, in the route search that suppresses the return in step S18, as described above, the system control unit 8 does not allow the return of the route point on the road or the vicinity point of the route point as described above. Is executed (for example, a route search is executed with a large return cost for the route point), an optimum route is searched, and the process is terminated.

[0072] On the other hand, in the route search that allows the return in step S19, as described above. Execute a route search that allows the route point on the road or the vicinity point of the route point to return (for example, execute a route search with a minimum return cost for the route point) Search and finish the process.

Note that, thereafter, the route guidance process is executed as in the first embodiment.

FIG. 5 and FIG. 6 are diagrams illustrating an example of the entire optimum route searched and displayed by the route search process.

[0075] In the example shown in Fig. 5, the waypoint on the road is a non-permissible point that is not allowed to turn back, and passes through the waypoint without turning back (maintaining the traveling direction of the vehicle before the waypoint) The optimum route to the destination point is displayed (for example, even if the total distance from the departure point to the destination point is relatively long, it is displayed as the optimum route). On the other hand, in the example shown in FIG. 6, the waypoint on the road is allowed to be turned back, and the optimum route to the destination point is displayed (for example, the departure point and the route). The route that is purely the shortest is drawn in each section of the origin point, the waypoint, and the destination point, and displayed as the optimum route).

[0076] As described above, according to the above embodiment, the destination point and the waypoint are set, and from the departure point to the waypoint on the set road or in the vicinity of the waypoint not on the set road. The in-vehicle navigation device S that searches for a route to the set destination point through a nearby route point on an existing road returns the route point on the road or the route point nearby. If it is a permissible point that allows this, it is configured to search for an optimal route to the destination point while allowing a route point on the route or a point near the route point to be turned back. In the case of a non-permitted place where a waypoint on the road or a place near the waypoint is not allowed to be turned back, it is possible to avoid turning the waypoint on the road or the place near the waypoint while turning back to the destination point. And then, is searching for a route can be intended user specifies waypoints are reflected, searches for a more optimal route intended by the user, is presented to the user.

[0077] Here, when the point on the map that is not on the road is set as a transit point, the in-vehicle navigation device S is a transit point nearby point on a certain road that is in the vicinity of the transit point. Configured to search for a route to the destination point via Depending on the location of the waypoint on the map that is not on the set road, search for a route that turns back the waypoint near the route point, or search for a route that passes without turning around the waypoint vicinity point, Since it is configured to execute either search, even if a point on the map that is not on the road is set as a waypoint, the intention that the user specified the waypoint is reflected, and the user intends more. The optimum route to be searched can be searched and presented to the user.

[0078] Further, since the configuration is such that whether or not the waypoint on the road or the place near the waypoint is an allowable point is determined according to the waypoint designating method, the user can Before designating, it is possible to select the most suitable designation method that suits the intention after deciding whether or not to pass through the above-mentioned waypoints or the like.

[0079] In addition, when the distance between the waypoint designated and set by the user and the waypoint vicinity point on the road existing in the vicinity of the waypoint is greater than or equal to a preset reference distance, The route neighborhood point is assumed to be the above-mentioned allowable point, and the route to the destination point is searched while allowing the route point neighborhood point to be folded back. The intention to specify the point is reflected, and the optimum route intended by the user can be searched and presented to the user.

[0080] In addition, when a point other than the road shown on the displayed map is designated and set by the user as a waypoint, a waypoint nearby point on the road existing in the vicinity of the route point is set. Since it is assumed that it is the above-mentioned permissible point, the route to the destination point is searched while allowing the route point near the waypoint to be folded back, so the user's intention to specify the waypoint is reflected with a simple configuration. The optimum route intended by the user can be searched and presented to the user.

[0081] Further, when a facility or building is designated as a waypoint by a user through POI search, address search, etc., the waypoint on the road or the place near the waypoint is regarded as the tolerated point, and Since the route to the destination point is searched while allowing the route point on the road or the point near the route point to be turned back, the user's intention to specify the route point is reflected with a simple configuration. It is possible to search the optimum route intended by the user and present it to the user. [0082] In addition to the configuration in the above embodiment, the route may be changed depending on the situation of the road (for example, the width of the road, the traffic situation of the road, etc.) at the waypoint on the road or near the waypoint. It may be configured to change the return cost for the point (change the difficulty of returning at the allowable point). For example, when the width of the road is wider than the reference value, when the traffic volume on the road is higher than the reference value, or when the road is in a traffic jam situation, etc. The return cost is determined according to the degree (the amount of traffic with respect to the reference value, the width of the road with respect to the reference value, or the degree of traffic congestion). (For example, this is a tolerable point that allows the route point to return, and the return cost is “1” when there is no traffic jam and “10” when there is traffic jam.) However, it is configured so that it is difficult to return in the route search process. According to this configuration, even if the waypoint on the road described above or the place near the waypoint is an allowable point, it can be difficult to turn back according to the width of the road, the traffic situation of the road, etc. The optimum route to be intended can be searched and presented to the user.

[0083] In addition, when searching for the optimum route, the estimated required time from the departure point to the destination point is calculated, and in the case of a device that takes the shortest route as the optimum route, the route point on the road or the route When the point near the ground is an unacceptable point, it is configured to add a large amount of time to the estimated time required for the return route so that it is difficult to return in the route search process (because a route that does not return becomes the optimal route). It ’s fine. Also, for example, when the width of the road at the waypoint on the road or near the waypoint is wider than the reference value, when the traffic volume on the road is larger than the reference value, and the road is in a traffic jam situation In some cases, add the time according to the degree of traffic volume with respect to the reference value, the degree of width of the road with respect to the reference value, or the degree of traffic congestion to the estimated required time for the route to turn back. If it is configured to make it difficult to return to the route search process,

[0084] Further, in the above-described embodiment, whether or not the waypoint on the road or the place near the waypoint is the permissible point is recorded in the history information regarding the route searched in the past or the route that has been guided. You may comprise so that it may judge based on. For example, on the road Stop if the vehicle has stopped in the past (for example, when the vehicle's gear is parked or when the vehicle's engine is stopped (for example, when the vehicle stops at Shop II)) It is determined that the route point on the road or the point near the route point is a permissible point that is allowed to return. Also, even if the waypoint on the road or the place near the waypoint is a place where the vehicle has stopped in the past, if the direction of travel of the vehicle after stopping is not the direction of turning back, the waypoint on the road It is determined that the point or the point near the waypoint is a non-permitted point that does not allow the return. In addition, for example, if a route point on the road or a point near the above-mentioned route point has been set as a destination point in the past, it is considered that there is a high possibility of stopping because there is an errand there. It is judged that the waypoint or the place near the waypoint is an allowable point that allows the turnaround.

Further, in the above-described embodiment, an example in which the route search device and method of the present application are applied to the above-described vehicle-mounted navigation device has been described. However, the present invention is not limited to this. The present invention may be applied to a portable terminal having a Yong function (for example, a cellular phone, a PDA, a PHS, etc.). For example, for route search of public transportation such as train transfer guidance (search for a route from a departure point (for example, Tokyo Station) to a destination point (for example, Shinjuku Station))! When a station on a route is set as a waypoint, the set waypoint is searched as an unpermitted point that is not allowed to turn around, while a “building” such as a department store is found as a waypoint. If it is set, the route near the waypoint is an allowable point that is allowed to be folded back, and the permitted route is allowed to be folded back (allowing the same route to be folded back) while searching for the optimum route to the destination point. To do.

Furthermore, in the above-described embodiment, an example in which the route search device and method of the present application are applied to the in-vehicle navigation device S mounted on the vehicle has been described. However, the present invention is not limited to this. A communication navigation terminal mounted on a vehicle, and a communication center device to which the communication navigation terminal is connected via an antenna and a mobile communication network (including a wireless base station). You may comprise so that the route search apparatus of this application, a method, etc. may be applied with respect to a navigation system. This In such a configuration, the communication center device performs the above-described route search process while performing communication via the mobile communication network from the communication navigation terminal.

Claims

The scope of the claims

[1] Setting means for setting the destination point and waypoint,

Route search means for searching for a route from the departure point to the destination point through a road point on a certain road that is in the vicinity of a route point on the set road or a route point that is not on the set road. ,

When the route search means is an allowable point that allows the route point on the road or the point on the road to be turned back, the route search means allows the route point on the road or the point on the road to be turned back to the destination point. A route search device characterized by searching for a route.

[2] In the route search device according to claim 1,

The route search device, wherein the route search means determines whether or not the route point on the road or the point on the road is the permissible point according to the way of specifying the route point.

[3] In the route search device according to claim 1,

The route search means does not allow the route point on the road or the point on the road to turn back! If it is a non-permissible place, the route search means suppresses turning the route point on the road or the point on the road. A route search device that searches for a route to the destination point.

[4] In the route search device according to claim 1,

The route search means allows the destination point to be turned back when the distance between the route point not on the set road and the road point is equal to or more than a preset reference distance. A route search device characterized by searching for a route up to.

[5] In the route search device according to claim 1,

Map display control means for displaying on the display screen a map showing the route constituting the route;

In the case where a point not on the road shown on the displayed map is set as the waypoint, the route search means loops back a point on the road existing in the vicinity of the waypoint. Searching for a route to the destination point while allowing A route search device characterized by the above.

[6] In the route search device according to claim 1,

When the facility or building is set as the waypoint, the route search means searches for a route to the destination point while allowing a point on the road existing near the waypoint to be turned back. A route search device characterized by:

[7] In the route search device according to claim 1,

The route search device, wherein the route search means determines whether or not the route point or the road point is the allowable point based on history information regarding a route searched in the past.

[8] In the route search device according to claim 1,

The route search means changes the difficulty of returning the allowable point according to the situation of the road constituting the route even if the waypoint or the point on the road is the allowable point. Route search device.

[9] A setting process for setting destination points and waypoints;

A route search step for searching for a route from the departure point to the destination point through a route point on a certain road that is in the vicinity of a route point on the set road or a route point that is not on the set road; Prepared,

In the route search step, when the route point on the road or the point on the road is an allowable point that allows the route point to be turned back, the destination point is allowed to be turned back on the route point or the road point. A route search method characterized by searching for a route up to.

[10] Set a destination point and a waypoint, and from the departure point to the destination point through a set point on the road or a road point on the road that is not near the set waypoint A computer that searches for the route of

If the route point on the road or the permitted point on the road is allowed to be turned back, the route to the destination point is searched while allowing the route point on the road or the point on the road to be turned back. A route search processing program characterized in that it is made to function.

[11] A recording medium, wherein the route search processing program according to claim 10 is recorded so as to be readable by a computer.

[12] Setting means for setting the destination point and waypoint,

If a point on the map that is not on the road is set as the waypoint, a route search means for searching for the route to the destination point so as to pass through a point on the road that exists in the vicinity of the waypoint And comprising

The route search means, according to the position of the route point that is not on the set road, searches for a route that turns the point on the road, or searches for a route that passes without turning the point on the road. A route search device characterized by executing such a search.