Information processing device and information processing program

Abstract

To improve convenience for a user relating to map data.SOLUTION: A data center comprises an execution section and a storage section. The execution section stores map data. The map data includes facility location information indicating a location of a specific facility and parking lot location information indicating locations of a plurality of parking lots associated with the specific facility. The execution section determines that a vehicle has been parked in any one of the parking lots. When the vehicle has been parked in the parking lot, the execution section determines an approach route for the vehicle to reach the parking lot and an approach direction toward the parking lot on the approach route. The execution section calculates the parking frequency of the vehicle parked in the parking lot for each combination of the approach route, the approach direction, and the parking lot. The execution section causes the storage section to store the parking frequency in association with the map data for each combination of the approach route, the approach direction, and the parking lot.SELECTED DRAWING: Figure 3

Description

Technical Field

[0001] The present invention relates to an information processing device Place, and an information processing program.

Background Art

[0002] The map data generation system of Patent Document 1 includes a terminal device and a map server. The terminal device determines the movement trajectory of the vehicle on which the terminal device is mounted based on the detection results of the GPS receiver and the acceleration sensor. Further, the terminal device identifies a deviation point where the vehicle has deviated from the road based on the determined movement trajectory. Furthermore, the terminal device identifies a drop-off point where the user has gotten off the vehicle after the vehicle has deviated from the road. In addition, the terminal device identifies an arrival point that the user has reached on foot after getting off the vehicle. Then, the terminal device transmits information regarding the deviation point, the drop-off point, and the arrival point to the map server. The map server that has received the information regarding the deviation point, the drop-off point, and the arrival point creates map data based on the aggregation result of these pieces of information. Specifically, the map server sets the deviation point in the map data as the vehicle entry point with respect to the arrival point. Also, the map server sets the drop-off point in the map data as the parking lot with respect to the arrival point.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] In the map data generation system described in Patent Document 1, the map data stored in the map server includes facilities and their parking lots. Therefore, by using this map data, when a user sets a specific facility as their destination, they can be guided to the parking lot of that facility. However, if there are multiple parking lots corresponding to a facility, the most convenient parking lot for the user will differ depending on the relative position of the user's current location to the facility. In the map data generation system described in Patent Document 1, information that takes such user convenience into consideration is not reflected in the map data. [Means for solving the problem]

[0005] An information processing device for solving the above problems comprises an execution unit and a storage unit, the storage unit storing map data, the map data including facility location information indicating the location of a specific facility and parking location information indicating the locations of a plurality of parking lots associated with the specific facility, and the execution unit performs the following: determine that a vehicle has been parked in one of the parking lots; when the vehicle is parked in the parking lot, determine the approach route the vehicle takes to reach the parking lot and the direction of approach to the parking lot on the approach route; calculate the parking frequency of the vehicle parked in the parking lot for each combination of the approach route, the direction of approach and the parking lot; and store data relating to the parking frequency in the storage unit, linked to the map data, for each combination of the approach route, the direction of approach and the parking lot.

[0006] According to the above configuration, parking frequency is calculated not for each individual parking lot, but for each combination of approach route, approach direction, and parking lot. The data on parking frequency for each combination is then stored in conjunction with map data, allowing for an understanding of which parking lots are most frequently used from which routes and directions. Therefore, when multiple parking lots exist for a specific facility, this improves user convenience by allowing users to identify the most convenient parking lot. [Brief explanation of the drawing]

[0007] [Figure 1] This is a schematic diagram of the information processing device. [Figure 2] This is a sequence diagram showing parking detection control and distribution control. [Figure 3] This is a flowchart showing the control for creating combined data. [Figure 4] This is a flowchart showing the control for creating excluded data. [Figure 5] This is a flowchart showing the selection control. [Figure 6] This is a flowchart showing the change control. [Figure 7] This is an explanatory diagram showing a specific facility and multiple parking lots. [Modes for carrying out the invention]

[0008] <Outline configuration of the information processing device> An embodiment of the present invention will be described below with reference to Figures 1 to 7. First, the general configuration of the information processing device 100 will be described.

[0009] As shown in Figure 1, the information processing device 100 is equipped with multiple vehicles 10. A vehicle 10 is, for example, a car owned by a user. Note that Figure 1 shows only one vehicle 10 as a representative example.

[0010] Vehicle 10 is equipped with a vehicle speed sensor 31, a GNSS receiver 32, and a display 36. The vehicle speed sensor 31 detects the vehicle speed SP, which is the speed of vehicle 10. The GNSS receiver 32 detects the position coordinates PZ, which are the coordinates of the point where vehicle 10 is located, by communicating with GNSS satellites (not shown). GNSS stands for Global Navigation Satellite System. The display 36 can display various types of information. The display 36 is also a touch panel display. Therefore, the user can input various types of information via the display 36.

[0011] Vehicle 10 is equipped with a control device 20. The control device 20 acquires various signals from the vehicle speed sensor 31, the GNSS receiver 32, and the display 36. The control device 20 also outputs control signals to the display 36 when displaying various information on the display 36.

