Notification device, notification method, and program for notification

The notification device optimizes parking lot entrance and exit selection to minimize travel time by calculating movement costs and considering real-time traffic conditions, addressing the inefficiencies of existing navigation systems.

JP2024166229AInactive Publication Date: 2024-11-28PIONEER IP
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
JP2024152828
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Filing Date
2024-09-05
Publication Date
2024-11-28
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Existing navigation systems fail to consider the entire guide route to a destination, including the entrance and exit of parking lots, leading to longer travel times due to traffic congestion at exits adjacent to roads with traffic jams.

Method used

A notification device and method that determines optimal routes by considering the entrance and exit positions of parking lots, calculating movement costs, and notifying users of the best exit to take based on real-time traffic conditions.

Benefits of technology

This approach ensures users reach their destination more efficiently by avoiding congested exits, optimizing the entire guide route from the departure point through parking lots to the final destination.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024166229000001_ABST
    Figure 2024166229000001_ABST
Patent Text Reader

Abstract

To provide a notification device that can determine, even when a user moves via a parking lot having a plurality of exits, the optimal route as the entire guide route and notify the user of the determined route.SOLUTION: A notification device acquires a moving cost for a route from a departure place to parking lots that is a route from the departure place to a parking lot P1 and parking lot P2 having at least a plurality of exits O, a moving cost for routes to the plurality of exits O in the parking lot P1 and parking lot P2, and a moving cost for a route after leaving the parking lot through the exit O; determines the optimal guide route on the basis of the moving costs; and displays, from the guide route, at least a route from the departure place to the parking lots and a route inside the parking lots on a display 3.SELECTED DRAWING: Figure 2
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present application relates to the technical fields of a notification device, a notification method, and a notification program. More specifically, the present application relates to a notification device and a notification method that determine a route for guiding a movement to a destination through a parking lot and notify information about the guided route, and a program for the notification device. [Background technology]

[0002] In recent years, navigation devices that guide vehicles from a departure point to a destination have become widespread. Such navigation devices may be mounted on a vehicle itself, or may function as a navigation device by executing a navigation program on a terminal device carried by a vehicle user (i.e., the driver or a passenger). If there is a facility to be visited between the departure point and the destination, a guide route that passes through a parking lot associated with the facility is determined.

[0003] An example of such a conventional technology is the technology described in Patent Document 1 below. In the technology described in Patent Document 1, when the destination or intermediate point of the movement is a parking lot, the entrance of the parking lot is determined so as to provide the shortest guide route from the current location to the parking lot. Also, when the parking lot itself is the starting point, the exit of the parking lot is determined so as to provide the shortest route to the destination. That is, in the technology described in Patent Document 1 below, when a parking lot is determined as an intermediate point, the entrance of the parking lot that provides the shortest guide route from the current location is first determined, the route from the current location to the entrance is guided, and the vehicle is parked in the parking lot that has the entrance. After that, when the route from the parking lot to the destination is searched, naturally only the exit of the parking lot is selected, and the guide route from the exit to the destination is guided again. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] JP 2004-12425 A Summary of the Invention [Problem to be solved by the invention]

[0005] However, in the case of the technology described in the above Patent Document 1, for example, even if a long traffic jam occurs on the road connected to the exit to which the vehicle is guided before entering the parking lot, the vehicle enters the parking lot through the entrance, and as a result, the vehicle is forced to exit the road through the parking lot's exit, which results in a long journey. In other words, in the technology described in the above Patent Document 1, even if the parking lot is a stopover, the entire guide route to the final destination is not taken into consideration, and only the entrance that provides the shortest route from the current location to the parking lot's entrance is selected. Therefore, in this case, the entrance to the parking lot that only has an exit adjacent to a road that takes a long time to pass through is selected, which results in a long time to reach the destination.

[0006] Therefore, the present application has been made in consideration of the above-mentioned problems, and one example of the object of the application is to provide an alerting device and an alerting method, as well as a program for said alerting device, that are capable of determining an optimal overall guidance route from a starting point to a destination, even when traveling via a parking lot as a stopover, and of notifying a user of information regarding the guidance route. [Means for solving the problem]

