Route search device, route search method, program, and storage medium

Abstract

To enable appropriate determination of a route with the lowest parking fees for parking facilities on toll roads.SOLUTION: In a route search device disclosed herein, acquisition means acquires a departure point and a destination point. The acquisition means may acquire a current location entered by a user and use the current location of a vehicle as a departure point. Cost computation means computes a required time and distance to the destination and a total cost, including tolls on toll roads and parking fees for paid parking facilities on toll roads, for each of multiple routes from the departure point to the destination point. Output means outputs a route with at least the lowest parking fees for parking facilities as a recommended route among one or more routes including a route with the lowest total cost.SELECTED DRAWING: Figure 9

Description

[Technical Field]

[0001] The present invention relates to a technique for searching for a route. [Background technology]

[0002] A known technique for searching for a route to a destination involves assigning a cost proportional to the cost per distance on an expressway to each link and using the Dijkstra algorithm to search for a route that takes into account the tolls and travel time of the toll road. For example, Patent Document 1 discloses a navigation device that searches for a route using a composite cost that includes the tolls and travel time, and outputs a recommended route that takes into account the balance between tolls and travel time. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Laid-Open No. 2011-7706 Summary of the Invention [Problem to be solved by the invention]

[0004] Charging parking fees at facilities such as service areas (SA) and parking areas (PA) on expressways and motorways (hereinafter referred to as "toll roads") is being considered. In this case, users will need to consider the parking fees at parking facilities on the toll road in addition to the toll road toll when planning their route to their destination. It is also expected that users will want to keep parking fees at parking facilities on toll roads as low as possible.

[0005] The present invention has been made to solve the above-mentioned problems, and its main object is to provide a route search device that can suitably determine a route with low parking fees at parking facilities on toll roads. [Means for solving the problem]

[0006] The claimed invention is a route search device comprising: an acquisition means for acquiring a departure point and a destination; a cost calculation means for calculating a total cost for a plurality of routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, tolls on toll roads, and parking fees at parking facilities on toll roads; and an output means for outputting as a recommended route the route with the lowest parking fee at least at the parking facility from among one or more routes including the route with the lowest total cost.

[0007] The claimed invention is a route search method executed by a computer, which obtains a starting point and a destination, calculates a total cost for multiple routes from the starting point to the destination, including the time or distance required to reach the destination, tolls on toll roads, and parking fees at parking facilities on toll roads, and outputs, as a recommended route, the route with the lowest parking fee at least at the parking facility from among one or more routes including the route with the lowest total cost.

[0008] The claimed invention is also a program that causes a computer to execute a process of acquiring a starting point and a destination, calculating a total cost for multiple routes from the starting point to the destination, including the cost of the time or distance required to reach the destination, tolls on toll roads, and parking fees at parking facilities on toll roads, and outputting as a recommended route the route with the lowest parking fee at least at the parking facility from among one or more routes including the route with the lowest total cost. [Brief explanation of the drawings]

[0009] [Figure 1] FIG. 1 is a block diagram showing a schematic configuration of a navigation device according to each embodiment. [Figure 2] 10 shows an example of the data structure of a toll table. [Figure 3] 10 shows an example of the data structure of a parking fee table. [Figure 4] FIG. 1 is a diagram showing an approximate solution route and expressway facilities on the approximate solution route. [Figure 5] 4 is a flowchart of a recommended route output process according to the first embodiment. [Figure 6] 10 is a flowchart of a process for adding fuel costs to link costs. [Figure 7] FIG. 10 is a diagram illustrating an example of a recommended route. [Figure 8] FIG. 10 is a diagram illustrating an example of a recommended route. [Figure 9] 10 is a flowchart of a recommended route output process according to a first example of the second embodiment. [Figure 10] 10 is a flowchart of a recommended route output process according to a second example of the second embodiment. [Figure 11] 10 shows the configuration of a route search system according to another system configuration. DETAILED DESCRIPTION OF THE INVENTION

[0010] In a preferred embodiment of the present invention, the route search device comprises an acquisition means for acquiring a departure point and a destination, a cost calculation means for calculating a total cost for a plurality of routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, the toll fee for a toll road, and the parking fee for a parking facility on the toll road, and an output means for outputting as a recommended route the route with the lowest parking fee at least at the parking facility from among one or more routes including the route with the lowest total cost.

[0011] In the above-described route search device, the acquisition means acquires a departure point and a destination. The acquisition means may acquire a current location input by a user, or may acquire the current location of a vehicle as the departure point. The cost calculation means calculates a total cost for multiple routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, the toll road toll, and the parking fees at parking facilities on the toll road. The output means then outputs, as a recommended route, the route with the lowest parking fees at the parking facilities from among one or more routes including the route with the lowest total cost. This makes it possible to preferably determine a route with low parking fees at parking facilities on the toll road.

[0012] In one aspect of the above route search device, the total cost may further include a cost for fuel or electricity of a vehicle traveling along the route.

[0013] In another aspect of the route search device, the cost calculation means calculates the total cost for a plurality of routes on which parking fees are free, and the output means outputs the route on which parking fees are free as the recommended route. In this aspect, a route on which parking fees are free on a toll road can be obtained.

[0014] In another aspect of the route search device, the cost calculation means calculates the total cost for a plurality of routes that satisfy a predetermined desired rest time at the parking facility, and the output means outputs a route that satisfies the predetermined desired rest time at the parking facility as the recommended route. In this aspect, a route that satisfies the user's desired rest time can be obtained.

[0015] In another aspect of the route search device, the output means outputs a predetermined number of routes in ascending order of parking fees at the parking facilities as the recommended routes. In this aspect, the user can view the predetermined number of routes in ascending order of parking fees at the parking facilities and determine the route to travel.

[0016] In another preferred embodiment of the present invention, a route search method executed by a computer acquires a starting point and a destination, calculates a total cost for multiple routes from the starting point to the destination, including the cost of the time or distance required to reach the destination, the toll road toll, and the parking fees at parking facilities on the toll road, and outputs, as a recommended route, the route with the lowest parking fees at least at the parking facilities from among one or more routes including the route with the lowest total cost. This method also makes it possible to preferably determine a route with low parking fees at parking facilities on a toll road.

[0017] In yet another preferred embodiment of the present invention, a program causes a computer to acquire a starting point and a destination, calculate a total cost for multiple routes from the starting point to the destination, including the cost of the time or distance required to reach the destination, tolls on toll roads, and parking fees at parking facilities on the toll roads, and output, as a recommended route, the route with the lowest parking fee at the parking facility from among one or more routes including the route with the lowest total cost. By executing this program on a computer, the above-mentioned route search device can be realized. This program can be stored in a storage medium and used. [Example]

[0018] The present invention will be described below with reference to the accompanying drawings, in which: In the following description, an expressway among toll roads is used as an example, but the present invention is equally applicable to toll roads other than expressways.

