JP2007071640A - Route search apparatus, route search method, route search program, and computer-readable storage medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To search for a route to which a toll discount system can be applied and increase alternatives in route searching. <P>SOLUTION: The route search apparatus 100 comprises a search section 101 and a decision section 102. An information output apparatus 110 comprises a generation section 111 and an output section 112. The search section 101 searches for a first optimum route to a destination. The decision section 102, when a toll road to which a toll discount system with distance traveled as a condition is applied is included in the first optimum route searched for by the search section 101, decides whether the distance condition is satisfied or not. The search section 101, when it is decided by the decision section 102 that the first optimum route does not satisfy the distance condition of the toll discount system, searches for a second optimum route satisfying the distance condition. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a route search device, a route search method, a route search program, and a computer-readable recording medium that search for an optimum route to a destination point.

  In recent years, various discount services may be applied to travel charges collected when a moving body such as a vehicle travels on a toll road. For example, when ETC (Electronic Toll Collection System) is used, a vehicle equipped with an ETC in-vehicle device can be applied with a discount system (time zone discount service) according to the ETC gate through which it passes and the time it passes through. It is.

  In order to receive the above-mentioned time zone discount system, the toll road and the toll road discount time zone for that toll road are memorized, and the vehicle is guided to the destination point so as to pass the toll road during the toll road discount time zone. A vehicle navigation device has been proposed (for example, see Patent Document 1 below).

Japanese Patent Laid-Open No. 2001-41760

  However, the above-described conventional technology does not consider the distance condition of this toll discount system when the toll road is applied with a toll discount system on the condition of travel distance. Therefore, there is a problem that the fee discount system cannot be applied because the vehicle is not guided to satisfy the distance condition even though the route to the destination point can reduce the cost if the predetermined distance condition is satisfied. As an example. For example, if the mileage on a toll road is less than 100 kilometers and can be applied for the toll discount system, even if the distance of the toll road to the destination is 120 kilometers in order to receive the toll discount system, 100 kilometers It is only necessary to guide the lesser section to travel on a toll road and the remaining section to travel on a general road. However, due to the above-mentioned problem, the vehicle is not guided to satisfy the distance condition, and therefore, the toll road cannot be applied by traveling 120 kilometers on the toll road.

  In order to solve the above-described problems and achieve the object, the route search device according to the invention of claim 1 includes a search means for searching for the first optimum route to the destination point, and a fee discount system on condition of travel distance And a judging means for judging whether the first optimum route satisfies the distance condition of the fee discount system when the toll road applying the above is included in the first optimum route, The search means, when it is determined that the first optimum route does not satisfy the distance condition of the fee discount system, the second optimum route to the destination point that satisfies the distance condition of the fee discount system. It is characterized by searching.

  According to a fifth aspect of the present invention, there is provided a route search method comprising: a first step of searching for a first optimum route to a destination point; and a toll road that applies a fee discount system on the condition of travel distance. A second step for determining whether the first optimum route is included, and a toll road to which a fee discount system is applied based on a travel distance in the second step is included in the first optimum route. A third step of determining whether the first optimum route satisfies the distance condition of the fee discount system, and the first optimum route satisfies the distance condition of the fee discount system according to the third step. And a fourth step of searching for a second optimum route to the destination point that satisfies the distance condition of the fee discount system when it is determined that it is not.

  A route search program according to a sixth aspect of the present invention causes a computer to execute the route search method according to the fifth aspect.

  According to a seventh aspect of the present invention, a computer-readable recording medium records the route search program according to the sixth aspect.

  Exemplary embodiments of a route search device, a route search method, a route search program, and a computer-readable recording medium according to the present invention will be explained below in detail with reference to the accompanying drawings.

