JP4412155B2 - Navigation device and program - Google Patents

Description

    The present invention relates to a navigation apparatus and a program for calculating a guide route so as to avoid entry into a specific road area.

Conventionally, a navigation device has been proposed that calculates a guide route that avoids a specific road area such as an area to be charged when entering (see, for example, Patent Documents 1 to 3). By using such a device, it is possible to receive route guidance that detours entry to a toll road or an urban area charged when entering.
JP 2002-181571 A Japanese Patent No. 3384293 JP 2003-35546 A

  However, in order for a vehicle to be allowed to enter a road area, it is necessary to pay a fee for entering the road area in advance. The conventional apparatus as described above cannot always properly cope with the case where it is possible to enter. An example of such a road area (hereinafter referred to as a time-charged road area) that has been negotiated so that entry by vehicle during the payment period is permitted by paying a fee in advance has been institutionalized in London. There is a congestion tax area.

  In this system, a person who wants to enter the congestion tax area by vehicle tells the license plate of the vehicle in advance and pays the charge for the congestion tax area on a desired date. Then, the payment information is notified to the authorities. The authorities will then collect license plate information for all vehicles entering the congestion tax area, and will fine the license plate owners who do not have information on payment of charges for the entry date in the license plate. Has come to pay.

  In such a billing system, it is not enough to simply calculate the guide route to avoid entering a certain road area, and based on whether or not the vehicle has already paid for the day, It is desirable to switch the method.

  Based on such considerations, the present invention avoids entry to a time-charged road area, which is a road area that has been negotiated so that entry by vehicle during the payment target period is permitted by paying a fee in advance. It is an object of the present invention to provide a navigation device that can determine whether or not the time-based charging road area is based on the fee payment status.

  In order to achieve the above object, the present invention is characterized in that the navigation apparatus includes a storage medium that stores entry availability data indicating information on whether to enter the time-limited charging road area, and further includes a certain time-charging area. Based on the information that the fee for a certain payment target period has been paid, the contents of the entry permission / prohibition data are rewritten to indicate that the entry into the time-charged road area is permitted for the payment target period, and the entry permission / prohibition data Based on the fact that it indicates that it is currently impossible to enter a time-limited charging road area, a guide route that avoids entering the time-based charging road area is calculated. Based on the fact that it is possible to enter the road area at the present time, a guide route that does not consider entering the time-charged road area is calculated. It is it is in the jar.

  In this way, the navigation device rewrites the entry permission / prohibition data based on the information indicating that the fee for the payment target period of a certain time-limited charging road area has been paid, and further, based on the entry permission / prohibition data, the time-limited charging road. By calculating a guide route that avoids or does not consider entering an area, whether or not to enter the time-charged road area is indicated in the fare payment status for the time-charged road area. It becomes possible to decide based on.

  The road area refers to an area including at least one link, and may be, for example, a single road or an entire city including a large number of roads. Rewriting is a concept including addition, deletion, and overwriting.

  The difference between the calculation of a guide route that avoids a certain time-charged road area and the calculation of a guide route that does not consider the time-charged road area is, for example, the route with the lowest cost among a plurality of routes. In the route calculation in which the route is used as a guide route, a cost that is lower in the latter case than in the former case is given to a certain route that enters the time-charged road area.

  In addition, when the payment target period for a certain time-charged road area is a period that repeats according to a predetermined rule, the navigation device determines the contents of the entry permission / prohibition data based on the arrival timing of the new payment target period. May be rewritten so as to indicate that entry into the time-limited charging road area is not possible for the payment target period.

  As a result, the payment target period is renewed. A guide route that can be avoided can be calculated.

  Further, the navigation device starts from the present time in payment history data that associates a plurality of payment target periods for a certain time-charged road area with whether or not there is payment of charges for the time-charged road area for each of the payment target periods. Or, based on the fact that the payment has been made for the payment target period including the current time, the contents of the entry permission / prohibition data indicate that entry into the time-limited charging road area is possible for the payment target period. May be rewritten.

  By using such payment history data, it becomes easy to manage the presence or absence of fee payments in a plurality of payment target periods.

  Note that the payment history data may be, for example, a list of all payment target periods for which charges have been paid. It is clear that payment periods not in such a list are unpaid payment periods, so such lists also include multiple payment periods and timed toll roads in each of these payment periods. This is because it can be said that there is a substantial association between the payment of charges to the area. Similarly, a list of all periods in which fees are not paid is also payment history data.

  Similarly, the navigation device, based on the fact that the payment history data is associated with the payment period starting from or including the current time in the payment history data, The payment target period may be rewritten to indicate that entry into the time-limited charging road area is not possible.

  In these cases, the navigation device may rewrite the content of the entry permission / prohibition data at the timing when the content of the payment history data changes. In this way, the contents of the entry allowance / prohibition data immediately respond to changes in the payment history data.

  Further, when the payment history data is stored in the storage medium, the navigation device may rewrite the contents of the payment history data based on a user input operation.

  In this way, by changing the fee payment history based on the user's manual input, the user himself / herself can provide information on the fee payment to the navigation device.

  The navigation device may calculate the guidance route again at the timing when the content of the entry permission / prohibition data changes. In this way, the navigation device can perform route calculation that responds quickly to changes in the entry availability data.

  In addition, if the navigation vehicle travels on a guide route that enters a certain time-charged road area afterwards, the navigation device may enter the time-charged road area before the vehicle enters the time-charged road area. In addition, based on the prediction that the entry availability data will indicate that entry into the time-charged road area will not be possible for the payment target period starting from the time before entry, the entry availability data indicating that entry is not possible. Based on this, the guidance route may be calculated again.

  In this way, the guidance route calculation can be performed in advance in consideration of the passage of time in the travel of the guidance route.

  The navigation device also guides the user to avoid entering the time-limited charging road area based on the fact that the current position is outside the time-based charging road area and the set destination is outside the time-charging area. The route may be calculated.

  The navigation device also guides the user to avoid entering the time-charged road area based on the fact that the current position is within the time-charged road area and the set destination is outside the time-charged road area. The route may be calculated.

  In this way, a guide route from a point in the time-limited toll road area to a point outside the time-to-time charged road area once enters the time-charged road area after leaving the time-charged road area. You can avoid becoming. This is more effective when the time-limited toll road area has an irregular geographical shape.

  The navigation device also guides the user to avoid entering the time-limited charging road area based on the fact that the current position is in the time-based charging road area and the set destination is in the time-based charging road area. The route may be calculated.

  In this way, a guide route from a point in the road area to a point outside the time-charged road area may once enter the time-charged road area after leaving the time-charged road area. You can avoid becoming. This is more effective when the time-limited toll road area has an irregular geographical shape.

  In addition, the navigation device considers that the current position is outside the time-charged road area, and that the set destination is in the time-charged road area, and avoids entering the time-charged road area. The guide route not to be calculated may be calculated. In this way, it is possible to cope with a case where the user is thinking of paying the fee for the time-limited charging road area in front of the time-based charging road area on the guide route.

  In addition, the navigation device is outside the time-charged road area where there is an earlier arrival of two points in the order of arrival in the point group consisting of the current position, the set destination, and the set waypoint. If there is at least one combination in which the slower arrival is in the time-charged road area, a guide route that does not consider avoiding entering the time-charged road area is calculated. Also good. In this way, it is possible to cope with a case where the user is thinking of paying the fee for the time-limited charging road area in front of the time-based charging road area on the guide route.

  Further, the navigation apparatus calculates a guide route that avoids entering a time-charged road area that does not exempt from charging for the license plate based on the license plate information of the host vehicle stored in the storage medium. It may be.

  In this way, it is possible to cope with a case where whether or not the fee payment is exempted in the time-limited charging road area differs for each vehicle (for example, for each number at the end of the license plate).

  Further, the navigation device may calculate a guide route that avoids entering the time-limited charging road area based on information acquired from outside the vehicle by wireless communication. In this way, it is possible to obtain information from the outside as to whether or not the host vehicle needs to avoid entering the time-charged road area.

  Further, the navigation device calculates a guide route that avoids entry to the time-limited charging road area based on the setting that the user wants to avoid entering the time-charged road area. It may be. In this way, calculation of the guide route according to the user's preference is realized.

  In addition, the navigation device calculates a guide route that does not consider avoiding entry into the time-limited charging road area, even though the user has set to avoid entering the time-charged road area. At this time, the user may be notified of that.

  In this way, the user is notified when avoiding entering the time-charged road area is not considered in spite of the setting for avoiding the time-charged road area. Therefore, the uncomfortable feeling given to the user can be reduced.

  Here, “when calculating” is a concept that includes a case where a guide route that does not take into account avoiding entry into the road area is performed and a route is being calculated unless the setting is changed as it is.

  From the same point of view, when the navigation apparatus calculates a guide route to enter the time-limited charging road area, even though the user has made a setting to avoid the time-based charging road area. A notification to that effect may be sent to the user.

  From the same viewpoint, the navigation device may notify the user when a destination or waypoint in the time-charged road area is set.

  In addition, the navigation device does not consider avoiding entry to the time limit charge road area of the upper limit number among the plurality of time charge areas, and provides a guide route that avoids entry to another time charge road area. You may come to calculate. By doing in this way, the area which avoids approach, and the area which does not avoid approach among several road areas can be divided with the restriction | limiting of an upper limit number.

  In addition, the navigation device does not consider entering the time-charged road area where the total charge amount does not exceed the upper limit amount among the time-charged road areas, and does not enter the other time-charged road areas. An avoiding guide route may be calculated. By doing in this way, based on an upper limit amount, the area which avoids approach, and the area which does not avoid approach can be divided among a plurality of road fields.

  In addition, the above-described feature of the present invention is that whether or not it is possible to enter a time-charged road area, which is a road area that has been negotiated so that entry by vehicle during the payment target period is permitted by paying a fee in advance. The content of the entry availability data in the storage medium storing the entry availability data representing the information is based on the information that the fee for the payment period for a certain time-charged road area has been paid. Based on the entry permission data rewriting function for rewriting to indicate entry into the time-charged road area and the entry into the time-charged road area with the contents of the entry permission data indicating that entry is currently impossible A guide route that avoids entry is calculated, and it indicates that it is possible to enter the road area where the content of the entry availability data is present. Based on the guidance route calculating function for calculating a guide route is not considered to avoid entry into the road area it can also be realized as a program for realizing in the computer.

  Hereinafter, an embodiment of the present invention will be described. FIG. 1 shows a hardware configuration of a vehicle navigation apparatus 1 according to this embodiment.

  The vehicle navigation apparatus 1 includes a position detector 11, an operation switch group 12, an image display device 13, a speaker 14, a RAM 16, a ROM 17, an external storage medium 18, and a CPU 19.

  The position detector 11 includes a well-known sensor (not shown) such as a geomagnetic sensor, a gyroscope, a vehicle speed sensor, and a GPS receiver. The current position and direction of the vehicle based on the characteristics of each of these sensors. Is output to the CPU 19.

  The operation switch group 12 includes a plurality of mechanical switches provided in the vehicle navigation device 1 and an input device such as a touch panel provided so as to overlap the display surface of the image display device 13. A signal based on the touch is output to the CPU 19.

  The image display device 13 displays a video based on the video signal output from the CPU 19 to the user. Examples of the display image include a map centering on the current location.

  The external storage medium 18 is a nonvolatile storage medium such as an HDD, and is read and executed by the CPU 19, map data for route guidance, and a plurality of entry availability flags (corresponding to the entry availability data in the claims). A plurality of payment history data are stored.

  The map data includes road data and facility data including the position and type of road pieces (links) and intersections (nodes), connection relationship information between intersections and road pieces, and the like. The facility data includes a plurality of entries for each facility, and each entry includes data indicating name information, location information, facility type information, and the like of the target facility. Further, in the present embodiment, the map data includes data on the congestion tax area (corresponding to the time-charged road area in the claims). Here, the traffic jam area is composed of one or more road pieces, and in order to enter a certain vehicle on a certain date, an entrance fee for that day (that is, a traffic tax) is paid in advance for that area. An area that is required to enter the area as many times as possible on the day if the congestion tax is paid.

  In this system, a person who wants to enter the congestion tax area by vehicle tells the license plate of the vehicle in advance and pays the charge for the congestion tax area on a desired date. Then, the payment information is notified to the authorities. The authorities then monitor and collect license plate information for all vehicles entering the congestion tax area, and for those license plate owners who do not have information on payment of charges for the entry date. , Have come to impose a fine.

  As described above, the traffic jam tax area is an area that is determined so that an arbitrary number of entries in the vehicle during the payment target period is permitted by paying a fee in advance.

  More specifically, the data on the traffic congestion tax area is data for specifying a road segment included in the traffic congestion tax area for each traffic congestion tax area.

  In order for the authorities to identify which vehicle has entered the congestion tax area, the license plate of the vehicle traveling on the road that can enter the congestion tax area may always be photographed with a camera. The roadside communication device installed at the entry point to the congestion tax area on the road and the vehicle-mounted communication device in the vehicle communicate wirelessly, and the vehicle-mounted communication device transmits a unique identification code to the roadside communication device. It may be like this. In addition, the collection of the charged fee may be paid on the spot, may be paid later, or, like ETC (automatic toll collection system), in-vehicle communication with the roadside communication device Charge collection may be realized by communication with the machine.

  The entry permission / prohibition flag is a flag provided for each congestion tax area. This entry permission flag is data used to determine whether or not the own vehicle should avoid entering each congestion tax area, as will be described later, and the own vehicle for the day of the target congestion tax area. Information indicating whether or not the congestion tax is paid.

  The payment history data is data in a table format provided for each congestion tax area. This payment history data includes information indicating whether or not the congestion tax of the vehicle for the day, the past, and the future day has already been paid. FIG. 2 shows a part of the payment history data for a certain congestion tax area. As shown in this figure, the payment history data consists of entries for each date, and each entry includes the date and information on whether the congestion tax of the host vehicle has been paid or not paid on that date. It comes to include. When the vehicle navigation apparatus 1 is shipped from the factory, each entry has information indicating unpaid.

  A CPU (corresponding to a computer) 19 executes a program for the operation of the vehicle navigation apparatus 1 read from the ROM 17 and the external storage medium 18, and from the RAM 16, the ROM 17, and the external storage medium 18 at the time of execution. Information is read, information is written to the RAM 16 and the external storage medium 18, and signals are exchanged with the position detector 11, operation switch group 12, image display device 13 and speaker 14.

  Specific processes performed by the CPU 19 executing the program include a current position specifying process, a guide route calculating process, a route guide process, a menu process, a payment history recording process, and an entry permission / rejection flag rewriting process.

  The current position specifying process is a process for specifying the current position and direction of the vehicle based on a signal from the position detector 11 using a known technique such as map matching.

  The guidance route calculation process is a process of receiving an input of a destination by the user from the operation switch group 12 and calculating an optimum guidance route from the current position to the destination.

  In the route guidance process, map data is read from the external storage medium 18 and an image in which the calculated guidance route, destination facility, transit facility, current position, etc. are superimposed on the map indicated by this map data is output to the image display device 13. In this process, a guidance voice signal for instructing a right turn, a left turn, or the like is output to the speaker 14 when the host vehicle needs to arrive before the guidance intersection.

  The menu process is a process of hierarchically displaying various processes executed by the CPU 19 according to the function and purpose of the process, and starting execution of a program corresponding to the process selected by the user from the menu displayed. is there. The menu display is performed by outputting image data of the menu to the image display device 13, and the user's selection is accepted by detecting a selection operation on the operation switch group 12.

  The entry permission / rejection flag rewriting process is a process of rewriting the contents of the entry permission / rejection flag based on the information in the payment history data at the timing when the date changes and the content of the payment history data. Details of the entry permission / rejection flag rewriting process will be described later.

  The payment history recording process is a process for changing the contents of the payment history data described above. FIG. 3 shows a program 600 executed by the CPU 19 for the entry history recording process. The CPU 19 starts the execution of the program 600 based on accepting an operation on the operation switch group 12 by the user for performing the entry history recording process for a specific congestion tax area in the menu process described above.

  In the execution of the program 600, the CPU 19 first displays the received image on the image display device 13 in step 610. FIG. 4 shows a display screen 90 on the image display device 13 representing the received image. The display screen 90 includes a calendar unit 91, a calendar unit 92, a title unit 93, a reverse button 94, a forward button 95, a completion button 96, and the like as components. Here, the button refers to a component in the screen that can be selected by the user. The selection of the button by the user is realized by touching a portion corresponding to the button display area of the touch panel of the operation switch group 12 provided so as to overlap the display surface of the image display device 13. Each of the calendar unit 91 and the calendar unit 92 displays all dates of a specific month in a calendar format. Each displayed date is also one button. In addition, the title part 93 includes a message that prompts the user to input a date when the congestion tax has been paid.

  Further, in this step 610, the CPU 19 determines whether or not the date button, the reverse button 94 and the forward button 95 in the calendar portions 91 and 92 are selected. If it is determined that the user has selected the date button, the fact that the date has been selected is recorded in the temporary storage area of the RAM 16. When it is detected that the retrograde button 94 is pressed, an image obtained by changing the calendar display month in the calendar units 91 and 92 to a month earlier than the current display month (for example, two months ago) is displayed on the image display device. 13 is displayed. When the completion button 96 is detected to be pressed, an image obtained by changing the calendar display month in the calendar units 91 and 92 to a future month (for example, two months ahead) from the current display month is displayed on the image display device 13. To display.

  Subsequently, in step 620, it is determined whether or not the completion button 96 has been selected. If it is selected, step 630 is subsequently executed. If not, step 610 is executed again.

  In step 630, based on the data of the selected date recorded in the temporary storage area of the RAM 16, it corresponds to those dates in the payment history data for the congestion tax area designated by the user when starting the program 600. Change the entry contents to paid. After step 630, execution of program 600 ends.

  When the CPU 19 executes such a program 600, the car navigation apparatus 1 accepts a user's date selection operation using the input image by displaying the calendar-type input image (see step 610). The contents of the entry corresponding to the accepted date in the payment history data for the congestion tax area designated by the user are changed to paid (see step 630). In this way, the user appropriately selects the reverse button 94 or the forward button 95 on the display screen 90 to display the month including the button date on the calendar unit 91 or the calendar unit 92. When one or more date buttons are selected and all are selected, the completion button 96 is selected, whereby the payment history can be registered in each payment history data.

  The CPU 19 further accepts the user's date selection using the calendar-type input image and the operation to cancel the payment using the operation device, and the contents of the entry corresponding to the accepted date in the payment history data. May be changed to unpaid.

  Next, the entry permission / prohibition flag rewriting process will be described. FIG. 5 shows a flowchart of a program 500 executed by the CPU 19 in order to realize the entry permission / rejection flag rewriting process. The CPU 19 executes the program 500 immediately after startup, and in step 510, after execution of the previous step 510, whether or not the entry of the current date in any payment history data has been changed from unpaid to paid. If it is, step 520 is subsequently executed, and if not, step 530 is subsequently executed.

  In step 520, the value of the entry permission / prohibition flag for the same congestion tax area as the payment history data whose entry has changed is changed to on (that is, a value indicating that entry is possible), and then step 530 is executed.

  In step 530, it is determined whether or not the date has changed since the previous execution of step 530, that is, whether or not the time has exceeded midnight. If the date has changed, step 540 is subsequently executed, and if the date has not changed, step 510 is subsequently executed.