[0019] <System configuration> Fig. 1 shows the system configuration of a navigation device 1 to which a route search device according to the present invention is applied. The navigation device 1 calculates costs for each route based on toll road tolls and parking fees at parking facilities on the toll road, determines recommended routes to be presented to the user, and displays the routes. As shown in Fig. 1, the navigation device 1 includes a standalone positioning device 10, a GPS receiver 18, a system controller 20, a data storage unit 31, a communication device 38, a display unit 40, an audio output unit 50, and an input device 60.

[0020] The stand-alone positioning device 10 includes an acceleration sensor 11, an angular velocity sensor 12, and a distance sensor 13. The acceleration sensor 11 is made of, for example, a piezoelectric element, and detects the acceleration of the vehicle and outputs acceleration data. The angular velocity sensor 12 is made of, for example, a vibration gyroscope, and detects the angular velocity of the vehicle when the vehicle changes direction, and outputs angular velocity data and relative direction data. The distance sensor 13 measures vehicle speed pulses, which are pulse signals generated in conjunction with the rotation of the vehicle's wheels.

[0021] The GPS receiver 18 receives radio waves 19 carrying downlink data including positioning data from multiple GPS satellites. The positioning data is used to detect the absolute position of the vehicle from latitude and longitude information, etc.

[0022] The system controller 20 includes an interface 21 , a CPU 22 , a ROM 23 , and a RAM 24 , and controls the entire navigation device 1 .

[0023] The interface 21 acts as an interface with the acceleration sensor 11, angular velocity sensor 12, distance sensor 13, and GPS receiver 18. From these sensors, the interface 21 inputs vehicle speed pulses, acceleration data, relative direction data, angular velocity data, GPS positioning data, absolute direction data, etc. to the system controller 20. The CPU 22 controls the entire system controller 20. The ROM 23 includes a non-volatile memory (not shown) that stores a control program for controlling the system controller 20, etc. The RAM 24 readably stores various data, such as route data preset by the user via the input device 60, and provides a working area for the CPU 22.

[0024] The system controller 20 , the data storage unit 31 , the display unit 40 , the audio output unit 50 and the input device 60 are interconnected via a bus line 30 .

[0025] The data storage unit 31 is configured with a storage medium such as an HDD, and stores various data used in navigation processing, such as map data 32. The map data 32 includes road data represented by links corresponding to roads and nodes corresponding to road junctions (intersections).

[0026] The data storage unit 31 also stores a toll table 33. The toll table 33 is a table for identifying the tolls charged when traveling on toll roads such as expressways, based on interchanges used as entrances and exits. FIG. 2 shows an example of the data structure of the toll table 33. In the toll table 33 shown in FIG. 2, entrance points, exit points, waypoints (waypoint 1, ...), discount time periods (discount time periods 1, ...), discount rates (discount rate 1, ...), and tolls are associated with each other. Here, a waypoint refers to a facility, such as a ticket inspection station, where the toll rate is affected by whether or not the vehicle passes through it. Hereinafter, the entrance points, exit points, and waypoints registered in the toll table 33 will also be simply referred to as "expressway facilities."

[0027] In this way, the toll table 33 associates tolls with each combination of factors that determine the toll when using an expressway. Therefore, by referring to the toll table 33, the system controller 20 can accurately identify the toll for the expressway when the searched route includes the expressway.

[0028] The data storage unit 31 also stores a parking fee table 34. When parking at service areas and parking areas (hereinafter also referred to as "highway parking facilities") on a highway becomes a paid service area, a parking fee is charged for parking at the highway parking facility. FIG. 3 shows an example of the parking fee table 34. As shown in the figure, the parking fee table 34 includes a route ID, a facility ID, a point of interest (POI) ID, a start time, an end time, a fee, and a fee type. The route ID is identification information for the highway route. The facility ID is identification information for each highway parking facility. The POI ID is the POI ID corresponding to each highway parking facility. The start time is the start time of charging for parking at that highway parking facility, and the end time is the end time of charging. In other words, if a vehicle is parked between the start time and the end time, a parking fee will be charged. The fee is the fee incurred for parking. The charging type indicates the charging method. Specifically, if the charging type is "fixed," a parking fee is charged for each parking session. If the charge type is "every X minutes," a parking fee will be charged for every X minutes of parking. If the charge type is "staying for more than Y minutes," a parking fee will be charged if you park for more than Y minutes. If the charge type is "free," no parking fee will be charged.

[0029] In this way, the parking fee table 34 specifies the parking fee incurred when parking a vehicle at each highway parking facility. Therefore, by referring to the parking fee table 34, the system controller 20 can calculate the parking fee at the highway facility when the searched route includes parking at the highway parking facility.

[0030] The configuration of the navigation device 1 will be described with reference to Figure 1 again. The communication device 38 receives traffic congestion information distributed from a VICS (Vehicle Information Communication System, registered trademark) center and traffic congestion information distributed from a server device (not shown) that distributes traffic congestion information. Note that the communication device 38 may receive information to be stored in the data storage unit 31 as map data 32 from the server device (not shown) under the control of the system controller 20.

[0031] The display unit 40 displays various display data on a display device such as a monitor under the control of the system controller 20. Specifically, the system controller 20 reads map data 32 from the data storage unit 31. The display unit 40 displays an image based on the map data 32 read from the data storage unit 31 by the system controller 20 on a display screen such as a monitor. The display unit 40 includes a graphic controller 41 that controls the entire display unit 40 based on control data sent from the CPU 22 via the bus line 30, a buffer memory 42 such as a VRAM (Video RAM) that temporarily stores image information that can be displayed immediately, a display control unit 43 that controls the display 44 such as a liquid crystal display or a CRT (Cathode Ray Tube) based on image data output from the graphic controller 41, and a display 44. The display 44 is, for example, a liquid crystal display device with a diagonal of approximately 5 to 10 inches and is mounted near the front panel inside the vehicle.

[0032] The audio output unit 50 is configured to include a D / A converter 51 that performs D / A conversion of audio digital data sent from the RAM 24 or the like via the bus line 30 under the control of the system controller 20, an amplifier (AMP) 52 that amplifies the audio analog signal output from the D / A converter 51, and a speaker 53 that converts the amplified audio analog signal into audio and outputs it inside the vehicle.

[0033] The input device 60 is composed of keys, switches, buttons, a remote control, a voice input device, etc. for inputting various commands and data. The input device 60 is arranged on the front panel of the main body of the in-vehicle electronic system installed in the vehicle or around the display 44. In addition, if the display 44 is a touch panel type, the touch panel provided on the display screen of the display 44 also functions as the input device 60.

[0034] In the above configuration, the system controller 20 is an example of the acquisition means, cost calculation means, output means, and computer that executes the program of the present invention, as will be described later.