[0007] In order to solve the above problem, the invention described in claim 1 comprises an acquisition means for acquiring departure point information indicating a departure point, first location information indicating a first location, and parking lot information indicating a parking lot having at least one entrance and a plurality of exits, the parking lot information including entrance position information indicating the position of the entrance and exit position information indicating the positions of each of the exits; a determination means for determining, when the first location is set as a destination, a route from the departure point through the parking lot to the first location based on the position of the departure point indicated by the acquired departure point information, the position of the first location indicated by the acquired first location information, the position of the entrance indicated by the entrance position information, and the positions of each of the plurality of exits indicated by the exit position information, and determining one exit from the plurality of exits as part of the determined route; and an alarm means for alarming the determined one exit, and is configured, when a second location different from the first location is set as a destination, the determination means for determining another exit different from the determined one exit as part of a route to the second location as a destination.

[0008] In order to solve the above problem, the invention described in claim 10 is a notification method executed in a notification device equipped with a notification means, comprising: an acquisition step of acquiring departure point information indicating a departure point, first point information indicating a first point, and parking lot information indicating a parking lot having at least one entrance and a plurality of exits, the parking lot information including entrance position information indicating a position of the entrance and exit position information indicating positions of each of the exits; and, when the first point is set as a destination, acquiring the position of the departure point indicated by the acquired departure point information, the position of the first point indicated by the acquired first point information, and the entrance position information indicating a position of each of the exits. The method includes a determination process for determining a route from the starting point to the first point via the parking lot based on the position of the entrance indicated by position information and the positions of each of the multiple exits indicated by the exit position information, and determining one exit from the multiple exits as part of the determined route, and an indication process for notifying the determined one exit using the indication means, and is configured such that when a second point different from the first point is set as a destination, in the determination process, another exit different from the determined one exit is determined as part of the route to the second point as a destination.

[0009] In order to solve the above problem, the invention described in claim 11 causes a computer to function as each of the means of the notification device described in any one of claims 1 to 9. [Brief description of the drawings]

[0010] [Figure 1] 1 is a block diagram showing a schematic configuration of an alarm device according to an embodiment; [Diagram 2] 1A and 1B are block diagrams showing a schematic configuration of a navigation device according to an embodiment, in which (a) is the block diagram, (b) is a conceptual diagram illustrating an example of the layout of parking lots and the like according to the embodiment, and (c) is a diagram illustrating the contents of an entrance / exit table according to the embodiment. [Diagram 3] 1A and 1B are a flowchart and the like showing a route determination operation according to an embodiment, in which FIG. 1A is the flowchart, and FIG. 1B is a diagram illustrating calculation of a travel cost according to the embodiment. [Figure 4] FIG. 2 is a conceptual diagram illustrating route determination according to an embodiment. [Diagram 5] 10A and 10B are conceptual diagrams illustrating an example of a route redetermining operation according to a first modified example, where (a) is the conceptual diagram, and (b) is a flowchart showing the route redetermining operation. [Figure 6] FIG. 11 is a conceptual diagram illustrating route determination according to a second modified example. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0011] Next, an embodiment of the present invention will be described with reference to Fig. 1. Fig. 1 is a block diagram showing a schematic configuration of a notification device according to the embodiment.

[0012] As shown in FIG. 1, a notification device S according to the embodiment includes an acquisition unit 1, a decision unit 2, and a notification unit 3.

[0013] In this configuration, the acquisition means 1 acquires departure point information indicating the departure point, first location information indicating a first location, and parking lot information indicating a parking lot having at least one entrance and multiple exits, the parking lot information including entrance location information indicating the location of the entrance and exit location information indicating the location of each of the exits.

[0014] When the first point is set as the destination, the determination means 2 determines a route from the departure point through the parking lot to the first point based on the position of the departure point indicated by the departure point information acquired by the acquisition means 1, the position of the first point indicated by the first point information acquired by the acquisition means 1, the position of the entrance indicated by the entrance position information, and the positions of each of the multiple exits indicated by the exit position information, and determines one exit from the multiple exits as part of the determined route.

[0015] Then, the notification means 3 notifies the user of the one exit determined by the determination means 2.

[0016] At this time, when a second point different from the first point is set as the destination, the determination means 2 determines another exit different from the one exit previously determined as part of the route to the second point as the destination.