In step 540, each entry propriety flag is rewritten. Specifically, the following (1) and (2) are executed for all payment history data.
(1) If the contents of an entry with a date starting from the present time in a certain payment history data have been paid, the entry permission / prohibition flag for the same congestion tax area as that payment history data is turned on.
(2) If the contents of an entry with a date starting from the current date in a certain payment history data are unpaid, the value of the flag indicating whether or not the traffic congestion tax area is the same as the payment history data is turned off (that is, the entry is impossible) Value).
Following step 540, step 510 is executed.

  When the CPU 19 repeats steps 510 to 540 as described above, the car navigation device 1 changes the entry of the day of payment history data for the congestion tax area, that is, the day of the day for the congestion tax area. When there is a user input that the congestion tax has been paid, the entry permission flag for the congestion tax area is set to ON (see steps 510 and 520), and at the turn of the date as the delimiter timing that appears periodically, The value of each entry permission / prohibition flag is rewritten based on the corresponding payment history data.

  Next, the guidance route calculation process executed by the CPU 19 will be described in detail. In this guidance route calculation process, the CPU 19 of the present embodiment calculates a route that avoids a route entering a certain congestion tax area, or a route that does not consider avoiding a route entering a certain congestion tax area. Is determined based on an entry permission flag corresponding to the congestion tax area.

  6 and 7 show a program 100 and a program 200 executed by the CPU 19 for the guide route calculation process.

  The CPU 19 starts executing the program 100 based on accepting a user's operation for setting a passing point and a destination in the menu process described above, and setting a route calculation condition in the menu process described above. The execution of the program 200 is started based on accepting the user's operation.

  When the CPU 19 starts executing the program 100, first, at step 110, the CPU 19 accepts selection of a passing point / destination setting method. Specifically, a display screen 20 as shown in FIG. 8 is displayed on the image display device 13, and the user waits for selection of a passing point / destination setting method using the display screen 20. Step 120 is executed.

  Here, the display screen 20 of FIG. 8 will be described. The display screen 20 includes an address selection button 21, a landmark selection button 22, a map selection button 23, a postal code selection button 24, a memory location selection button 25, a previous location selection button 26, a current location display button 27, and a return button. It is a screen composed of a plurality of components such as 28. When the CPU 19 detects from the signal from the touch panel that there is a touch on a portion corresponding to a specific button, the CPU 19 determines that the button has been selected by the user, and executes processing corresponding to the button.

  Specifically, the CPU 19 selects one of the address selection button 21, the landmark selection button 22, the map selection button 23, the postal code selection button 24, the memory location selection button 25, and the previous location selection button 26. When the button is selected, it is determined that a passing point / destination setting method has been selected, and then step 120 is executed. When the current location display button 27 is selected, the execution of the program 100 is stopped and a map centered on the current location is displayed on the image display device 13. When the return button 28 is selected, the execution of the program 100 is terminated and the execution of the menu process is resumed. Note that a current location display button 27 and a return button 28 on other display screens to be described later are buttons for realizing the same functions as the current location display button 27 and the return button 28 on the display screen, respectively.

  In step 120, a point setting is accepted. Specifically, when the address selection button 21 is selected in step 110, the user inputs an address character string, and specifies the destination or waypoint from the received address. If the selection button 22 for sights is selected in step 110, a list of sights is displayed, one of the selections by the user is received, and the received sights are specified as a destination or a waypoint. If the map selection button 23 is selected in step 110, the map is displayed, the user selects one point on the map, and the position is specified as the destination or waypoint. If the postal code selection button 24 is selected in step 110, the input of the postal code is accepted, and the area corresponding to the accepted postal code or the position selected more precisely from the area is selected as the destination or Identify as a stopover. If the memory location selection button 25 is selected in step 110, a list of specific locations (for example, home, parking lot, favorite restaurant, etc.) registered in advance by the user is displayed, and one of them is displayed by the user. One selection is accepted, and the accepted point is specified as the destination or waypoint. If the previous point selection button 26 is selected in step 110, the destination selected last time is specified as the current destination or waypoint.

  As an example of this point setting reception, FIG. 9 shows a map display screen 30 that the CPU 19 displays on the image display device 13 when the map selection button 23 is selected in step 110. The display screen 30 includes a selection position mark 31, a destination button 32, a waypoint button 33, a direction icon 34 indicating a map direction, a scale change button 35, a current position display button 27, a return button 28, and the like on the map. Elements are stacked. When the user selects the destination button 32, the CPU 19 specifies a point on the map where the selection position mark 31 overlaps as the destination. When the user selects the waypoint button 33, the CPU 19 identifies a point on the map where the selection position mark 31 overlaps as a waypoint. When the selection of the scale change button 35 is detected, the CPU 19 enlarges / reduces the scale of the display map. Further, the CPU 19 moves the selection position mark 31 on the map based on the operation of the operation switch group 12 by the user.

  Subsequently, in step 130, it is determined based on the map data whether or not the set point (that is, the destination or waypoint) identified in step 120 is inside one of the congestion tax areas. If it is within the congestion tax area, step 140 is executed. If it is outside the congestion tax area, step 150 is subsequently executed.

  In step 140, the image display device 13 or the speaker 14 is caused to give a warning notification that the set point is in the congestion tax area for a predetermined time or until the user accepts an operation for the operation switch group 12. An example of the display screen 30 in such a warning is shown in FIG. In this figure, a warning display that “the set point is within the congestion tax area” is shown in a pop-up window 36 at the center of the display screen 30. It should be noted that this warning notification may be performed only when a setting is made to avoid passing through the congestion tax area by executing a program 200 described later. Further, the warning notification may be performed only when the entry permission / prohibition flag corresponding to the congestion tax area is off. Following step 140, step 150 is executed.

  In step 150, a list of destinations and waypoints identified after the program 100 is started is displayed. FIG. 11 shows a display screen 40 showing an example of a list of destinations and waypoints. The display screen 40 includes point addition buttons 45 to 47, a route condition setting button 48, scroll buttons 49 and 50 in addition to the specified current position name 41, the specified waypoint names 42 and 43, and the specified destination name 44. , The current location display button 27, the return button 28, and the like. In step 150, when the scroll buttons 49 and 50 are selected, the name display of the waypoint name 43 and the destination name 44 is scrolled horizontally.

  Subsequent to step 150, in step 160, it is determined whether or not an operation for setting an additional point, that is, any of the point addition buttons 45 to 47 has been selected. Here, among the plurality of buttons 45 to 47, which button is selected depends on the selection order of the points selected due to the selection of the button. If there is an operation for setting an additional point, step 110 is subsequently executed. If not, step 170 is subsequently executed.

  In step 170, it is determined whether or not an operation for setting the route condition, that is, whether or not the route condition setting button 48 has been selected. If there is, step 180 is executed, and if not, step 150 is executed. .

  In step 180, the execution of the program 200 is started to set the route calculation conditions, and then the execution of the program 100 is terminated. As described above, the program 200 starts executing not only during the menu processing but also during the execution of the program 100.

  When the CPU 19 executes such a program 100, the car navigation apparatus 1 accepts a destination and transit point setting from the user (see step 120), and the set point is within the congestion tax area. At some time, a warning notification to that effect is sent to the user (see step 140).

  When the CPU 19 starts executing the program 200, first, in step 210, the CPU 19 performs a display for allowing the user to set various conditions used for route calculation and a process for accepting the setting. FIG. 12 shows a display screen 60 displayed on the image display device 13 at this time. The display screen 60 is composed of a main road button 61, a time limit road button 62, a toll road button 63, a ferry button 64, a traffic jam tax button 65, a traffic tax detail setting button 66, a route calculation button 67, and the like. Have as. In step 210, it is further determined whether or not any one of the main road button 61, the time limit road button 62, the toll road button 63, the ferry button 64, and the congestion tax button 65 is selected by the user. Then, the setting flag corresponding to the button determined to be selected is toggled on / off.

  The display shapes of the buttons 61 to 65 on the display screen 60 differ depending on whether the corresponding setting flag is on or off. Specifically, when a certain setting flag is ON, the shape of the button corresponding to the setting flag among the buttons 61 to 65 is like a mechanical button in a pressed state. When a certain setting flag is off, the shape of the button corresponding to the setting flag among the buttons 61 to 65 is a mechanical button that is not pressed.

  Subsequently, at step 215, whether or not the setting has been changed to allow entry into the congestion tax area → not possible, that is, whether or not the setting flag corresponding to this button has changed from on to off when the congestion tax enable button 65 is selected. Determine whether or not. If it has not been changed, step 220 is subsequently executed, and if it has been changed, step 230 is subsequently executed.

  In step 230, it is determined whether or not entry into any congestion tax area is unavoidable. When it is determined that entry into a traffic jam tax area is unavoidable, two points in the order of arrival in the point group including the current position, the destination, and the waypoint (for example, in the example of FIG. 11) Of the current position and DEERLIJK, DEERLIJ and 19DULVERTON ROAD, 19DULVERTON ROAD and the destination MUSCOVY ROAD, the faster arrival is outside the congestion tax area and the slower arrival Means that there is at least one combination in the congestion tax area. In this case, it is almost impossible to enter the congestion tax area. In addition, when there is no transit point and the set point is only the destination, it is unavoidable to enter a certain congestion tax area when the current position is outside the congestion tax area and the destination is the congestion This is the case in the tax area. Here, it may be determined whether or not entry into any of the congestion tax areas for which the corresponding entry availability flag is off is unavoidable. If it is unavoidable, then step 240 is executed. If not unavoidable, then step 220 is executed.

  In step 240, a warning notification indicating that a guidance route to enter the congestion tax area is to be calculated is given to the image display device 13 or the speaker 14 until a predetermined time or a user's consent operation on the operation switch group 12 is received. Make it. An example of the display screen 60 in such a warning is shown in FIG. In this figure, a warning display that “the route to the set point may pass through the congestion tax area” is shown in a pop-up window 68 at the center of the display screen 60. Following step 240, step 220 is executed.

  In step 220, it is determined whether or not the detailed congestion tax setting button 66 is selected. If it is selected, step 250 is subsequently executed.

  In step 250, a screen for detailed setting is displayed, and the user is caused to make detailed settings regarding entry into the congestion tax area through this screen display. FIG. 14 shows an example of the display screen 70 for detailed setting. The display screen 70 includes a total amount button 71, a charge input field 72, a passing area number button 73, a number input field, an individual area setting button 75, a London button 76, a city A button 77, a city B button 78, and an end button 79. Has as an element.

  At least one of the total amount button 71, the passing area number button 73, and the individual area setting button 75 is highlighted. Specifically, when any one of the buttons 71, 73, and 75 is selected, the selected button is highlighted, and when the other buttons are highlighted, the other buttons are selected. The highlighted display returns to the normal display. Highlight selection information indicating which of the buttons 71, 73, and 75 is highlighted is recorded in the external storage medium 18.

  For the charge input field 72, the user can input a numerical value using the operation switch group 12. When receiving a numerical value input, the CPU 19 records the value in the external storage medium 18 as a variable of the total fee. In the number input field 74, the user can input a numerical value using the operation switch group 12. When receiving a numerical value input, the CPU 19 records the value in the external storage medium 18 as a variable for the number of passing areas.

  The London button 76, the city A button 77, and the city B button 78 are buttons assigned to individual congestion tax areas, and whether or not to enter the corresponding congestion tax area by selecting each button is individually determined. Toggle on / off of area flag value.

  If the end button 79 is selected, step 250 is ended, and then step 225 is executed.

  In step 225, it is determined whether or not the route calculation button 67 has been selected. If it has been selected, step 260 is subsequently executed. If not, step 210 is subsequently executed.

  In step 260, the execution of the route calculation process is started and the execution of the program 200 is ended.

  When the CPU 19 executes such a program 200, the car navigation apparatus 1 receives an input of route calculation conditions from the user (see step 210), and the setting that the user wants to avoid entering the congestion tax area is set. Despite being done (see step 215), out of the congestion tax area where there is the fastest of the two points in the order of arrival in the point group consisting of the current position, destination, and waypoint If it is almost unavoidable to enter the area from outside the congestion tax area, for example, because there is only one combination that is in the congestion tax area with the slower arrival, enter the congestion tax area. The user is notified that a guidance route is calculated that does not consider avoiding entry (see steps 230 and 240). By checking such a display, the user resets the waypoints and destinations where entry into the congestion tax area is inevitable, or pays the congestion tax on the day of the congestion tax area. You will be prompted to make a decision.

  In addition, in the detailed setting for a plurality of congestion tax areas, the car navigation device 1 allows entry into the maximum number of congestion tax areas among the plurality of congestion tax areas, and allows entry into other congestion tax areas. Settings to avoid, settings that allow entry into a congestion tax area where the total amount of charges does not exceed the maximum amount, and avoid entry into other congestion tax areas, or allow entry into individual congestion tax areas, Each permission can be set (see step 250).

  Next, the guidance route calculation process executed by the CPU 19 will be described in detail. The CPU 19 executes a program 300 shown in FIG. 15 for the guide route calculation process. When starting execution of the program 300, the CPU 19 first refers to the route calculation condition in step 310. The route calculation conditions to be referred to, that is, to be read out, are the entry permission flag recorded in the program 100, the setting flag set in step 210 of the program 200, and the congestion tax area detailed setting set in step 250 (ie, highlight). Selection information, fee entered in the fee entry field 72, number entered in the passing area number button 73, and individual area flag).

  Subsequently, in step 320, route calculation is performed based on the referred route calculation condition.

  Specifically, the optimum route based on the Dijkstra method is calculated for each section divided by a point group including a current position (departure position), a destination, and a waypoint. In this calculation, the cost of a plurality of routes connecting the start point and end point of each section is calculated, and the route with the lowest cost is specified as the optimum route. Here, when the route is a route that enters a congestion tax area, the value of the cost of the route varies depending on the value of the setting flag.

  Specifically, when the setting flag corresponding to the main road enable button 61 is OFF, the cost of the route passing through the main road is set to a large value that cannot practically become the optimum route. Further, when the setting flag is on, the cost of the route passing through the main road is set to a lower value than when the setting flag is off so that the route passing through the main road can be the optimum route.

  When the setting flag corresponding to the time limit road enable button 62 is off, the cost of the route passing through the time limit road is set to a large value that cannot be an optimum route in practice. Further, when the setting flag is on, the cost of the route passing through the time-limited road is set to a lower value than when the setting flag is off so that the route passing through the time-limited road can be the optimum route.

  When the setting flag corresponding to the toll road button 63 is off, the cost of the route passing through the toll road is set to a large value that cannot practically be the optimum route. Further, when the setting flag is on, the cost of the route passing through the toll road is set to a lower value than when the setting flag is off so that the route through the toll road can be the optimum route.

  Further, when the setting flag corresponding to the ferry enable button 64 is OFF, the cost of the route using the ferry is set to a large value that cannot effectively be the optimum route. When the setting flag is on, the cost of the route using the ferry is set to a lower value than when the setting flag is off so that the route using the ferry can be the optimum route.

  Further, when the setting flag corresponding to the congestion tax enable button 65 is on, the cost of the route entering the congestion tax area is set to a value such that the route entering the congestion tax area can be the optimum route. That is, cost calculation is performed so as not to consider avoiding entry into the congestion tax area.

  In the following, the case where the setting flag corresponding to the congestion tax enable button 65 is off will be described. In this case, if the route is a route that enters a certain congestion tax area, what is the cost of the route? Whether the value is a value or not depends on the entry permission flag corresponding to the congestion tax area. Hereinafter, the case where the entry permission / prohibition flag corresponding to the congestion tax area is on and the case where it is off will be described.