[0035] <First Example> [Route search method] In the first embodiment, the navigation device 1 calculates a route using the time required to reach the destination, the tolls on the expressway, and the parking fees at the expressway parking facilities as costs, and outputs the route with the smallest total cost, which is the sum of these costs, as the recommended route.

[0036] Specifically, the system controller 20 considers at least one of the expressway facilities on the provisionally searched route (hereinafter also referred to as the "approximate solution route") to be pseudo-closed, and searches for a route other than the approximate solution route based on a cost that does not take tolls into account (hereinafter also referred to as the "toll-unconsidered cost").The system controller 20 then calculates the cost that takes tolls into account (hereinafter also referred to as the "toll-considered cost") for each of the approximate solution route and the route other than the searched approximate solution route, and outputs the route with the smallest toll-considered cost as the recommended route.

[0037] FIG. 4(A) is a diagram showing an approximate solution route and expressway facilities on the approximate solution route. In FIG. 4(A), the approximate solution route that overlaps with general roads is shown by a dashed line, and the approximate solution route that overlaps with expressways is shown by a solid line. Here, the approximate solution route is a route searched for using an existing route search algorithm that can be executed using the Dijkstra algorithm, and may be a route searched for by setting the required time and / or distance as a cost (also called "link cost") for each link. In another example, the approximate solution route may be a route searched for by assuming that the distance traveled on the expressway is proportional to the toll and setting a link cost that reflects the hypothetical toll for each link.

[0038] In the example of Figure 4(A), the approximate solution route passes through four expressway facilities 6A to 6D, including interchanges at the entrance and exit. In this case, the system controller 20 regards at least one of the expressway facilities 6A to 6D as a pseudo road closure and searches for a route other than the approximate solution route based on a cost that does not take tolls into account. In this case, for example, the system controller 20 uses the required time and / or distance as a cost index and calculates the integrated value of the link costs of the entire route as the cost that does not take tolls into account.

[0039] FIG. 4(B) shows the route with the smallest cost before toll is taken into account when the expressway facility 6B is pseudo-closed. In the example of FIG. 4(B), the system controller 20 searches for a route that does not pass through the expressway facility 6B. In this case, the system controller 20 sets a link cost for each link based on the required time and / or distance, for example, and searches for a route with the smallest integrated value of the link cost using the Dijkstra algorithm or the like. Then, the system controller 20 searches for all patterns (2 patterns) in which at least one of the expressway facilities 6A to 6D is pseudo-closed. 4 −1), a route with the smallest integrated value of the link costs (i.e., the cost not considering the toll) is searched for.

[0040] Furthermore, the system controller 20 calculates the toll for the route with the smallest untolled cost for each pattern in which at least one of the expressway facilities 6A to 6D is pseudo-closed, by referring to the toll table 33 based on the expressway facilities passed through and the time of day the route is passed through. The system controller 20 then multiplies the calculated toll by a predetermined conversion rate to convert the toll into a cost in the same unit as the untolled cost, and adds the converted cost to the untolled cost to calculate the toll-considered cost. Similarly, the system controller 20 calculates the toll for the approximate solution route to calculate the toll-considered cost. The system controller 20 then considers the route with the smallest toll-considered cost among the routes for which the tolls have been calculated as the recommended route.

[0041] 3(C) shows the route with the smallest toll-considered cost. In this case, the system controller 20 determines that the toll-considered cost of the route with the smallest toll-unconsidered cost when expressway facilities 6B and 6C are pseudo-closed is smaller than the approximate solution route or routes with patterns in which other expressway facilities are pseudo-closed, and sets this route as the recommended route.

[0042] [Recommended route output processing] Fig. 5 is a flowchart of the recommended route output process according to Example 1. As an example, the flowchart in Fig. 5 uses an algorithm in which a tentative (provisional) recommended route is defined as a "first candidate route" and a route to be compared with the first candidate route is defined as a "second candidate route," and the first candidate route is sequentially updated by comparing the toll-considered costs of the first candidate route and the second candidate route.

[0043] First, the system controller 20 searches for an approximate solution route through a route search process (step S100). The route search process is performed by, for example, setting the required time and / or distance as link costs as described above. Next, the system controller 20 creates a list of expressway facilities (also called an "expressway facility list") that exist on the approximate solution route (step S101).

[0044] Next, the system controller 20 determines whether the time required for the approximate solution route is equal to or greater than the driving time that requires a break (step S102). Here, the "driving time that requires a break" may be predetermined and may be set or changed by the user. If the time required for the approximate solution route is not equal to or greater than the predetermined time that requires a break (step S102: No), the process proceeds to step S105.

[0045] On the other hand, if the required time for the approximate solution route is equal to or longer than the predetermined time required for a break (step S102: Yes), the system controller 20 calculates the arrival time at a highway facility in the highway facility list where a break is possible, and adds the facility where the arrival time at the highway facility is after the recommended continuous driving time for a break has elapsed and the parking fee is the cheapest to the approximate solution route as a proposed stopover (step S103). Here, the "recommended continuous driving time for a break" is the continuous driving time at which the driver needs to take a break, and is set to, for example, two hours.

[0046] Next, the system controller 20 recalculates the toll fee and the required travel time for the approximate solution route to which the proposed route points have been added (step S104). At this time, the system controller 20 also takes into account the stay time at the proposed route points when recalculating. The stay time at the proposed route points may be a time predetermined as a general stay time, or may be a desired stay time preset by the user.

[0047] Next, the system controller 20 calculates the toll-considered cost of the approximate solution route and sets it as the first candidate route (step S105). In this case, the system controller 20 calculates the toll-unconsidered cost of the approximate solution route, and then converts the toll of the approximate solution route calculated based on the toll table 33 into a cost using a predetermined conversion rate and adds it to the toll-unconsidered cost, thereby calculating the toll-considered cost of the approximate solution route. Furthermore, if a proposed route point is proposed in step S103, the system controller 20 converts the parking fee at the proposed route point into a cost using a predetermined conversion rate and adds it to the toll-considered cost. In this way, if a proposed route point is proposed, the total cost of the first candidate route will include the cost of the required time and / or distance, the cost of expressway tolls, and the cost of parking fees at paid parking facilities.

[0048] Next, the system controller 20 selects at least one highway facility to be pseudo-closed from the highway facility list and searches for a second candidate route with the smallest unconsidered cost (step S106). In this case, the system controller 20 can determine the cost for each link based on the distance, travel time, etc., without considering tolls or parking fees, making it possible to efficiently search for a second candidate route using the Dijkstra algorithm. Note that the second candidate route, i.e., the route searched for by selecting at least one highway facility to be pseudo-closed from the highway facility list and minimizing the unconsidered cost, will hereinafter be referred to as the "pseudo-road-closure route."

[0049] Next, the system controller 20 adds proposed waypoints to the second candidate route using the same method as for the first candidate route (i.e., the method of step S103), and calculates the toll-considered cost of the second candidate route (step S107). At this time, the system controller 20 calculates the toll-considered cost of the second candidate route by adding the toll cost calculated with reference to the toll table 33 and the parking fee cost of the proposed waypoints calculated with reference to the parking fee table 34 to the toll-unconsidered cost of the second candidate route found in step S106.

