JP2007010399A - Route searching device and route searching method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a route searching device for searching for a route from a starting place to a destination, taking the difference of a situation of a user or a mental or physical load in driving in consideration. <P>SOLUTION: This route searching device searches for a route from a starting place to a destination by evaluation based on a prescribed evaluation cost, and includes the first cost required actually for traveling from the starting place to the destination and the second cost determined by converting necessary time required for traveling from the starting place to the destination into money, and a coefficient for converting the necessary time into the money is set selectively by the user. The route searching device searches for the route from the starting place to the destination by evaluation based on a prescribed evaluation cost, and the evaluation cost includes a cost required for traveling from the starting place to the destination and cost equivalent to a trouble loaded to the user when traveling from the starting place to the destination. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a route search apparatus and a route search method for generating a route to a destination in order to guide a moving body such as an automobile.

  A route search device typified by a car navigation device searches a route from a departure point (or current location) to a destination with reference to map information, and moves the mobile object along the guidance route obtained as a result. It is a device to guide to. A general route search apparatus is based on an algorithm using the Dijkstra method or an improved version thereof, and a guided route having the lowest evaluation cost (sometimes called an evaluation function, a route price, or a route cost). Explore.

  In many route search apparatuses, a route search can be performed under different conditions such as distance priority, general road priority, and toll road priority by changing the setting of an evaluation cost serving as a search guideline (Patent Document 1). reference). In addition, the economic burden required from the starting point to the destination is one of the problems that are of great interest to the user (which is basically a driver but can also be a passenger of a vehicle) There is also a route search device that uses the sum of the fuel consumption from the departure point to the destination and the toll road fee as an evaluation cost, and obtains an economic route that minimizes the sum as a guidance route (see Patent Document 2).