(1) When the entry propriety flag is on:
In this case, the cost of the route entering the traffic congestion tax area is set to a value such that the route entering the traffic congestion tax area can be an optimal route. That is, cost calculation is performed so as not to consider avoiding entry into the congestion tax area.

(2) When the entry flag is off:
In this case, if at least one of all the sections is outside the congestion tax area and the end point of the section is within the congestion tax area, avoid entering the congestion tax area. Cost calculation that does not consider this is performed for each section. This is because, among the two sets of the current position, destination, and waypoint, which arrive in sequence, the faster arrival is outside the congestion tax area, and the later arrival is within the congestion tax area. If there is even one such combination, unless there is a very special situation, the vehicle will always enter the congestion tax area once, so try to calculate a route that avoids entering the congestion tax area. Is based on the fact that it is almost meaningless.

  Also, in this case, for all sections, if the start point of the section is within the congestion tax area or the end point of the section is outside the congestion tax area, the highlight selection information set in step 250 of the program 200 Depending on the contents, the route calculation method differs as follows.

(2-1) When the highlight selection information indicates that none of the total amount button 71, the passing area number button 73, and the individual area setting button 75 is highlighted:
In this case, a route that avoids entry into the congestion tax area is calculated. The cost calculation for avoiding entry into the congestion tax area is a cost such that the cost of the route entering the congestion tax area does not fall below the cost of the route not entering the congestion tax area. Even in such a case, if all candidate routes enter only the traffic congestion tax area, one of them is calculated as the optimum route.