[0012] The control device 20 comprises an execution unit 21, a storage unit 22, and a communication unit 23. The communication unit 23 can communicate with external devices of the vehicle 10 via a communication network 200. The storage unit 22 stores information acquired by the control device 20. The storage unit 22 also pre-stores various programs. Furthermore, the storage unit 22 pre-stores map data DM. The map data DM includes information about roads and information about multiple facilities around roads. The road information is, for example, link data connecting two different coordinates. The facility information includes information about a specific facility Z and information about multiple parking lots P associated with the specific facility Z. The information about the specific facility Z is facility location information indicating the location of the specific facility Z. The information about the parking lots P is parking lot location information indicating the location of the parking lots P. Here, each parking lot P includes multiple parking spaces. Therefore, multiple vehicles 10 can be parked in each parking lot P. The execution unit 21 executes various processes by reading programs from the storage unit 22. In this embodiment, one of the programs stored in the storage unit 22 constitutes a part of an information processing program executed by the information processing device 100. Therefore, the execution unit 21 executes a part of the processing performed by the information processing program. An example of the execution unit 21 is a CPU.

[0013] As shown in Figure 1, the information processing device 100 includes a data center 50. An example of the data center 50 is a so-called server. The data center 50 includes an execution unit 51, a storage unit 52, and a communication unit 53. The communication unit 53 can communicate with devices outside the data center 50 via a communication network 200. The storage unit 52 stores information acquired by the data center 50. The storage unit 52 also stores various programs in advance. Furthermore, the storage unit 52 also stores map data DM in advance. Note that, due to the execution of distribution control described later, the map data DM in the storage unit 52 matches the map data DM in the storage unit 22. The execution unit 51 executes various processes by reading the programs in the storage unit 52. That is, the programs in the storage unit 52 constitute a part of the information processing program executed by the information processing device 100. Therefore, the execution unit 51 executes some of the processes executed by the information processing program. Note that an example of the execution unit 51 is a CPU.

[0014] <Parking detection control> Next, the parking determination control performed by the control device 20 of the vehicle 10 and the data center 50 will be described. The parking determination control is performed between the control devices 20 of multiple vehicles 10 and one data center 50. The control device 20 of the vehicle 10 performs the parking determination control once each time the vehicle 10 starts moving.

[0015] As shown in Figure 2, when the execution unit 21 of the control device 20 starts parking determination control, it executes the process in step S11. In step S11, the execution unit 21 of the control device 20 determines that the vehicle 10 has been parked in one of the parking lots P. For example, the execution unit 21 of the control device 20 determines that the vehicle 10 has been parked in one of the parking lots P based on information about the behavior of the vehicle 10, such as the vehicle speed SP and position coordinates PZ, and the map data DM. For example, the execution unit 21 determines that the vehicle 10 has been parked in a parking lot P if it satisfies conditions such as the position coordinates PZ matching the parking lot location information of the parking lot P stored in the map data DM, and the vehicle speed SP being zero for a predetermined period of time or longer. After step S11, the execution unit 21 of the control device 20 proceeds to step S12. In other words, the execution unit 21 of the control device 20 proceeds to step S12 when the vehicle 10 has been parked in a parking lot P.

[0016] In step S12, the execution unit 21 of the control device 20 determines the approach path RA and the direction of approach to the parking lot P on the approach path RA when the vehicle 10 reaches the parking lot P. For example, the execution unit 21 of the control device 20 determines the approach path RA as the path from the point where the vehicle 10 was located a certain period of time prior to the parking lot P, based on the history of the position coordinates PZ from a certain period of time prior to the vehicle 10 being parked in the parking lot P. Also, for example, the execution unit 21 of the control device 20 determines the direction of approach to the parking lot P on the approach path RA as the direction of approach DA, based on the above history of the position coordinates PZ. After step S12, the execution unit 21 of the control device 20 proceeds to step S13.

[0017] In step S13, the execution unit 21 of the control device 20 transmits the collected data DX, which is information combining the approach route RA, the approach direction DA, and the parking lot P where the vehicle 10 is parked, to the data center 50. In other words, every time the vehicle 10 parks in the parking lot P, the execution unit 21 of the control device 20 transmits the collected data DX, which is information combining the approach route RA, the approach direction DA, and the parking lot P, outside the vehicle 10. Then, when the data center 50 receives the collected data DX from the control device 20, the execution unit 51 of the data center 50 can determine that the vehicle 10 has parked in any of the parking lots P. Also, the execution unit 51 of the data center 50 can determine the approach route RA when the vehicle 10 reaches the parking lot P and the approach direction DA to the parking lot P on the approach route RA. Furthermore, the execution unit 51 of the data center 50 stores the collected data DX in the storage unit 52. Note that in FIG. 2, it is illustrated that the collected data DX is transmitted from one vehicle 10 to the data center 50, but actually, a plurality of vehicles 10 transmit the collected data DX to the data center 50 in parallel. After step S12, the data center 50 ends the current parking determination control.

[0018] <Combined Data Creation Control> Next, the combined data creation control executed by the data center 50 will be described. The data center 50 repeatedly executes the combined data creation control at a predetermined period determined in advance. Here, an example of the predetermined period is about several days to several tens of days.