Japanese Patent Laid-Open No. 11-23304 JP 2002-303522 A

  However, the conventional route search apparatus and the route search method have a problem that the difference in the position of the user when performing the route search cannot be reflected in the route search result. For example, users not only want to use a route that is as cheap as possible, but also want to use a route that is cheap, but at the same time there is no time to spare and the user wants to arrive at the destination early even if the cost is slightly higher. Can happen. In the conventional route search device or method, in the latter situation, the user makes the route search device perform the route search with priority on the toll road with priority on time, or economically on the route search device with priority on cost. There is no choice but to search for a route, and a route search is performed based on an extreme condition that does not match the actual situation.

  In addition, in the conventional route search device capable of obtaining an economic route, since the evaluation cost does not consider the existence of realistic or specific road conditions such as intersections and curves, it is sufficiently economical. There was a face that could not be said that a guidance route could be obtained. For example, even if a guidance route that does not use a toll road is obtained by route search, there are many signals and intersections when you actually drive the route, and you may stop and start the car many times. is there. In this case, more fuel is required than expected, and it may be more economical to use a route through a toll road.

  In addition, although the cost is low for users who are unfamiliar with driving, elderly users, users with remarkable fatigue, etc., it is possible to use a route that allows easy driving to the destination if possible. A situation in which the financial burden of fuel consumption and toll road charges is compared with the mental and physical burden of driving can often occur, but in conventional route search devices or methods, Under such circumstances, it has been impossible to obtain an appropriate and effective guidance route.

  The present invention solves the above-mentioned problem, considering a difference in the position where the user is placed, and further considering a specific road situation, and an appropriate economy from the starting point to the destination. Provided are a route search device and a route search method for searching for a general route. The present invention also provides a route search that searches for a route from the departure point to the destination in consideration of the mental burden and the physical burden in driving in addition to the financial burden of fuel consumption and toll road charges. An apparatus and a route search method are provided.

  The route search device of the present invention is a route search device that performs an evaluation based on a predetermined evaluation cost and searches for a route from the departure place to the destination. The evaluation cost is calculated based on the movement from the departure place to the destination. The first cost actually required and the second cost converted from money to the required time required to move from the departure place to the destination are included, and the coefficient for converting the required time into money is selected by the user. It is characterized by being set to.

  The route search method of the present invention is a route search method for searching a route from a departure point to a destination by performing a step of performing evaluation based on a predetermined evaluation cost for a plurality of candidate routes, wherein the evaluation cost is , Including a first cost actually required for the movement from the departure place to the destination, and a second expense obtained by converting the required time required for the movement from the departure place to the destination into money. The method includes a step of selectively setting a coefficient for converting the money into money.

  In the route search apparatus and the route search method described above, the first cost includes a product of a fuel consumption and a fuel unit price consumed for movement from the departure place to the destination, and the consumed fuel is calculated as a movement distance. In addition to the proportional fuel, it is preferable to include a fuel consumed by at least one of a right turn, a left turn, an intersection, a signal, and an interchange existing from the starting point to the destination.

  In the route search device and the route search method, a route search is performed a plurality of times under different search conditions to generate a plurality of routes from the departure point to the destination, and at least one of the plurality of routes The departure that is a part and is generated by identifying a plurality of route parts connecting intersections of the plurality of routes, calculating the evaluation cost for each route part, and selectively combining the plurality of route parts It is preferable to obtain the evaluation cost for each route from the ground to the destination. Furthermore, it is preferable that the coefficient for converting the required time into money in the calculation of the evaluation cost for a certain route component changes according to the position of the route component between the departure place and the destination.

  The route search device of the present invention is a route search device that performs an evaluation based on a predetermined evaluation cost and searches for a route from the departure place to the destination. The evaluation cost is calculated based on the movement from the departure place to the destination. It includes a cost required and a cost corresponding to the trouble that is brought to the user when moving from the departure place to the destination.

  The route search method of the present invention is a route search method for searching a route from a departure point to a destination by performing a step of performing an evaluation based on a predetermined evaluation cost for a plurality of candidate routes, wherein the evaluation cost is And a cost required for movement from the starting point to the destination, and a cost corresponding to the trouble that is brought to the user when moving from the starting point to the destination.

  In the above route search device and route search method, at the cost corresponding to the trouble, the number of right turns, the number of left turns, the number of intersections, the number of signals, the number of interchanges, and the curve of the route from the starting point to the destination are calculated. Preferably at least one of the degrees is converted to money.

  In the route search device and the route search method, a route search is performed a plurality of times under different search conditions to generate a plurality of routes from the departure point to the destination, and at least one of the plurality of routes The departure that is a part and is generated by identifying a plurality of route parts connecting intersections of the plurality of routes, calculating the evaluation cost for each route part, and selectively combining the plurality of route parts It is preferable to obtain the evaluation cost for each route from the ground to the destination. Further, in calculating the evaluation cost for a certain route component, in order to obtain the cost corresponding to the troublesome, the coefficient for converting the event occurring in the route component into money is that between the departure place and the destination. It is preferable to change depending on the position of the path component.

  The user can actually set the coefficient for converting the required time into money by including the cost of converting the required time required to move from the departure place to the destination into money in the evaluation cost. It is possible to determine a guidance route by performing a route search in consideration of the placed position. For example, the coefficient for converting the required time into money is set larger when the user is in a hurry or when there is a comparatively monetary margin, compared to the reverse case, that is, the normal case. Since a route with a low evaluation cost is evaluated as suitable as a guide route, when a coefficient is set as in the former, a route with a short duration and / or a long toll road section is highly evaluated. A guidance route suitable for the position where the user is placed can be obtained.

  In addition to the fuel that is proportional to the distance traveled, include the cost due to the fuel consumed by at least one of the right turn, left turn, intersection, signal, and interchange existing from the starting point to the destination. Thus, it becomes possible to evaluate the economics of the route more strictly.

  In addition, the trouble caused to the user from the starting point to the destination is converted into money and included in the evaluation cost. In addition to the financial burden, the mental and physical burden of driving The route search can be performed in consideration of the above. Specifically, this trouble is caused to the user due to a right turn, a left turn, an intersection, a signal, an interchange, or a curve of a route.

  Hereinafter, an embodiment in which the present invention is applied to an in-vehicle navigation device for automobiles (hereinafter referred to as “navigation device”) will be described with reference to the drawings. FIG. 1 is a block diagram of the navigation device (1). The navigation device (1) includes a position detection means for determining the current position and direction of the vehicle on which the device (1) is mounted, a recording means for recording map information, etc., and information recorded in the recording means Control that performs route search using navigation, processing necessary to guide the car along the guidance route (for example, creation of image data and voice data for guidance), and overall control of the navigation device (1) Means, display means for displaying a guidance screen and various setting screens showing the current position of the vehicle and a map of the surroundings, voice output means for generating guidance voice, and a navigation device (1) And operating means for giving various instructions.

  The position detection means receives a GPS signal transmitted from a GPS (Global Positioning System) satellite via the GPS antenna (3), and specifies the current position (for example, latitude and longitude) of the vehicle using the GPS signal. A GPS receiver (5) is included. The position detection means includes a gyroscope (7) and a vehicle speed sensor (9), and a gyro microcomputer (hereinafter referred to as "microcomputer") that processes the signals sent from these to identify the direction and speed of the vehicle. (11)). When the navigation device (1) is performing the route guidance operation of the automobile, the GPS receiver (5) and the gyro microcomputer (11) determine the position, direction and speed of the automobile and send the information to the control means. Do this periodically.

  The recording means includes a recording medium (13) that records map information and the like, and a driver (15) that reads information from the recording medium (13) based on an instruction from the control means. As the recording medium (13), a CD-ROM, DVD, HD, IC memory or the like is used. The map information is recorded on the recording medium (13) in a form in which the geographical area is divided into blocks of a predetermined size. The data related to each block includes data regarding road nodes and links included in the block, position data regarding facilities such as gas stations, and data for displaying a map of the block on the display means. .

  Nodes are provided corresponding to road intersections, branch points, merge points, end points, and road end points in blocks. The data related to each block includes, for each node included in the block, the ID number of the node, the position of the node (for example, latitude and longitude), and the attribute of the node (for example, the entrance of an intersection or toll road) And the ID of the link connected to the node and the ID number of the node adjacent to the node.

  A link corresponds to a section of a road connecting nodes, and usually has a direction. The data related to each block includes, for each link included in the block, the ID number of the ring, the ID number of the start node and the end node of the link, and the type of road of the link (for example, toll road or national road) And the distance (length) of the link, the ID of the link connected to the link, and various numerical values (items shown in FIG. 4 excluding toll road charges) referred to in the route search operation to calculate the evaluation cost, Is included.

  As the control means, a control microcomputer (25) including a CPU (17), RAM (19), ROM (21), flash memory (23), a local bus (not shown), and the like is used. The ROM (21) stores programs and parameters for executing various controls and processes of the navigation device (1). Programs and parameters that may be updated, such as a program for performing a route search operation and a route guidance operation, are stored in the flash memory (23). These programs are executed by the CPU (17). The RAM (19) is used to store temporary data such as map information and calculation results read out in the route search operation and the route guidance operation.

  The display means includes a drawing IC (27), a liquid crystal display (hereinafter referred to as “LCD”) (29), and an LCD I / F (31). When an instruction to display a route search result display screen, a guidance screen or various setting screens displayed during the route guidance operation is sent from the control microcomputer (25), the drawing IC (27) Image data is created, and these screens are displayed on the LCD (29) via the LCD I / F (31).

  The audio output means includes a digital-analog converter (hereinafter referred to as “DAC”) (33), an amplifier (35), and a speaker (37). The control means appropriately creates a digital audio signal related to the guidance voice for guiding the user along the guidance route during the route guidance operation, and sends it to the DAC (33). The digital audio signal is converted into an analog audio signal by the DAC (33) and sent to the amplifier (35). The analog voice signal is amplified by the amplifier (35), and the guidance voice is output from the speaker (37).

  The operation means includes various operation keys (39) provided on a housing (not shown) of the navigation device (1), a touch panel (41) arranged on the LCD (29), and a remote controller not shown. (Hereinafter referred to as “remote control”), a remote control light receiving unit (43) for receiving an infrared signal transmitted from the remote control, and a key microcomputer (45). When the operation key (39) is pressed, the key microcomputer (45) discriminates the pressed operation key (39) and sends an operation command corresponding thereto to the control microcomputer (25). The key microcomputer (45) discriminates the area where the touch panel (41) is pressed while the setting screen or the like is displayed on the LCD (29), and sends an operation command corresponding to the operation to the control microcomputer ( Send to 25). The remote control light receiving unit (43) converts and demodulates the received infrared signal into an electrical signal and sends it to the key microcomputer (45). )

  Next, a route search operation performed by the navigation device (1) of this embodiment will be described. FIG. 2 is a flowchart showing an outline of the route search operation. When the route search operation is started, the control microcomputer (25) displays a destination setting screen on the LCD (29) (S1). When the user inputs a destination by operating the operation key (39), the remote controller or the like, the control microcomputer (25) specifies the positions thereof and stores them in the RAM (19). In the navigation device (1), the destination can be set by various procedures. For example, in the recording medium (13), a search database in which information on a destination such as an address and a name is associated with a position of the destination is recorded, and when the user inputs information on the destination, The search database is referred to, and the position of the destination is specified. When the destination setting screen is displayed, the control microcomputer (25) stores the current position of the vehicle specified by the GPS receiver (5) in the RAM (19) as the position of the departure place. In the navigation device (1), it is possible to set the departure place so as to set the destination.

  The control microcomputer (25) (the CPU (17)) determines whether or not the setting of the departure point and the destination is completed, for example, whether or not an operation for instructing the completion of the setting is performed by the operation means When the setting is completed, a route search setting screen is displayed on the LCD (29) (S3). On the route search setting screen, various settings relating to route generation performed below are performed. For example, it can be set whether the user is in a hurry to the destination or in a normal (not in a hurry) state. The control microcomputer (25) determines whether or not the setting on the route search setting screen is completed (S4). When the setting is completed, the node data and link within a predetermined range including the set starting point and destination are set. Data is read from the recording medium (13) and stored in the RAM (19) of the control microcomputer (25) (S5).

  The navigation device (1) of the present embodiment performs a route search for each of a plurality of search conditions to obtain a plurality of routes having different characteristics. For this reason, after step S5, a certain search condition is selected from a plurality of search conditions, and a route search is performed based on the evaluation cost corresponding to the search condition (S6). The navigation device (1) performs a route search under, for example, three search conditions of toll road priority, distance priority, and general road priority. In the route search process in step S6, the node closest to the departure point or the node at the departure point (hereinafter referred to as the “departure node”) is selected from the node closest to the departure point (hereinafter referred to as “departure node”) based on the algorithm based on the Dijkstra method or its improved method. A route to a nearby node or a destination node (hereinafter referred to as a “destination node”) is searched. The control microcomputer (25) performs a calculation by referring to necessary numerical values (distance, etc.) included in the read link data, and obtains a route having the lowest evaluation cost corresponding to the condition set in step S5. . The obtained route is expressed by a link string, and the data is stored in the RAM (19).

  After step S6, it is determined whether route search processing (step S6) has been performed for all search conditions (S7). If there are remaining search conditions, step S6 is performed again while changing the search conditions. After step S6 is repeated in this way and route search processing is performed for all search conditions, nodes corresponding to intersections of the obtained multiple routes (hereinafter referred to as “intersection nodes”) are extracted. Then, a process is performed for identifying a route component that is a part of at least one of the plurality of routes and connects the intersection nodes (S8). Information on the obtained path parts (for example, the path to which the path parts belong and the intersection nodes of the start and end points of the path parts) is stored in the RAM (19). Here, the intersection is an intersection where two or more routes included in a plurality of routes obtained by the route search intersect, or an end point of a common part where two or more routes included in a plurality of routes overlap (confluence of roads) (Corresponding to a point or a branch point), including a starting point and a destination.