(2-2) When the highlight selection information indicates that the total amount button 71 is highlighted:
In this case, entry into the congestion tax area (congestion tax area where the entry enable / disable flag is off) is permitted within a range where the total charge amount is within the charge amount input in the charge input field 72. Specifically, when the guide route candidates enter one or more traffic jam tax areas, the charge amounts of the traffic tax areas are specified, and the sum of those charges is input in the charge input field 72 If it is less than or equal to the tolled amount, the cost of this route is set to a value that can be an optimum route against a route that does not enter the congestion tax area. Also, if the sum of these exceeds the amount of charge entered in the fee entry field 72, the cost of this route is practically unlikely to be the optimum route against the route that does not enter the congestion tax area. Use a large value.

  Information on the charge amount of each congestion tax area is stored in the external storage medium 18 in advance, and the CPU 19 reads out this information and specifies the charge amount of each congestion tax area.

  As described above, the CPU 19 determines that the total amount of charges does not exceed the upper limit amount (that is, the amount entered in the fee entry field 72) among the plurality of congestion tax areas in which the amount charged for entry is determined. By calculating a guide route that avoids entering into other congestion tax areas without considering entering into the traffic jam area, based on the maximum amount, among multiple congestion tax areas, An area that avoids entry and an area that avoids entry can be separated.