(Embodiment)
(Functional configuration of route search device)
The functional configuration of the route search apparatus according to this embodiment will be described with reference to FIG. FIG. 1 is a block diagram illustrating an example of a functional configuration of the route search apparatus according to the present embodiment.

  In FIG. 1, the route search apparatus 100 includes a search unit 101 and a determination unit 102. Then, the route search device 100 outputs information to other devices. In the present embodiment, it is assumed that route search apparatus 100 outputs information to information output apparatus 110. The information output device 110 includes a generation unit 111 and an output unit 112.

  The search unit 101 searches for an optimum route to the destination point. The route search is performed based on, for example, map information acquired from a recording medium or a communication unit (not shown) and information on the position of the moving body. The searched optimum route (first optimum route) includes a predetermined toll road to which a fee discount system is applied on the condition of travel distance, and the route (first optimum route) is When it is determined by the determination unit 102, which will be described later, that the distance condition of the fee discount system is not satisfied, the optimum route (to the destination point that satisfies the distance condition of the fee discount system by changing the entrance or exit of the toll road) The second optimum route) is searched.

  The determination unit 102 determines whether or not the optimal route searched by the search unit 101 includes a predetermined toll road to which a fee discount system based on a travel distance is applied. If the optimum route includes a predetermined toll road to which a fare discount system is applied under the condition of travel distance, whether or not the optimum route satisfies the distance condition of the fare discount system is determined. to decide. The determination result is output to the search unit 101.

  The generation unit 111 acquires information on the optimum route searched for by the search unit 101 from the route search device 100, and generates various types of information based on the acquired information. The information to be generated includes, for example, information indicating an optimum route to the destination point, information on a required time to the destination point, and information on a travel fee necessary to reach the destination point. Note that this route is used when the optimal route includes a toll road to which a fare discount system based on travel distance is applied and the distance condition of the fare discount system is not satisfied for that route. And the above information about the optimum route satisfying the distance condition of the fee discount system may be generated for each.

  The output unit 112 outputs the information generated by the generation unit 111. The information is output, for example, by voice or output as an image on a display unit (not shown).

(Processing contents of route search device)
Next, the contents of the process of the route search apparatus 100 according to the present embodiment will be described. FIG. 2 is a flowchart showing the contents of processing of the route search apparatus according to the present embodiment. In the flowchart of FIG. 2, first, the search unit 101 searches for a first optimal route to the destination point (step S201).

  Subsequently, the determination unit 102 determines whether or not the first optimum route searched in step S201 includes a toll road to which a fee discount system based on a travel distance is applied (step S202). . The fare discount system based on the travel distance is a system that allows the travel fare on the toll road to be discounted when a predetermined distance condition is satisfied when traveling on the toll road. In FIG. 2, the charge discount system based on travel distance is represented as “distance discount system”.

  If it is determined in step S202 that the first optimal route includes a toll road to which a fare discount system based on travel distance is applied (step S202: Yes), the determination unit 102 determines whether the first optimal route includes a toll road. It is determined whether or not the optimum route satisfies the distance condition of this fee discount system (step S203).

  In step S203, when the determination unit 102 determines that the first optimum route does not satisfy the distance condition (step S203: No), the search unit 101 searches for the second optimum route that satisfies the distance condition (step S204). ). The search for the second optimum route is performed, for example, by changing at least one of an entrance or an exit of a toll road. At this time, a plurality of routes are searched by changing at least one of the entrance or the exit of the toll road, and the second optimum route is selected as a second route that satisfies the distance condition and satisfies the predetermined condition among the plurality of routes. It is good. The predetermined condition described above may be, for example, the shortest distance or the shortest time. Also, when changing entrances and exits on toll roads, for example, exits based on selection conditions such as changing only the suburbs without changing the entrance or exit on the side close to the urban area. Alternatively, the second optimum route may be searched by changing the entrance.

  In step S202, when the determination unit 102 determines that the first optimum route does not include a toll road that applies a fee discount system that is conditional on travel distance (step S202: No), in step S203, When the determination unit 102 determines that the first optimal route satisfies the distance condition (step S203: Yes), and when the second optimal route is searched in step S204, the information output device 110 searches the information output device 110. The route information is output (step S205), and the series of processing ends. Then, the generation unit 111 of the information output device 110, based on the information on the route, information indicating the optimum route to the destination point, information on the required time to the destination point, and the travel fee required to reach the destination point Such information is generated, and the output unit 112 of the information output device outputs the information.

  As described above, according to the route search device, the route search method, the route search program, and the computer-readable recording medium according to the present embodiment, the fee discount system that uses the travel distance as a condition for the searched optimum route When a toll road to which is applied is included, an optimum route that satisfies the distance condition can be searched. Therefore, the user can obtain information on the searched optimum route via an information output device or the like, and can confirm the optimum route that can be applied with a fee discount system that is based on the travel distance. The optimum route can be selected as a route to be guided by the navigation device. Furthermore, the user can reduce the travel fee by traveling based on the optimum route that satisfies the distance condition of the fee discount system.

  Examples of the present invention will be described below. In the present embodiment, an example in which the route search device of the present invention is implemented by a navigation device mounted on a moving body such as a vehicle (including a four-wheeled vehicle and a two-wheeled vehicle) will be described.