[0050] Next, the system controller 20 determines whether the toll-considered cost of the second candidate route is smaller than the toll-considered cost of the first candidate route (step S108). If the toll-considered cost of the second candidate route is smaller than the toll-considered cost of the first candidate route (step S108; Yes), the system controller 20 sets the second candidate route as the first candidate route (step S109). On the other hand, if the toll-considered cost of the second candidate route is equal to or greater than the toll-considered cost of the first candidate route (step S108; No), the system controller 20 determines that there is no need to replace the first candidate route, and proceeds to step S110.

[0051] Next, the system controller 20 determines whether all patterns of expressway facilities that will be pseudo-closed have been executed (step S110). That is, the system controller 20 determines whether the processes of steps S106 to S109 have been executed for all patterns of expressway facilities that will be pseudo-closed when at least one of the expressway facilities in the expressway facility list is to be pseudo-closed.

[0052] If the system controller 20 determines that all patterns of expressway facilities to be pseudo-road closures have not been executed (step S11; No), it returns the process to step S106. Then, in step S106, the system controller 20 performs a route search targeting another pattern of expressway facilities to be pseudo-road closures, and sets a second candidate route. In this way, the system controller 20 repeatedly executes the processes of steps S106 to S109 until all patterns of expressway facilities to be pseudo-road closures have been executed.

[0053] If the system controller 20 determines that all patterns of expressway facilities that create pseudo-road closures have been executed (step S110; Yes), it determines that the current first candidate route is the route with the smallest toll consideration cost, and outputs the first candidate route as the recommended route (step S111).Then, the process ends.

[0054] In this way, the system controller 20 can determine a recommended route based on the total cost taking into consideration the tolls of the expressway and the parking fees of the expressway parking facilities. Furthermore, in steps S103 and S107, when proposing a proposed route, the system controller 20 proposes the cheapest proposed route, and therefore can propose a recommended route that will result in the cheapest parking fee.

[0055] [Route search taking fuel costs into account] In the above embodiment, when searching for an approximate solution route in step S100 of the recommended route output process shown in Fig. 5, and when searching for a route after pseudo-closing at least one expressway facility in step S106, the required time and / or distance are used as link costs, and route searching is performed using the Dijkstra algorithm. In this route search, by adding fuel costs to the cost in addition to the required time and / or distance, it becomes possible to propose a recommended route that takes into account the fuel costs associated with vehicle travel.

[0056] Specifically, when the system controller 20 performs a route search in steps S100 and S106 of the recommended route output process shown in Fig. 5, it performs the link cost adjustment process described below to add the fuel cost to the link cost. Fig. 6 is a flowchart of the link cost adjustment process.

[0057] 6, first, the system controller 20 acquires link data used for route search (step S10), and calculates the link cost of the link based on the required time and / or distance (step S11). Next, the system controller 20 estimates the fuel consumption of a vehicle traveling along the link (step S12). Specifically, the system controller 20 estimates the fuel consumption required to travel along the link based on the link's distance (length), road type (general road, expressway, etc.), road attributes (road gradient, legal speed limit, etc.), and the fuel consumption of a standard vehicle (gasoline consumption or electricity consumption).

[0058] Next, the system controller 20 calculates the fuel cost required to travel the link based on the fuel consumption amount obtained in step S12 and the standard fuel unit price (step S13), and converts the fuel cost into a cost (also called "fuel cost") using a predetermined conversion rate (step S14).Then, the system controller 20 adds the obtained fuel cost to the link cost calculated in step S11 to calculate the link cost taking the fuel cost into account (step S14).

[0059] In this way, when performing a route search in steps S100 and S106 of the recommended route output process shown in FIG. 5, the system controller 20 uses link costs that take fuel costs into account, thereby enabling the system controller 20 to propose a recommended route that takes fuel costs into account.

[0060] Note that the above "fuel costs" are based on the assumption that the vehicle is powered by an internal combustion engine such as a gasoline-powered vehicle. If the vehicle is an EV (Electric Vehicle), the cost of electricity (electricity costs) can be used instead of fuel costs.

[0061] [Example of recommended route] Next, an example of a recommended route obtained by the recommended route output process will be described. Assume that there is a road network as shown in FIG. 7(A). In FIG. 7(A), dashed lines indicate ordinary roads, and solid lines indicate expressways. Assume that the expressway has entrances A to C and exit D as expressway facilities, as well as expressway parking facilities (service areas) SA1 and SA2. SA1 is the facility with facility ID=105 in parking fee table 34 shown in FIG. 3, and SA2 is the facility with facility ID=108 in parking fee table 34.

[0062] FIG. 7(B) shows an example of a route (referred to as "Route X") when a user drives from departure point S to destination G without taking a break at a highway parking facility. On Route X, the vehicle drives on a local road from departure point S, enters the expressway at entrance A, exits the expressway at exit D, and travels on a local road to destination G. In this case, since the vehicle does not park at a highway parking facility, the parking fee at the highway parking facility is 0 yen, and the total fee for Route X is 7,000 yen.

[0063] FIG. 8(A) shows an example of a route (referred to as "route Y") when a user takes a break at an optional facility (in this case, SA2) while driving from departure point S to destination G. On route Y, the vehicle drives on a public road from departure point S, enters the expressway at entrance A, takes a 30-minute break at highway parking facility SA2 from 9:00, exits the expressway at exit D, and travels on a public road to destination G. In this case, since the vehicle parks at highway parking facility SA2 for 30 minutes from 9:00, the parking fee is 600 yen, and the total fee for route X is 7,600 yen.

[0064] FIG. 8(B) shows an example of a recommended route (referred to as "route Z") according to this embodiment. On recommended route Z, the vehicle travels on local roads from departure point S, enters the expressway at entrance B, takes a 30-minute break at highway parking facility SA1 from 8:30, exits the expressway at exit D, and travels to destination G on local roads. In this case, the vehicle parks at highway parking facility SA1 for 30 minutes from 8:30, so the parking fee is 0 yen. The total fee for route Z is 6,700 yen.

[0065] Thus, according to the first embodiment, even if the user does not set which expressway parking facilities to stop at, the navigation device 1 can calculate a recommended route that includes inexpensive and cost-effective rest facilities and suggest it to the user in advance.

[0066] [Variations] The following describes modifications of the first embodiment. The following modifications can be applied to the first embodiment in appropriate combinations.