[0019] As shown in FIG. 3, when starting the combined data creation control, the execution unit 51 of the data center 50 executes the process of step S21. In step S21, based on a plurality of collected data DX, the execution unit 51 of the data center 50 calculates the first parking frequency FA, which is the parking frequency of the vehicle 10 parking in the parking lot P for the first reference period TA for each combination of the approach route RA, the approach direction DA, and the parking lot P. Here, the parking frequency of the vehicle 10 indicates the frequency with which the vehicle 10 parks in the parking lot P during a predetermined period for the parking lot P that can be used with the same approach route RA and approach direction DA.

[0020] For example, as shown in FIG. 7, assume that for a specific facility Z, six parking lots P, i.e., the first parking lot PA to the sixth parking lot PF, are associated. Among the six parking lots P, the first parking lot PA to the third parking lot PC can be reached by using a left path RAL located to the left of FIG. 7 with respect to the specific facility Z. Also, when reaching the first parking lot PA to the third parking lot PC using the left path RAL, there are cases of reaching with the downward direction in FIG. 7 as the traveling direction and reaching with the upward direction as the traveling direction. Therefore, the execution unit 51 calculates the first parking frequency FA for the combination of "parking lot P is the first parking lot PA, approaching path RA is the left path RAL, and approaching direction DA is downward". Similarly, the execution unit 51 calculates the first parking frequency FA for the combination of "parking lot P is the first parking lot PA, approaching path RA is the left path RAL, and approaching direction DA is upward".

[0021] In the present embodiment, when calculating the first parking frequency FA, the execution unit 51 counts the number of corresponding data for each combination of the approaching path RA, approaching direction DA, and parking lot P from the collected data DX of the acquired first reference period TA. Also, the execution unit 51 counts the total number of corresponding data for the approaching path RA and approaching direction DA that are the same as the target combination from the collected data DX of the acquired first reference period TA. Then, the execution unit 51 calculates the first parking frequency FA by dividing the number of data corresponding to the combination of the approaching path RA, approaching direction DA, and parking lot P by the total number of data corresponding to the same approaching path RA and approaching direction DA. Note that above, the first parking lot PA was used as an example for explanation, but the execution unit 51 calculates the first parking frequency FA for all combinations of the parking lot P, approaching path RA, and approaching direction DA. And the execution unit 51 stores the calculated first parking frequencies FA in the storage unit 52. In the present embodiment, an example of the first reference period TA is a period from several months before the time point of the process in step S21. As shown in FIG. 3, after step S21, the execution unit 51 proceeds with the process to step S22.

[0022] As shown in Figure 3, in step S22, the execution unit 51 calculates a correction value V based on the first parking frequency FA. Specifically, the execution unit 51 calculates a larger correction value V the higher the first parking frequency FA is. Here, a larger correction value V indicates a higher evaluation. And the larger the correction value V, the higher the final evaluation score SB, which will be described later. The execution unit 51 calculates a correction value V for each combination of approach route RA, approach direction DA, and parking lot P. After step S22, the execution unit 51 proceeds to step S23.

[0023] In step S23, the execution unit 51 obtains the reference evaluation score SA. In this embodiment, the storage unit 52 has pre-stored the reference evaluation score SA corresponding to each parking lot P. Therefore, the execution unit 51 obtains the reference evaluation score SA by accessing the storage unit 52. Here, the reference evaluation score SA is a value stored in the storage unit 52 that becomes larger the shorter the distance between the entrance / exit DW of the specific facility Z and the parking lot P. Note that the larger the reference evaluation score SA, the higher the final evaluation score SB, which will be described later. Specifically, in the example shown in Figure 7, the distance between the center position of each parking lot P and the center position of the entrance / exit DW is shorter in the order of the first parking lot PA, the second parking lot PB, and the third parking lot PC. Therefore, the reference evaluation score SA is also larger in the order of the first parking lot PA, the second parking lot PB, and the third parking lot PC. As shown in Figure 3, after step S23, the execution unit 51 proceeds to step S24.

[0024] As shown in Figure 3, in step S24, the execution unit 51 calculates the final evaluation score SB based on the reference evaluation score SA and the correction value V. In this embodiment, the execution unit 51 uses the sum of the reference evaluation score SA and the correction value V as the final evaluation score SB. The execution unit 51 calculates the final evaluation score SB for each combination of approach route RA, approach direction DA, and parking lot P. After step S24, the execution unit 51 proceeds to step S25.

[0025] In step S25, the execution unit 51 generates combination data DC, which is information that associates the combination of approach route RA, approach direction DA, and parking lot P with the final evaluation point SB corresponding to that combination. The execution unit 51 then stores the combination data DC in the storage unit 52, linked to the map data DM. As mentioned above, the final evaluation point SB is based on the first parking frequency FA. Therefore, to rephrase the process in step S25, in step S25, the execution unit 51 stores the data related to the first parking frequency FA in the storage unit 52, linked to the map data DM, for each combination of approach route RA, approach direction DA, and parking lot P. After step S25, the execution unit 51 terminates the combination data creation control for this step.

[0026] <Exclusion Data Creation Control> Next, we will describe the exclusion data creation control performed by the data center 50. The data center 50 repeatedly performs the exclusion data creation control at predetermined control cycles. Here, an example of a control cycle is several milliseconds to several seconds.