[0017] As described above, according to the operation of the notification device S according to the embodiment, the starting point information, the first location information, and the parking lot information including the entrance position information and the exit position information are respectively acquired, and based on them, a route from the starting point to the parking lot to the destination with the first location as the destination and one exit constituting the route are determined, and the determined one exit is notified. Furthermore, when a second location different from the first location is set as the destination, another exit is determined as part of the route to the second location as the destination. Therefore, since the route to the destination is determined taking into consideration the positions of the entrance and the exit in a parking lot having multiple exits, it is possible to determine the optimal route as a whole to the destination and notify the user of information related thereto. EXAMPLES

[0018] Next, specific examples corresponding to the above-described embodiment will be described with reference to Figures 2 to 4. The examples described below are examples in which the present application is applied to route determination operations and notification operations in a navigation device that guides a vehicle along a guide route to a destination.

[0019] Fig. 2 is a block diagram showing a schematic configuration of a navigation device according to an embodiment, Fig. 3 is a flowchart showing a route determination operation according to an embodiment, and Fig. 4 is a conceptual diagram illustrating route determination according to an embodiment. In Fig. 2, the same component numbers as those of the respective components in the notification device S according to the embodiment shown in Fig. 1 are used for the respective components in the notification device S.

[0020] As shown in FIG. 2(a), the navigation device NV of the embodiment including the configuration as an example of the notification device S of the embodiment is composed of a processing unit 10 consisting of a CPU, a RAM (Random Access Memory) or a ROM (Read Only Memory), etc., a sensor unit 12 that detects the current position of the vehicle in which the navigation device NV is mounted (in other words, the current position of the navigation device NV itself) either autonomously or by using a GPS (Global Positioning System) or the like, a display 3 consisting of a liquid crystal display or the like and being an example of the notification means 3 of the embodiment, an operation unit 13 consisting of a touch panel, operation buttons or a remote control etc. provided on the surface of the display 3, and a recording unit 14 consisting of a hard disk, a RAM etc.

[0021] The processing unit 10 also includes a travel cost calculation unit 11, an interface 1 as an example of an acquisition means 1 according to the embodiment, and a route determination unit 2 as an example of a determination means 2 according to the embodiment. In this case, the travel cost calculation unit 11, the interface 1, and the route determination unit 2 may each be realized by a hardware logic circuit such as a CPU constituting the processing unit 10, or may be realized in software by the CPU or the like reading and executing a program corresponding to a flowchart showing a route determination operation described later. As shown by the dashed lines in FIG. 2(a), the interface 1, the route determination unit 2, and the display 3 correspond to the notification device S according to the embodiment.

[0022] In the above configuration, a map database (abbreviated as "map DB" in FIG. 2(a)) 15 according to the embodiment is pre-recorded in a non-volatile manner in the recording unit 14. This map database 15 is a map database used for the guidance operation in the navigation device NV according to the embodiment, and includes road data, intersection data, parking lot data, facility data, etc. The map database 15 also records an entrance / exit table TB according to the embodiment, which indicates the correspondence between the entrances and exits of the parking lots used in the above guidance operation.

[0023] Here, the entrance / exit table TB according to the embodiment will be specifically described with reference to FIG. 2(b) and FIG. 2(c). As shown in FIG. 2(b), it is assumed that there are two parking lots P1 and P2 associated with a facility U used by a user of a vehicle equipped with a navigation device NV. The facility U and the parking lots P1 and P2 are surrounded by roads R1 to R4, and the parking lot P1 has two entrances I1 and I2 and two exits O1 and O2. The parking lot P2 has an entrance I3 and an exit O3. In this case, the entrance / exit table TB shown in FIG. 2(c) is recorded in the map database 15 as the entrance / exit table TB corresponding to the parking lots P1 and P2. In the entrance / exit table TB shown in FIG. 2(c), it is described that the entrance I1 can use the exit O1 and the exit O2 to exit the parking lot P1, and the entrance I2 can also use the exit O1 and the exit O2. On the other hand, it is described that the entrance I3 can only use the exit O3 to exit the parking lot P2. In the following description, when describing matters common to the inlets I1 to I3, they will be collectively referred to simply as "inlet I." Similarly, when describing matters common to the outlets O1 to O3, they will be collectively referred to simply as "outlet O."