(Hardware configuration of navigation device)
The hardware configuration of the navigation device according to the present embodiment will be described with reference to FIG. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment.

  In FIG. 3, a navigation device 300 is mounted on a moving body such as a vehicle, and includes a navigation control unit 301, a user operation unit 302, a display unit 303, a position acquisition unit 304, a recording medium 305, and a recording medium. The decoding unit 306, the audio output unit 307, the communication unit 308, the route search unit 309, the route guidance unit 310, the audio generation unit 311, and the speaker 312 are configured.

  The navigation control unit 301 controls the entire navigation device 300. The navigation control unit 301 includes, for example, a CPU (Central Processing Unit) that executes predetermined arithmetic processing, a ROM (Read Only Memory) that stores various control programs, and a RAM (Random Access Memory) that functions as a work area of the CPU. It is realizable with the microcomputer etc. comprised by these.

  The navigation control unit 301 determines which map on the map based on the information on the current position acquired by the position acquisition unit 304 and the map information obtained from the recording medium 305 via the recording medium decoding unit 306 at the time of route guidance. Whether the vehicle is traveling in the position is calculated, and the calculation result is output to the display unit 303. In addition, the navigation control unit 301 inputs / outputs information related to route guidance with the route search unit 309, the route guidance unit 310, and the voice generation unit 311 during route guidance, and displays information obtained as a result of the display unit 303 and Output to the audio output unit 307.

  The user operation unit 302 acquires information input by a user operating operation means such as a remote controller, a switch, and a touch panel, and outputs the acquired information to the navigation control unit 301.

  The display unit 303 includes, for example, a CRT (Cathode Ray Tube), a TFT liquid crystal display, an organic EL display, a plasma display, and the like. Specifically, the display unit 303 can be configured by, for example, a video display interface connected to a video I / F (interface) or a video I / F. Specifically, the video I / F includes, for example, a graphic controller that controls the entire display device, a buffer memory such as a VRAM (Video RAM) that temporarily stores image information that can be displayed immediately, and a graphic controller. Based on the output image information, the display device is configured by a control IC or the like. The display unit 303 displays traffic information, map information, route guidance information, and various other information.

  The position acquisition unit 304 includes a GPS receiver and various sensors, and acquires information on the current position of the moving body (current position of the navigation device 300). The GPS receiver receives radio waves from a GPS satellite and obtains a geometric position with respect to the GPS satellite. GPS is an abbreviation for Global Positioning System, and is a system for accurately obtaining a position on the ground by receiving radio waves from four or more satellites. The GPS receiver includes an antenna for receiving radio waves from a GPS satellite, a tuner for demodulating the received radio waves, an arithmetic circuit for calculating the current position based on the demodulated information, and the like.

  The various sensors are various sensors such as a vehicle speed sensor, an angular velocity sensor, and an acceleration sensor that are mounted on the moving body or the navigation device 300. From the information output from these sensors, the movement displacement, moving speed, and moving direction of the moving body are determined. Ask. Thus, the position of the moving body can be recognized with higher accuracy by using the output information of the various sensors together with the information obtained from the received radio wave of the GPS receiver.

  Various control programs and various information are recorded on the recording medium 305 in a state readable by a computer. The recording medium 305 can be realized by, for example, an HD (Hard Disk), a DVD (Digital Versatile Disk), a CD (Compact Disk), or a memory card. Note that the recording medium 305 may accept writing of information by the recording medium decoding unit 306 and record the written information in a nonvolatile manner.

  The recording medium 305 stores map information used for route search and route guidance. The map information recorded in the recording medium 305 includes background data representing features (features) such as buildings, rivers, and the ground surface, and road shape data representing road shapes. It is drawn in two or three dimensions on the display screen. When the navigation device 300 is guiding a route, the map information read from the recording medium 305 by the recording medium decoding unit 306 and the mark indicating the position of the moving body acquired by the position acquisition unit 304 are displayed on the display unit 303. The Rukoto.

  The background data includes background shape data representing the shape of the background and background type data representing the type of the background. The background shape data includes, for example, feature representative points, polylines, polygons, feature coordinates, and the like. The background type data includes, for example, text data representing the name, address, and telephone number of a feature, and type data of a feature such as a building, river, or ground surface.

  The road shape data is a road network having a plurality of nodes and links connecting the nodes. The node indicates an intersection where a plurality of roads such as a three-way road such as a T-shaped road, a cross road, and a five-way road intersect. The link indicates a road. Some links have shape interpolation points, and curved roads can be expressed by these shape interpolation points.

  The road shape data further includes traffic condition data. Traffic condition data includes, for example, the presence or absence of traffic lights or pedestrian crossings for each node, the presence or absence of entrances or junctions on expressways, the length (distance) for each link, vehicle width, traveling direction, road type (toll road) , General roads, etc.), past traffic information obtained by statistically processing past traffic information based on seasons, days of the week, large holidays, and time.

  In addition, the traffic condition data includes information on a toll road for which a toll on a highway or the like is charged, an application condition for a toll discount system related to the toll, a discount charge for applying the toll discount system, and the like. The application conditions of the fee discount system are, for example, distance conditions that require traveling over a predetermined distance or traveling less than a predetermined distance, time zone conditions that require traveling in a predetermined time zone, and predetermined points such as an ETC gate. Such as a passage condition on the condition of passage of the above, or a combination thereof.

  In this embodiment, the map information is recorded on the recording medium 305. However, the present invention is not limited to this. The map information may be recorded on a server or the like outside the navigation device 300. In that case, the navigation apparatus 300 acquires map information from a server via a network through the communication unit 308, for example. The acquired map information is stored in a RAM or the like.

  The recording medium decoding unit 306 controls reading / writing of information with respect to the recording medium 305. For example, when HD is used as the recording medium 305, the recording medium decoding unit 306 is an HDD (Hard Disk Drive).

  The audio output unit 307 reproduces sound such as guidance sound by controlling output to the connected speaker 312. There may be one speaker 312 or a plurality of speakers. The audio output unit 307 includes, for example, a D / A converter that performs D / A conversion of audio digital information, an amplifier that amplifies an audio analog signal output from the D / A converter, and A / D conversion of audio analog information. And an A / D converter that performs the above.

  The communication unit 308 acquires various information from the outside. For example, the communication unit 308 includes an FM multiplex tuner, a VICS (registered trademark) / beacon receiver, a wireless communication device, and other communication devices, and performs communication with other communication devices. Further, the communication unit 308 may be configured to perform communication via a communication medium such as a mobile phone, a PHS, a communication card, and a wireless LAN.

  Information acquired by the communication unit 308 includes traffic information such as traffic jams and traffic regulations distributed from the road traffic information communication system center, traffic information acquired by businesses in their own way, and other publicly available data on the Internet, etc. It is. For example, the communication unit 308 may request traffic information of a desired area from a server that accumulates traffic information of the whole country via a network, and acquire the requested traffic information.

  The route search unit 309 uses the map information acquired from the recording medium 305 via the recording medium decoding unit 306, the traffic information acquired via the communication unit 308, and the like to optimize the route from the departure point to the destination point. Search for a route. Here, the optimum route is a route that best matches the user's request.

  In general, there are an infinite number of routes from a departure point to a destination point. For this reason, the route search unit 309 sets items to be considered in route search (hereinafter referred to as search conditions) and searches for routes that match the conditions. The search condition may be a configuration that can be set by the user, for example, a required time to the destination, a road type, a distance, a travel fee, and the like. Specifically, in the search for the optimum route, a plurality of routes to the destination point are searched, and route information including search results and search conditions is output to the display unit 303.

  The route guidance unit 310 includes the optimum route information searched by the route search unit 309, the position information of the moving body acquired by the position acquisition unit 304, and the map information obtained from the recording medium 305 via the recording medium decoding unit 306. Based on the above, route guidance information for guiding the user to the destination point is generated. The route guidance information generated at this time may be information that considers the traffic jam information received by the communication unit 308. The route guidance information generated by the route guidance unit 310 is output to the display unit 303 via the navigation control unit 301.

  The voice generation unit 311 generates various types of voice information such as guidance sounds. That is, based on the route guidance information generated by the route guidance unit 310, the virtual sound source corresponding to the guidance point is set and the voice guidance information is generated, and this is output to the voice output unit 307 via the navigation control unit 301. To do.

  In addition, the search part 101 which is a functional structure of the route search apparatus 100 concerning embodiment implement | achieves the function by the route search part 309 and the judgment part 102 by the navigation control part 301, respectively.