FIG. 3A is an explanatory diagram illustrating an example of a route and a route portion obtained by route search. The FIG. 3 (a), are shown from the departure node N ₁ route R ₁ is a three path leading to the destination node N _2, route R ₂ and route R _3, for example, the route R ₁ is The route R ₂ is a route obtained by performing a route search using the general road priority as a search condition, the route R ₂ as a search condition, and the route R ₃ as a search condition using a toll road priority. These three routes intersect at the intersection node N ₃ in addition to the departure node N ₁ and the destination node N ₂ . In this case, in step S8, a part of the route R _1, and path component L ₁ extending to the intersection node N ₃ from the start point node N _1, a part of the route R _2, departure node N ₁ a path component L ₂ that leads to the intersection node N ₃ from a part of the route R _3, and path components L ₃ reaching the intersection node N ₃ from the start point node N _1, a part of the route R ₃ , a path component L ₄ extending from the intersection node N ₃ to the destination node N _2, a part of the route R _2, and path parts L ₅ extending from the intersection node N ₃ to the destination node N _2, route R ₁ And a route component L ₆ from the intersection node N ₃ to the destination node N ₂ is specified.

  After step S8, the control microcomputer (25) obtains various path characteristics for each of the identified path parts by referring to the path and path part information and link data stored in the RAM (19). Is stored in the RAM (19) (S9). The route characteristics include the travel distance, speed limit, and toll road fee, as well as the number of right turns, the number of left turns, the number of intersections, the number of signals, the number of ICs, and the degree of curve in the route component. As an example, FIG. 4 shows a table summarizing the route characteristics for each of the route components shown in FIG.

  The travel distance is a travel distance required for actually traveling along the route component. The speed limit is the legal speed limit of the route part (in the case where a plurality of sections having different legal speed limits are included in the path part, the average speed limit speed). The toll road fee is a toll for the toll road section included in the route component. A database relating to toll road tolls is recorded on the recording medium (13), and is referred to when a toll road toll is calculated. If the toll road section is not included in the route component, the toll road fee is set to zero.

  The number of right turns and the number of left turns are respectively the number of right turns and the number of left turns required when traveling along the route part. The number of intersections and the number of ICs are the number of intersections and the number of ICs that pass when traveling along the route component, respectively. The degree of curve is a value obtained by subtracting the linear distance between the start and end points from the travel distance of the route component.

  After step S9, the control microcomputer (25) calculates and stores an evaluation cost for each path component based on the path characteristics obtained in step S8 (S10). The evaluation cost is calculated based on the following formula, for example.

  The required time (h) is the sum of the value obtained by dividing the travel distance by the speed limit and the time required for the route event (right turn, left turn, intersection, signal and IC) of the route component. The driver unit price (yen / h) indicates a monetary value corresponding to the effort of the driver (user) per unit time. In the navigation device (1) of this embodiment, the driver unit price is set according to the circumstances of the user using the route search setting screen in step S3. When there is no time allowance and the user hurries to the destination, when the user specifies that on the route search setting screen, it is normal (when there is time allowance or not worrying about time) A driver unit price with a larger value is set and used for the calculation in step S10. For example, the driver unit price is set to 3000 yen / h when rushing, and is set to 2000 yen / h in a normal case. Note that the driver unit price may be set higher than the normal case even when the user has a financial margin.

  The consumed fuel (liter) is the sum of the amount of fuel consumed for moving the travel distance and the amount of fuel consumed for stopping, starting, and the like caused by the route event. The unit price of fuel (yen / liter) is the price of fuel per unit volume.

  The degree of trouble (points) is a numerical value of the degree of feeling that the user feels troublesome when performing stop, start, direction confirmation, etc. at the route event of the route part, in other words, the mental and physical fatigue given to the user. It has become. The trouble unit price (yen / point) is the amount of trouble per point, and is used to convert the trouble degree into a monetary value.

  When the user does not care about the operational burden necessary for making a right turn or a left turn, it is preferable that the evaluation cost is calculated without including the troublesomeness and the troublesome unit price. Therefore, in the navigation device (1) of the present embodiment, when the fact is selected on the route search setting screen in step S3, the evaluation cost is calculated in step S10 without considering the troublesomeness and the troublesome unit price. Is done.

  FIG. 5 is a table summarizing examples of numerical values used for calculating the evaluation cost for each route event. These values, driver unit price, automobile fuel consumption per unit distance, fuel unit price and trouble unit price are stored in the flash memory (23) of the control microcomputer (25), and in step S10 Referenced. For example, the driver unit price is 2000 yen / h, the automobile fuel consumption is 10 liters / km, the fuel unit price is 100 yen / liter, and the troublesome unit price is 1 yen / point.