(2-3) When the highlight selection information indicates that the passing area number button 73 is highlighted:
In this case, entry into the congestion tax area is permitted within a range in which the congestion tax area that passes through (congestion tax area where the entry permission flag is zero) falls within the number input in the number input field 74. Specifically, when the guide route candidates enter the one or more congestion tax areas, if the total number of the congestion tax areas is equal to or less than the number input in the number input field 74, The cost of this route is set to a value that can be an optimum route against a route that does not enter the congestion tax area. Also, if the total number exceeds the number input in the number input field 74, the cost of this route is a large value that is practically not an optimum route against a route that does not enter the congestion tax area. And

  As described above, the CPU 19 does not consider avoiding entry to the traffic congestion tax area of the upper limit number among the congestion tax areas, and calculates a guide route that avoids entry to another congestion tax area. By doing so, it is possible to divide an area that avoids entry and an area that does not avoid entry among a plurality of congestion tax areas based on the limit of the upper limit number.

(2-4) When the highlight selection information indicates that the individual area setting button 75 is highlighted:
In this case, out of the congestion tax area where the admission flag is off, for the congestion tax area where the individual area flag is on, a route that does not consider entering the congestion tax area is calculated and For a traffic congestion tax area where the area flag is off, a route that avoids entry into the traffic congestion tax area is calculated. Specifically, if the guide route candidate enters the traffic congestion tax area where the entry permission flag is OFF and the individual area flag is OFF, the cost of the route is determined as the traffic congestion tax area. It is set to a large value so that it is virtually impossible to become an optimum route against a route that does not enter the route. In addition, if the guide route candidate enters only the congestion tax area where the individual area flag is on, the cost of that route becomes the optimal route against the route that does not enter the congestion tax area. The value is as follows.

  In FIG. 16, as an example of the guidance route calculation, the destination is set, the waypoint is not set, the setting flag corresponding to the congestion tax enable button 65 is off, and the highlight selection information is When the total amount button 71, the passing area number button 73, and the individual area setting button 75 are not highlighted, the guide route calculation method performed by the CPU 19 is shown in a table format. As shown in this figure, the CPU 19 determines whether or not the congestion tax area for which the congestion tax for the day has been paid, that is, the congestion tax area for which the corresponding entry availability flag is on, regardless of the departure place (current position) and destination. Calculate a guide route that does not consider entering the congestion tax area.

  In addition, for the traffic tax area where the traffic tax of the day has not been paid, i.e., the traffic tax area where the corresponding admission flag is off, if the current position is outside the traffic tax area and the destination is outside the traffic tax area, If the current position is within the congestion tax area and the destination is outside the congestion tax area, and if the current position is within the congestion tax area and the destination is within the congestion tax area, the congestion tax area A guide route that avoids entering is calculated.

  As a result, the guide route is to enter the traffic jam area once in the guide route from a point outside the traffic tax area to a point outside the traffic tax area. The guide route from a point in the area to a point outside the traffic congestion tax area will enter the traffic congestion tax area after leaving the traffic congestion tax area, and from a point in the traffic congestion tax area It is possible to avoid that the guide route to a point outside the congestion tax area once enters the congestion tax area after leaving the congestion tax area. This is more effective when the congestion tax area has an irregular geographical shape.

  Also, if the current location is outside the congestion tax area and the destination is within the congestion tax area, the congestion tax area where the congestion tax of the day is unpaid, i.e., the congestion tax area where the corresponding entry permission flag is off, A guidance route that does not consider avoiding entry into the congestion tax area may be calculated. This is because if the current position is outside the congestion tax area and the set destination is within the congestion tax area, the vehicle must be in the congestion tax area at least once, unless there are special circumstances. This is because it is almost meaningless to calculate a route that avoids entering the congestion tax area.

  Subsequent to step 320, it is determined in step 340 whether the calculated guide route is to enter one of the congestion tax areas. Is executed, and step 345 is executed when it is determined not to enter.

  In step 345, the calculated optimum guide route is displayed on the image display device 13 together with the map. FIG. 17 shows an example of a display screen 80 for displaying the guidance route. The display screen 80 represents a guide route 82 to the destination 81 on the map. In the display screen 80, the itinerary list 83 indicates the distance of the expressway and the general road in the guide route, the total distance display 84 indicates the total route distance of the guide route 82, and the arrival schedule display 87 indicates the arrival schedule. The scheduled time is shown. Further, when the user selects the route change button 85, the CPU 19 calculates another optimum route. Further, when the user selects the guide button 86, the CPU 19 starts the route guidance process described above. After step 345, execution of program 300 ends.

  In step 348, it is determined whether or not the setting is entry into the traffic congestion tax area, that is, whether or not the setting flag corresponding to the traffic congestion tax enable button 65 is off. If the entry is not possible, step 345 is subsequently executed.

  In step 350, the relationship between the degree of progress of the travel and the time when the host vehicle starts traveling on the guide route at the current time (or the departure time designated by the user using the operation switch group 12) is determined in advance. Identified based on the average speed, speed limit, etc. of the road pieces in the guide route recorded in the map data, and based on the relationship, the date changes according to the elapsed time of travel in the traffic jam tax area to enter By doing so, before entering the congestion tax area, it is determined whether or not there is at least one congestion tax area in which the entry availability flag is reset from on to off. If there is, then step 380 is executed. If not, then, in step 355, the same guidance route display as in step 345 is performed.

  Subsequent to step 355, in step 370, a notification that a guide route to enter the congestion tax area has been calculated (for example, a message such as “I will enter the congestion tax area”) for a certain period of time or a group of user operation switches. Until the confirmation operation is performed on the image display device 12, the image display device 13 and the speaker 14 are performed. FIG. 18 shows how this notification is displayed in the pop-up window 88 of the display screen 80. Note that such warning notification may be performed only for a traffic jam tax area where the entry permission / prohibition flag is off. After step 370, execution of program 300 ends.

  In step 380 after it is determined in step 350 that there is at least one congestion tax area that is reset from on to off before entering the guide route while traveling on the guide route, the entry enable / disable flag is temporarily turned off. Then, step 320 is executed again. Note that the CPU 19 returns the value of the entry permission / prohibition flag temporarily turned off to the original value when the execution of the program 300 ends.

  When the execution of the program 300 is completed, the CPU 19 subsequently starts the route guidance process.

  When the CPU 19 executes such a program 300, the car navigation apparatus 1 calculates a guide route (see step 320) based on the set route calculation conditions (see step 310). In this calculation, the congestion tax for the day of any congestion tax area is unpaid (that is, the entry permission flag of the congestion tax area is reset), and from the current position, destination, and waypoint Among the two points in the point group, the fastest arrival is outside the congestion tax area and there is no combination where the slower arrival is within the congestion tax area. In addition, when the user has set to avoid the congestion tax area, a guide route that avoids entering the congestion tax area is calculated.

  And, in other cases, that is, when calculating a guidance route that does not consider avoiding entry into the congestion tax area, if the user has set to avoid entering the congestion tax area, A warning to that effect is sent to the user (see steps 348 and 370).

  In addition, when a guide route that does not consider avoiding entry into a certain congestion tax area is calculated, if the host vehicle travels on the calculated guide route later, it will enter the congestion tax area according to the passage of time during the travel. The guide route is calculated again (see step 380) based on the prediction that the entry permission data will be turned off when the date changes before the host vehicle enters (see step 350). May be. In this way, the guidance route calculation can be performed in advance in consideration of the passage of time in the travel of the guidance route.

  Next, FIG. 19 shows a program 400 that is repeatedly executed in parallel with the processing when the CPU 19 is executing the route guidance processing. In the execution of this program, the CPU 19 first determines in step 410 whether or not the value of the entry permission / prohibition flag has changed anew, that is, after the previous execution of step 410. Note that the change in the value of the entry permission / prohibition flag is generated by the execution of the program 500 described above. If there is a new change in the value of the entry permission / prohibition flag, step 420 is subsequently executed. If there is no change, the execution of the program 400 once is terminated.

  In step 420, in order to perform the route calculation process again, the program 300 is executed, and then execution of the program 400 once is terminated.

  When the CPU 19 executes such a program 400, the car navigation apparatus 1 calculates the guidance route again when the date changes with the passage of time and the value of the entry permission flag changes (step 410). Thus, the guide route can be flexibly changed based on the passage of time.

  With the above operation, the car navigation apparatus 1 associates a plurality of payment target periods for a plurality of congestion tax areas with the payment history of the congestion tax areas for the individual payment target periods. Data is rewritten based on a user registration operation. In addition, the car navigation device 1 rewrites the contents of the entry availability data at the timing when the date changes and the payment history data changes so that the entry into the congestion tax area is indicated for the payment target period, and the entry availability data Based on the fact that no entry into the traffic jam area with the contents of is presently indicated, a guidance route that avoids entering the traffic congestion tax area is calculated, and the traffic tax area with the content of the entry availability data is calculated. Based on the fact that entry is possible at the present time, a guide route that does not consider entering the congestion tax area is calculated.

  In this way, the car navigation apparatus 1 rewrites the entry permission / prohibition data based on the information that the fee for the payment target period in a certain congestion tax area has been paid, and further, the congestion tax based on the entry permission / inhibition data. Whether or not to enter the congestion tax area by calculating a guide route that avoids or does not consider entering the area based on the payment status of the congestion tax area. You can decide.