[0027] As shown in Figure 4, when the execution unit 51 of the data center 50 starts the exclusion data creation control, it executes the process of step S31. In step S31, the execution unit 51 of the data center 50 calculates the second parking frequency FB, which is the parking frequency of vehicles 10 parked in parking lot P for the second reference period TB, for each combination of approach route RA, approach direction DA, and parking lot P. The processing content of step S31 is the same as the processing content of step S21 described above, except for the period for which the parking frequency is calculated. In this embodiment, an example of the second reference period TB is the period from the time of processing in step S31 to several tens of minutes prior. Therefore, the second reference period TB is a shorter period than the first reference period TA. Also, the start date of the second reference period TB is later than the start date of the first reference period TA. Furthermore, the end date of the second reference period TB is after the end date of the first reference period TA. Therefore, the second parking frequency FB reflects the situation for a period closer to the time of processing in step S31, that is, the current parking frequency, compared to the first parking frequency FA. After step S31, the execution unit 51 proceeds to step S32.

[0028] In step S32, the execution unit 51 determines whether a predetermined exclusion condition is met for each combination of approach route RA, approach direction DA, and parking lot P. For example, the execution unit 51 determines that the exclusion condition is met if both of the following two conditions are met.

[0029] Condition (1): The second parking frequency FB is lower than the first parking frequency FA. Condition (2): The difference between the second parking frequency FB and the first parking frequency FA is greater than or equal to a predetermined specified difference.

[0030] For example, suppose a parking lot P becomes unavailable due to some factor such as being full or under construction. In this case, even if the first parking frequency FA is high, the second parking frequency FB will decrease sharply. In such cases, the exclusion condition described above is met. After step S32, the execution unit 51 proceeds to step S33.

[0031] In step S33, the execution unit 51 stores in the storage unit 52, as exclusion data DE, information indicating whether a parking lot P is excluded or not for each combination of approach route RA, approach direction DA, and parking lot P. Specifically, the execution unit 51 designates all combinations that include a parking lot P that satisfies the exclusion conditions in step S32 as combinations to be excluded. On the other hand, if there are no parking lot Ps that satisfy the exclusion conditions in step S32, all combinations are excluded from the exclusion list. After step S33, the execution unit 51 terminates the exclusion data creation control for this instance.

[0032] <Delivery control> Next, the distribution control performed by the data center 50 and the control devices 20 of the vehicles 10 will be described. The distribution control is performed in parallel between one data center 50 and the control devices 20 of multiple vehicles 10. The data center 50 performs distribution control whenever one or more of the map data DM, combined data DC, and exclusion data DE are updated.

[0033] As shown in Figure 2, when the execution unit 51 of the data center 50 starts distribution control, it executes the process in step S35. In step S35, the execution unit 51 of the data center 50 sends a campaign notification NC to the control device 20 of the vehicle 10. This campaign notification NC is intended to inform the user of the vehicle 10, etc., that there are software updates related to the information processing device 100, such as map data DM, combined data DC, and exclusion data DE.

[0034] Upon receiving the campaign notification NC, the execution unit 21 of the control device 20 executes the process in step S36. In step S36, the execution unit 21 of the control device 20 displays an option on the display 36 asking whether or not to accept the software update. If acceptance is not obtained from the user, the execution unit 21 of the control device 20 displays the above option on the display 36 at regular intervals. If acceptance is obtained from the user, the execution unit 21 of the control device 20 proceeds to step S37.

[0035] In step S37, the execution unit 21 of the control device 20 sends a request notification NR to the data center 50. This request notification NR is intended to inform the execution unit 51 of the data center 50 that it has accepted the update of the map data DM, the combined data DC, and the exclusion data DE.

[0036] Upon receiving the request notification NR, the execution unit 51 of the data center 50 executes the process in step S38. In step S38, the execution unit 51 of the data center 50 transmits the map data DM, the combination data DC, and the exclusion data DE to the control device 20 of the vehicle 10. The execution unit 21 of the control device 20, upon receiving the map data DM, the combination data DC, and the exclusion data DE, stores the map data DM, the combination data DC, and the exclusion data DE in the storage unit 22. If the storage unit 22 already stores the map data DM, the combination data DC, and the exclusion data DE, the execution unit 21 overwrites them with new map data DM, the combination data DC, and the exclusion data DE. After that, the execution unit 21 of the control device 20 terminates the current distribution control.

[0037] <Selection control> Next, the selection control performed by the control device 20 of the vehicle 10 will be described. For example, each time a user sets a specific facility Z as the destination of the vehicle 10 by operating the display 36, the control device 20 of the vehicle 10 performs selection control once.

[0038] As shown in Figure 5, when the execution unit 21 of the control device 20 starts selection control, it executes the process in step S41. In step S41, the execution unit 21 searches for a guidance route RG from the current position of the vehicle 10 to each parking lot P associated with a specific facility Z, and a guidance direction DG along the guidance route RG, based on map data DM and position coordinates PZ, etc. In searching for the guidance route RG and guidance direction DG, the execution unit 21 searches in a way that satisfies predetermined conditions, such as minimizing the travel distance. After step S41, the execution unit 21 proceeds to step S42.