(Contents of processing of navigation device 300)
Next, the contents of the process of the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 4 is a flowchart showing the contents of the processing of the navigation device according to the present embodiment. In the flowchart of FIG. 4, first, the navigation control unit 301 determines whether a route search request has been accepted (step S <b> 401). For example, the route search request may be configured to be requested by the user operating the user operation unit 302.

  In step S401, the route search unit 309 waits for the navigation control unit 301 to accept a route search request, and if so (step S401: Yes), searches for the first optimum route (step S402). The search for the first optimum route is, for example, map information acquired from the recording medium 305 via the recording medium decoding unit 306 or traffic acquired via the communication unit 308 for the route from the departure point to the destination point. This is done using information.

  Subsequently, the navigation control unit 301 refers to the information recorded in the recording medium 305 to determine whether or not the first optimum route includes a toll road to which a fee discount system is applied with a travel distance as a condition. Is determined (step S403). This determination may be made with reference to information acquired by the communication unit 308. In FIG. 4, the charge discount system based on travel distance is represented as “distance discount system”.

  In step S403, when the first optimal route does not include a toll road to which the fee discount system based on the travel distance is applied (step S403: No), the navigation control unit 301 starts from the route search unit 309. Information on the first optimum route is acquired, and route information relating to the first optimum route is generated (step S405). Then, the generated route information is output to the display unit 303 or the like (step S406), and the series of processes is terminated. The route information is, for example, information indicating the first optimum route, information on a required time to the destination, and the like.

  In step S403, when the toll road to which the fee discount system based on the travel distance is applied is included in the first optimum route (step S403: Yes), the navigation control unit 301 displays the first optimum route. However, with reference to the information recorded on the recording medium 305, it is determined whether or not the distance condition of the fee discount system is satisfied (step S404). The distance condition may be acquired by the communication unit 308.

  In step S404, when the first optimal route satisfies the distance condition of the fee discount system (step S404: Yes), the navigation control unit 301 acquires information on the first optimal route from the route search unit 309, Route information regarding the first optimum route is generated (step S405). Then, the generated route information is output to the display unit 303 or the like (step S406), and the series of processes is terminated.

  In step S404, when the first optimal route does not satisfy the distance condition of the fee discount system (step S404: No), the second optimum route that satisfies the distance condition of the fee discount system is searched by steps S407 to S411. To do.

  The route search unit 309 searches for a route by changing the entrance / exit of the toll road included in the first optimal route (step S407). In changing the entrance, either the exit or the entrance may be changed, or both the entrance and exit may be changed. Then, the navigation control unit 301 determines whether or not the route searched in step S407 satisfies the distance condition of the fee discount system (step S408).

  In step S408, when the route searched in step S407 does not satisfy the distance condition of the fee discount system (step S408: No), the process returns to step S407, and the route search unit 309 determines the toll road of the first optimum route. The route is searched by changing the entrance / exit (step S407).

  In step S408, when the route searched in step S407 satisfies the distance condition of the fee discount system (step S408: Yes), the navigation control unit 301 stores the searched route as a candidate route in a memory or the like (step S408). S409). And it is judged whether the search which changed the entrance / exit is complete | finished (step S410).

  In step S410, when the search for changing the entrance / exit is not terminated (step S410: No), the route searching unit 309 further searches the route by changing the entrance / exit of the toll road of the first optimal route (step S407), Repeat the process.

  In addition, in step S410, when the search for changing the entrance / exit is terminated (step S410: Yes), the navigation control unit 301 selects the second optimum route from the candidate routes stored in the memory or the like (step S411). . Note that one or a plurality of second optimal routes may be selected.

  Then, the navigation control unit 301 generates route information regarding the selected second optimum route (step S405). Furthermore, the generated route information is output to the display unit 303 or the like (step S406), and the series of processes is terminated. Note that when generating the route information, the navigation control unit 301 acquires information on the first optimum route searched by the route search unit 309 and also generates information on the first optimum route, so that the first optimum route is obtained. It may be possible to compare the information regarding and the information regarding the second optimum route. At this time, information may be generated so that the travel distance, the required time, and the travel fee can be compared.

  The determination of the end of the search in step S410 described above may be made by setting a threshold value for the distance condition or the travel fee without changing the search for all the entrances and exiting the search. For example, the route search unit 309 may search the route by separating the entrance from the departure point one by one, and may end the search when the distance condition is satisfied. Similarly, the route may be searched by leaving the exits one by one from the destination point, and the search may be terminated when the distance condition is satisfied. Alternatively, the search may be terminated when a predetermined discount rate is applied to the travel fee on the first optimal route.

  In addition, in the above-described step S407, the toll road entrance / exit may be changed according to a predetermined standard. For example, the route search unit 309 may search for a route by changing the entrance and exit so as to avoid traffic jams in consideration of traffic jam information and traffic jam prediction information. Moreover, you may make it search for a path | route by changing only the suburb direction, without changing the entrance or exit of the side near a city area between an entrance and an exit.

  Further, without performing step S408 described above, in step S410, a plurality of routes are searched and stored in the memory until the search for changing the entrance / exit is completed, and the distance condition of the fee discount system is determined from these routes. A route that satisfies the condition may be extracted, and the second optimum route may be selected from the extracted routes.

