JP5101717B2 - Route search device, route search method, route search processing program, etc. - Google Patents

Description

  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.

  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, a weight taking into account road attributes such as distance and road width in a section such as a road corresponding to the link) There is known an in-vehicle navigation device that calculates a total link cost by calculating the total link cost and searches for a route candidate having the minimum total link cost as an optimal route.

  Further, in the navigation device disclosed in Patent Document 1, not only the link cost but also the node cost in a node connecting a plurality of links is taken into consideration and the total cost (the sum of the total link cost and the total node cost) is calculated. The optimum route is searched for.

  A vehicle-mounted navigation device is also known in which a user can designate a waypoint in the middle from a departure point to a destination point in searching for such an optimum route.

JP 2000-329574 A

  By the way, there are two types of intentions for the user to specify the waypoint, that is, a case where the user wants to stop by the waypoint (location) and a case where the user wants to pass (pass) the route point. For example, when it is desired to go through the waypoint, the optimum route should be searched so as to pass through without turning back at the waypoint.

  However, this is not always the case when it is desired to stop at the waypoint, and there may be no problem even if the optimum route is searched to return at the waypoint. In a conventional in-vehicle navigation device, it is not possible to automatically distinguish whether the user wants to pass through without turning back at the waypoint, or whether the user may turn back at the waypoint. There is an inconvenience in searching for the optimum route intended.

  Therefore, a route search device, a route search method, and a route that can solve such inconvenience, 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 search processing program and the like.

  In order to solve the above-mentioned problem, the invention according to claim 1 is characterized in that a setting means for setting a destination point and a waypoint, and a roadway that exists near the waypoint on the road or not on the road from the departure point. Route search means for searching for a route to the destination point through the point, and the route search means, when the distance between the route point not on the road and the road point is a predetermined distance or more, The route to the destination point is searched while allowing a turnaround at a point on the road.

  The invention according to claim 2 is characterized in that setting means for setting a destination point and a waypoint, and a route from the departure point to the waypoint on the road or a route point existing in the vicinity of the waypoint that is not on the road, Route search means for searching for a route to a point, and the route search means sets the difficulty of turning back at the road point according to the distance between the route point that is not on the road and the road point. Based on the above, a route to the destination point is searched.

  The invention according to claim 3 is a route search method executed by a route search device, wherein the route search method includes a setting step of setting a destination point and a waypoint, and the waypoint on the road from a departure point. Or a route search step that searches for a route to the destination point through a road point that exists in the vicinity of the route point that is not on the road, and in the route search step, the route point that is not on the road and the route When the distance from the road point is equal to or greater than a predetermined distance, the route to the destination point is searched while allowing the user to turn back at the road point.

  The invention according to claim 4 is a route search method executed by a route search device, wherein the route search method includes a setting step of setting a destination point and a waypoint, and the waypoint on the road from a departure point. Or a route search step that searches for a route to the destination point through a road point that exists in the vicinity of the route point that is not on the road, and in the route search step, the route point that is not on the road and the route A difficulty of turning back at the road point is set according to the distance from the road point, and a route to the destination point is searched based on the difficulty.

  The invention of the route search processing program according to claim 5 sets a destination point and a waypoint, and from a departure point through the route point on the road or in the vicinity of the route point that is not on the road, A computer that searches for a route to the destination point is configured such that if the distance between the route point that is not on the road and the point on the road is equal to or greater than a predetermined distance, the computer can search the route to the destination point while allowing the route point to be turned back. It is made to function like searching.

  The invention of the route search processing program according to claim 6 sets a destination point and a waypoint, and from a departure point through the route point on the road or in the vicinity of the route point that is not on the road, A computer that searches for a route to the destination point is set to be difficult to turn back at the point on the road according to the distance between the route point that is not on the road and the point on the road, and based on the difficulty, It is made to function so that a route may be searched.