[0039] In step S42, the execution unit 21 accesses the storage unit 22 to obtain the combination data DC stored in association with the map data DM. The execution unit 21 then extracts the combination data DC from among the multiple combination data DCs that matches the combination of guidance route RG and guidance direction DG. Specifically, the execution unit 21 extracts the matching combination data DC when the combination of approach route RA and approach direction DA in the combination data DC matches the combination of guidance route RG and guidance direction DG in the vicinity of the specific facility Z. For example, as shown in Figure 7, suppose the combination of guidance route RG and guidance direction DG in the vicinity of the specific facility Z matches the combination in the multiple combination data DCs where "approach route RA is the left-hand route RAL, and approach direction DA is downward." In this case, the execution unit 51 extracts the combination data DC for "approach route RA is the left-hand route RAL, approach direction DA is downward, and parking lot P is the first parking lot PA." Furthermore, the execution unit 51 extracts combination data DC for "approach route RA is left-hand route RAL, approach direction DA is downward, and parking lot P is second parking lot PB". In addition, the execution unit 51 extracts combination data DC for "approach route RA is left-hand route RAL, approach direction DA is downward, and parking lot P is third parking lot PC". As shown in Figure 5, after step S42, the execution unit 21 proceeds to step S43.

[0040] As shown in Figure 5, in step S43, the execution unit 21 selects one combination data DC from the combination data DC extracted in step S42. Specifically, the execution unit 21 obtains the exclusion data DE by accessing the storage unit 22. Based on the exclusion data DE, the execution unit 21 identifies the remaining combination data DCs from the combination data DCs extracted in step S42, excluding the combination data DCs containing the parking lot P that are to be excluded. Then, based on the final evaluation score SB included in the combination data DCs, the execution unit 21 selects the combination data DC with the highest final evaluation score SB from the identified combination data DCs. As mentioned above, the final evaluation score SB is based on the first parking frequency FA. Therefore, to rephrase the process in step S43, in step S43, the execution unit 21 selects one combination data DC from the combination data DCs extracted in step S42 based on the first parking frequency FA. After step S43, the execution unit 21 proceeds to step S44.

[0041] In step S44, the execution unit 21 sets the parking lot P, which is included in the combination data DC selected in step S43, as the destination for the vehicle 10. The execution unit 21 also searches for the final guidance route RG and guidance direction DG based on the approach route RA and approach direction DA included in the combination data DC selected in step S43 and the set destination. The execution unit 21 then outputs the final guidance route RG and guidance direction DG as the navigation result to the specific facility Z. Specifically, the execution unit 21 outputs a control signal to the display 36. As a result, the display 36 displays the navigation result based on the control signal.

[0042] <Change control> Next, the change control performed by the control device 20 of vehicle 10 will be described. When the control device 20 of vehicle 10 finishes selection control, the control device 20 of vehicle 10 repeatedly performs change control. Also, when the control device 20 determines that vehicle 10 has been parked in the designated parking lot P, the control device 20 terminates change control.

[0043] As shown in Figure 6, when the execution unit 21 of the control device 20 starts change control, it executes the process in step S51. In step S51, the execution unit 21 determines whether the vehicle 10 has reached the destination parking lot P based on the map data DM and position coordinates PZ, etc. Specifically, the execution unit 21 determines that the vehicle 10 has reached the destination parking lot P if the vehicle 10 is within a predetermined range relative to the center position of the destination parking lot P. An example of a predetermined range is a few meters to a dozen meters. If the execution unit 21 determines in step S51 that the vehicle 10 has not reached the destination parking lot P (S51: NO), the execution unit 21 executes the process in step S51 again. On the other hand, if the execution unit 21 determines in step S51 that the vehicle 10 has reached the destination parking lot P (S51: YES), the execution unit 21 proceeds to step S52.

[0044] In step S52, the execution unit 21 determines, based on the map data DM and position coordinates PZ, whether the vehicle 10 has driven without parking in the designated parking lot P. Specifically, the execution unit 21 determines that the vehicle 10 has driven without parking in the designated parking lot P if the vehicle 10 leaves a predetermined range that is set in advance with respect to the center position of the designated parking lot P. In this embodiment, the predetermined range in step S52 is the same as the predetermined range in step S51. If the execution unit 21 does not determine in step S52 that the vehicle 10 has driven without parking in the designated parking lot P (S52: NO), the execution unit 21 executes the process in step S51 again. On the other hand, if the execution unit 21 determines in step S52 that the vehicle 10 has driven without parking in the designated parking lot P (S52: YES), the execution unit 21 proceeds to step S53.

[0045] In step S53, the execution unit 21 changes the destination to a different parking lot P from the one in step S52 that is associated with the specific facility Z. Specifically, the execution unit 21 extracts parking lots P that are available via the same approach route RA and approach direction DA from among the multiple parking lots P associated with the specific facility Z. The execution unit 21 then identifies the parking lot P closest to the vehicle 10's position at the time of processing in step S53, using the same approach route RA and approach direction DA. Finally, the execution unit 21 sets the identified parking lot P as the new destination.