[0024] On the other hand, the sensor unit 12 detects the current position, generates current position data indicating the detected current position, and outputs the data to the processing unit 10. On the other hand, the operation unit 13 executes operations required for the navigation device NV to perform the route guidance operation according to the embodiment, and the operation unit 13 generates an operation signal corresponding to the operation and outputs the operation signal to the processing unit 10. Based on the operation signal, the processing unit 10 generally controls the route guidance operation according to the embodiment using the current position data, road data recorded in the map database 15, the entrance / exit table TB, and the like. At this time, temporary data required for the processing unit 10 to perform the route guidance operation is temporarily recorded in the recording unit 14, and the necessary map or guide route is presented to the user via the display 5. In addition, in the route guidance operation, the travel cost calculation unit 11 of the processing unit 10 calculates a travel cost required for determining a guide route to be presented to the user, and outputs the calculated travel cost to the route determination unit 2 via the interface 1.

[0025] Here, the above-mentioned "travel cost" refers to data for each link or node that indicates whether the so-called "link" or "node" constituting the above-mentioned road data, intersection data, or parking lot data, etc., recorded in the map database 15, is likely to be selected as a guide route (i.e., a guide route from the starting point to the destination for the user) that will ultimately be presented to the user. The travel cost is a value that changes depending on, for example, the distance, the time required, or the traffic congestion occurring at that time. The higher the travel cost, the less likely it is to be selected as the guide route, and the final guide route is selected as a route that has a series of links or nodes with as low a travel cost as possible. The travel cost calculation unit 11 calculates such a travel cost for each link or node, and outputs it to the route determination unit 2 via the interface 1.

[0026] Then, the route determination unit 2 adds up each travel cost calculated by the travel cost calculation unit 11, determines a guide route that includes the road or intersection (i.e., link or node) with the lowest total, and presents the determined guide route to the user via a display 3, etc.

[0027] Next, the route determination operation according to the embodiment, which is executed mainly by the processing unit 10, will be specifically described with reference to Figures 3 and 4. In the following embodiment, the route determination operation of a guide route presented to a user who departs from a departure point not shown in Figure 2(b), uses a facility U illustrated in Figure 2(b), and moves to a final destination (a destination different from the departure point) not shown in Figure 2(b) will be described.

[0028] For example, when a preset guide route determination operation is performed on the operation unit 13, the travel cost calculation unit 11 of the processing unit 10 initializes the value of the entrance parameter m, which is a natural number indicating each entrance I, with the total number of entrances ("3" in the case of the example shown in FIG. 2(b)) being the maximum value, as shown in FIG. 3(a) (step S1). Next, the processing unit 10 searches for one or more routes from the starting point to the entrance Im, for example, by a method similar to the conventional method (step S2), and then the travel cost calculation unit 11 calculates the travel cost CIm for each of the searched routes and temporarily records it in the recording unit 14 (step S3). Here, "entrance Im" refers to the m-th entrance in the parking lot P1 and the parking lot P2, and "travel cost CIm" refers to the travel cost of the route from the starting point to the entrance Im.

[0029] Next, the movement cost calculation unit 11 judges whether the current value of the entrance parameter m is the sum of the numbers of entrances I of the parking lots P1 and P2 (step S4). If the judgment in step S4 is that the current value of the entrance parameter m is smaller than the sum of the numbers of entrances I ("3" in this embodiment) (step S4; NO), the movement cost calculation unit 11 increments the value of the entrance parameter m by "1" (step S5) and returns to the operation of step S2.

[0030] On the other hand, if the current value of the entrance parameter m is the total number of the entrances I in the judgment of step S4 (step S4; YES), the travel cost calculation unit 11 then initializes the value of the exit parameter n, which is a natural number indicating each exit O, with the total number of exits O of each of the parking lots P1 and P2 ("3" in the case of the example shown in FIG. 2(b)) as the maximum value (step S6). Next, the processing unit 10 searches for one or more routes from the exit On to the destination, for example, by a method similar to the conventional method (step S7), and then the travel cost calculation unit 11 calculates the travel cost COn for each of the searched routes and temporarily records it in the recording unit 14 (step S8). Here, "exit On" refers to the n-th exit O in the parking lots P1 and P2, and "travel cost COn" refers to the travel cost of the route from the exit On to the destination.

[0031] Next, the travel cost calculation unit 11 judges whether the current value of the exit parameter n is the sum of the numbers of exits O of the parking lots P1 and P2 (step S9). If the judgment in step S9 is that the current value of the exit parameter n is smaller than the sum of the numbers of the exits O ("3" in this embodiment) (step S9; NO), the travel cost calculation unit 11 increments the value of the exit parameter n by "1" (step S10) and returns to the operation of step S7.