[0067] (Variation 1) In the first embodiment described above, the system controller 20 proposes one recommended route. However, instead, it may propose a predetermined number of recommended routes, starting with the lowest toll-related cost. In this case, the system controller 20 may, for example, set a predetermined number of routes as first candidate routes, and if there are fewer than the predetermined number of first candidate routes, add the second candidate route to the first candidate routes without performing the determination in step S107. On the other hand, if there are already a predetermined number of first candidate routes, the system controller 20 may compare the first candidate route with the highest toll-related cost and the second candidate route, and if the toll-related cost of the second candidate route is lower, set the second candidate route as the first candidate route instead of the first candidate route.

[0068] (Variation 2) In the first embodiment, the navigation device 1 proposes a route that minimizes the total cost taking into consideration the required time and / or time cost, the cost of expressway tolls, the cost of highway parking fees, and the cost of fuel or electricity. In addition, the navigation device 1 may propose a route with the shortest required time and / or time, a route with the lowest expressway tolls, a route with the lowest highway parking fees, a route with the lowest fuel or electricity cost, etc. In this case, the navigation device 1 may output, as recommended routes, the routes with the smallest required time and / or time cost, the cost of expressway tolls, the cost of highway parking fees, and the cost of fuel or electricity.

[0069] (Variation 3) The navigation device 1 may present the total cost for the recommended route, i.e., the sum of the expressway toll, the parking fee at the highway parking facility, and the fuel or electricity cost. Furthermore, the navigation device 1 may calculate the total cost for multiple cases with different stay times at the highway parking facility based on the recommended route and present the total cost for each case. For example, if the stay time at the highway parking facility included in the obtained recommended route is 30 minutes, the navigation device 1 may calculate the total cost by changing the stay time at the highway parking facility to 15 minutes, 45 minutes, etc., and present the total cost for each of the cases with stay times at the highway parking facility of 15 minutes, 30 minutes, and 45 minutes. Alternatively, the navigation device 1 may calculate the total cost for multiple cases with different stay times at the highway parking facility and present the stay time that minimizes the total cost. Furthermore, the navigation device 1 may calculate the total cost for multiple cases with different stay times at the highway parking facility and present the maximum stay time within the allowable cost (budget) set by the user.

[0070] (Variation 4) When a second candidate route has multiple highway parking facilities, the navigation device 1 may calculate the toll-considered costs for multiple combinations of selectively using each parking facility, and compare each of these with the first candidate route to determine the recommended route.

[0071] (Variation 5) The user may be allowed to set in advance whether or not to take into account parking fees at highway parking facilities when searching for a route in the navigation device 1. In this case, the navigation device 1 may propose a recommended route taking into account parking fees at highway parking facilities only if the user has set it to take into account parking fees at highway parking facilities.

[0072] (Variation 6) When searching for a route, the user may specify a departure date and time from the departure location. In this case, the navigation device 1 may propose a recommended route for when the user departs at the departure date and time specified by the user. Alternatively, the user may specify a departure date and / or departure time zone, and the navigation device 1 may propose a departure time within the specified departure date and / or departure time zone at which expressway parking fees are cheapest.

[0073] (Variation 7) The user may be allowed to specify a desired rest time at highway parking facilities during route search. In this case, the navigation device 1 may suggest a departure time at which highway parking fees are reduced, provided that the user stays at one or more highway parking facilities for the desired rest time specified by the user. For example, the navigation device 1 may perform a route search for an approximate solution route and a pseudo-closed route that satisfies the user's desired rest time, and then determine a recommended route by comparing the obtained first and second candidate routes.

[0074] (Variation 8) The user may be allowed to specify the allowable parking fee (maximum parking fee) at highway parking facilities during route search. In this case, the navigation device 1 may suggest a departure time that allows the longest possible rest time within the allowable parking fee range specified by the user.

[0075] (Variation 9) The cost conversion rate used in the recommended route output process may be set or changed by the user. Specifically, the user sets the conversion rate from toll to cost (toll-based time cost) to, for example, 500 yen / h, 700 yen / h, or 900 yen / h. The system controller 20 uses the cost conversion rate set by the user when calculating the toll-considered cost for the approximate solution route and the pseudo road closure route. Note that the user may be allowed to set the cost conversion rate for expressway tolls and the cost conversion rate for parking fees to different values.

[0076] (Variation 10) When calculating the toll for a highway, the navigation device 1 may apply an ETC discount depending on the day of the week or the time of day.

[0077] (Variation 11) In the above embodiment, the navigation device 1 is configured as an on-board device installed in a vehicle. Alternatively, the navigation device may be configured as a terminal device such as a smartphone. In this case, the configuration of the terminal device is the same as that of the navigation device 1 shown in FIG. 1 , but does not include the standalone positioning device 10. Therefore, the terminal device determines the current position of the vehicle based on the output of the GPS receiver 18. Furthermore, the display 44 and the input device 60 are configured by a touch panel or the like of the terminal device.

[0078] <Second Example> In the first embodiment, the navigation device 1 proposes a recommended route taking into consideration the parking fees at highway parking facilities. However, some users would like to avoid paying parking fees at highway parking facilities for free or to keep the fees as low as possible. Therefore, in the second embodiment, the navigation device 1 proposes a recommended route that results in free or the lowest highway parking fees.

[0079] [Example 1] The first example of the second embodiment is an example in which parking fees at highway parking facilities are free. In the first example of the second embodiment, the navigation device 1 determines a recommended route using essentially the same method as in the first embodiment. However, in the first example of the second embodiment, the navigation device 1 sets the condition that highway parking fees are free when calculating the approximate solution route and the pseudo road closure route.

[0080] Fig. 9 is a flowchart of the recommended route output process according to the first example of the second embodiment. The recommended route output process shown in Fig. 9 is basically the same as the recommended route proposal process of the first embodiment shown in Fig. 5, but differs in the following respects.

[0081] First, in the recommended route output process according to the first embodiment, in step S103, the system controller 20 adds to the approximate solution route as a proposed stopover point the highway facility where the arrival time is after the recommended continuous driving time for a break has elapsed and where the parking fee is the cheapest. Alternatively, in the recommended route output process according to the second embodiment, in step S103a, the system controller 20 adds to the approximate solution route as a proposed stopover point the highway facility where the arrival time is after the recommended continuous driving time for a break has elapsed and where the parking fee is free.

[0082] Also, in step S107 of the recommended route output process according to the first embodiment, the system controller 20 adds to the second candidate route as a proposed stopover the highway facility where the arrival time is after the recommended continuous driving time for a break has elapsed and where the parking fee is the cheapest, as in step S103. Instead, in step S107 of the recommended route output process according to the second embodiment, the system controller 20 adds to the second candidate route as a proposed stopover the highway facility where the arrival time is after the recommended continuous driving time for a break has elapsed and where the parking fee is free.

[0083] In this way, in the second embodiment, the system controller 20 calculates the first and second candidate routes along which parking fees are free at highway parking facilities, and compares them to determine the recommended route. Therefore, in the second embodiment, the navigation device 1 can propose a recommended route along which parking fees are free at highway parking facilities.