In the above embodiment, the programs 100, 200, 300, 400, 500 and 600 correspond to the programs described in the claims. In addition, the CPU 19 executes the program 500 to function as an entry permission / rejection data rewriting unit described in the claims. Further, the CPU 19 executes the programs 100 to 400 to function as a guide route calculation unit described in the claims. Further, the CPU 19 executes the program 600 to function as the payment history data rewriting means described in the claims.
(Other embodiments)
In the above embodiment, the car navigation device 1 calculates a guide route that avoids entering the congestion tax area according to the situation. The congestion tax area here is an example of an urban area that has been negotiated so that entry by vehicle during the payment target period is permitted by paying a fee in advance. However, not only in such an urban area, the car navigation device 1 avoids entering a toll road that is arranged so that entry by vehicle during the payment target period is permitted by paying a fee in advance. A simple guide route may be calculated. In other words, the car navigation device 1 only needs to calculate a guide route that avoids entering a time-charged road area composed of one or more links according to the situation.

  In the above embodiment, 0:00 am is used as the date transition as the delimiter timing that appears periodically. However, if it corresponds to the contents of the time restriction of the road area, it is not necessarily 0:00. It may be any time, such as 4 am.

  In the above embodiment, the payment target period is a “period repeated according to a predetermined rule” such as a date, but it is not always necessary to do so.

  For example, the payment target period of a certain congestion tax area may be a period that starts when the user pays the congestion tax for the congestion tax area and ends after a predetermined time (for example, 24 hours later). When the period subject to payment for a certain time-charged road area is a period from when the fee is paid to after a predetermined time, the navigation apparatus may pay the fee for the time-charged road area. It is only necessary to rewrite the contents of the entry permission / prohibition data in the storage medium so as to indicate that entry into the time-limited charging road area is not possible based on the arrival of a timing that is a predetermined time after the occurrence.

  Further, for example, the payment target period for a certain time-charged road area may be a period from when the host vehicle enters the time-charged road area to a predetermined time later. In such a case, the navigation device, based on the arrival of the timing after a predetermined time from the time when the host vehicle entered the time-limited charging road area, the content of the entry permission / prohibition data in the storage medium, What is necessary is just to rewrite so that the entry to the said time limit charge road area may be impossible.

  Further, in the above embodiment, the congestion tax area is an area that is determined to enter the area many times during the payment target period if the congestion tax is paid for the payment target period. However, it is not always necessary to enter the area many times. For example, a traffic congestion tax area may be an area where it is stipulated that if a traffic congestion tax is paid for a certain payment target period, the area may be entered only once during the payment target period. Good. In such a case, the navigation device may rewrite the corresponding entry propriety flag from on to off when the host vehicle enters the congestion tax area.

  Also, depending on the congestion tax area, there may be a system in which certain types of vehicles (for example, vehicles owned by residents around the congestion area tax boundary) are always allowed to enter. That is, depending on the vehicle, there may be no reason to avoid entering the time-charged road area.

  For example, if there is no reason why a vehicle with a license plate with a certain area name avoids entering a certain road area, there is no reason why a vehicle with a license plate with a certain last number avoids entering a certain road area. In the case where the vehicle does not exist, the car navigation device 1 calculates a guide route that avoids entering the road region based on the license plate information of the host vehicle stored in the storage medium such as the external storage medium 18. It may be determined whether or not it is necessary to calculate a guidance route that avoids entry into the road area only when necessary.

  In addition, the car navigation device 1 has a device that reads a removable portable storage medium such as a memory stick, a compact flash (registered trademark), and a magnetic card, and based on the ID information read using the device, the car navigation device 1 It is determined whether it is necessary to calculate a guidance route that avoids entry into the road area, and only when necessary, a guidance route that avoids entry into the road area is calculated. Also good.

  Depending on the congestion tax area, there may be a system that requires payment of congestion tax on certain days and always permits entry on other days. That is, depending on the day of the week, there may be no reason to avoid entering the time-charged road area.

  In such a case, the car navigation apparatus 1 needs to calculate a guide route that avoids entering the road area for each day of the week stored in the storage medium such as the current day of the week and the external storage medium 18. Based on the information on whether or not there is a guide route that avoids entry into the road area only when the day is a day of the week on which the entry into the road area should be avoided Also good.

  Depending on the congestion tax area, there may be a system that requires payment of congestion tax during certain times of the day (for example, during commuting rush hours) and always allows entry during other times. is there. In other words, depending on the time of the day, there may be no reason to avoid entering the road area.

  In such a case, the car navigation device 1 needs to calculate the current time and a guidance route that avoids entering the road area stored in the storage medium such as the external storage medium 18. Only when the current time is a day of the week when it is necessary to avoid entry into the road area, a guide route that avoids entry into the road area may be calculated based on the information on the belt. .

  In addition, the car navigation device 1 communicates with a device outside the vehicle such as a road device by wireless communication using a mobile phone or the like, and transmits its own identification number at that time. Receive information on whether the corresponding vehicle needs to avoid entering the road area, and based on the received information, avoid entering the road area only when necessary A simple guide route may be calculated.

  Further, the car navigation device 1 of the above embodiment is not limited to a vehicle navigation device, and may be any device such as a portable navigation device as long as it is a navigation device.

  In the above embodiment, the contents of the payment history data change according to the user's operation. In addition to this, the navigation device also provides information indicating that the fee has been paid by wireless communication. And the contents of the payment history data may be rewritten based on the information.

  In addition to the external storage medium 18, the payment history data may be stored in a removable portable storage medium such as a memory card. In this way, by attaching this removable portable storage medium to an external congestion tax payment device, the payment content is recorded on the storage medium, and the car navigation device reads it. It becomes possible to link the payment history data with the entry availability flag.

  Further, since the car navigation device 1 has the payment history data, it becomes easy to manage the presence / absence of fee payment in a plurality of payment target periods, but such payment history data is not necessarily required. For example, the car navigation device 1 receives an operation to the effect that the payment for the day for a certain congestion tax area has been made, thereby turning on the value of the entry permission / prohibition flag corresponding to the congestion tax area. At the start of the payment target period, the value of the entry permission / prohibition flag may be turned off.

  Moreover, in said embodiment, although the car navigation apparatus 1 showed the entry permission flag as one form of the entry permission data, the entry permission data may have a format such as payment history data. In this case, the content of the entry permission / inhibition data changes only when payment is made, and the content may not change at the start of a new payment target period.