[0032] On the other hand, if it is determined in step S9 that the current value of the exit parameter n is the total number of the exits O (step S9; YES), the travel cost calculation unit 11 then calculates the travel cost Cmn of each route when moving from the entrance Im to the exit On for the entrance I and exit O of each of the parking lots P1 and P2, and temporarily records it in the recording unit 14 (step S11). Here, the "travel cost Cmn" refers to the travel cost of each route from the entrance Im to the exit On.

[0033] Then, the route determination unit 2 calculates the sum of each combination of the calculated travel cost CIm, travel cost COn, and each travel cost Cmn (step S12). Here, it is assumed that the total travel cost calculated by the operation of step 12 is the value illustrated in FIG. 3(b). In the example illustrated in FIG. 3(b), for example, the travel cost CI1 from the departure point to the entrance I1 is "1200", the travel cost CO1 from the exit O1 available from the entrance I1 to the destination is "3300", and the travel cost C11 from the entrance I1 to the exit O1 is "50", so the total travel cost from the departure point to the destination via the entrance I1 and the exit O1 is "4550".

[0034] Next, the route determination unit 2 determines the route with the smallest total travel cost calculated by the operation of step S12 as the guide route to be actually presented to the user (step S13), and displays it using, for example, the display 3. In the example shown in FIG. 3, the travel cost is the smallest when the vehicle is parked in the parking lot P1 from the departure point using the entrance I1, and then travels to the destination using the exit O1. Therefore, the route determination unit 2 determines this route as the guide route and presents it to the user. As a result, the display 3 displays a guide route using the entrance I1 → exit O1, as shown in, for example, FIG. 4. At this time, if the travel cost (CIm+Cmn+COn) of the entire guide route in each of the cases where a certain first point is set as the destination and the case where a second point different from the first point is set as the destination are different from each other, the guide route presented to the user is also different between the two cases. In these cases, the exit O included in the determined guide route may change between the case where the first point is set as the destination and the case where the second point is set as the destination.

[0035] Thereafter, the processing unit 10 judges whether or not to end the route guidance operation according to the embodiment, for example, when a predetermined ending operation is executed on the operation unit 13, or when the vehicle itself arrives at the destination (step S14). If the route guidance operation is not to be ended in the judgment of step S14 (step S14; NO), the processing unit 10 proceeds to the operation of step S1. On the other hand, if the route guidance operation is to be ended in the operation of step S14 (step S14; YES), the processing unit 10 ends the route guidance operation as it is.

[0036] As described above, according to the route guidance operation of the embodiment, the travel cost CIm from the departure point to the parking lot, the travel cost Cmn within each parking lot, and the travel cost COn from the parking lot to the destination are calculated, and based on these, a guide route including the route from the departure point to the parking lot, the route within the parking lot, and the route from the parking lot to the destination is determined and presented to the user. Therefore, since the guide route is determined taking into consideration the route within the parking lot and the route from the parking lot to the destination in a parking lot with multiple exits, it is possible to determine the optimal route as a whole guide route and present related information to the user.

[0037] More specifically, for example, in the case of parking lots P1 and P2 shown in FIG. 2(b), the parking lot P2 is closest in distance to the starting point, and the exit O1 of parking lot P1 is closest in distance to the destination. Meanwhile, assume that road R2 from which the exit O3 of parking lot P2 leaves and road R4 from which the exit O2 of parking lot P1 leaves are congested, and it takes time to pass through them. In this case, in the case of the technology described in the above Patent Document 1, the entrance I3 of parking lot P2, which is closest to the starting point, is simply selected, and the user ends up getting caught in a traffic jam when leaving the exit O3. In contrast, in the case of the route determination operation according to the embodiment, the route from the parking lot to the destination and the route within the parking lot are taken into consideration when determining the guide route, so even in the above case, a guide route including the entrance I1 and exit O1 of parking lot P1, which does not have a traffic jam after leaving the parking lot, is presented, and the user can move to the destination in a shorter time.

[0038] Furthermore, since the travel cost Cmn within each parking lot is calculated based on the entrance / exit table TB that indicates the relationship between the entrances I and the exits O, the travel cost Cmn can be calculated more accurately to determine the guide route.