[0084] [Example 2] The second example of the second embodiment is an example of minimizing the parking fee at a paid parking facility. The navigation device 1 determines a recommended route using essentially the same method as in the first embodiment. However, in the second example of the second embodiment, when comparing the first candidate route and the second candidate route, the navigation device 1 selects the route with the lower fee consideration cost and the lower parking fee at the paid parking facility.

[0085] Fig. 10 is a flowchart of the recommended route proposal process according to the second example of the second embodiment. In the recommended route proposal process according to the second example of the second embodiment, steps S108a and S108b are executed instead of step S108 of the recommended route proposal process according to the first embodiment shown in Fig. 5. The other processes are the same as those in the recommended route proposal process according to the first embodiment, and therefore descriptions thereof will be omitted where appropriate.

[0086] In step S108a, the system controller 20 determines whether the toll-considered cost of the second candidate route is less than the toll-considered cost of the first candidate route. If the toll-considered cost of the second candidate route is less than the toll-considered cost of the first candidate route (step S108a; Yes), the system controller 20 further determines whether the parking fees of the highway parking facilities on the second candidate route are lower than the parking fees of the highway parking facilities on the second candidate route (step S108b). If the parking fees of the highway parking facilities on the second candidate route are lower than the parking fees of the highway parking facilities on the second candidate route (step S108b; Yes), the system controller 20 sets the second candidate route as the first candidate route (step S109).

[0087] Thus, in the second example of the second embodiment, when the second candidate route and the first candidate route are compared, the second candidate route is replaced with the first candidate route only if the second candidate route has a lower toll cost and the parking fees at the expressway parking facilities are cheaper. Therefore, the first candidate route obtained when processing for all patterns of expressway facilities to be pseudo-closed in step S110 is completed is the route with the lowest toll cost and the cheapest parking fees at the paid parking facilities, and this is output as the recommended route.

[0088] In this way, in the second example of the second embodiment, the navigation device 1 can propose a recommended route that will result in the lowest parking fees at paid parking facilities.

[0089] [Variations] Modifications 1 to 11 described in the first embodiment can also be applied to the first and second examples of the second embodiment in the same way.

[0090] <Third Example> Long-distance truck drivers often take breaks at highway parking facilities. Standards regarding working hours are set by law for truck drivers. Therefore, from the perspective of legal compliance, it is necessary to propose recommended routes that comply with these standards.

[0091] Standards regarding working hours for truck drivers include, for example: (1) Standards for rest periods (continuous driving time) Continuous driving time is set at four hours. Drivers must stop driving within four hours of starting driving or immediately after four hours have elapsed and take a break of at least 30 minutes. Note that breaks can be taken in separate intervals. Therefore, truck drivers, for example, must take a 30-minute break for every four hours of driving. Hereinafter, this will be referred to as the "rest rule." (2) Standards regarding rest periods The time from the start of a shift to the end of work is called "duty time." Duty time is the total of working hours and rest time. The time between one shift and the next is called the "rest period." Rest time refers to the worker's completely free time, including sleep time, as part of their daily routine. A worker must have at least eight consecutive hours of rest per day after finishing work. Therefore, truck drivers, for example, must take eight hours of rest for every 16 hours of driving. Hereinafter, this will be referred to as the "rest rule."

[0092] Therefore, in the third embodiment, the navigation device 1 proposes a recommended route in accordance with the above-mentioned rest rules and rest interval rules. Specifically, the user sets a desired continuous driving time and a desired rest time at highway parking facilities as conditions for route search in accordance with the above-mentioned rest rules. For example, to satisfy the above-mentioned rest rules, the user sets the desired continuous driving time to 4 hours and the desired rest time to 30 minutes. Note that the user may also set the desired rest time to 15 minutes x 2 or 10 minutes x 3 in order to take breaks.

[0093] The navigation device 1 basically executes the same recommended route output process as in the first embodiment. However, in the recommended route output process in Fig. 5, when searching for an approximate solution route in step S100 and when searching for a pseudo-road-closure route in step S105, the system controller 20 searches for a route that satisfies the desired continuous driving time and desired rest time. As a result, of the routes that satisfy the rest rules set by the user, the route with the lowest toll consideration cost is proposed as the recommended route.

[0094] Furthermore, if the destination is far away and it takes 16 hours or more to reach the destination, the system controller 20 considers the rest rule and searches for an approximate solution route and a pseudo-road closure route. The rest rule requires 8 hours or more of continuous rest after 16 hours of driving. Therefore, if it takes 16 hours or more to reach the destination, the system controller 20 searches for a route that allows 8 hours of continuous rest. Note that if there are no highway parking facilities that allow continuous parking for 8 hours or more, or if parking at a highway parking facility would cost more than a preset allowable amount, the navigation device 1 may suggest a rest facility on a public road. For example, if there is a facility on a public road that allows continuous parking for 8 hours for a lower fee than the toll parking facilities on the expressway, the navigation device 1 may output a recommended route that involves exiting the expressway and using that facility.

[0095] [Variations] Modifications 1 to 11 described in the first embodiment can also be applied to the third embodiment in the same way.

[0096] <Other system configurations> The route search process executed by the navigation device 1 may be executed by a server device that communicates with the navigation device 1 via a network.

[0097] Fig. 11 shows the configuration of a route search system according to another system configuration. In the example of Fig. 11, the route search system includes a navigation device 1 and a server device 3. The server device 3 stores a CPU 22, map data 32, a toll table 33, and a parking fee table 34.

[0098] In the configuration example of Fig. 11, after receiving an input specifying a destination, etc., the navigation device 1 transmits the input information of the destination, etc. and information on the current position of the vehicle to the server device 3. The server device 3 determines a recommended route based on the first to third embodiments by referring to the map data 32, the toll table 33, and the parking fee table 34. The server device 3 then transmits the obtained recommended route to the navigation device 1 as a route search result, and causes the navigation device 1 to display it.

[0099] In this system configuration, the server device 3 is an example of a route search device in the present invention, and the CPU 22 of the server device 3 is an example of an acquisition means, cost calculation means, output means, and a computer that executes a program in the present invention.

[0100] Hereinafter, the present specification discloses the following inventions of means 1 to 3.

[0101] (Measure 1) The introduction of parking fees at facilities such as service areas (SA) and parking areas (PA) on expressways and motorways (hereinafter referred to as "toll roads") is being considered. In this case, it becomes necessary to consider the parking fees at the toll road parking facilities in addition to the toll road toll when planning a route to your destination.

[0102] Therefore, the main object of the invention of means 1 is to provide a route search device that can suitably determine a route with low parking fees at parking facilities on toll roads.

[0103] The route search device of means 1 includes an acquisition means for acquiring a departure point and a destination, a cost calculation means for calculating a total cost for a plurality of routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, the toll fee for the toll road, and the parking fee for the parking facility on the toll road, and an output means for outputting one or more routes, including the route with the smallest total cost, as recommended routes.