It is a hardware block diagram of the car navigation apparatus 1 which concerns on embodiment of this invention. It is a chart which shows a part of payment history data. It is a flowchart of the program 600 which CPU19 performs. It is a figure which shows the display screen 90 for registration of payment log | history data. It is a flowchart of the program 500 which CPU69 runs. It is a flowchart of the program 100 which CPU19 performs. It is a program 200 flowchart which CPU19 performs. It is a figure which shows the display screen 20 which selects the setting means of a destination and a waypoint. It is a figure which shows the map display screen 30 of a destination and a waypoint. It is a figure which shows the display screen 30 which has a warning display by the pop-up window. It is a figure which shows the display screen 40 of a destination and a waypoint. It is a figure which shows the display screen 60 for route condition setting. It is a figure which shows the display screen 30 which has a warning display by the pop-up window. It is a figure which shows the display screen 70 for the setting of traffic congestion tax detailed conditions. It is a flowchart of the program 20 which CPU19 performs. It is a chart which shows the case classification in the direction of route calculation. It is a figure which shows the display screen 80 of the calculated guide route. It is a figure which shows the display screen 30 which has a warning display by the pop-up window. It is a flowchart of the program 20 which CPU19 performs.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 ... Car navigation apparatus, 11 ... Position detector, 12 ... Operation switch group,
13 ... Image display device, 14 ... Speaker, 16 ... RAM, 17 ... ROM,
18 ... external storage medium, 19 ... CPU, 20 ... display screen, 21 ... address selection button,
22 ... Selection button for sights, 23 ... Selection button for maps, 24 ... Selection button for postal codes,
25 ... Memory point selection button, 26 ... Previous point selection button,
27 ... Current location display button, 28 ... Return button, 30 ... Display screen,
31 ... selected position mark, 32 ... destination button, 33 ... waypoint button,
34 ... Direction icon, 35 ... Scale change button, 36 ... Pop-up window,
40, 60, 70, 80, 90 ... display screen, 41 ... current position name,
42, 43 ... route name, 44 ... destination name, 45-47 ... point addition button,
48 ... Route condition setting button, 49, 50 ... Scroll button,
61 ... Main road button, 62 ... Time limit road button, 63 ... Toll road button,
64 ... Ferry button, 65 ... Congestion tax button, 66 ... Congestion tax detail setting button,
67 ... Route calculation button, 68 ... Pop-up window, 71 ... Total amount button,
72 ... Charge input field, 73 ... Passage area number button,
74 ... Number input field, 75 ... Individual area setting button, 76 ... London button,
77 ... City A button, 78 ... City B button, 79 ... End button, 81 ... Destination,
82 ... guide route, 83 ... stroke list, 84 ... total distance display, 85 ... route change button,
86 ... Guide button, 87 ... Arrival schedule display, 88 ... Pop-up window,
91 ... Calendar part, 92 ... Calendar part, 93 ... Title part, 94 ... Reverse button,
95 ... Forward button, 96 ... Complete button, 100-600 ... Program.