[0039] In this case, even if the travel costs of the entire guided routes leading to different destinations are different from one another and the exits O included in each guided route are different as a result, the guided route to the destination is determined taking into consideration the positions of the entrance I and the exit O. As a result, the optimal route as a whole of the guided routes can be determined and related information can be notified to the user, just as in the above case.

[0040] [Variations] Next, modified examples corresponding to the embodiment will be described with reference to Fig. 5 and Fig. 6. Fig. 5 is a conceptual diagram illustrating a route redetermining operation according to a first modified example, and Fig. 6 is a conceptual diagram illustrating a route determination operation according to a second modified example. In the following description, when it is possible to cite the component numbers and the like used in the examples, they will be quoted as they are.

[0041] [First Modification] First, as a first modified example, in the same case as the example shown in Fig. 2(b), for example, when the guide route shown in Fig. 4 is presented, if for some reason the vehicle enters the parking lot P2 from the entrance I3 as shown in Fig. 5(a) and parks there, the guide route to the destination thereafter is automatically re-determined to include a route from the exit O3 as shown in Fig. 5, with reference to the entrance / exit table TB. In this first modified example, a route with a different exit O is presented compared to the guide route according to the embodiment presented initially.

[0042] Here, the route redetermining operation according to the first modified example will be explained in more detail with reference to Fig. 5(b). As shown in Fig. 5(b), the route redetermining operation according to the first modified example starts when the guide route illustrated in Fig. 4 is presented, by determining whether the vehicle position has deviated from the guide route illustrated in Fig. 4 at the entrance I of either the parking lot P1 or the parking lot P2 associated with the facility U to be used (step S20). In the following explanation of the first modified example and Fig. 5(b), the guide route illustrated in Fig. 4 will be simply referred to as the "original guide route".

[0043] If it is determined in step S20 that the location that has deviated from the original guidance route is not one of the entrances I mentioned above (step S20; NO. Specifically, for example, if the user has stopped at another store on the way to facility U), then the processing unit 10 determines that the route redetermining operation related to the first variant is unnecessary (step S30), and ends the redetermining operation and continues guidance using the original guidance route.

[0044] On the other hand, if the determination in step S20 indicates that the position deviated from the original guide route is one of the entrances I (step S20; YES), the processing unit 10 then determines whether or not the entrance I deviated from the original guide route is different from the entrance I on the original guide route (entrance I1 in the example shown in FIG. 5(a)) (step S21). If the determination in step S21 indicates that the entrances I are the same (step S21; NO), the processing unit 10 proceeds to the operation of the above step S30.

[0045] On the other hand, in the judgment of step S21, if the entrance I deviated from the original guide route is different from the entrance I on the original guide route (step S21; YES. In the example shown in FIG. 5(a), the entrance I1 and the entrance I3 are different), the route determination unit 2 next refers to the entrance / exit table TB and acquires from the map database 15 the exit data indicating the exit O associated with the entrance I deviated from the guide route (step S22). Then, the route determination unit 2 judges whether the exit O on the original guide route is included in the exit O indicated by the exit data acquired by the operation of step S22 (step S23). In the judgment of step S23, if the exit O indicated by the exit data is included in the exit O on the original guide route (step S23; YES), the processing unit 10 proceeds to the operation of the above step S30.

[0046] On the other hand, in the judgment of step S23, if the exit O indicated by the exit data does not include the exit O on the original guide route (step S23; NO. In the example shown in FIG. 5(a), the exit O3 is not included on the original guide route), the travel cost calculation unit 11 then initializes the value of the exit parameter n for the exit O associated with the entrance I off the original guide route in the entrance / exit table TB (step S24). Next, the processing unit 10 searches for one or more routes from the exit On to the destination in the same manner as in the embodiment (step S25), and then the travel cost calculation unit 11 calculates the travel cost COn for each of the searched routes and temporarily records it in the recording unit 14 (step S26).

[0047] Next, the travel cost calculation unit 11 judges whether the current value of the exit parameter n is the total number of exits O associated with the entrances I that deviate from the original guide route in the entrance / exit table TB (step S27). If it is judged in step S27 that the current value of the exit parameter n is smaller than the total number of the exits O (step S27; NO), the travel cost calculation unit 11 increments the value of the exit parameter n by "1" (step S28) and returns to the operation of the above step S25.

