JP6223019B2 - Route search apparatus and route search method - Google Patents

Description

  The present invention relates to a route search device and a route search method for performing a route search in consideration of a fee that a user uses for toll road traffic.

  Conventionally, a route guidance method for selecting a route based on a route cost calculated based on a usage fee that does not exceed a fee (amount) specified in advance has been disclosed (see, for example, Patent Document 1).

  In Patent Document 1, a travel distance from a departure road to a destination road is used as a route cost, and a function for searching for an optimum recommended route with the lowest route cost is provided. Further, a fee required for route travel is obtained, and a recommended route is searched by reflecting the fee on the route cost. At this time, a fee specified in advance is also taken into consideration, and a route that can be traveled at or below the fee is searched.

JP 2002-303522 A

  In Patent Document 1, the route cost is obtained by road link distance (meter) + fee × fee coefficient (meter / yen). That is, the charge is converted into a distance and incorporated in the route cost. Therefore, a route that can be traveled at a predetermined price or less does not necessarily satisfy a route search condition desired by the user (for example, a route having the shortest distance from the departure point to the destination). .

  The present invention has been made to solve these problems, and is a route search device capable of searching for a route that is equal to or less than a charge set by the user and satisfies the route search conditions set by the user, and An object is to provide a route search method.

In order to solve the above problems, a route search device according to the present invention includes an input unit for inputting information including a set amount of a charge used for toll road traffic, a route search condition, and a destination, and the current location of the host vehicle. A location information acquisition unit for acquiring location information, a map data acquisition unit for acquiring map data, a route search unit for searching a route from the current location to the destination based on the destination, location information, and map data; The route search unit searches for a first route candidate as a route candidate according to the route search condition, and when the first route candidate includes a toll road, the route search unit passes the toll road from the first route candidate. By selecting different sections, at least one second route candidate whose toll is less than or equal to the set amount is selected, and one route is searched from the second route candidates according to the route search condition. , The distance from Hometown to the destination is the shortest, and is that rates required for the destination is a minimum from the current location, the route search unit, the distance the first as a route search condition that the shortest When searching for a route candidate, and then searching for a plurality of routes when searching for a second route candidate with the shortest distance as a route search condition, the route search condition is that the fee is the lowest One route is searched from the plurality of routes .

The route search method according to the present invention includes (a) a step of inputting information including a set amount of a charge used for toll road traffic, a route search condition, and a destination, and (b) the position of the current location of the host vehicle. A step of acquiring information, (c) a step of acquiring map data, and (d) a step of searching for a route from the current location to the destination based on the destination, position information, and map data, (D) searches for a first route candidate as a route candidate in accordance with the route search condition, and if the first route candidate includes a toll road, the section through which the toll road passes from the first route candidate is different. its toll is elected at least one second path candidate becomes less than the set amount, and searches for a primary path from the second path candidate in accordance with the route search conditions whereby the route search condition, from the current location The distance to the destination is It is short, and charges required from the current position to the destination is that it is the lowest, step (d), distance to search the first path candidate as a route search condition that is the shortest, and thereafter When a plurality of routes are searched when the second route candidate is searched using the shortest distance as a route search condition, one route is selected from the plurality of routes using the lowest charge as the route search condition. It is characterized by searching .

According to the present invention, the route search device includes an input unit for inputting information including a set amount of a charge used for toll road traffic, route search conditions, and a destination, and a position for acquiring position information of the current location of the host vehicle. An information acquisition unit; a map data acquisition unit that acquires map data; and a route search unit that searches for a route from the current location to the destination based on the destination, location information, and map data. The first route candidate that is a candidate for the route is searched according to the route search condition, and when the toll road is included in the first route candidate, the section through which the toll road passes is changed from the first route candidate. At least one or more second route candidates whose toll is less than or equal to the set amount are selected, one route is searched from the second route candidates according to the route search condition, and the route search condition is determined from the current location to the destination. Distance It There is the shortest, and is that rates required for the destination is a minimum from the current location, the route search part, the distance is searched first route candidate as the route search condition that is the shortest, and thereafter When a plurality of routes are searched when the second route candidate is searched using the shortest distance as a route search condition, one route is selected from the plurality of routes using the lowest charge as the route search condition. to explore, or less fee set by the user, and the user is able to search for a route that satisfies the set route search conditions.