[0046] For example, as shown by the solid arrow in Figure 7, let's assume that vehicle 10 is traveling along the leftward route RAL, located to the left in Figure 7, with the approach direction DA being downward in Figure 7, relative to the specific facility Z. Let's assume that the parking lot P that was not used in step S52 is the first parking lot PA. At this time, the execution unit 21 extracts the second parking lot PB and the third parking lot PC from among the six parking lots P associated with the specific facility Z, excluding the first parking lot PA, as parking lots P that can be used along the same approach route RA and approach direction DA. The execution unit 21 then identifies the second parking lot PB as the parking lot P closest to the vehicle 10's position at the time of processing in step S53. The execution unit 21 then sets the identified second parking lot PB as the new destination. As shown in Figure 6, after step S53, the execution unit 21 proceeds to step S54.

[0047] As shown in Figure 6, in step S54, the execution unit 21 searches for a new guidance route RG and guidance direction DG based on the approach route RA and approach direction DA used in step S53 and the destination set in step S53. The execution unit 21 then outputs the new guidance route RG and guidance direction DG as the navigation result to the specific facility Z. Specifically, the execution unit 21 outputs a control signal to the display 36. As a result, the display 36 displays the navigation result based on the control signal.

[0048] <Operation of this embodiment> As shown in Figure 2, in parking determination control, the execution unit 21 of the control device 20 transmits collected data DX, which is information combining approach path RA, approach direction DA, and parking lot P, to the data center 50. The data center 50 then acquires the collected data DX from the control devices 20 of multiple vehicles 10. As a result, the storage unit 52 of the data center 50 can store a large amount of collected data DX. Furthermore, as shown in Figure 3, in combination data creation control, the execution unit 51 calculates a first parking frequency FA for each combination of approach path RA, approach direction DA, and parking lot P based on multiple collected data DX in the first reference period TA. The execution unit 51 also calculates a final evaluation point SB for each combination based on the first parking frequency FA. Furthermore, the execution unit 51 generates combination data DC, which is information associating the combination of approach path RA, approach direction DA, and parking lot P with the final evaluation point SB corresponding to that combination. The execution unit 51 then stores the combination data DC in the storage unit 52, linked to the map data DM.

[0049] <Effects of this embodiment> (1) In this embodiment, the first parking frequency FA used to calculate the final evaluation score SB of the combination data DC is calculated not for each parking lot P, but for each combination of approach route RA, approach direction DA, and parking lot P. By storing the data on the first parking frequency FA for each combination in conjunction with the map data DM, it is possible to understand which parking lot P is most likely to be used by which route and from which direction. Therefore, when there are multiple parking lots P for a specific facility Z, it is possible to understand which parking lot P is most likely to be used, thereby improving convenience for the user.

[0050] (2) As shown in Figure 5, in selection control, the execution unit 21 of the control device 20 sets parking lot P as the destination of the vehicle 10 based on the final evaluation score SB which takes into account the first parking frequency FA. Here, the higher the first parking frequency FA calculated for each approach route RA and approach direction DA, the more frequently the target parking lot P is parked in by users. In other words, the higher the first parking frequency FA of the target parking lot P, the more convenient that parking lot P tends to be for users. Therefore, based on the first parking frequency FA, ​​parking lot P which is convenient for users is more likely to be set as the destination.

[0051] (3) As shown in Figure 3, in the combination data creation control, the execution unit 51 of the data center 50 calculates the final evaluation score SB using not only the correction value V based on the first parking frequency FA, ​​but also the reference evaluation point SA. Here, the reference evaluation point SA is a value that reflects the distance between the entrance / exit DW of the specific facility Z and the parking lot P. This allows, for example, parking lot P, which is convenient because it is close to the entrance / exit DW of the specific facility Z, to be set as the destination.

[0052] (4) For example, as shown by the solid arrow in Figure 7, suppose that vehicle 10 is traveling along the left-hand route RAL located to the left of Figure 7 with respect to a specific facility Z, with the approach direction DA being downwards in Figure 7. Here, if parking lots 1 to 3 PC are available, the first parking frequency FA corresponding to parking lot 1 PA will be relatively high. However, if parking lot 1 PA is unavailable or difficult to use due to some factor, the current parking frequency corresponding to parking lot 1 PA tends to be lower. In other words, the second parking frequency FB in the second reference period TB will be considerably lower than the first parking frequency FA in the first reference period TA.

[0053] As shown in Figure 4, in the exclusion data creation control, the execution unit 51 of the data center 50 determines whether the exclusion conditions are met, namely that the second parking frequency FB is lower than the first parking frequency FA, ​​and the difference between the second parking frequency FB and the first parking frequency FA is greater than or equal to a specified difference. The execution unit 51 of the data center 50 also creates exclusion data DE for parking lots P that meet the exclusion conditions. Then, as shown in Figure 5, in the selection control, the execution unit 21 of the control device 20 sets parking lot P as the destination of the vehicle 10 after excluding the parking lot P that is to be excluded based on the exclusion data DE. This prevents parking lot P, which is currently unavailable, from being set as the destination in the selection control.

[0054] (5) Due to some factor, for example, vehicle 10 may continue driving away from parking lot PA 1, which was its destination, without parking in it. In this case, at that point, parking lot PA 1 may not be convenient for the user of vehicle 10.