[0048] On the other hand, if it is determined in step S27 that the current value of the exit parameter n is the sum of the number of the above exits O (step S27; YES), the travel cost calculation unit 11 and the route determination unit 2 re-determine the guidance route so as to include a route to the destination with the smallest calculated travel cost COn (step S29), and then the processing unit 10 continues guidance using the re-determined guidance route.

[0049] In the route re-determination operation according to the first modified example shown in Fig. 5(a) as an example, since there is only one candidate for the new exit O, the exit O3, it is not necessary to calculate the travel cost Cmn according to the embodiment. However, if there are multiple candidates for the exit O associated with the entrance I that is off the original guidance route in the entrance / exit table TB, it is preferable to re-determine a new guidance route by taking into account the travel cost Cmn between the entrance I and the candidate exit O.

[0050] [Second modified example] As a second modified example, in the same case as the example shown in Fig. 2(b), when the guide route shown in Fig. 4 is presented, if for some reason the entrance I1 is passed as shown in Fig. 6, the guide route to the destination is re-determined by referring to the entrance / exit table TB to include a route via another entrance I2 → exit O1 of the parking lot P1 as shown in Fig. 6. In this second modified example, a route is presented in which the entrance I is different but the exit O remains the same compared to the guide route according to the embodiment presented initially.

[0051] [Third Modification] Furthermore, as a third modified example, when a parking lot on the route has multiple entrances I, the travel cost Cmn may be determined based on each of the distances between the multiple entrances I and multiple exits O. Specifically, when the sum (CIm+COn) of the travel cost CIm for each starting point-parking lot route corresponding to each entrance I and the travel cost COn for each parking lot-destination route corresponding to each exit O is the same, it is preferable to set the guidance route including a route in the parking lot that includes the entrance I and exit O that are closest to each other. In this case, since the guidance route is set including a route in the parking lot that includes the entrance I and exit O that are closest to each other, it is possible to set an optimal guidance route by, for example, minimizing the travel distance in the parking lot.

[0052] [Fourth Variation] Furthermore, as a fourth modified example, in the case where the parking lots P1 and P2 are parking lots associated with the facility U and the parking lot P1 has multiple entrances I (see FIG. 2(b)), the travel cost Cmn may be determined based on the sum of the distances from the multiple entrances I to the facility U and the distances from the facility U to multiple exits O. Specifically, when the sum (CIm+COn) of the travel cost CIm for each of the starting point-parking lot routes corresponding to each entrance I and the travel cost COn for each of the multiple parking lot-destination routes corresponding to each exit O is the same, it is preferable to set the guidance route by including a route in the parking lot including the entrance I and the exit O in which the sum of the distance between the entrance I and the facility U and the distance between the facility U and the exit is the shortest, for example, by referring to the parking lot data in the map database 15. In this case, the guidance route is set by including a route in the parking lot including the entrance I and the exit O in which the sum of the distance between the entrance I and the facility U and the distance between the facility U and the exit O is the shortest, so that the optimal guidance route can be set by including the entrance I or the exit O that is closest to the facility U to be used.

[0053] [Fifth Modification] As a fifth modification, when at least one of parking lots P1 and P2 is a multi-storey parking lot, the travel cost Cmn may be weighted so that the more floors there are, the less likely it is to be selected as part of the guide route, and then added to the other travel costs. In this case, it is possible to determine the optimal guide route by, for example, avoiding floors of parking lots that require a long travel distance.

[0054] [Sixth Modification] Furthermore, as a sixth modified example, when parking lot data includes parking position data indicating the location of a parking position (parking spot or parking space) and vacancy status data indicating the vacancy status, the travel cost Cmn may be configured to have a value that makes it more likely that a route in the parking lot P1 or P2 that has a shorter travel distance of the vehicle in the parking lot is selected as part of the guide route, based on the parking position data, etc. In this case, the optimal guide route can be determined by, for example, avoiding parking positions that have a longer travel distance.

[0055] [Seventh Variation] As a seventh modification, in the case of the sixth modification, a configuration may be made in which, based on the parking position data and the like, a route in the parking lot having a shorter travel distance between the entrance I or exit O and the parking position, and a shorter distance from the parking position to the facility U, has a value that makes it more likely to be selected as part of the guide route. In this case, for example, a route with the shortest travel distance for both the vehicle and the user can be determined as the optimal guide route.