[0104] In the route search device of the above-mentioned means 1, the acquisition means acquires a departure point and a destination. The acquisition means may acquire a current location input by a user, or may acquire the current location of a vehicle as the departure point. The cost calculation means calculates a total cost for multiple routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, toll road tolls, and parking fees at parking facilities on the toll road. The output means then outputs one or more routes, including the route with the smallest total cost, as recommended routes. This allows the cost to be calculated, reflecting parking fees at parking facilities on the toll road, and the recommended route to be suitably determined.

[0105] In one aspect of the route search device of the above-mentioned means 1, the total cost may further include the cost of fuel or electricity for a vehicle traveling along the route.

[0106] In another aspect of the route search device of the above-mentioned means 1, when there are multiple parking facilities on one route, the cost calculation means calculates multiple total costs when each parking facility is selectively used, thereby making it possible to determine a recommended route taking into account multiple patterns of using different parking facilities.

[0107] In another aspect of the route search device of the above-mentioned means 1, the output means outputs, in addition to the recommended route, a route that minimizes each of the required time or distance, toll fee, and parking fee. In this aspect, the user can compare the recommended route with the route that minimizes each of the required time or distance, toll fee, and parking fee.

[0108] In another aspect of the route search device of the above-mentioned means 1, the output means outputs a route on which parking fees are free in addition to the recommended route. In this aspect, a recommended route on which parking fees are free on toll roads can be obtained.

[0109] In another aspect of the route search device of the above-mentioned means 1, the output means calculates the sum of tolls and parking fees corresponding to the recommended route and outputs it as a total cost for the recommended route. In this aspect, the user can know the total cost required to travel the recommended route.

[0110] In another aspect of the route search device of the above-mentioned means 1, the output means calculates the total cost for a plurality of cases in which the length of stay at the parking facility is different, and outputs the total cost for each case. In this aspect, the user can know the total cost for a plurality of cases in which the length of stay at the parking facility is different.

[0111] In another aspect of the route search device of the above-mentioned means 1, the output means calculates the total cost for a plurality of cases of different stay times at the parking facility and outputs the stay time that minimizes the total cost. In this aspect, the user can know the stay time that minimizes the total cost among the plurality of cases of different stay times at the parking facility.

[0112] In another aspect of the route search device of the above-mentioned means 1, the output means calculates the total cost for a plurality of cases of different stay times at the parking facility and outputs the maximum stay time for which the total cost is equal to or less than a predetermined allowable cost. In this aspect, the user can know the maximum stay time for which the total cost is equal to or less than the allowable cost among the plurality of cases of different stay times at the parking facility.

[0113] In another aspect of the route search device of the above-mentioned means 1, the tolls for toll roads are the tolls after ETC discounts, so that a recommended route can be obtained taking ETC discounts into consideration.

[0114] In another preferred embodiment of Means 1, a route search method executed by a computer acquires a starting point and a destination, calculates a total cost for a plurality of routes from the starting point to the destination, including the cost of the time or distance required to reach the destination, the toll fee of the toll road, and the parking fee of a parking facility on the toll road, and outputs one or more routes including the route with the smallest total cost as a recommended route. This method also makes it possible to calculate a cost that reflects the parking fee of a parking facility on the toll road and appropriately determine a recommended route.

[0115] In yet another preferred embodiment of Means 1, the program causes a computer to execute a process of acquiring a departure point and a destination, calculating a total cost for a plurality of routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, the toll fee of a toll road, and the parking fee of a parking facility on the toll road, and outputting one or more routes including the route with the smallest total cost as a recommended route. By executing this program on a computer, the above-mentioned route search device can be realized. This program can be stored in a storage medium and used.

[0116] (Measure 2) Charging parking fees at facilities such as service areas (SA) and parking areas (PA) on expressways and motorways (hereinafter referred to as "toll roads") is being considered. In this case, users will need to consider the parking fees at parking facilities on the toll road in addition to the toll road toll when planning their route to their destination. It is also expected that users will want to keep parking fees at parking facilities on toll roads as low as possible.

[0117] Therefore, the invention of means 2 has been made to solve the above-mentioned problems, and its main purpose is to provide a route search device that can suitably determine a route with low parking fees at parking facilities on toll roads.

[0118] The route search device of means 2 includes an acquisition means for acquiring a departure point and a destination, a cost calculation means for calculating a total cost for a plurality of routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, the toll fee for the toll road, and the parking fee for the parking facility on the toll road, and an output means for outputting as a recommended route the route with the lowest parking fee at least at the parking facility from among one or more routes including the route with the lowest total cost.

[0119] In the route search device of means 2 above, the acquisition means acquires a departure point and a destination. The acquisition means may acquire a current location input by a user, or may acquire the current location of a vehicle as the departure point. The cost calculation means calculates a total cost for multiple routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, the toll road toll, and the parking fees at parking facilities on the toll road. The output means then outputs, as a recommended route, the route with the lowest parking fees at the parking facilities from among one or more routes including the route with the lowest total cost. This makes it possible to preferably determine a route with low parking fees at parking facilities on the toll road.

[0120] In one aspect of the route search device of the above-mentioned means 2, the total cost may further include the cost of fuel or electricity for a vehicle traveling along the route.

[0121] In another aspect of the route search device of the above-mentioned means 2, the cost calculation means calculates the total cost for a plurality of routes on which parking fees are free, and the output means outputs the route on which parking fees are free as the recommended route. In this aspect, a route on which parking fees are free on a toll road can be obtained.

[0122] In another aspect of the route search device of the above-mentioned means 2, the cost calculation means calculates the total cost for multiple routes that satisfy a predetermined desired rest time at the parking facility, and the output means outputs a route that satisfies the predetermined desired rest time at the parking facility as the recommended route. In this aspect, a route that satisfies the user's desired rest time can be obtained.

[0123] In another aspect of the route search device of the above-mentioned means 2, the output means outputs a predetermined number of routes in the parking facilities with the lowest parking fees as the recommended routes. In this aspect, the user can view the predetermined number of routes in the parking facilities with the lowest parking fees and decide which route to take.

[0124] In another preferred embodiment of Means 2, a route search method executed by a computer acquires a starting point and a destination, calculates a total cost for a plurality of routes from the starting point to the destination, including the cost of the time or distance required to reach the destination, the toll fee for the toll road, and the parking fee for the parking facility on the toll road, and outputs, as a recommended route, the route with the lowest parking fee at the parking facility from among one or more routes including the route with the lowest total cost. This method also makes it possible to preferably determine a route with low parking fees at parking facilities on a toll road.

[0125] In yet another preferred embodiment of means 2, the program causes a computer to execute a process of acquiring a departure point and a destination, calculating a total cost for multiple routes from the departure point to the destination, including the cost of the time or distance required to reach the destination, tolls on toll roads, and parking fees at parking facilities on the toll roads, and outputting, as a recommended route, the route with the lowest parking fee at least at the parking facility from among one or more routes including the route with the lowest total cost. By executing this program on a computer, the above-mentioned route search device can be realized. This program can be stored in a storage medium and used.