[0055] In this regard, as shown in Figure 6, in the change control, if the vehicle 10 drives without parking in the first parking lot PA which was the destination, the execution unit 21 of the control device 20 changes the destination to a different parking lot P from the one where the vehicle did not park. This prevents a situation where the first parking lot PA continues to be guided as the destination even though the driver does not want to park there for some reason.

[0056] (6) In change control, if the vehicle is not parked in the parking lot P which was the original destination, the execution unit 21 of the control device 20 extracts parking lots P that are available along the same approach path RA and approach direction DA. The execution unit 21 of the control device 20 then sets the parking lot P that is closest to the vehicle 10's position along the same approach path RA and approach direction DA as the new destination. In other words, the execution unit 21 of the control device 20 changes the new destination to a parking lot P other than the one that was not parked in, in order along the approach direction DA. This eliminates the need for the user to move the vehicle 10 in a direction opposite to the approach direction DA.

[0057] <Example of changes> This embodiment can be implemented with the following modifications. This embodiment and the following modifications can be combined with each other to the extent that they do not contradict each other technically.

[0058] In the above embodiment, the parking determination control may be modified. For example, the timing at which the control device 20 transmits the collected data DX to the data center 50 may be changed. Specifically, when the control device 20 terminates its operation, the execution unit 21 of the control device 20 may transmit the collected data DX to the data center 50.

[0059] For example, the data that the control device 20 transmits to the data center 50 may be changed. Specifically, the execution unit 21 of the control device 20 may transmit only information related to the behavior of the vehicle 10, such as the vehicle speed SP and position coordinates PZ, to the data center 50. In this case, the execution unit 51 of the data center 50 can determine whether the vehicle 10 has been parked in one of the parking lots P based on the information related to the behavior of the vehicle 10, such as the vehicle speed SP and position coordinates PZ, and the map data DM. The execution unit 51 of the data center 50 can also determine the approach route RA and approach direction DA based on the history of the position coordinates PZ. The execution unit 51 of the data center 50 can then create collected data DX, which is information combining the approach route RA, approach direction DA, and parking lot P.

[0060] • In the above embodiment, the combination data creation control may be modified. For example, the value indicated by the standard evaluation score SA may be changed. Specifically, the standard evaluation score SA may be a value that takes into account, in addition to or instead of, the distance between the entrance / exit DW of the specific facility Z and the parking lot P, the size of the parking lot P, the width of the passageway at the entrance / exit of the parking lot P, the distance of the passageway at the entrance / exit of the parking lot P, etc.

[0061] For example, the execution unit 51 of the data center 50 does not need to use the reference evaluation score SA. That is, the execution unit 51 of the data center 50 may calculate the final evaluation score SB based only on the first parking frequency FA.

[0062] In the above embodiment, the exclusion data creation control may be modified. For example, the exclusion conditions may be changed. Specifically, the execution unit 51 of the data center 50 may determine that the exclusion conditions are met if one or more of conditions (1) and (2) are met.

[0063] In the above embodiment, the control for creating excluded data may be omitted. For example, depending on the specific facility Z being targeted, there may be few opportunities for a large difference to occur between the second parking frequency FB in the second reference period TB and the first parking frequency FA in the first reference period TA. In this case, the impact of omitting the exclusion data creation control is small.

[0064] • In the above embodiment, the distribution control may be modified. For example, the timing of the distribution control may be changed. Specifically, if the user has given prior consent for the software update to be performed automatically, the data center 50 may repeatedly perform the distribution control at predetermined control cycles. In this case, in step S36, the execution unit 21 of the control device 20 may proceed to step S37 without displaying the options on the display 36.

[0065] • In the above embodiment, the selection control may be modified. For example, in step S43, the execution unit 21 of the control device 20 may select a combination data DC from the identified combination data DC that has the second highest evaluation score SB, based on the final evaluation score SB included in the combination data DC. As an example, suppose the difference between the first-highest-rated final evaluation score SB and the second-highest-rated final evaluation score SB is relatively small, and the second parking frequency FB for the parking lot P corresponding to the second-highest-rated final evaluation score SB is low. In this case, the vacancy rate of the parking lot P corresponding to the second-highest-rated final evaluation score SB may be high. That is, the parking lot P corresponding to the second-highest-rated final evaluation score SB may be highly convenient for the user.

[0066] For example, if the exclusion data creation control is omitted as described above, in step S43, the execution unit 21 of the control device 20 may set parking lot P as the destination of the vehicle 10 without excluding parking lot P based on the exclusion data DE.

[0067] • In the above embodiment, the change control may be modified. For example, the predetermined range in step S51 may be narrower than the predetermined range in step S52.

[0068] • In the above embodiment, change control may be omitted. For example, if the need for change control is low, the execution unit 21 of the control device 20 does not need to perform change control.

[0069] • In the above embodiment, the configuration of the information processing device 100 may be changed. For example, the information processing device 100 does not need to have a data center 50. Specifically, by having the control devices 20 of multiple vehicles 10 communicate with each other, each execution unit 21 of the control device 20 can perform combined data creation control, etc.