[0056] [Eighth Modification] As an eighth modified example, at least one of the travel cost CIm, travel cost Cmn, and travel cost COn may be configured to have a value that makes it more difficult to select the more crowded the parking lot P1 or parking lot P2 is as part of the guide route, based on congestion information that indicates the congestion status of the parking lot P1 or parking lot P2 itself or the surrounding area. In this case, it is possible to determine an optimal guide route that avoids crowded parking lots.

[0057] [Other variations] As yet another modified example, for example, in the case of moving from home to facility U and then returning home, it is sufficient that at least the route from home (starting point) to the parking lot and the route within the parking lot are presented as the guide route presented to the user via the display 3. Even in this case, the return travel cost COn is calculated (although the corresponding route is not displayed on the display 3), and the optimal exit O is presented to the user based on this. In this case, the home corresponds to the "destination" in the embodiment. Furthermore, this embodiment and each modified example can be widely applied not only when the starting point is home, but also when the destination of the entire guide route is the same as the initial starting point.

[0058] Furthermore, for example, if map data for parking lot P1 or parking lot P2 (hereinafter simply referred to as “parking lot map data”) is recorded in the map database 15, it is preferable to provide guidance while displaying on the display 3 a map corresponding to the parking lot map data.

[0059] On the other hand, if the parking lot map data is not recorded, it is preferable to guide the user by displaying, for example, "the name of the exit O," "the exit for the direction of XX," or "the name of the road" that connects to the exit O on the display 3. At this time, the distance to the exit O to be used may be displayed in parallel.

[0060] Furthermore, similarly, when the parking lot map data is not recorded, a straight line mark and an arrow mark indicating the route from the current position detected by the sensor unit 12 to the exit O may be displayed, and the distance on the straight line mark may be displayed in parallel.

[0061] Furthermore, when displaying a route within a parking lot, it is preferable to display a map of the parking lot at a scale where the entrance I and exit O to be used fit within the same screen (in other words, they are displayed simultaneously).

[0062] Furthermore, when presenting the determined guide route to the user, not only the display using the display 3 but also audio output from a speaker (not shown) may be used in combination.

[0063] Furthermore, in the navigation device NV according to the embodiment, the map database 15 and the travel cost calculation unit 11 are built-in, but these may be provided in an external server device (not shown) and the necessary map data and the calculation results of each travel cost may be obtained via a network such as the Internet. In this case, even a portable terminal device or a so-called smartphone having low processing power or small storage capacity can realize the same functions as the navigation device NV according to the embodiment.

[0064] Furthermore, a program corresponding to the flowchart shown in FIG. 3(a) or FIG. 5(b) can be recorded on a recording medium such as an optical disk or a hard disk, or obtained via a network such as the Internet, and then read out and executed by a general-purpose microcomputer or the like, thereby causing the microcomputer or the like to function as the processing unit 10 according to the embodiment. [Explanation of symbols]

[0065] 1. Acquisition method (interface) 2. Decision means (route decision section) 3 Notification means (display) 10 Processing section 11 Travel cost calculation section 14 Recording section 15 Map Database TB Entrance / Exit Table P1, P2 parking lots U Facility I1, I2, I3 entrance O1, O2, O3 exit S Notification Device NV navigation equipment

Claims

[Claim 1] An acquisition means for acquiring departure point information indicating a departure point, first location information indicating a first location, and parking lot information indicating a parking lot having at least one entrance and a plurality of exits, the parking lot information including entrance location information indicating a location of the entrance and exit location information indicating a location of each of the exits; a determination means for determining, when the first point is set as a destination, a route from the departure point through the parking lot based on a position of the departure point indicated by the acquired departure point information, a position of the first point indicated by the acquired first point information, a position of the entrance indicated by the entrance position information, and the positions of each of the plurality of exits indicated by the exit position information, and determining one of the plurality of exits as part of the determined route; a notification means for notifying the determined one of the exits; Equipped with The notification device is characterized in that, when a second point different from the first point is set as the destination, the determination means determines another exit different from the determined one exit as part of a route to the second point as the destination.

Citation Information

Patent Citations

  • Route search device

    JP2011214877A

  • Information providing apparatus

    JP2004012425A