(Route search result in route search unit 309)
Here, an example of a route search result in the route search unit 309 according to the present embodiment will be described with reference to FIG. FIG. 5 is an explanatory diagram of an example of a route search result in the route search unit according to the present embodiment.

  In FIG. 5, a route search unit 309 searches for a route that reaches from the departure point 501 to the destination point 502 via the toll road 503.

  The departure point 501 is a point where a moving body such as a vehicle departs in the route search, and is a point set by the user operating the user operation unit 302 or a current point of the moving body acquired by the position acquisition unit 304. . Further, the destination point 502 is a point that a moving body such as a vehicle reaches in the route search, and is a point that is set by the user operating the user operation unit 302.

  The toll road 503 is a road through which a moving body such as a vehicle can travel from the departure point 501 to the destination point 502, and a travel fee is charged for passage, and the speed limit is set higher than that of a general road. In the present embodiment, the toll road 503 has a plurality of ICs (interchanges) serving as entrances and exits, and IC (a) 504, IC (b) 505, IC (c) 506, and IC (d) 507, and the distance between each IC (the distance between the roads) is 30 kilometers between IC (a) 504 and IC (b) 505, and IC (b) 505 and IC (c) 506 Is 40 kilometers, and IC (c) 506 and IC (d) 507 are 50 kilometers. In addition, the toll road 503 is applied with a fee discount system in which a traveling fee is discounted when a predetermined distance condition is satisfied. In the present embodiment, the distance condition is that the travel distance that the moving body travels on the toll road 503 is less than 100 kilometers, and the travel fee is discounted by 50% when this distance condition is satisfied.

  In this embodiment, there are a plurality of routes that travel from the departure point 501 to the destination point 502 via the toll road 503. For example, route (A) 511 is IC (a) 504 from starting point 501 as an entrance of toll road 503, and IC (d) 507 is toll road via IC (b) 505 and IC (c) 506. In the route to reach the destination point 502 as the exit of 503, the travel distance of the toll road 503 is 120 kilometers.

  Route (B1) 512 is routed from starting point 501 to IC (a) 504 as the entrance of toll road 503, via IC (b) 505, and IC (c) 506 as the exit of toll road 503. The travel distance of the toll road 503 is 70 kilometers.

  The route (B2) 513 is a route from the departure point 501 to the destination point 502 with IC (a) 504 as the entrance of the toll road 503 and IC (b) 505 as the exit of the toll road 503. The mileage is 30 kilometers.

  Further, the route (B3) 514 starts from the departure point 501 with IC (b) 505 as the entrance of the toll road 503, via IC (c) 506, and with IC (d) 507 as the exit of the toll road 503. The travel distance of the toll road 503 is 90 kilometers.

  The route (B4) 515 is a route from the departure point 501 to the destination point 502 using the IC (b) 505 as the entrance of the toll road 503 and the IC (c) 506 as the exit of the toll road 503. The mileage is 40 kilometers.

  A route (B5) 516 is a route from the starting point 501 to the destination point 502 using IC (c) 506 as the entrance of the toll road 503 and IC (d) 507 as the exit of the toll road 503. The mileage is 50 kilometers.

  As described above, in this embodiment, when traveling on the toll road 503 from the departure point 501 to the destination point 502, the route satisfying the distance condition of the fee discount system is the route (B1) 512 to the route (B5) 516. .

  Here, a specific example of the search process for the first optimum route and the second optimum route in FIG. 4 will be described with reference to FIG.

  In step S402, the route search unit 309 searches for the route (A) 511 as the first optimum route. Then, in determining whether the route (A) 511 includes the toll road 503 to which the fee discount system based on the travel distance is applied (step S403), the charge discount system based on the travel distance is applied. Since the toll road 503 is included (step S403: Yes), it is determined whether or not the distance condition of the fee discount system is satisfied (step S404).

  In step S404, the route (A) 511 is a travel distance of 120 kilometers (100 kilometers or more) of the toll road 503 and does not satisfy the distance condition of the fee discount system (step S404: No). The route is searched by changing the entrance / exit of the toll road 503 in the route (A) 511 (step S407).

  In step S407, the exit is changed to search for the route (B1) 512, and it is determined whether or not the distance condition of the fee discount system is satisfied (step S408). Since the route (B1) 512 has a travel distance of 70 km (less than 100 km) and satisfies the distance condition of the fee discount system (step S408: Yes), the route (B1) 512 is used as a candidate route in a memory or the like. It memorize | stores (step S409), and determines whether the search which changed the entrance / exit is complete | finished next (step S410). If the distance condition of the fee discount system is not satisfied (step S408: No), the process returns to step S407 and the process is repeated.

  In step S410, since only the route (B1) 512 has been searched for changing the entrance / exit (step S410: No), the process returns to step S407 and the process is repeated. Similarly, the route (B2) 513 to the route (B5) 516 are searched, these routes are stored as candidate routes, and the search with the changed entrance / exit is terminated (step S410: Yes).

  Then, one or a plurality of routes are selected as the second optimum route from the route (B1) 512 to the route (B5) 516 that are candidate routes (step S411). The selection criteria for the second optimum route include required time, travel distance, travel fee, and the like. Specifically, when the route (B3) 514 has the shortest required time, the route (B3) 514 is selected. If the route (B1) 512 has the shortest travel distance, the route (B1) 512 is selected. Furthermore, a predetermined number (for example, three) may be selected in the order of shorter required time, or a predetermined number may be selected in the order of shorter travel distance.

  In the above-described navigation device 300, the distance condition subject to the application of the fee discount system is taken into consideration, but a route search subject to the application of the fee discount system may be performed in combination with other conditions. For example, when there is a condition for applying the rate discount system for the time zone, a route that satisfies the time zone condition may be selected. Specifically, when departing in a time zone where the end time of the time zone condition is close, the nearest IC (a) 504 is selected as the entrance on the departure point 501 side, and the exit on the destination point 502 side is taken. , Search to satisfy the distance condition. Alternatively, if the passage through the ETC gate is a condition, the entrance / exit of the toll road 503 that can pass through the ETC gate may be selected.

  Further, the navigation device 300 described above is not limited to the in-vehicle device, but can be used for planning a route using a removed use or a personal computer or a mobile phone. For example, the present invention may be applied to route search using map information on the Internet. Moreover, it can also apply to the plan of movement so that it may receive the application of the distance discount of the fare in a train using route information, such as a train, instead of map information.

  In addition, the navigation device 300 described above searches for the first optimal route without considering the fee discount system when the route search request is received, but the distance of the fee discount system when the route search request is received. It may be configured to search for a route that satisfies a condition.

  As described above, according to the navigation device 300 of the above-described embodiment, when the toll road to which the fee discount system is applied with the travel distance as a condition is included in the searched optimum route, the distance condition It is possible to search for an optimum route that satisfies the above. Therefore, the user can obtain information on the searched optimum route via an information output device or the like, and can confirm the optimum route that can be applied with a fee discount system that is based on the travel distance. The optimum route can be selected as a route to be guided by the navigation device. Furthermore, the user can reduce the travel fee by traveling based on the optimum route that satisfies the distance condition of the fee discount system.

  In addition, by generating and outputting information on the optimal route that satisfies the distance condition of the fee discount system and information on the optimal route that does not satisfy the distance condition of the fee discount system, the user can check both route information, The degree of freedom of selection can be increased. In addition, by making it possible to compare the information of each optimum route including the distance, the required time, and the travel fee, it is possible to improve efficiency in the route selection of the user.

  The route search method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. The program may be a transmission medium that can be distributed via a network such as the Internet.