It is a figure showing an example of outline composition of an in-vehicle navigation device concerning this embodiment. 3 is a flowchart illustrating route search processing of the in-vehicle navigation device S according to the first embodiment. It is a figure which shows an example of the optimal path | route (only the vicinity of a waypoint is shown) searched and displayed by the route search process. 12 is a flowchart illustrating route search processing of the in-vehicle navigation device S according to the second embodiment. It is a figure which shows an example of the whole optimal path | route searched and displayed by the path | route search process in case a route point is a non-permissible point. It is a figure which shows an example of the whole optimal path | route searched and displayed by the path | route search process in case a via point is an allowable point.

  Hereinafter, embodiments of the present application will be described with reference to the accompanying drawings. In addition, embodiment described below is embodiment at the time of applying this application with respect to a vehicle-mounted navigation apparatus.

  First, with reference to FIG. 1 etc., the structure and function of the vehicle-mounted navigation apparatus in this embodiment are demonstrated.

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

  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, an audio output unit 6, and an operation unit. 7 and a system control unit 8 and the like.

  The GPS receiver 1 receives navigation radio waves output from GPS satellites arranged in the satellite orbit and orbiting the earth via an antenna (not shown), and detects position information (longitude and latitude) based on the received signals. The GPS data is output to the system control unit 8.

  The sensor unit 2 includes, 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, an acceleration sensor that detects the acceleration of the vehicle, A distance sensor for detecting the travel distance is provided, and each data (speed data, azimuth data, acceleration data, travel distance data, etc.) detected by these sensors is output to the system control unit 8. Yes.

  The traffic information receiving unit 3 has, for example, a VICS (Vehicle Information and Communication System) receiver, FM multiplex broadcasting, optical (infrared) beacons installed on roads (major arterial roads and highways), radio waves ( Road traffic information transmitted from a (quasi-microwave) beacon or the like (for example, information relating to traffic conditions such as traffic jams) is received and output to the system control unit 8.

  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, and each drive is controlled by the system control unit 8. The data and program for performing route search and route guidance (route guidance) recorded on a recording medium such as a CD-ROM, DVD-ROM, or HD are read out and output to the system control unit 8. It has become. Furthermore, in the HD or the like in the information storage unit 4, history information relating to a previously searched route and a guided route is stored.

  Here, the data for performing route search, route guidance, etc. include, for example, map data, POI (Point Of Interest) data, link data, node data, route guidance data, input instructions to the user, Data for prompting a selection instruction (for example, menu data) and the like are included.

  The map data includes image data for displaying a map on the display screen in the display unit 5, data indicating coordinates of each point (coordinates (X, Y) on the map corresponding to latitude and longitude), and the like. For example, a plurality of administrative boundary data indicating boundaries of a plurality of administrative divisions on the map (including addresses corresponding to the administrative divisions), road data indicating roads on the map (each road name, each intersection name, And a plurality of house shape data (each house shape) indicating a house shape as an example of a plurality of plane sections on the map (for example, sections where facilities, buildings, etc. are installed) Address data, a postal code, a telephone number, and the like), and shape data (including names of rivers and mountains, etc.) indicating shapes of rivers and mountains. Note that data indicating coordinates are associated with addresses, road names, intersection names, and the like in the map data.

  The POI data includes POI names, addresses, and telephones indicating the contents of points on the map (for example, facilities (amusement parks, theme parks, etc.) and buildings (housing, condominiums, hotels, buildings, offices, etc.)). A number, a postal code, and POI coordinates (coordinates (X, Y) on a map corresponding to latitude and longitude) are included, and are associated with house shape data.

  The road shown by the road data is composed of links as a plurality of line segments, and at least two links are connected by one node. This node corresponds to, for example, a connection portion including a contact point (a node) such as an intersection, a bending point, a branch point, a junction (junction), or an interchange of a toll road.

  The link data includes, for each link, the link ID of the link, the node IDs of 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 the direction (These information are 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, whether there is a right / left turn lane, or the like.

  Further, for each link, a link cost is set as a weight in consideration of 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 to be small. Further, the link cost changes depending on traffic conditions such as traffic jam obtained by the traffic information receiving unit 3 (for example, in the case of traffic jam, the link cost corresponding to the link is set small).

  The node data includes, for each node, the node ID of the node, the coordinates of the node (coordinates (X, Y) on the map corresponding to the latitude and longitude), and the link of the link connected to the node. It has information such as ID.

  Furthermore, each node has a weight that represents the difficulty of moving the vehicle (straight, left or right turn, etc.) from the road corresponding to one link to the road corresponding to the other link via the connection corresponding to that node. A node cost is set as a splice. For example, when a vehicle turns right from a wide road to a narrow road via an intersection, the node cost is set large because it is difficult to turn.

  These link data and node costs are calculated based on the shortest distance from the optimal route (for example, the starting point (for example, the current point or the current point to the next point) to the destination point, and the shortest time from the starting point to the destination point. Route). Details of the return cost will be described later.

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

  Note that data and programs for performing route search and route guidance (route guidance) are not recorded in the information storage unit 4, but include communication networks including, for example, the Internet and mobile communication networks (including wireless base stations). The information may be stored and stored in a predetermined server connected to the server, and may be appropriately transmitted from the server and output to the system control unit 8.

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

  The audio output unit 6 includes, for example, a DAC (digital / analog signal converter), an amplifier, a speaker, and the like, and after audio data related to route guidance output from the system control unit 8 is D / A converted by the DAC. Amplified by an amplifier and output as sound waves from a speaker.

  The operation unit 7 has a plurality of operation buttons for receiving an input instruction, a selection instruction (for example, an instruction for a destination point), and the like from the user, and sends an instruction signal corresponding to the operation button pressed by the user to the system. The data is output to the control unit 8. Further, the map displayed on the display screen of the display can be scroll-displayed by an instruction from the user via the operation unit 7, and the user can select an arbitrary point on the map via the operation unit 7. It can be specified as a destination point or a waypoint.

  The system control unit 8 includes a CPU having an arithmetic function, a working RAM, a ROM that stores various data and programs, and the like, and performs overall control of all the components in the navigation device S. Then, the CPU of the system control unit 8 reads and executes a program (including the route search processing program of the present application) for performing route search, route guidance, and the like stored in the information storage unit 4, for example, thereby executing the map of the present application. It functions as display control means, setting means, route search means, and the like.

  More specifically, the system control unit 8 sets a destination point and a waypoint (via route setting is arbitrary) designated via the operation unit 7 from the user in the route search process, and a departure point (for example, From the current point) to the destination point (if a waypoint is set, a route point on the set road, or on a road that exists near a route point that is not on the set road (for example, The optimum route is searched through a point on the road (hereinafter referred to as a “near-by point”) on the road closest to the waypoint (on the road constituting the route).

  Here, the destination point or the waypoint is, for example, a POI search that can be selected from a menu displayed on the display screen of the display unit 5 (for example, a search from a POI name registered in the POI data in advance), an address search (for example, , Search from an address registered in advance in map data or POI data), telephone number search (for example, search from a telephone number registered in advance in map data or POI data), road search (pre-registered in map data) The search is performed by the user specifying a search condition via the operation unit 7 in the search for the road name) or the intersection search (search from the intersection name, the junction name registered in the map data in advance), etc. It can be specified from the contents. 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 the destination point or the waypoint. Of course, when the user inputs characters of a desired name via the operation unit 7, it can be designated as a destination point or a waypoint. The position information (coordinates (X, Y) 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. The waypoint is not limited to indicating a single point (dot), but a predetermined range (for example, in the case of road search, a range of a certain distance corresponding to the searched road name). It may be shown.

  Further, the position information of the current location (coordinates (X, Y) on the map corresponding to the latitude and longitude) is obtained by the system control unit 8 from the speed data, azimuth data, acceleration data, etc. from the sensor unit 2 and GPS. It is calculated and recognized based on GPS data from the receiving unit 1. In addition, since the calculation method of the positional information on the present location of a vehicle is a well-known technique, the further detailed description is abbreviate | omitted.

  In searching for the optimum route from the departure point to the destination point, the system control unit 8 acquires, for example, each link cost of a plurality of links constituting the route candidate from the departure point to the destination point, Based on these link costs, the total link cost of each route candidate is calculated, and further, the respective node costs in a plurality of nodes connecting the at least two or more links are obtained, and each of the node costs is calculated based on these node costs. Calculate the total node cost of the route candidate. Then, the system control unit 8 calculates a total cost, which is the sum of the calculated total link cost and the total node cost, for each path candidate, of which the total cost is small (for example, the smallest) path Search for a candidate as an optimal route.

  Further, when a route point is set when searching for the optimum route, the system control unit 8 exists in the vicinity of the route point on the set road or the route point not on the set road. If the waypoint near the waypoint on the road is allowed to be turned back, the route to the destination point is searched while allowing the waypoint on the road or the place near the waypoint to be turned back. It has become. On the other hand, the system control unit 8 wraps 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 restraining.

  As an example, if the set waypoint is a stopover point that the user wants to stop by, the waypoint on the road or a point near the waypoint is an allowable point that allows turning back (that is, until the user goes to the destination point). If the total cost of the route to be turned back is minimum (less than the total cost of the route not to be turned back), the route to be turned back is searched as the optimum route (because it is considered to be designated as a transit point for the purpose of stopping between) A 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 or the route point nearby point on the road). On the other hand, for example, when the route point on the road or the point near the route point is a pass point that the user wants to pass (go straight and do not return), the route point or the route point on the road Neighboring points are non-permissible points that are not allowed to be turned back (that is, it is considered that the user wants to go to the destination point through the route point on the road or the route point near the route point (for example, ease of driving). ) Even if the total cost of the route to be turned back is the smallest, the route to be turned back is not searched for as the optimum route (in consideration of the direction at the waypoint on the road or near the waypoint, the waypoint on the road or Route search that does not allow turning around the above-mentioned waypoints). The allowable point is not limited to indicating one point (dot), but a predetermined range (for example, in the case of road search, a range of a certain distance corresponding to the searched road name). It may be shown.

  As another example, a return cost is set for the set waypoint as a weight indicating the difficulty of returning, the return cost is added to the total cost, and the sum of the return cost and the total cost is calculated. It may be configured such that the route with the smallest 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 possible to substantially return at the waypoint on the road or near the waypoint, and as a result If the “sum of the total cost and the return cost” of the return route is minimum, the return route 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 is set to a large value (for example, the size at which the return route is not searched for as the optimum route). It is not allowed to turn back at the waypoint on the road or near the waypoint, and the route to be turned back is not searched as the optimum route.

  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, whether the set waypoint or the like is a stop point or a passage point) is, for example, This is determined according to the waypoint specification method (how the user specified).

Specific examples are shown below.
(1) When the route point on the road or the nearby point of the route point is allowed to be turned back (in the case of (i) to (iv) below)
(I) When a desired point (for example, a point on the house shape, predetermined from the road) other than the road (the road constituting the route) is designated as a transit point on the displayed map, or the desired point on the road (Ii) When a desired POI is specified as a transit point by POI search (iii) By searching for the desired facility or building When an address is designated as a transit point (iv) When a location corresponding to a desired phone number is designated as a transit point by a phone number search Note that even if (i) to (iv) above, If the designated waypoint is not on the road and the distance between the waypoint and the waypoint nearby point on the road that is in the vicinity of the waypoint is shorter than a preset reference distance, Neighborhood It may be used as the non-permissive point.
(2) In the case of a non-permitted point that does not allow a route point on the road or a point near the route point to be turned 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 designated as a transit point by road search (vii) Desired intersection by searching for an intersection etc. Or, when a junction is designated as a waypoint, even in the cases (v) to (vii) above, it is reasonable to make a detour route of tens of kilometers by passing through the route without turning back In this case, if the distance difference between the route to be turned back and the route to be turned back is, for example, a predetermined distance (for example, 5 km), the turn-around point is set as an allowable point and the return is allowed. It is desirable.

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

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

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

  First, the user designates a transit point from the contents retrieved by the above-mentioned POI search, address search, telephone number search, road search, intersection, etc., or designates an arbitrary point on the displayed map as a transit point. When the destination point is designated and the search execution button on the operation unit 7 is pressed, the route search process shown in FIG. 2 is started. The designated waypoints and destination points are stored in a predetermined area in the RAM.

  When the route search process shown in FIG. 2 is started, the system control unit 8 sets the designated waypoint and destination point (step S1).

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

  If the calculated distance is not shorter than the reference distance (greater than the reference distance) (step S3: N), the waypoint vicinity point that is closest to the waypoint is the allowable point. Then, as described above, the system control unit 8 performs a route search that allows the route point vicinity to be turned back (for example, sets the return cost for the route point to a minimum and executes the route search) ( Step S4), the optimum route is searched and the process is terminated.

  On the other hand, when the calculated distance is shorter than the reference distance (when the set waypoint is on the road or when 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 back, and the system control unit 8, as described above, A route search that does not allow the route point in the vicinity of the route point to be turned back (suppressed from turning back) is performed (for example, the route search is performed with a large return cost for the route point) (step S5), and the optimum route is determined. Search and finish the process.

  When the optimum route is searched in this way, the system control unit 8 executes route guidance processing, recognizes the position information of the current location of the vehicle, and matches whether or not the current location of the vehicle is located on the road. The so-called map matching process, and using the searched optimum route, information related to the route (route (route) guidance (guidance) of the optimum route, distance and fee of the optimum route) is presented 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.

  In the above processing, whether or not the distance between the set waypoint not on the road and the waypoint nearby point on the road existing in the vicinity of the waypoint is shorter than a preset reference distance. Although the return cost setting is changed by determining, the present invention is not limited to this. For example, even if the comparison with the reference distance is not performed, the distance between the waypoint that is not on the road and the place near the waypoint is determined. The return cost may be changed accordingly. For example, data TB indicating the relationship between the set route point not on the road and the distance between the route point vicinity and the return cost is prepared, and the return cost to which the calculated distance applies is extracted. For example, when the corresponding distance does not exist in the data TB, the return cost of the nearest distance is extracted and changed.

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

  In the example shown in FIG. 3A, the distance X1 between the waypoint 51 that is not on the set road and the point 52 on the road that exists in the vicinity of the waypoint 51 (for example, the nearest) is the reference Since it is shorter than the distance Y, the optimum route that has passed without turning around at the point 52 is displayed (the same applies when the waypoint 51 and the point 52 match). On the other hand, in the example shown in FIG. 3B, the distance X2 between the waypoint 51 that is not on the set road and the point 52 on the road that exists in the vicinity of the waypoint 51 (for example, the nearest) is Since the distance is greater than or equal to the reference distance Y, the optimum route turned back at the point 52 is displayed.

(Example 2)
Next, with reference to FIG. 4 etc., the route search process of the vehicle-mounted navigation device S according to the second embodiment will be described.

  FIG. 4 is a flowchart illustrating the 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 the waypoint are designated by the user.

  First, as in the first embodiment, the user designates a transit point from the contents retrieved by the above-described POI search, address search, telephone number search, road search, intersection, etc., or any point on the displayed map. 4 is designated as a via point, 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.

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

  Next, the system control unit 8 determines whether or not the set waypoint is the one specified from the displayed map (step S12), and is the waypoint specified from the map (Step S12: Y), it is further determined whether or not the route point exists on the road on the displayed map (determined by coordinates (X, Y)) (step S13).

  And when the said waypoint exists on the road on the displayed map (step S13: Y), it is assumed that the waypoint on the said road is a non-permissible point which does not permit return | turnback, step S18 ( On the other hand, if the route point does not exist on the road on the displayed map (step S13: N), the route point that is in the vicinity of the route point is transferred. It is assumed that the waypoint vicinity point of is a permissible point allowing the return, and the process proceeds to step S19 (route search permitting the return).

  On the other hand, when the route point is not designated on the map in step S12 (step S12: N), the system control unit 8 designates the set route point by the POI search (through the POI search). If it is not specified by the POI search (step S14: N), the process proceeds to step S15, and if it is specified by the POI search (Step S14: Y), it is assumed that the waypoint on the road or the place near the waypoint is allowed to be turned back, and the process proceeds to Step S19 (route search that is allowed to be turned back).

  In step S15, the system control unit 8 determines whether or not the set waypoint is the one specified by the road search, and when 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 the address search or telephone number search (step S16).

  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 (step S17). If the house number is not designated (step S17: N), the route point is assumed to be a non-permissible point that is not allowed to be turned back, and the process proceeds to step S18 (route search that suppresses turning back). When the house number is designated (step S17: Y), the route point is assumed to be an allowable point that allows the return, and the process proceeds to step S19 (route search that allows the return).

  On the other hand, when the address or telephone number of the facility or building is designated as the waypoint in step S16 (step S16: Y), the waypoint on the road or the place near the waypoint is returned. When it is determined that the permitted point is acceptable, the process proceeds to step S19 (route search that permits turning back), and when the address or telephone number of the facility or building is not designated as a transit point (step S16: N), It is assumed that the waypoint on the road or the place near the waypoint is a non-permissible point that is not allowed to be turned back, and the process proceeds to step S18 (route search in which turning back is suppressed).

  If the address or telephone number of the facility or building is not designated as a waypoint (step S16: N), it is further determined whether or not it has been designated by another method (such as an intersection search). Alternatively, it may be configured to determine whether to perform a route search that allows a return or a route search that does not allow a return.

  In the route search process in the second embodiment, as in the first embodiment, the distance between the set waypoint on the road and the waypoint nearby point on the road existing in the vicinity of the waypoint is calculated. A configuration may be added to determine 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 be returned. You may comprise so that it may be discriminate | determined whether a route search is performed or a route search which does not permit return | turnback is performed.

  Then, in the route search that suppresses the return in step S18, as described above, the system control unit 8 executes a route search that does not allow the return point on the road or the vicinity point of the stop point (for example, The route search is executed with a large return cost for the waypoint), the optimum route is searched, and the process ends.

  On the other hand, in the route search that allows the return in step S19, as described above, the route search that permits the return of the waypoint on the road or the vicinity point of the waypoint is executed (for example, the return to the route point). The route search is performed with the cost set to the minimum), the optimum route is searched, and the process is terminated.

  From this point onward, the route guidance process is executed as in the first embodiment.

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

  In the example shown in FIG. 5, the waypoint on the road is a non-permissible point that does not allow the turnaround, and the destination point that has passed without maintaining the turnaround (maintaining the traveling direction of the vehicle before the waypoint). (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 an allowable point that allows the turnaround, and the optimum route to the destination point is displayed (for example, the departure point and the waypoint). In each section of the waypoint and the destination point, the route that is purely the shortest is drawn and displayed as the optimum route).

  As described above, according to the above-described embodiment, the destination point and the waypoint are set, and the road existing from the departure point in the vicinity of the waypoint on the set road or the waypoint not on the set road. The on-vehicle navigation device S that searches for a route to the set destination point through the upper waypoint vicinity point is an allowable point that allows the route point on the road or the route point vicinity point to be turned back. In some cases, the route is configured to search for the optimum route to the destination point while allowing the route point on the road or the vicinity point of the route point to be turned around. If it is a non-permitted place that does not allow a turnaround point, a route to the destination point is suppressed while preventing a turnaround point on the road or a turnaround point. And then, is search, can be intended user specifies waypoints are reflected, searches for a more optimal route intended by the user, is presented to the user.

  Here, when a point that is not on the road on the map is set as a waypoint, the vehicle-mounted navigation device S passes through a waypoint vicinity point on a certain road that exists in the vicinity of the waypoint. It is configured to search for a route to the destination point, and according to the position on the map of a waypoint that is not on the set road, search for a route that turns back the waypoint near the route point, or Since it is configured to execute either one of the search for a route that passes without turning around a nearby point, even if a point that is not on the road on the map is set as a waypoint, The intention specifying the point is reflected, and the optimum route intended by the user can be searched and presented to the user.

  In addition, according to the waypoint designation method, it is configured to determine whether or not the waypoint on the road or the place near the waypoint is an allowable point, so the user designates the waypoint It is possible to select an optimum designation method that suits the intention after determining whether to pass through the route point or the like before.

  If the distance between the waypoint specified and set by the user and the waypoint nearby point on the road existing in the vicinity of the waypoint is greater than or equal to a preset reference distance, Since the point is the above-mentioned allowable point, and the route to the destination point is searched while allowing the route point near the route point to be folded back, the intention of the user specifying the route point is simple. The optimum route that is reflected and intended by the user can be searched for and presented to the user.

  In addition, when a point other than the road shown on the displayed map is designated and set by the user as a waypoint, the waypoint vicinity point on the road existing in the vicinity of the route point is the above-described allowable point. Since the route to the destination point is searched while allowing the route point nearby to be turned around, the user's intention to specify the waypoint is reflected with a simple configuration, and the user Can search for the optimal route intended by the user and present it to the user.

  In addition, when a facility or building is designated as a transit point by a user through POI search, address search, etc., the transit point on the road or the transit point vicinity point is regarded as the allowable point, and the transit point on the road Since the route to the destination point is searched while allowing the point or the nearby route point to be returned, the user's intention to specify the waypoint is reflected with a simple configuration, and the user intends more. The optimum route to be searched can be searched and presented to the user.

  In addition to the configuration in the above embodiment, the return cost for the waypoint according to 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. May be changed (the difficulty of turning back at the allowable point is changed). 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, and when the road is in a traffic jam situation (other than that, a waypoint such as a one-way street is folded back) Depending on the degree of traffic (the degree of traffic volume relative to the reference value, the degree of width of the road relative to the reference value, or the degree of traffic jams, etc.) Set (for example, an allowable point that allows the route point or the like to return, and the return cost at this time is “1” when there is no traffic jam, and “10” when there is traffic jam) It is configured so that it is difficult to return in the search process. According to this configuration, even if the waypoint on the road 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 searched can be searched and presented to the user.

  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 uses the route with the shortest time as the optimum route, the route point on the road or the point near the route point is When it is a non-permissible point, it may be configured to add a large time to the estimated required time of the route to be turned back so that it is difficult to turn back in the route search process (because a route that does not turn back becomes an optimum route). In addition, 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 when the road is in a traffic jam situation For example, add the time according to the degree of traffic volume with respect to the reference value, the degree of the width of the road with respect to the reference value, or the degree of the traffic congestion condition, etc. What is necessary is just to comprise so that it may become difficult to return in search processing.

  Further, in the above embodiment, it is determined whether or not the waypoint on the road or the place near the waypoint is the permissible point based on the history information about the route searched in the past or the route that has been guided. You may comprise. For example, if the vehicle stops in the past at the waypoint on the road or near the waypoint (for example, when the vehicle gear is put into parking or when the vehicle engine is stopped (for example, when the vehicle stops) If it is a point where it is determined that the vehicle has stopped and the history remains, for example, it is determined that the route point on the road or the nearby point of the route point is an allowable point that allows turning back. In addition, 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 to turn back, 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, when a waypoint on the road or a place near the waypoint is 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 determined that the point or the point near the waypoint is an allowable point that allows the turnaround.

  Moreover, in the said embodiment, although the example at the time of applying the route search apparatus and method of this application with respect to the said vehicle-mounted navigation apparatus was demonstrated, it is not limited to this, It has a pedestrian navigation function You may apply with respect to a portable terminal (for example, a mobile telephone, PDA, PHS etc.) etc. For example, in route search for public transportation such as railway transfer guidance (search for a route from a departure point (for example, Tokyo Station) to a destination point (for example, Shinjuku Station)) When the station is set, the route is set as a non-permissible point that is not allowed to be turned back, while the “building” such as a department store is set as the route point. Then, the route near the waypoint is an allowable point that is allowed to be turned back, and the optimum route to the destination point is searched while allowing the permitted point to be turned back (allowing the same route to be turned back).

  Furthermore, in the said embodiment, although the example at the time of applying the route search apparatus and method of this application with respect to the vehicle-mounted navigation apparatus S mounted in the vehicle was demonstrated, it is not limited to this, A vehicle For a communication navigation system configured by a communication navigation terminal mounted on the communication center device and a communication center apparatus 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, method, etc. of this application may be applied. 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.

DESCRIPTION OF SYMBOLS 1 GPS receiving part 2 Sensor part 3 Traffic information receiving part 4 Information storage part 5 Display part 6 Audio | voice output part 7 Operation part 8 System control part S Vehicle-mounted navigation apparatus

Claims (7)

A setting means for setting a destination point and a waypoint;
A route search means for searching for a route from a departure point to the destination point through a route point existing in the vicinity of the route point on the road or not on the route;
With
The route searching means searches for a route to the destination point while allowing a return on the road point when the distance between the route point not on the road and the road point is a predetermined distance or more. Route search device. A setting means for setting a destination point and a waypoint;
A route search means for searching for a route from a departure point to the destination point through a route point existing in the vicinity of the route point on the road or not on the route;
With
The route search means sets a difficulty of turning back at the road point according to a distance between the route point not on the road and the road point, and searches for a route to the destination point based on the difficulty. A characteristic route search device. A route search method executed by a route search device,
The route search method includes:
A setting process for setting a destination point and a waypoint;
A route search step for searching for a route from a departure point to the destination point through a route point existing in the vicinity of the route point on the road or not on the route;
Including
In the route search step, when the distance between the route point not on the road and the road point is a predetermined distance or more, the route to the destination point is searched while allowing the route point to be turned back. A route search method. A route search method executed by a route search device,
The route search method includes:
A setting process for setting a destination point and a waypoint;
A route search step for searching for a route from a departure point to the destination point through a route point existing in the vicinity of the route point on the road or not on the route;
Including
In the route search step, setting a difficulty of turning back at the road point according to the distance between the route point not on the road and the road point, and searching for a route to the destination point based on the difficulty The route search method characterized by this. A computer that sets a destination point and a waypoint, and searches a route from the departure point to the destination point through the route point on the road or in the vicinity of the route point that is not on the road,
A route that functions to search for a route to the destination point while allowing a turnaround at the point on the road when a distance between the route point not on the road and the road point is a predetermined distance or more Search processing program. A computer that sets a destination point and a waypoint, and searches a route from the departure point to the destination point through the route point on the road or in the vicinity of the route point that is not on the road,
According to the distance between the waypoint that is not on the road and the point on the road, the difficulty of turning back at the point on the road is set, and the route to the destination point is searched based on the difficulty. Route search processing program.   7. A recording medium in which the route search processing program according to claim 5 is recorded so as to be readable by a computer.

Images