As a specific example, the evaluation cost of the path component L ₁ shown in FIG. 3A is calculated using the numerical values shown in FIGS. 4 and 5 and the unit price shown above. From FIG. 4, the toll road charge for the route component L ₁ is 0 yen, and the required time, fuel consumption, and complexity are calculated as follows.

Accordingly, the evaluation cost of the path component L ₁ is obtained as follows (fractions are rounded down).

  The following results are obtained by calculating the evaluation costs of other path components in the same manner.

In this way, after the evaluation cost of each route component is calculated in step S10, the evaluation cost is calculated for all routes from the starting point to the destination obtained by combining the route components using the result. (S11). After step S11, the route with the lowest evaluation cost is set as the guide route used in the route guide operation and displayed on the LCD (29) (S12). FIG. 6 is a table showing evaluation costs and evaluation ranks of all routes from the departure place to the destination in the illustrated case. In the illustrated case, since the evaluation cost of the route 4 constituted by the route component L ₂ and the route component L ₄ is the lowest, the route 4 indicated by a thick line in FIG. 3B is set as the guidance route, A screen for displaying this route is displayed on the LCD (29). After step S12, the route search operation of the navigation device (1) ends, and a route guidance operation that guides the user to the destination along the set guidance route is started. In step S12, several routes with the lowest evaluation cost (for example, five routes with the lowest evaluation cost to the first to the fifth) are displayed on the LCD (29), and a guide route is selected from these. The user may select a route to be adopted as

  In the above embodiment, in the evaluation cost calculation, the value of the troublesome unit price is the same for each route component. However, the troublesome unit price may be varied between the departure point and the destination. In this case, since the fatigue of the user required for the driving operation increases from the starting point to the destination, the unit price of the trouble changes so as to increase toward the destination, and the user approaches the destination or closes the destination. In the calculation of the evaluation cost of the route component including, the troublesome unit price is set larger than the calculation of the evaluation cost of the route component close to or including the departure place.