It is a block diagram which shows an example of a functional structure of the route search apparatus concerning this Embodiment. It is a flowchart which shows the content of the process of the route search apparatus concerning this Embodiment. It is a block diagram which shows an example of the hardware constitutions of the navigation apparatus concerning a present Example. It is a flowchart which shows the content of the process of the navigation apparatus concerning a present Example. It is explanatory drawing which shows an example of the route search result in the route search part concerning a present Example.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Route search apparatus 101 Search part 102 Judgment part 110 Information output apparatus 111 Generation part 112 Output part

Claims (7)

Search means for searching for a first optimum route to the destination point;
When a toll road to which a fee discount system based on a travel distance is applied is included in the first optimal route, whether the first optimal route satisfies the distance condition of the fee discount system A judging means for judging;
With
The search means, when it is determined that the first optimal route does not satisfy the distance condition of the fee discount system, finds the second optimal route to the destination point that satisfies the distance condition of the fee discount system. A route search device characterized by searching.   The route search according to claim 1, wherein the search means searches for the second optimum route by changing at least one of an entrance or an exit of a toll road included in the first optimum route. apparatus.   The search means searches for a plurality of routes in which entrances or exits of toll roads included in the first optimal route are changed, and one route satisfying the distance condition and satisfying a predetermined condition among the plurality of routes. The route search device according to claim 2, wherein the second optimum route is used.   3. The search unit according to claim 2, wherein the search unit searches for the second optimum route by changing an entrance or exit of a toll road included in the first optimum route based on a predetermined condition. Route search device. A first step of searching for a first optimum route to the destination point;
A second step of determining whether a toll road to which a fee discount system based on a travel distance is applied is included in the first optimum route;
When the toll road to which the fee discount system based on the travel distance is applied in the second step is included in the first optimum route, the first optimum route is the distance condition of the fee discount system. A third step of determining whether or not
When it is determined in the third step that the first optimal route does not satisfy the distance condition of the fee discount system, a second optimal route to the destination point that satisfies the distance condition of the fee discount system is determined. A fourth step to search;
A route search method comprising:   A route search program causing a computer to execute the route search method according to claim 5. A computer-readable recording medium on which the route search program according to claim 6 is recorded.

Images