The route search method includes (a) a step of inputting information including a set amount of a charge used for toll road passage, a route search condition, and a destination, and (b) acquiring position information of the current location of the host vehicle. And (c) acquiring map data, and (d) searching for a route from the current location to the destination based on the destination, location information, and map data, and (d) Search for a first route candidate that is a route candidate according to the route search condition, and when the first route candidate includes a toll road, the first route candidate is made different from the section through which the toll road passes. At least one second route candidate whose toll is less than or equal to the set amount is selected, one route is searched from the second route candidates according to the route search condition, and the route search condition is from the current location to the destination Is the shortest distance , And it is that rates required for the destination is a minimum from the current position, step (d), distance to search the first path candidate as a route search condition that the shortest, thereafter, the distance is the shortest If a plurality of routes are searched when the second route candidate is searched using the route search condition as a route search condition, to search for one route from the plurality of routes using the route search condition that the fee is the lowest It is possible to search for a route that is less than or equal to the fee set by the user and satisfies the route search condition set by the user.

It is a figure which shows an example of a structure of the route search apparatus by embodiment of this invention. It is a flowchart which shows an example of operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention. It is a figure for demonstrating operation | movement of the route search apparatus by embodiment of this invention.

  Embodiments of the present invention will be described below with reference to the drawings.