For example, in the case illustrated in FIG. 3A, the troublesome unit price when the evaluation cost of the route parts L _{1 to} L ₃ on the departure side is calculated is 1 yen / point, and the route part L on the destination side is calculated. The troublesome unit price when the evaluation costs of _{4 to} L ₆ are calculated may be 1.5 yen / point. The case illustrated in FIG. 3 (a) is a simple example that takes account of ease of explanation, and in fact, the evaluation cost for a route obtained by combining a considerable number of route parts exceeding two is shown. There will be many cases to ask for. Therefore, for example, the unit price is 1 yen / point for 30% route parts on the departure side (of all routes), 1.5 yen / point for the middle 40% route parts, and on the destination side. The remaining 30% of route parts may be set to be 2 yen / point.

In consideration of the situation where the departure side needs to move quickly even though the cost is somewhat high, the driver unit price may be made variable in a manner similar to the above-mentioned troublesome unit price. For example, in the case illustrated in FIG. 3A, the driver unit price when the evaluation cost of the route components L _{1 to} L ₃ on the departure side is calculated is 2500 yen, and the route components L _{4 to} L on the destination side are calculated. The driver unit price when the evaluation cost of ₆ is calculated may be 2000 yen. Furthermore, the driver unit price is 3000 yen for 30% of route parts on the departure side (for all routes), 2500 yen for the route parts of the middle 40%, and 2000 for the remaining 30% of route parts on the destination side. It may be set as a circle. Note that if there is a situation where it is desired to move quickly on the destination side, the driver unit price may be changed so as to increase toward the destination.

  The apparatus configuration for carrying out the present invention is not limited to the above embodiment. For example, the route search process and the evaluation cost calculation process in the route search operation described with reference to FIG. This may be performed separately by a server device that is connected to the navigation device (1). The present invention is not limited to a navigation device for automobiles, and may be applied to navigation devices for two-wheeled vehicles and other vehicles.

  In the above embodiment, the route search is performed a plurality of times under different conditions to obtain a plurality of routes having different characteristics from the starting point to the destination, and thereafter, a route component that connects the intersections of the routes is obtained. However, a plurality of routes may be obtained by performing a route search only under certain specific conditions. For example, a route search may be performed under distance priority conditions, and several routes having different evaluation cost values may be selected, including a route with the lowest evaluation cost. However, in the present invention, it is not preferable that a plurality of path parts having similar characteristics exist. Therefore, as in the above-described embodiment, a plurality of paths having different characteristics are generated, and the path parts of these paths are generated. Is preferably obtained. In addition, a route serving as a guidance route may be generated by performing a route search using an evaluation cost according to the above-described mathematical formula without preparing a plurality of such routes. However, as in the above-described embodiment, route parts that are characteristic of the present invention can be obtained in an in-vehicle navigation device by identifying route parts from a plurality of routes and obtaining an evaluation cost including various elements for the route of the combination. This is practically possible (in the in-vehicle vigilance device (1), the calculation capability of the control microcomputer (25) used is limited). In the embodiment in which most of the necessary calculations are performed by the server device, it is preferable that a route serving as a guidance route is generated by performing a route search using an evaluation cost according to the mathematical formula shown above. I will.

  The above description of the embodiments is for explaining the present invention, and should not be construed as limiting the invention described in the claims or reducing the scope thereof. Each part configuration of the present invention is not limited to the above embodiment, and various modifications can be made within the technical scope described in the claims.