[0126] (Measure 3) Charging parking fees at facilities such as service areas (SA) and parking areas (PA) on expressways and motorways (hereinafter referred to as "toll roads") is being considered. In this case, it becomes necessary to consider the parking fees at the toll road parking facilities in addition to the toll road toll when planning a route to a destination. Meanwhile, for truck drivers and others, standards regarding working hours are set by law. Therefore, from the perspective of legal compliance, it is necessary to propose routes that comply with these standards.

[0127] Therefore, the invention of means 3 has been made to solve the above-mentioned problems, and its main purpose is to provide a route search device that can appropriately determine a route that complies with laws and regulations regarding rest periods, etc., while taking into account parking fees at parking facilities on toll roads.

[0128] The route search device of means 3 includes an acquisition means for acquiring a departure point and a destination, a search means for searching for multiple routes from the departure point to the destination, where the parking time at a parking facility on a toll road is longer than the desired stay time and the continuous driving time of the vehicle is less than the desired continuous driving time, a cost calculation means for calculating a total cost for the multiple routes, including the cost of each of the time or distance required to reach the destination, the toll fee for the toll road, and the parking fee at the parking facility, and an output means for outputting one or more routes, including the route with the smallest total cost, as recommended routes.

[0129] In the route search device of the above-mentioned means 3, the acquisition means acquires a departure point and a destination. The acquisition means may acquire a current location input by a user, or may acquire the current position of the vehicle as the departure point. The search means searches for multiple routes from the departure point to the destination, where the parking time at a parking facility on a toll road is longer than the desired stay time and the continuous driving time of the vehicle is equal to or shorter than the desired continuous driving time. The cost calculation means calculates a total cost for the multiple routes, including the cost of the time or distance required to reach the destination, the toll fee for the toll road, and the parking fee at the parking facility. The output means then outputs one or more routes, including the route with the smallest total cost, as recommended routes. This makes it possible to suitably determine a route that complies with laws and regulations regarding rest periods, etc., while taking into account parking fees at parking facilities on toll roads.

[0130] In one aspect of the route search device of the above-mentioned means 3, the total cost may further include the cost of fuel or electricity for a vehicle traveling along the route.

[0131] In one aspect of the route search device of the above-mentioned means 3, the output means outputs, as the recommended routes, a predetermined number of routes from among the one or more routes, which have the longest parking times at the parking facility. In this aspect, the user can select the route to actually travel from the plurality of routes with the longest parking times.

[0132] In another aspect of the route search device of the above-mentioned means 3, the output means calculates the sum of tolls and parking fees corresponding to the recommended route and outputs the calculated sum as the total cost for the recommended route. In this aspect, the user can know the total cost for the recommended route.

[0133] In another aspect of the route search device of the above-mentioned means 3, when there are multiple parking facilities on one route, the cost calculation means calculates multiple total costs when each parking facility is selectively used. In this aspect, it is possible to determine a recommended route taking into account the case where different parking facilities are selected.

[0134] In another aspect of the route search device of the above-mentioned means 3, when the required time to the destination exceeds a predetermined rest time, the search means searches for a route including a continuous rest time corresponding to the predetermined rest time. In this aspect, a recommended route that ensures the predetermined rest time can be obtained.

[0135] In another preferred embodiment of means 3, a route search method executed by a computer acquires a starting point and a destination, searches for multiple routes from the starting point to the destination in which the parking time at a parking facility on a toll road is longer than the desired stay time and the continuous driving time of the vehicle is equal to or shorter than the desired continuous driving time, calculates a total cost for the multiple routes including the cost of the time or distance required to reach the destination, the toll fee for the toll road, and the parking fee at the parking facility, and outputs one or multiple routes including the route with the lowest total cost as recommended routes. This makes it possible to preferably determine a route that complies with laws and regulations regarding rest periods, etc., while taking into account the parking fees at parking facilities on the toll road.

[0136] In yet another preferred embodiment of means 3, the program causes a computer to execute a process of acquiring a departure point and a destination, searching for multiple routes from the departure point to the destination in which the parking time at a parking facility on a toll road is longer than the desired stay time and the continuous driving time of the vehicle is equal to or shorter than the desired continuous driving time, calculating a total cost for the multiple routes including the cost of the time or distance required to reach the destination, the toll fee for the toll road, and the parking fee for the parking facility, and outputting one or more routes including the route with the lowest total cost as recommended routes. By executing this program on a computer, the above-mentioned route search device can be realized. This program can be stored in a storage medium and used. [Explanation of symbols]

[0137] 1. Navigation devices 3. Server equipment 10. Standalone positioning device 20 System Controller 22 CPU 31 Data Storage Unit 38 Communication Equipment 40 Display Unit 44 Display 50 Audio Output Unit 60 Input Device

Claims

1. An acquisition means for acquiring a departure point and a destination point; a cost calculation means for calculating a total cost including the cost of a required time or distance to the destination, a toll fee of a toll road, and a parking fee of a parking facility on the toll road for a plurality of routes from the departure point to the destination; an output means for outputting, as a recommended route, a route with the lowest parking fee at the parking facility from among one or more routes including the route with the lowest total cost; A route search device comprising:

2. The route search device according to claim 1 , wherein the total cost further includes a cost for fuel or electricity of a vehicle traveling along the route.

3. the cost calculation means calculates the total cost for a plurality of routes on which parking fees are free; The route search device according to claim 1 , wherein the output means outputs, as the recommended route, a route on which parking fees are free.

4. the cost calculation means calculates the total cost for a plurality of routes that satisfy a predetermined desired rest time in the parking facility; 2. The route search device according to claim 1, wherein the output means outputs, as the recommended route, a route that satisfies a predetermined desired rest time at the parking facility.

5. 2. The route search device according to claim 1, wherein the output means outputs a predetermined number of routes in ascending order of parking fees at the parking facilities as the recommended routes.

6. A computer-implemented route search method, comprising: Obtain the origin and destination, calculating a total cost for a plurality of routes from the departure point to the destination, the total cost including the cost of a required time or distance to the destination, a toll fee on a toll road, and a parking fee at a parking facility on the toll road; A route search device that outputs, as a recommended route, the route with the lowest parking fee at the parking facility from among one or more routes including the route with the lowest total cost.

7. Obtain the origin and destination, calculating a total cost for a plurality of routes from the departure point to the destination, the total cost including the cost of a required time or distance to the destination, a toll fee on a toll road, and a parking fee at a parking facility on the toll road; A program that causes a computer to execute a process of outputting, as a recommended route, the route with the lowest parking fee at the parking facility from among one or more routes including the route with the lowest total cost.

8. A storage medium storing the program according to claim 7.

Images