<Embodiment>
First, the configuration of the route search apparatus according to the embodiment of the present invention will be described.

  FIG. 1 is a diagram illustrating an example of the configuration of the route search apparatus 1.

  The route search device 1 includes an input unit 2, a position information acquisition unit 3, a route search unit 4, a map data storage unit 5, a storage unit 6, a communication unit 7, a display unit 8, and a control unit 9. It has.

  The input unit 2 inputs information including a set amount of charge used for toll road traffic, route search conditions, and a destination. That is, the user sets each information via the input unit 2.

  Here, the route search condition is a condition for searching for a route from the current location (departure location) to the destination. In the present embodiment, as a route search condition, the distance from the current location to the destination is the shortest, the time from the current location to the destination is the shortest, the fuel consumption from the current location to the destination is the least, And the minimum fee required from the current location to the destination.

  The position information acquisition unit 3 acquires position information of the current location of the host vehicle. An example of the position information acquisition unit 3 is a GPS (Global Positioning System) sensor.

  The route search unit 4 searches for a route from the current location to the destination based on the current location information, the destination, and the map data.

  The map data storage unit 5 stores map data. The map data storage unit 5 may acquire and store map data in advance, or may acquire map data from the outside via the communication unit 7 when necessary. That is, the map data storage unit 5 has a function of a map data acquisition unit that acquires map data.

  The storage unit 6 stores the route searched by the route search unit 4 and fee information necessary for passage on the toll road.

  The communication unit 7 acquires various information such as traffic information (for example, traffic jam information) from the outside through communication.

  The display unit 8 displays various information such as a map including the current location and a route from the current location to the destination to the user.

  The control unit 9 controls each of the above components. In addition, the control unit 9 includes a toll road extraction unit 91 and a section division unit 92.

  The toll road extraction unit 91 extracts toll roads included in the route candidates (first route candidates) searched by the route search unit 4 based on the route search conditions.

  The section dividing unit 92 divides the toll road extracted by the toll road extracting unit 91 for each predetermined section.

  Here, the predetermined section refers to each interchange section on the toll road (hereinafter referred to as an IC section) in the present embodiment.

  Next, the operation of the route search apparatus 1 will be described.

  FIG. 2 is a flowchart showing an example of the operation of the route search apparatus 1.

  In step S <b> 1, the user sets one of the route search conditions described above via the input unit 2. Here, “the shortest distance from the current location to the destination” is set as the route search condition.

  In step S <b> 2, the user sets a fee to be used for toll road traffic through the input unit 2. That is, the upper limit of the fee that can be used to travel on the toll road is set. Here, it is assumed that “500 yen” is set as the fee used for toll road traffic.

  In step S3, the route search unit 4 searches for a route (first route candidate) from the current location to the destination in accordance with the route search condition set in step S1. At this time, the route search unit 4 acquires the location information of the current location from the location information acquisition unit 3 and acquires the map data from the map data storage unit 5. Further, it is assumed that the destination information is set by the user via the input unit 2 before performing the process of step S3. That is, the route search unit 4 searches for a route from the current location to the destination based on the current location information, the destination, and the map data. The searched route is stored in the storage unit 6.

  In step S4, the toll road extraction unit 91 determines whether or not the toll road is included in the route searched in step S3. If it is determined that no toll road is included, the process proceeds to step S7. On the other hand, if it is determined that a toll road is included, the toll road is extracted from the route searched in step S3, and the process proceeds to step S5. Specifically, the toll road extraction unit 91 acquires the route searched in step S3 from the storage unit 6, and based on the road link attribute included in the map data from the route, the toll road link (hereinafter simply referred to as “toll road link”). Toll road).

  In step S5, the section dividing unit 92 divides the toll road extracted by the toll road extracting unit 91 for each IC section. The IC section information is included in the map data.

  FIG. 3 shows an example of a route obtained by dividing the toll road into IC sections.

  As shown in FIG. 3, the toll road is divided into four IC sections A to D. Moreover, the charge shown in each IC section A-D has shown the charge required in order to drive | work each IC section AD.

  In FIG. 3, a triangle mark indicates an IC (interchange). In particular, black triangles indicate the start and end of an IC section through which the host vehicle passes. A white arrow indicates a route searched by the route search unit 4, and a solid arrow indicates a route through which the host vehicle passes.

  In step S6, the route search unit 4 selects a route candidate (second route candidate) that is equal to or less than the set fee and searches for one route from the route candidates according to the route search condition. This will be specifically described below.

  First, the route search unit 4 calculates all combinations of the first IC section and the IC section closer to the destination than the first IC section with the IC section closest to the host vehicle as the head.

  FIG. 4 is a diagram illustrating a result of calculating all combinations of the IC section A and the IC sections B to D with the IC section A among the IC sections A to D illustrated in FIG. In FIG. 4, each of A to D corresponds to IC sections A to D. “1” indicates that the corresponding IC section is used (passes through the corresponding IC section), and “0” indicates that the corresponding IC section is not used (does not pass through the corresponding IC section). Yes. The calculation result of the combination is stored in the storage unit 6.

  FIGS. 5-7 is a figure which shows an example of the combination with each IC section BD when IC section A is made into the head. 5 to 7, white triangle marks indicate the start end or end of the IC section where the host vehicle does not pass. The other triangles and arrows are the same as in FIG.

  FIG. 5 shows a case where the own vehicle passes through the IC section A of the toll road and does not pass through the IC sections B, C, and D (passes through a road other than the toll road). FIG. 5 corresponds to the case where IC section A in FIG. 4 is “1”, IC section B is “0”, IC section C is “0”, and IC section D is “0”.

  FIG. 6 shows a case where the own vehicle passes through the IC sections A and B of the toll road and does not pass through the IC sections C and D. FIG. 6 corresponds to the case where IC section A in FIG. 4 is “1”, IC section B is “1”, IC section C is “0”, and IC section D is “0”.

  FIG. 7 shows a case where the own vehicle passes through the IC sections A and D of the toll road and does not pass through the IC sections B and C. FIG. 7 corresponds to the case where IC section A in FIG. 4 is “1”, IC section B is “0”, IC section C is “0”, and IC section D is “1”.

  Next, the route search unit 4 calculates all the combinations of the IC section B and the IC sections C and D with the IC section B closest to the host vehicle next to the IC section A as the head. The calculated results are shown in FIG. “1” and “0” shown in FIG. 8 are the same as those in FIG. The calculation result of the combination is stored in the storage unit 6.

  FIG. 9 is a diagram illustrating an example of a combination with each of the IC sections C and D when the IC section B is at the head. 9 are the same as those in FIGS. 5 to 7.

  FIG. 9 shows a case where the own vehicle passes through the IC sections B and C of the toll road and does not pass through the IC sections A and D. FIG. 9 corresponds to the case where IC section A in FIG. 8 is “0”, IC section B is “1”, IC section C is “1”, and IC section D is “0”.

  Thereafter, the same calculation as described above is performed for each of the IC sections C and D as the head.

  From the above, the route search unit 4 calculates all the combinations of the IC sections divided by the section dividing unit 92.

  Next, the route search unit 4 selects a route candidate (second route candidate) that is less than or equal to the charge set by the user. Specifically, the route search unit 4 calculates the combination of the IC sections calculated as described above and stored in the storage unit 6, and toll information necessary for toll road traffic stored in the storage unit 6 (each Based on the charge information for each IC section), a combination of IC sections that is equal to or lower than the charge used for toll road traffic set by the user in step S2 is selected as a route candidate (second route candidate). Here, route candidates that are 500 yen or less are selected.

  10 to 12 are diagrams illustrating an example of route candidates selected by the route search unit 4. 10 corresponds to FIG. 6, FIG. 11 corresponds to FIG. 9, and FIG. 12 corresponds to FIG. Also, a plurality of route candidates other than those shown in FIGS.

  10 to 12, combinations of IC sections that are equal to or less than the charge (500 yen) set by the user in step S2 are shown as route candidates.

  From the above, the route search unit 4 selects a route candidate that is less than or equal to the charge set by the user from the combination of IC sections. That is, the route search unit 4 makes at least one or more of the toll lower than the set amount by changing the section (IC section) through which the toll road passes from the route searched in step S3 (first route candidate). Route candidate (second route candidate) is selected.

  Next, the route search unit 4 searches for one route from the selected route candidates according to the route search condition set in step S1. Here, one route that is set as the route search condition “the distance from the current location to the destination is the shortest” is searched.

  Returning to FIG. 2, in step S <b> 7, the route search unit 4 adopts a route that satisfies the route search condition as the optimum route, and ends the process. Specifically, the one route finally searched in step S6 is adopted as the optimum route. When no toll road is included in step S4, the route searched in step S3 is adopted as the optimum route.

  After the process shown in FIG. 2, the route searched by the route search unit 4 is displayed on the display unit 8.

  From the above, according to the present embodiment, a route candidate that is equal to or less than the set fee is selected from the route searched based on the set route search condition, and the route search condition set from the selected route candidate is satisfied. It is possible to search for a route to be performed. That is, it is possible to search for a route that is equal to or less than the charge set by the user and satisfies the route search condition set by the user.

  The route search device 1 described above is not only a vehicle-mounted navigation device, that is, a car navigation device, but also a PND (Portable Navigation Device) and a mobile communication terminal (for example, a mobile phone, a smartphone, and a tablet terminal) that can be mounted on a vehicle. Etc.), and a navigation apparatus constructed as a system by appropriately combining servers and the like. In this case, each function or each component of the route search device 1 is distributed and arranged in each function for constructing the system.

  Specifically, some functions of the route search device 1 can be arranged in a mobile communication terminal, a PND, or a server. Further, when DA (Display Audio) is used as an in-vehicle device, since DA can only display and output audio, other functions can be arranged in the mobile communication terminal, PND, or server.

  For example, when the function of the route search device 1 is arranged in a server, the route search device 1 is set to acquire setting information including a set amount of a charge used for toll road use, a route search condition, and a destination. From the current location to the destination based on the information acquisition unit, the location information acquisition unit that acquires the location information of the current location of the target vehicle, the map data acquisition unit that acquires map data, and the destination, location information, and map data The route search unit searches for a first route candidate as a route candidate according to the route search condition, and if the first route candidate includes a toll road, By selecting different sections on the toll road from the route candidates, at least one second route candidate whose toll is less than or equal to the set amount is selected, and the second route candidates according to the route search condition To explore La primary path.

  Even if it is a case where it is said structure, the effect similar to embodiment is acquired.

  Further, software (route search method) for executing the operation in the embodiment may be incorporated into a mobile communication terminal, a PND, or a server as necessary. The same effects as those of the embodiment can be obtained by installing the software for executing the operation in the embodiment in a portable communication terminal, a PND, or a server as necessary.

  In FIG. 1, each of the input unit 2, the position information acquisition unit 3, the route search unit 4, and the communication unit 7 has been described as being realized by executing a program process using a CPU based on software. If possible, each of the input unit 2, the position information acquisition unit 3, the route search unit 4, and the communication unit 7 is configured to perform specific computation or processing on hardware (for example, an electric signal). An arithmetic / processing circuit or the like may be configured. Further, both of the above may be mixed.

  In FIG. 1, the map data storage unit 5 and the storage unit 6 may have a function of storing data, for example, an HDD (Hard Disk Drive), a DVD (Digital Versatile Disk), a semiconductor memory, or the like. Further, the map data storage unit 5 and the storage unit 6 may have a function as a slot for mounting an external storage device such as an HDD, a DVD, or a semiconductor memory.

  Various methods can be used to set a toll used for toll road traffic. For example, a fee may be defined in advance on the route search device side. Specifically, it is defined as “Flat” for 1000 yen or less, “Normal” for 1001 to 1500 yen, “High” for 1501 yen or more, and these three options (“Flat”, “Normal”, “ "High price") on the display unit 8 and allowing the user to select via the input unit 2 or a plurality of pre-defined price options (for example, "1000 yen", "3000 yen", "5000 yen") Etc.) may be displayed on the display unit 8 and the user may select via the input unit 2. Further, as another method, an arbitrary fee (amount) may be directly input by the user via the input unit 2.

  The communication unit 7 may acquire map data and toll information necessary for traffic on toll roads. By doing in this way, the map data memorize | stored in the map data memory | storage part 5 and the charge information memorize | stored in the memory | storage part 6 can be updated to the newest information.

  In step S6 of FIG. 2, when searching for one route from route candidates based on the route search condition set in step S1, a plurality of routes may be searched instead of one route. For example, when the route search condition is “the distance from the current location to the destination is the shortest”, a plurality of routes having the shortest distance may be searched from the route candidates. In such a case, for example, by further adding a condition “lowest charge”, it is possible to narrow down a plurality of routes having the shortest distance to one route having the lowest charge. That is, when a plurality of routes are searched from the route candidates, another route search condition may be added to search for one route. Note that the number of route search conditions to be added is not limited to one and may be plural.

  In FIG. 2, the description has been made assuming that “the distance from the current location to the destination is the shortest” is set as the route search condition, but other route search conditions (the shortest time, the minimum fuel consumption, and the lowest charge) Also good.

  In FIG. 2, the description has been made assuming that “500 yen” is set as the charge used for toll road traffic. However, the charge may be set by the various methods described above.

  The charges for each IC section in FIGS. 3, 5 to 7, and 9 to 12 are shown for simplification, and are not limited thereto. For example, a charge that includes various information such as discounts may be used.

  In the present embodiment, the section dividing unit 92 is described as being divided for each IC section. However, the section dividing unit 92 may be divided for each other point or facility (for example, tollgate) other than the IC.

  In the present invention, the embodiments can be appropriately modified and omitted within the scope of the invention.

  1 route search device, 2 input unit, 3 location information acquisition unit, 4 route search unit, 5 map data storage unit, 6 storage unit, 7 communication unit, 8 display unit, 9 control unit, 91 toll road extraction unit, 92 section Dividing part.