It is a block diagram of the navigation apparatus which is an Example of this invention. It is a flowchart which shows the route search operation | movement of the navigation apparatus which is an Example of this invention. FIG. 3A is an explanatory diagram illustrating an example of a route component generated by the navigation device according to the embodiment of the present invention, and FIG. 3B is an explanatory diagram illustrating a guidance route generated by the navigation device. FIG. It is the table | surface which put together the path | route characteristic regarding each of the path | route components shown to Fig.3 (a). It is the table | surface which put together an example of the numerical value used for calculation of evaluation cost about each of route event. It is a table | surface which shows the evaluation cost of all the paths from the departure place to the destination obtained by combining the route components shown to Fig.3 (a), and an evaluation rank.

Explanation of symbols

(1) Navigation device
(5) GPS receiver
(13) Recording medium
(25) Control microcomputer
(29) Liquid crystal display device

Claims (16)

In a route search device that performs an evaluation based on a predetermined evaluation cost and searches for a route from a departure place to a destination,
The evaluation cost includes a first expense that is actually required for movement from the departure place to the destination, and a second expense that is obtained by converting the time required for movement from the departure place to the destination into money. ,
The route search device according to claim 1, wherein the coefficient for converting the required time into money is selectively set by a user.   The first cost includes a product of the fuel consumption and the unit price of fuel consumed by the movement from the departure place to the destination, and the consumed fuel is separated from the fuel proportional to the movement distance from the departure place. The route search device according to claim 1, comprising fuel consumed by at least one of a right turn, a left turn, an intersection, a signal, and an interchange existing before reaching the destination.   A plurality of route searches are performed under different search conditions to generate a plurality of routes from the starting point to the destination, and a part of at least one of the plurality of routes, For each of the routes from the starting point to the destination generated by specifying a plurality of route parts connecting the intersections, calculating the evaluation cost for each route part, and selectively combining the plurality of route parts. The route search device according to claim 1, wherein the evaluation cost is obtained.   The coefficient for converting the required time into money in the calculation of the evaluation cost for a certain route component changes according to the position of the route component between the departure place and the destination. Route search device. In a route search device that performs an evaluation based on a predetermined evaluation cost and searches for a route from a departure place to a destination,
The evaluation cost includes a cost required for movement from the starting point to the destination, and a cost corresponding to troublesomeness caused to the user when moving from the starting point to the destination. Search device.   At the cost corresponding to the trouble, at least one of the number of right turns, the number of left turns, the number of intersections, the number of signals, the number of interchanges, and the degree of the curve of the route from the starting point to the destination is converted into money. The route search device according to claim 5.   A plurality of route searches are performed under different search conditions to generate a plurality of routes from the starting point to the destination, and a part of at least one of the plurality of routes, For each of the routes from the starting point to the destination generated by specifying a plurality of route parts connecting the intersections, calculating the evaluation cost for each route part, and selectively combining the plurality of route parts. The route search apparatus according to claim 5, wherein the evaluation cost is obtained.   In calculating the evaluation cost for a certain route component, the coefficient for converting the event occurring in the route component into money in order to obtain the cost corresponding to the trouble is that the route component between the starting point and the destination The route search device according to claim 7, wherein the route search device changes according to the position of the route. In a route search method for evaluating a plurality of candidate routes based on a predetermined evaluation cost and searching for a route from a departure place to a destination,
The evaluation cost includes a first expense that is actually required for movement from the departure place to the destination, and a second expense that is obtained by converting the required time required for movement from the departure place to the destination into money. ,
The route search method characterized by including the process which a user selectively sets the coefficient which converts the said required time into money.   The first cost includes a product of a fuel consumption and a unit price of fuel consumed by the movement from the departure place to the destination, and the consumed fuel is separated from the fuel proportional to the movement distance from the departure place. The route search method according to claim 9, comprising fuel consumed by at least one of a right turn, a left turn, an intersection, a signal, and an interchange existing up to the destination.   Performing a plurality of route searches under different search conditions to generate the plurality of routes from the starting point to the destination; and a part of at least one of the plurality of routes, A step of identifying a plurality of route parts connecting the intersections of the routes, a step of calculating the evaluation cost for each route part, and the purpose from the starting point generated by selectively combining the plurality of route parts The route search method according to claim 9, further comprising a step of obtaining the evaluation cost for each route to the ground.   12. The coefficient for converting the required time into money in the calculation of the evaluation cost for a certain route part changes according to the position of the route part between the departure place and the destination. Route search method. In a route search method for searching for a route from a departure place to a destination by performing evaluation based on a predetermined evaluation cost for a plurality of candidate routes,
The evaluation cost includes a cost required for movement from the starting point to the destination, and a cost corresponding to troublesomeness caused to the user when moving from the starting point to the destination. Search method.   At the cost corresponding to the trouble, at least one of the number of right turns, the number of left turns, the number of intersections, the number of signals, the number of interchanges, and the degree of the curve of the route from the starting point to the destination is converted into money. The route search method according to claim 13.   Performing a plurality of route searches under different search conditions to generate the plurality of routes from the starting point to the destination; and a part of at least one of the plurality of routes, A step of identifying a plurality of route parts connecting the intersections of the routes, a step of calculating the evaluation cost for each route part, and the purpose from the starting point generated by selectively combining the plurality of route parts The route search method according to claim 13 or 14, further comprising the step of obtaining the evaluation cost for each route to the ground.   In calculating the evaluation cost for a certain route component, the coefficient for converting the event occurring in the route component into money in order to obtain the cost corresponding to the trouble is that the route component between the starting point and the destination The route search method according to claim 15, wherein the route search method changes according to the position of the route.

Images