[0070] In the above embodiment, focusing only on the vehicle 10, it is effective for the execution unit 21 of the control device 20 to perform only the processing of steps S11 and S12, and the processing of transmitting the collected data DX to the outside in step S13, in the parking determination control. Specifically, if the above processing allows an external device such as a data center 50 to acquire multiple collected data DX, the external device such as the data center 50 can calculate a first parking frequency FA based on the collected data DX. The external device such as the data center 50 can then create combined data DC including the calculated first parking frequency FA. [Explanation of Symbols]

[0071] Z...Specific facilities 10... Vehicles 20...Control device 21…Executive Department 22...Storage section 23… Communications Department 31…Vehicle speed sensor 32…GNSS receiver 36…Display 50...Data center 51…Executive Department 52...Storage section 53... Communications Department 100... Information Processing Device 200... Communication Network

Claims

1. It comprises an execution unit and a storage unit, The aforementioned storage unit stores map data. The aforementioned map data includes facility location information indicating the location of a specific facility, and parking location information indicating the locations of multiple parking lots associated with the specific facility. The execution unit is, To determine that a vehicle has been parked in one of the aforementioned parking lots, When the vehicle is parked in the parking lot, the approach route taken by the vehicle to reach the parking lot and the direction of approach to the parking lot along the approach route are determined. For each combination of the aforementioned approach route, approach direction, and parking lot, the frequency of parking of the vehicle in the parking lot is calculated. For each combination of the aforementioned approach route, approach direction, and parking lot, the data relating to the parking frequency is stored in the storage unit in association with the map data. Execute, The execution unit is, When the aforementioned specific facility is set as the destination of the aforementioned vehicle, The process involves searching for a guidance route from the vehicle's current location to each of the parking lots associated with the specified facility, and the direction of guidance along that guidance route. From the combinations stored in the memory unit, extract the combination that matches the combination of the guide path and the guide direction, From the extracted combinations, one of the above combinations is selected based on the parking frequency, The selected combination includes the parking lot as the destination, and the navigation result to the specified facility is output based on the approach route and approach direction included in the selected combination. Execute Information processing device.

2. The execution unit is, From the combinations extracted, select the one with the highest parking frequency. Execute The information processing apparatus according to claim 1.

3. The memory unit stores the evaluation score for each parking lot. The aforementioned evaluation score is given as the shorter the distance between the entrance / exit of the specified facility and the parking lot, the higher the evaluation score. The execution unit is, For each of the above combinations, a correction value is calculated that is evaluated more highly the higher the parking frequency. Selecting the combination that yields the highest evaluation based on the evaluation score for the parking lot and the correction value for the combination, Execute The information processing apparatus according to claim 1.

4. The period during which the parking frequency stored in the memory unit in conjunction with the aforementioned map data is calculated is defined as the first reference period. When a period shorter than the first reference period is designated as the second reference period, The start date of the second reference period is later than the start date of the first reference period. The end of the second reference period is after the end of the first reference period. The execution unit is, For the second reference period, the frequency of parking of the vehicle in the parking lot is calculated for each combination of the approach route, the approach direction, and the parking lot. For each combination of the approach route, the approach direction, and the parking lot, it is determined whether the exclusion conditions are met, such that the parking frequency in the second reference period is lower than the parking frequency in the first reference period, and the difference between the parking frequency in the second reference period and the parking frequency in the first reference period is greater than or equal to a predetermined specified difference. From the extracted combinations, one of the above combinations is selected after excluding the combinations that satisfy the exclusion conditions. Execute The information processing apparatus according to claim 1.

5. The execution unit is, After outputting the navigation results to the specified facility, it is determined whether the vehicle has reached the parking lot designated as the destination, After determining whether or not the vehicle reached the parking lot, it is determined whether or not the vehicle drove without parking in the parking lot. If it is determined that the vehicle drove without parking in the aforementioned parking lot, the system outputs a navigation result with a different parking lot associated with the specified facility as the new destination, which is different from the parking lot in which the vehicle was not parked. Execute The information processing apparatus according to claim 1.

6. An information processing program executed by an information processing device comprising an execution unit and a storage unit, The aforementioned storage unit stores map data. The aforementioned map data includes facility location information indicating the location of a specific facility, and parking location information indicating the locations of multiple parking lots associated with the specific facility. The execution unit, To determine that a vehicle has been parked in one of the aforementioned parking lots, When the vehicle is parked in the parking lot, the approach route taken by the vehicle to reach the parking lot and the direction of approach to the parking lot along the approach route are determined. For each combination of the aforementioned approach route, approach direction, and parking lot, the frequency of parking of the vehicle in the parking lot is calculated. For each combination of the aforementioned approach route, approach direction, and parking lot, the data relating to the parking frequency is stored in the storage unit in association with the map data. Make it run, The execution unit, When the aforementioned specific facility is set as the destination of the aforementioned vehicle, The process involves searching for a guidance route from the vehicle's current location to each of the parking lots associated with the specified facility, and the direction of guidance along that guidance route. From the combinations stored in the memory unit, extract the combination that matches the combination of the guide path and the guide direction, From the extracted combinations, one of the above combinations is selected based on the parking frequency, The selected combination includes the parking lot as the destination, and the navigation result to the specified facility is output based on the approach route and approach direction included in the selected combination. Make it run Information processing program.

Images