Claims (22)

A storage medium for storing admission data indicating information on whether or not to enter a time-charged road area, which is a road area determined so that entry in the vehicle during the payment target period is permitted by paying a fee in advance; ,
Based on the information that the fee for the payment target period in a certain time-charged road area has been paid, the contents of the entry permission / prohibition data in the storage medium are entered into the time-charged road area for the payment target period. Entry permission data rewriting means for rewriting as shown,
Based on the fact that the entry permission / inhibition data content indicates that the entry into the time-limited charging road area is not possible at present, a guide route that avoids entry into the time-limited charging road area is calculated, and the entry permission / inhibition data contents A navigation device comprising: a guide route calculating means for calculating a guide route that does not consider avoiding entering the time-charged road region based on the fact that an entry into a time-charged road region is currently indicated . The payment target period for a certain time-charged road area is a period that repeats according to a predetermined rule.
The entry permission / rejection rewriting means determines that entry of the entry permission / prohibition data in the storage medium is not allowed to enter the time-limited charging road area for the payment target period based on the arrival timing of a new payment target period. The navigation device according to claim 1, wherein the navigation device is rewritten as shown. In the payment history data that associates the plurality of payment target periods for a certain time-charged road area with the presence / absence of fee payment for the time-charged road area for each of the payment target periods, Based on the fact that the payment has been made with respect to the payment target period starting from or including the present time, the content of the entry permission / prohibition data in the storage medium is related to the time-limited charging road for the payment target period. The navigation device according to claim 1, wherein the navigation device is rewritten so as to indicate that entry into the area is possible. The entry permission / rejection data rewriting means is configured to determine whether or not the entry is permitted in the storage medium based on the fact that the payment history data is associated with the payment target period starting from or including the current time in the payment history data. 4. The navigation apparatus according to claim 3, wherein the contents of the data are rewritten so as to indicate that entry into the time-limited charging road area is impossible for the payment target period. 5. The navigation device according to claim 3, wherein the entry permission / rejection data rewriting unit rewrites the contents of the entry permission / rejection data in the storage medium at a timing when the contents of the payment history data change. The storage medium stores the payment history data,
6. The navigation device according to claim 5, further comprising a payment history data rewriting means for rewriting the contents of the payment history data based on a user input operation. The navigation device according to any one of claims 1 to 6, wherein the guide route calculation unit calculates the guide route again at a timing when the content of the entry permission / prohibition data changes. The guide route calculating means, if the host vehicle travels later on the calculated guide route entering the time-charged road area, the vehicle enters the time-charged road area as time passes during the travel. Prior to the entry, the entry availability data indicating that the entry is impossible based on the prediction that the entry into the time-charged road area will be impossible for the payment target period starting from the time before the entry. The navigation apparatus according to claim 1, wherein the guide route is calculated again based on the above. The guide route calculating means avoids entering the time-limited charging road region based on the fact that the current position is outside the time-based charging road region and the set destination is outside the time-based charging road region. The navigation apparatus according to claim 1, wherein a guide route is calculated. The guide route calculating means avoids entering the time-limited charging road region based on the fact that the current position is in the time-charging fee road region and the set destination is outside the time-charging fee region. The navigation device according to any one of claims 1 to 9, wherein a guide route is calculated. The guide route calculating means avoids entry into the time-limited charging road area based on the fact that the current position is in the time-based charging road area and the set destination is in the time-based charging road area. The navigation device according to any one of claims 1 to 10, wherein a guide route is calculated. The guide route calculation means avoids entering the time-limited charging road region based on the fact that the current position is outside the time-charging fee road region and the set destination is in the time-charging fee road region. The navigation device according to any one of claims 1 to 11, wherein a guide route that is not taken into account is calculated. The guide route calculating means is a time-charged road area in which there is an earlier arrival of two points in the order of arrival in a point group consisting of a current position, a set destination, and a set waypoint A guide route that does not consider avoiding entry to the time-charged road area when there is at least one combination that is outside and within the time-charged road area. The navigation device according to any one of claims 1 to 12. The guide route calculation means calculates a guide route that avoids entering a time-charged road area that does not exempt from charging for the license plate, based on the license plate information of the host vehicle stored in the storage medium. The navigation device according to claim 1, wherein: 15. The guide route calculation unit according to claim 1, wherein the guide route calculation means calculates a guide route that avoids entering a time-charged road area based on information acquired from outside the vehicle by wireless communication. The navigation device described in one. The guide route calculation means calculates a guide route that avoids entering the time-limited charging road area based on a setting that the user wants to avoid entering the time-charged road area. Item 16. The navigation device according to any one of Items 1 to 15. The guide route calculation means calculates a guide route that does not consider avoiding entry into the time-limited charging road area even though the user has set to avoid entering the time-charged road area. The navigation device according to claim 16, wherein a notification to that effect is sent to the user. When the guide route calculation means calculates a guide route to enter the time-limited charging road area even though the user has set to avoid entering the time-charged road area, The navigation device according to claim 16 or 17, wherein a notification to that effect is made. The navigation device according to any one of claims 1 to 18, wherein when a destination or waypoint in the time-limited charging road area is set, a notification to that effect is given to the user. The guide route calculation means does not consider entering an upper limit number of time-charged road regions out of a plurality of time-charged road regions, and avoids entry into other time-charged road regions. The navigation device according to claim 1, wherein the navigation device is calculated. The guide route calculating means does not consider entering a time-charged road area where the sum of the charges does not exceed the upper limit amount among a plurality of time-charged road areas, and enters another time-charged road area. The navigation device according to any one of claims 1 to 20, wherein a guide route that avoids the problem is calculated. In a storage medium for storing admission data indicating information on whether or not to enter a time-charged road area, which is a road area that is arranged so that entry in a vehicle during the payment target period is permitted by paying a fee in advance Based on the information that the fee for the payment target period of a certain time-charged road area has been paid, the content of the entry permission / prohibition data is rewritten so as to indicate that it is possible to enter the time-charged road area for the payment target period. Based on the fact that the entry availability data rewriting means and the entry availability data content indicates that entry into the time-charged road area is not possible at the present time, a guide route that avoids entry into the road area is calculated, Based on the fact that entry to the road area with the contents of the entry availability data indicates that it is currently possible to enter the road area, A program that causes a computer to function as guidance route calculation means for calculating a guidance route that is not considered to be avoided.

Images