Claims (5)

An input unit for inputting information including a set amount of charge to be used for toll road traffic, route search conditions, and a destination;
A location information acquisition unit that acquires location information of the current location of the host vehicle;
A map data acquisition unit for acquiring map data;
A route search unit that searches for a route from the current location to the destination based on the destination, the location information, and the map data;
With
The route search unit searches for a first route candidate that is a candidate for the route according to the route search condition, and when the toll road is included in the first route candidate, the toll from the first route candidate By selecting different sections that pass through the road, at least one second route candidate whose toll is less than or equal to the set amount is selected, and one route is selected from the second route candidates according to the route search condition. Explore
The route search condition is that the distance from the current location to the destination is the shortest , and the fee required from the current location to the destination is the lowest ,
The route search unit searches the first route candidate using the shortest distance as the route search condition, and then uses the shortest distance as the second route as the route search condition. When a plurality of the routes are searched when searching for a candidate, a route search is performed by searching for the one route from the plurality of the routes as the route search condition that the fee is lowest. apparatus. A toll road extraction unit for extracting the toll road included in the first route candidate;
A section dividing section that divides the toll road extracted by the toll road extracting section into predetermined sections;
Further comprising
The route search device according to claim 1, wherein the route search unit selects the second route candidate from all combinations of sections divided by the section dividing unit.   The route search device according to claim 2, wherein the section is each interchange section on the toll road. (A) a step of inputting information including a set amount of a charge used for toll road traffic, a route search condition, and a destination;
(B) a step of acquiring position information of the current location of the host vehicle;
(C) obtaining map data;
(D) searching for a route from the current location to the destination based on the destination, the location information, and the map data;
With
The step (d) searches for a first route candidate that is a candidate for the route according to the route search condition, and when the toll road is included in the first route candidate, the first route candidate By selecting different sections through which the toll road passes, at least one second route candidate whose toll is less than or equal to the set amount is selected, and one of the second route candidates is selected according to the route search condition. Explore the route,
The route search condition is that the distance from the current location to the destination is the shortest , and the fee required from the current location to the destination is the lowest ,
In the step (d), the first route candidate is searched using the shortest distance as the route search condition, and then the second search is performed using the shortest distance as the second route search condition. When a plurality of the routes are searched when searching for a route candidate, the route is searched for one of the plurality of routes as the route search condition that the fee is lowest. Search method. A setting information acquisition unit for acquiring setting information including a set amount of a fee to be used for toll road traffic, a route search condition, and a destination;
A location information acquisition unit that acquires location information of the current location of the target vehicle;
A map data acquisition unit for acquiring map data;
A route search unit that searches for a route from the current location to the destination based on the destination, the location information, and the map data;
With
The route search unit searches for a first route candidate that is a candidate for the route according to the route search condition, and when the toll road is included in the first route candidate, the toll from the first route candidate By selecting different sections that pass through the road, at least one second route candidate whose toll is less than or equal to the set amount is selected, and one route is selected from the second route candidates according to the route search condition. Explore
The route search condition is that the distance from the current location to the destination is the shortest , and the fee required from the current location to the destination is the lowest ,
The route search unit searches the first route candidate using the shortest distance as the route search condition, and then uses the shortest distance as the second route as the route search condition. When a plurality of the routes are searched when searching for a candidate, a route search is performed by searching for the one route from the plurality of the routes as the route search condition that the fee is lowest. apparatus.

Images