Method, apparatus, device and computer-readable storage medium for navigation
By receiving navigation destination information and predicting the ease of parking, this solution addresses the problem that existing navigation applications cannot provide parking information around the destination, enabling users to select suitable destinations in advance and improving the practicality and user experience of navigation.
Patent Information
- Application Number
- CN201910878173.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2019-09-17
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2039-09-17
AI Technical Summary
Existing navigation apps cannot provide information on the ease of parking around the destination, making it impossible for users to determine in advance whether parking will be easy, especially when using points of interest as navigation destinations.
By receiving navigation destination information input by the user, the system determines the destination address associated with that destination and the parking availability information in the surrounding area, and predicts the parking status at future times. It then provides the user with information such as parking availability index or number of available parking spaces to help the user choose a suitable destination.
Users can know the parking situation around their destination in advance, make reasonable parking decisions, and improve the practicality of navigation and user experience.
Smart Images

Figure CN112528169B_ABST
Abstract
Description
Technical Field
[0001] Embodiments of the present disclosure relate to the field of navigation, and more particularly to a method, apparatus, device, and computer-readable storage medium for navigation. Background Art
[0002] Existing navigation applications usually only provide destination address information related to the navigation destination, but cannot provide information about whether parking is easy around the destination address. Although some parking lots can provide real-time parking information in some way to indicate the real-time parking status of the parking lot (such as the total number of parking spaces, the number of occupied parking spaces and / or the number of vacant parking spaces, etc.), such real-time parking information is usually not provided in navigation applications. Such real-time parking information is often only for some parking lots, and there are still a large number of parking lots that cannot provide such real-time parking information. In addition, such real-time parking information can only indicate the parking status of the parking lot at the current moment, but cannot predict or indicate the parking status of the parking lot in the future (for example, when the user arrives).
[0003] In addition, when using navigation applications, users often do not use a parking lot as the navigation destination, but rather use points of interest such as shopping malls and restaurants as the destination. Traditional solutions cannot provide information about the difficulty of parking around these points of interest. Therefore, users cannot determine whether it is easy to park around the destination before traveling. Summary of the invention
[0004] In view of the above problems, an exemplary embodiment of the present disclosure provides a solution for navigation. The solution not only provides a destination address associated with a navigation destination to a user, but also provides parking difficulty information around the destination address to the user, thereby helping the user to select a suitable destination address in advance and make effective parking decisions.
[0005] In a first aspect of the present disclosure, a method for navigation is provided. The method includes: receiving a first user input about a navigation destination from a user; determining at least one destination address associated with the navigation destination and parking difficulty information of its surroundings; and simultaneously providing the at least one destination address and the parking difficulty information of its surroundings to the user.
[0006] In some embodiments, determining the parking difficulty information includes: determining a time when the user arrives at the at least one destination address; and predicting the parking difficulty information around the at least one destination address at the time.
[0007] In some embodiments, said providing said at least one destination address and said parking difficulty information of its surroundings to said user simultaneously comprises: presenting said at least one destination address and said parking difficulty information of its surroundings to said user simultaneously.
[0008] In some embodiments, the parking difficulty information includes at least one of the following: an index indicating parking difficulty; and the number of vacant parking spaces.
[0009] In some embodiments, the method further includes: in response to the user selecting one of the at least one destination addresses based on the parking difficulty information, receiving a second user input from the user regarding the selected destination address; determining a navigation route from the user's current location to the selected destination address; and providing the navigation route to the user.
[0010] In some embodiments, the predicting of the parking difficulty information around the at least one destination address at the time includes: determining a parking area corresponding to the at least one destination address, the parking area including one or more parking lots around the at least one destination address; predicting the parking demand of the parking area at the time based on historical parking information of at least one parking lot at a historical time corresponding to the time; and predicting the parking difficulty information around each of the at least one destination address at the time based on the parking demand.
[0011] In some embodiments, predicting the parking demand of the parking area at the time includes: determining the historical parking demand of the at least one parking lot at the historical time based on the historical parking information; determining a mapping relationship between the historical parking demand and the spatial characteristics of the at least one parking lot; and predicting the parking demand of the parking area at the time based on the spatial characteristics of the parking area and the mapping relationship.
[0012] In some embodiments, the spatial feature includes at least one of the following: a distance from at least one point of interest; and a number of surrounding points of interest.
[0013] In some embodiments, the method further comprises: predicting parking difficulty information of each of the one or more parking lots at the time based on the parking demand, wherein the one or more parking lots include a parking lot that cannot provide historical parking information.
[0014] In a second aspect of the present disclosure, a device for navigation is provided. The device includes: a first receiving module configured to receive a first user input about a navigation destination from a user; a first determining module configured to determine at least one destination address associated with the navigation destination and parking difficulty information of its surroundings; and a first providing module configured to simultaneously provide the parking difficulty information of the at least one destination address and its surroundings to the user.
[0015] In some embodiments, the first determination module includes: a determination unit configured to determine the time when the user arrives at the at least one destination address; and a prediction unit configured to predict the parking difficulty information around the at least one destination address at the time.
[0016] In some embodiments, the first providing module includes: a presenting unit configured to simultaneously present the parking difficulty information of the at least one destination address and its surroundings to the user.
[0017] In some embodiments, the parking difficulty information includes at least one of the following: an index indicating parking difficulty; and the number of vacant parking spaces.
[0018] In some embodiments, the device also includes: a second receiving module, configured to receive a second user input regarding the selected destination address from the user in response to the user selecting one of the at least one destination addresses based on the parking difficulty information; a second determination module, configured to determine a navigation route from the user's current location to the selected destination address; and a second providing module, configured to provide the navigation route to the user.
[0019] In some embodiments, the prediction unit is further configured to: determine a parking area corresponding to the at least one destination address, the parking area including one or more parking lots around the at least one destination address; predict the parking demand of the parking area at the time based on historical parking information of at least one parking lot at a historical time corresponding to the time; and based on the parking demand, predict the parking difficulty information around each destination address of the at least one destination address at the time.
[0020] In some embodiments, the prediction unit is further configured to: determine the historical parking demand of the at least one parking lot at the historical time based on the historical parking information; determine the mapping relationship between the historical parking demand and the spatial characteristics of the at least one parking lot; and predict the parking demand of the parking area at the time based on the spatial characteristics of the parking area and the mapping relationship.
[0021] In some embodiments, the spatial feature includes at least one of the following: a distance from at least one point of interest; and a number of surrounding points of interest.
[0022] In some embodiments, the prediction unit is further configured to: predict parking difficulty information of each of the one or more parking lots at the time based on the parking demand, wherein the one or more parking lots include a parking lot that cannot provide historical parking information.
[0023] In a third aspect of the present disclosure, a device for navigation is provided. The device comprises: at least one processing unit; and at least one memory, the at least one memory being coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions, when executed by the at least one processing unit, causing the device to execute the method according to the first aspect of the present disclosure.
[0024] In a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a device, the device executes the method according to the first aspect of the present disclosure.
[0025] It can be seen from the above description that the solution for navigation according to the embodiment of the present disclosure not only provides the user with a destination address associated with the navigation destination, but also provides the user with parking difficulty information around the destination address. In addition, the solution can predict the parking difficulty information around the destination address when the user arrives at the destination address, thereby helping the user to select a suitable destination address in advance and make effective parking decisions.
[0026] It should be understood that the contents described in the summary of the invention are not intended to limit the key or important features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, wherein:
[0028] Figure 1 A block diagram illustrating an example environment according to an embodiment of the present disclosure is shown;
[0029] Figure 2 A flowchart illustrating an example method for navigation according to an embodiment of the present disclosure is shown;
[0030] Figure 3A block diagram showing an example system for determining parking difficulty information around at least one destination address at a specific time according to an embodiment of the present disclosure;
[0031] Figure 4 A flowchart showing an example method for determining parking difficulty information around at least one destination address at a specific time according to an embodiment of the present disclosure;
[0032] Figure 5 A schematic diagram showing a parking area divided according to an embodiment of the present disclosure is shown;
[0033] Figure 6 A flowchart showing an example method for predicting parking demand of a target parking area at a specific time according to an embodiment of the present disclosure is shown;
[0034] Figure 7 A schematic diagram of generating a time series model according to an embodiment of the present disclosure is shown;
[0035] Figure 8 A block diagram showing an example apparatus for navigation according to an embodiment of the present disclosure; and
[0036] Fig. 9 A block diagram of a computing device in which embodiments of the present disclosure may be implemented is shown. DETAILED DESCRIPTION
[0037] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.
[0038] In the description of the embodiments of the present disclosure, the term "including" and similar terms should be understood as open inclusion, that is, "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first", "second", etc. may refer to different or the same objects. Other explicit and implicit definitions may also be included below.
[0039] Figure 1 1 shows a block diagram of an example environment 100 according to an embodiment of the present disclosure. Figure 1As shown, the example environment 100 may generally include a user 110 and a navigation device 120. The navigation device 120 may include, but is not limited to, a mobile phone, a computer, a personal digital assistant, a game console, a wearable device, an in-vehicle communication device, a virtual reality device or an augmented reality device, etc. The navigation device 120 may provide input devices such as a touch screen and a keyboard for the user 110 to operate. In addition, the navigation device 120 may provide output devices such as a display and a speaker for providing information to the user 110. The navigation device 120 may also be equipped with a positioning device to determine its location. The navigation device 120 may be equipped with a navigation application for providing navigation services to the user 110.
[0040] Figure 2 2 shows a flowchart of a method 200 for navigation according to an embodiment of the present disclosure. For example, the method 200 may be performed as follows: Figure 1 The navigation device 120 shown in the figure performs. It should be understood that the method 200 may also include additional blocks not shown, and / or the blocks shown may be omitted. For example, in some embodiments, blocks 240-250 may be omitted. The scope of the present disclosure is not limited in this respect.
[0041] At block 210 , the navigation device 120 receives a user input (also referred to herein as a “first user input”) from the user 110 regarding a navigation destination.
[0042] In some embodiments, the navigation destination input by the user 110 may indicate the name of a certain point of interest to which the user is going. The "point of interest" mentioned herein may include restaurants, shopping centers, schools, parking lots, etc. For example, the navigation destination input by the user 110 may be "Wangfujing Bookstore", "Beijing Department Store", "Wangfujing Department Store Parking Lot", etc. Alternatively, in other embodiments, the navigation destination input by the user 110 may indicate the name of a certain area to which the user is going without specifically indicating a specific point of interest in the area, such as "Wangfujing", "Zhongguancun", etc.
[0043] At block 220 , the navigation device 120 determines at least one destination address associated with the navigation destination and parking difficulty information of the surrounding area.
[0044] In some embodiments, when the navigation destination input by the user 110 indicates the name of a certain point of interest, the navigation device 120 may determine the address of the point of interest (e.g., by querying a map) as the destination address. The navigation device 120 may further determine the parking difficulty information around the point of interest. For example, when the navigation destination input by the user 110 is "Beijing Department Store", the navigation device 120 may determine that the address of Beijing Department Store is No. 255 Wangfujing Street by querying a map, and further determine the parking difficulty information around Beijing Department Store.
[0045] Alternatively, in other embodiments, when the navigation destination input by the user 110 indicates the name of a certain area, the navigation device 120 may determine the corresponding addresses of one or more points of interest in the area as the destination address, and determine the parking difficulty information around each point of interest. For example, when the navigation destination input by the user 110 is "Wangfujing", the navigation device 120 may determine the corresponding addresses of one or more points of interest in the area (e.g., "Wangfujing Bookstore", "Wangfujing Snack Street", "Wangfujing Department Store Parking Lot", etc.) by querying the map, and further determine the parking difficulty information around these destination addresses.
[0046] In some embodiments, the parking difficulty information around the destination address may be represented as an index indicating the difficulty of parking around the destination address. For example, the higher the index, the higher the parking difficulty; conversely, the lower the index, the lower the parking difficulty. Further, the index may also be represented as a label. For example, when the index is above a certain threshold, the label may indicate "difficult parking"; and when the index is below a certain threshold, the label may indicate "easy parking". Additionally or alternatively, the parking difficulty information around the destination address may also indicate the number of empty parking spaces remaining in one or more parking lots around the destination address.
[0047] In some embodiments, the navigation device 120 may determine parking difficulty information around at least one destination address at the current time (e.g., the time point or time period when the user 110 inputs the navigation destination). Alternatively or additionally, in some embodiments, the navigation device 120 may determine the time (e.g., the time point or time period) when the user arrives at the at least one destination address from the current location of the user, and predict the parking difficulty information around the at least one destination address when the user arrives at the at least one destination address. The determination of parking difficulty information will be further described below in conjunction with Figure 3-7 Describe in detail.
[0048] At block 230 , the navigation device 120 provides the user 110 with the determined at least one destination address and parking difficulty information of its surroundings at the same time.
[0049] In some embodiments, the navigation device 120 may present the parking difficulty information of at least one destination address and its surroundings to the user 110 in a visual manner (e.g., graphically or in text). In some embodiments, the parking difficulty information may be presented in association with at least one destination address in an information link manner. In other embodiments, the navigation device 120 may also provide the determined parking difficulty information of at least one destination address and its surroundings to the user 110 in an audible manner (e.g., information broadcast) or in any other manner. The scope of the present disclosure is not limited in this respect.
[0050] In some embodiments, the user 110 can select the destination address to which he is going based on the parking difficulty information around at least one destination address. For example, the user 110 can select a destination address where parking is easier from multiple destination addresses as the destination to which he is going.
[0051] Additionally, at block 240, in response to the selection of the user 110, the navigation device 120 receives a user input (referred to herein as a "second user input") regarding the selected destination address from the user 110. At block 250, the navigation device 120 determines a navigation route from the current location of the user 110 to the selected destination address. At block 260, the navigation device 120 provides the navigation route to the user 110.
[0052] Figure 3 1 is a block diagram of an example system 300 for determining parking difficulty information around at least one destination address at a specific time according to an embodiment of the present disclosure. The system 300 can be implemented, for example, in Figure 1 At the navigation device 120 shown in FIG. Figure 2 The block 220 shown is used to determine parking difficulty information around at least one destination address at the current time or when the user arrives at at least one destination address. Figure 3 As shown, the example apparatus 300 may generally include a time series analysis unit 310 , a mapping relationship determination unit 320 , a parking demand prediction unit 330 , and a spatial interpolation unit 340 .
[0053] In some embodiments, the time series analysis unit 310 may obtain historical parking information 301 of at least one parking lot 350 at a historical time. The historical time may correspond to a specific time, which may be a historical time point or a historical time period. For example, when determining the parking difficulty information around at least one destination address during the period from 10:00 to 10:30 a.m. on Monday, the historical time may be 10:00 to 10:30 a.m. on Monday last week. For example, when determining the parking difficulty information around at least one destination address at 10:00 a.m. on Monday, the historical time may be 10:00 a.m. on Monday last week. The historical parking information 301 may include corresponding parking data of the parking lot 350 at each historical time point in the historical time (for example, when the historical time is a historical time period, the historical time point may be selected every 5 minutes or 10 minutes, etc.). For example, the parking data at each historical time point may include the number of occupied parking spaces, the number of available parking spaces, the occupied parking space (for example, area), and / or the available parking space, etc., of the parking lot 350 at the historical time point.
[0054] In some embodiments, the time series analysis unit 310 may perform a time series analysis on the acquired historical parking information 301 to obtain a time series model corresponding to at least one historical time point in the historical time. The time series model may describe a mapping relationship between a parking demand and a set of factors that cause the parking demand to change over time. The time series analysis unit 310 may use the obtained set of time series models to determine the historical parking demand 302 of the parking lot 350 at the historical time. The historical parking demand 302 may be an index indicating the difficulty of parking the parking lot 350 at the historical time (for example, the higher the index, the higher the difficulty of parking; conversely, the lower the index, the lower the difficulty of parking). The historical parking demand 302 may be provided to the mapping relationship determination unit 320.
[0055] In some embodiments, the mapping relationship determination unit 320 may obtain a set of spatial features 303 of the parking lot 350 and the historical parking demand 302 determined by the time series analysis unit 310. The spatial features 303 may include the distance from the parking lot 350 to one or more points of interest (e.g., transportation stations, shopping centers, etc.) and / or the corresponding number of various points of interest (e.g., schools, office buildings, tourist attractions, etc.) around the parking lot 350 (e.g., within a threshold distance). In some embodiments, the mapping relationship determination unit 320 may further determine a mapping relationship 304 between the parking demand of the parking lot and the spatial features of the parking lot based on the spatial features 303 and the historical parking demand 302. The mapping relationship 304 may be used to predict the parking demand of the parking area at a specific time, so the mapping relationship 304 is also referred to as a prediction model 304 hereinafter. The prediction model 304 may be provided to the parking demand prediction unit 330.
[0056] In some embodiments, the parking demand prediction unit 330 may determine a parking area 360 corresponding to the at least one destination address, hereinafter also referred to as a “target parking area 360”. For example, the target parking area 360 may be determined based on the navigation destination input by the user 110, and may include one or more parking lots around the at least one destination address associated with the navigation destination. For another example, as described below in conjunction with Figure 5 As described, the target parking area 360 may also be determined based on the division of a larger geographical area. In some embodiments, the parking demand prediction unit 330 may further determine a set of spatial features 305 of the target parking area 360. The spatial features 305 may correspond to the spatial features 303. For example, the spatial features 305 may include the distance from the target parking area 360 to one or more points of interest (e.g., transportation stations, shopping centers, etc.) and / or the corresponding number of various points of interest (e.g., schools, office buildings, tourist attractions, etc.) within the target parking area 360. The parking demand prediction unit 330 may use the prediction model 304 to predict the parking demand 306 of the target parking area 360 at a specific time (e.g., the current time when the user 110 inputs the navigation destination or the time when the user arrives at at least one destination address) based on the spatial features 305. Corresponding to the historical parking demand 302, the parking demand 306 may be an index indicating the parking difficulty of the target parking area 360 at the specific time. Corresponding to the historical parking demand 302 , the parking demand 306 may be an index indicating the difficulty of parking in the target parking area 360 at the specific time (for example, a higher index indicates a higher parking difficulty; conversely, a lower index indicates a lower parking difficulty). The parking demand 306 may be provided to the spatial interpolation unit 340 .
[0057] In some embodiments, the spatial interpolation unit 340 may predict the parking demand 307 of each sub-parking area in the target parking area 360 at a specific time by using a spatial interpolation technique based on the parking demand 306 of the target parking area 360. In some embodiments, each sub-parking area may correspond to a destination address. That is, the spatial interpolation unit 340 may predict the parking demand 307 around each of the at least one destination address at the specific time based on the parking demand 306 of the target parking area 360. For example, the parking demand 306 may be regarded as a parking difficulty index at the center of the target parking area 360. The parking demand 307 around each destination address at the specific time may be determined based on the parking demand 306 and the distance from the destination address to the center of the target parking area 360. Further, the parking difficulty information around each destination address may be generated based on the parking demand around each destination address. In some embodiments, each sub-parking area may correspond to a parking lot in the target parking area 360 (for example, a parking lot that can provide historical parking information or a parking lot that cannot provide historical parking information, which may be different from the parking lot 350). That is, the spatial interpolation unit 340 may predict the parking demand of each parking lot in the target parking area 360 at the specific time based on the parking demand 306 of the target parking area 360. For example, the parking demand of each parking lot at the specific time may be determined based on the parking demand 306 and the distance of the parking lot to the center of the target parking area 360.
[0058] Figure 4 4 is a flowchart showing an example method 400 for determining parking difficulty information around at least one destination address at a specific time according to an embodiment of the present disclosure. For example, the method 400 can be viewed as follows: Figure 2 An example implementation of block 220 is shown below. Figure 3 The method 400 will be described in detail.
[0059] At block 410, a target parking area 360 corresponding to at least one destination address is determined. In some embodiments, the target parking area 360 may be determined based on the navigation destination input by the user 110, for example, it may include one or more parking lots around at least one destination address associated with the navigation destination. Alternatively, in other embodiments, a geographic area (e.g., a city where the user 110 is located) including all parking lots accessible to the user 110 may be divided into a group of parking areas, and a parking area associated with at least one destination address in the group of parking areas is selected as the target parking area 360.
[0060] Figure 5A schematic diagram of determining a target parking area according to an embodiment of the present disclosure is shown. For example, Figure 5 It shows a plurality of parking lots (such as Figure 5 In some embodiments, a predetermined proportion (e.g., 20%) of parking lots may be randomly selected from the geographic area 500, such as Figure 5 520-6 (collectively or individually referred to as "parking lot 520") in the geographic area 500. In some embodiments, the geographic area 500 can be divided into a group of parking areas based on the selected parking lot 520, so that each parking lot 520 is included in a corresponding parking area, and the number of parking lots in each parking area 510 is lower than a predetermined threshold. Specifically, in some embodiments, a circular area can be placed with the position of each selected parking lot 520 as the center, and each circular area can be gradually expanded to include more parking lots until the two circular areas are tangent or the number of parking lots included in the circular area reaches a predetermined threshold. In this way, the geographic area 500 can be divided into a group of parking areas 510-1, 510-2...510-6 (collectively referred to as "parking areas 510" or "circular areas 510"), wherein parking lots in the same parking area have spatial similarities. For example, a parking area associated with at least one destination address among the parking areas 510-1, 510-2...510-6 can be selected as the target parking area 560.
[0061] Additionally or alternatively, in some embodiments, in order to achieve full coverage of the geographic area 500, one or more space segmentation points (such as Figure 5 By connecting these spatial segmentation points, the geographic area 500 can be segmented into a plurality of irregularly shaped parking areas. For example, a parking area associated with at least one destination address among these irregularly shaped parking areas can be selected as the target parking area 360.
[0062] Back to Figure 4 At block 420 , based on the historical parking information 301 of the parking lot 350 at the historical time, the parking demand 306 of the target parking area 360 at a specific time corresponding to the historical time is predicted.
[0063] Figure 6 1 is a flowchart showing an example method 600 for predicting parking demand at a target parking area at a specific time according to an embodiment of the present disclosure. For example, the method 600 can be viewed as follows: Figure 4 One example implementation of block 420 is shown.
[0064] At block 610 , based on the historical parking information 301 , the historical parking demand 302 of the parking lot 350 at the historical time is determined.
[0065] In some embodiments, the acquired historical parking information 301 may be subjected to a time series analysis to obtain a time series model corresponding to at least one historical time point in the historical time. The time series model may describe the mapping relationship between parking demand and a set of factors causing the parking demand to change over time. For the purpose of example, it is assumed that at least one historical time point included in the historical time is represented as {t i |i∈[1,M]}, where M represents the number of historical time points and M≥1.
[0066] In some embodiments, for each historical time point t i , the established time series model can be expressed as:
[0067] PD i =w1 i *PLD+w2 i *PLSR i +w3 i *PLCR i +w4 i *PLC i (1)
[0068] Among them, PD i Indicates the parking lot at historical time point t i Parking demand at the location; PLD, PLSR i , PLCR i and PLC i represents a set of factors that cause parking demand to change over time and w1 i 、w2 i 、w3 i and w4 i Indicates the weights of these factors. Specifically, PLD can represent the density of parking lots around the parking lot, which can be calculated as follows:
[0069]
[0070] Among them, Cnt m Indicates the number of parking lots within a smaller area (e.g., a circular, square, or arbitrarily shaped area) centered on the parking lot, and Cnt n Indicates the number of parking lots within a larger area centered on this parking lot. i It can be expressed as iThe ratio of the available space of the parking lot to the total available space of the surrounding parking lots (also referred to as “first ratio” in this article) can be calculated as follows:
[0071]
[0072] Among them, S i Indicates that the parking lot is at time t i Available space at Sr i (r∈[1,n]) represents the number of parking lots around the parking lot at time point t i The available space at the parking lot, and n represents the number of parking lots around the parking lot. i It can be expressed as i The ratio of the number of available parking spaces in the parking lot to the total number of available parking spaces in surrounding parking lots (also referred to as a “second ratio” herein) can be calculated, for example, as follows:
[0073]
[0074] Among them, C i Indicates that the parking lot is at time t i The number of available parking spaces, Cr i (r∈[1,n]) represents the number of parking lots around the parking lot at time point t i The number of available parking spaces at the parking lot, where n represents the number of parking lots around the parking lot. i It can be expressed as i The space utilization of the parking lot can be calculated as follows:
[0075]
[0076] It should be understood that the factors selected in formula (1) are only exemplary and are not intended to limit the scope of the present disclosure. In other embodiments, time series models can also be established based on other factors, not just those shown above.
[0077] In order to establish a time series model as shown in formula (1), it is necessary to determine the weight w1 of each factor i 、w2 i 、w3 i and w4 i In some embodiments, these weights may be initially set to default values, e.g., w1 i is 0.1, w2 i is 0.1, w3 i is 0.1, w4 iis 0.4. Based on each historical time point t of the parking lot 350 in the historical time period i The number of parking spaces actually occupied at (i∈[1,6]) Pd i Draw the initial curve, for example Figure 7 The initial curve 710 in FIG. 7 can be adjusted by adjusting the weight w1 i 、w2 i 、w3 i and w4 i To smooth the curve 710, a smoothed curve 720 is obtained. In this way, the weight w1 of each factor can be determined. i 、w2 i 、w3 i and w4 i It should be understood that the above-described method of determining the weight of each factor is only exemplary. In other embodiments, any known or future developed method (such as a random forest algorithm) may be used to determine the weight of each factor. In this way, it is possible to determine a mapping relationship between parking demand and a set of factors that cause parking demand to change over time.
[0078] After establishing the time series model shown in formula (1) and determining the weight of each factor, the historical parking demand 302 of the parking lot 350 at the historical time can be determined using formula (1). For example, for each historical time point t i , a set of factors PLD, PLSR that affect the parking demand of parking lot 350 can be determined i , PLCR i and PLC i Then, formula (1) can be used to determine the parking lot 350 at the historical time point t i Parking Demand PD i , for example, Figure 7 The smoothed curve 720 is shown in FIG. 8. In some embodiments, the historical parking demand 302 of the parking lot 350 in the historical time period can be determined by averaging the parking demands at multiple historical time points.
[0079] At block 620 , a mapping relationship 304 between the historical parking demand 302 and the spatial characteristics 303 of the parking lot 350 is determined.
[0080] In some embodiments, the spatial features 303 of the parking lot 350 may include the distance from the parking lot 350 to one or more points of interest (e.g., transportation stations, shopping centers, etc.) and / or the corresponding number of various points of interest (e.g., schools, office buildings, tourist attractions, etc.) around the parking lot 350 (e.g., within a threshold distance). Preferably, in some embodiments, the acquired spatial features 303 of the parking lot 350 may include the distance from the parking lot 350 to the subway station, the number of schools around the parking lot 350, the number of tourist attractions around the parking lot 350, and the distance from the parking lot 350 to the shopping center.
[0081] In some embodiments, the mapping relationship 304 (ie, the prediction model 304) between the historical parking demand 302 and the spatial characteristics 303 of the parking lot 350 can be expressed as:
[0082] PD=w1*Dsub+w2*Dsch+w3*Dm+w4*Na (6)
[0083] Wherein, PD represents parking demand, Dsub represents the distance to the subway station, Dsch represents the distance to the school, Dm represents the distance to the shopping center and Na represents the number of tourist attractions. It should be understood that the spatial features selected in formula (6) are only exemplary and are not intended to limit the scope of the present disclosure. In other embodiments, the prediction model 304 can also be established based on other spatial features, not just limited to those shown above.
[0084] In order to establish the prediction model 304 as shown in formula (6), it is necessary to determine the weights w1, w2, w3 and w4 of each spatial feature. In some embodiments, a linear regression algorithm can be used to determine the weights w1, w2, w3 and w4 of each spatial feature based on the historical parking demand 302 and the spatial feature 303. Alternatively, in some embodiments, any known or future developed method (such as a random forest algorithm) can be used to determine the weights w1, w2, w3 and w4 of each spatial feature.
[0085] In this way, a mapping relationship between parking demand and spatial characteristics of a parking area can be determined, which can reflect the association between parking demand and spatial characteristics and also take into account the association between parking demand and a group of factors that cause parking demand to change over time.
[0086] At block 630 , the parking demand 306 of the target parking area 360 at a specific time is predicted based on the spatial feature 305 of the target parking area 360 and the mapping relationship 304 .
[0087] In some embodiments, the spatial feature 305 may correspond to the spatial feature 303. For example, the spatial feature 305 may include the distance from the target parking area 360 to one or more points of interest (e.g., transportation stations, shopping centers, etc.) and / or the corresponding number of various points of interest (e.g., schools, office buildings, tourist attractions, etc.) within the target parking area 360. Preferably, in some embodiments, the acquired spatial feature 305 of the target parking area 360 may include the distance from the target parking area 360 to the subway station, the number of schools within the target parking area 360, the number of tourist attractions within the target parking area 360, and the distance from the target parking area 360 to the shopping center. In some embodiments, the parking demand 306 of the target parking area 360 at a specific time may be obtained by substituting the spatial feature 305 into the mapping relationship 304 shown in formula (6).
[0088] Back to Figure 4 At block 430 , based on the parking demand 306 of the target parking area 360 , a spatial interpolation method is used to predict parking difficulty information around each of the at least one destination address at the specific time.
[0089] In some embodiments, the parking demand 307 around each of the at least one destination address at the specific time can be predicted based on the parking demand 306 of the target parking area 360. For example, the parking demand 306 can be regarded as the parking difficulty index at the center of the target parking area 360. The parking demand 307 around each destination address can be determined based on the parking demand 306 and the distance of the destination address to the center of the target parking area 360. Further, the parking difficulty information around the destination address can be generated based on the parking demand around each destination address. In some embodiments, the parking difficulty information associated with the destination address can be generated based on the parking demand around each destination address to indicate the difficulty of parking around the destination address. Alternatively, a corresponding relationship between the parking demand and the number of parking spaces can be established, so as to convert the parking demand around each destination address into the number of available parking spaces around the destination address. That is, the parking difficulty information around each destination address can indicate the parking difficulty index around the destination address and / or the number of empty parking spaces around the destination address.
[0090] Additionally or alternatively, in some embodiments, the parking demand of each parking lot (e.g., a parking lot that can provide historical parking information or a parking lot that cannot provide historical parking information) in the target parking area 360 at the specific time may be predicted based on the parking demand 306 of the target parking area 360. For example, the parking demand of each parking lot at the specific time may be determined based on the parking demand 306 and the distance of the parking lot to the center of the target parking area 360. Similarly, parking difficulty information of the parking lot may be generated based on the parking demand of each parking lot at the specific time to indicate the difficulty of parking in the parking lot. The parking difficulty information of each parking lot may indicate an index of the parking difficulty of the parking lot and / or the number of vacant parking spaces in the parking lot.
[0091] It can be seen from the above description that the solution for navigation according to the embodiment of the present disclosure can solve various problems in the traditional solution. The solution not only provides the user with a destination address associated with the navigation destination, but also provides the user with parking difficulty information around the destination address, thereby helping the user to select a suitable destination in advance and make effective parking decisions.
[0092] Figure 8 FIG. 8 is a block diagram of an exemplary apparatus 800 for navigation according to an embodiment of the present disclosure. The apparatus 800 may be used to implement, for example, Figure 1 The navigation device 120 shown. Figure 8 As shown, the device 800 may include a first receiving module 810, configured to receive a first user input regarding a navigation destination from a user; a first determining module 820, configured to determine at least one destination address associated with the navigation destination and parking difficulty information of its surroundings; and a first providing module 830, configured to simultaneously provide the parking difficulty information of at least one destination address and its surroundings to the user.
[0093] In some embodiments, the first determination module 820 includes: a determination unit configured to determine the time when the user arrives at at least one destination address; and a prediction unit configured to predict parking difficulty information around the at least one destination address at the time.
[0094] In some embodiments, the prediction unit is further configured to: determine a parking area corresponding to at least one destination address, the parking area including one or more parking lots around the at least one destination address; predict the parking demand of the parking area at the time based on historical parking information of at least one parking lot at the historical time corresponding to the time; and based on the parking demand, predict the parking difficulty information around each destination address of at least one destination address at the time.
[0095] In some embodiments, the prediction unit is further configured to: determine the historical parking demand of at least one parking lot at a historical time based on historical parking information; determine the mapping relationship between the historical parking demand and the spatial characteristics of at least one parking lot; and predict the parking demand of the parking area at that time based on the spatial characteristics and mapping relationship of the parking area.
[0096] In some embodiments, the spatial feature includes at least one of the following: a distance from at least one point of interest; and a number of surrounding points of interest.
[0097] In some embodiments, the prediction unit is further configured to: predict parking difficulty information of each of one or more parking lots at a time based on parking demand, wherein the one or more parking lots include a parking lot that cannot provide historical parking information.
[0098] In some embodiments, the first providing module 830 includes: a presenting unit configured to simultaneously present at least one destination address and parking difficulty information of its surroundings to the user.
[0099] In some embodiments, the parking difficulty information includes at least one of the following: an index indicating parking difficulty; and the number of vacant parking spaces.
[0100] In some embodiments, the device 800 also includes: a second receiving module, configured to receive a second user input regarding the selected destination address from the user in response to the user selecting one of the at least one destination addresses based on the parking difficulty information; a second determination module, configured to determine a navigation route from the user's current location to the selected destination address; and a second providing module, configured to provide the navigation route to the user.
[0101] The modules and / or units included in the device 800 can be implemented in various ways, including software, hardware, firmware, or any combination thereof. In some embodiments, one or more units can be implemented using software and / or firmware, such as machine executable instructions stored on a storage medium. In addition to or as an alternative to machine executable instructions, some or all of the units in the device 800 can be implemented at least in part by one or more hardware logic components. As an example and not limitation, exemplary types of hardware logic components that can be used include field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.
[0102] Figure 8The modules and / or units shown in the can be partially or completely implemented as hardware modules, software modules, firmware modules or any combination thereof. In particular, in some embodiments, the processes, methods or procedures described above can be implemented by hardware in the storage system or a host corresponding to the storage system or other computing devices independent of the storage system.
[0103] Fig. 9 900 is a schematic block diagram of an example device 900 that can be used to implement an embodiment of the present disclosure. The device 900 can be used to implement the following Figure 1 The navigation device 120 shown. Fig. 9 As shown, the device 900 includes a central processing unit (CPU) 901, which can perform various appropriate actions and processes according to computer program instructions stored in a read-only memory (ROM) 902 or computer program instructions loaded from a storage unit 908 into a random access memory (RAM) 903. In the RAM 903, various programs and data required for the operation of the device 900 can also be stored. The CPU 901, the ROM 902, and the RAM 903 are connected to each other via a bus 904. An input / output (I / O) interface 905 is also connected to the bus 904.
[0104] A number of components in the device 900 are connected to the I / O interface 905, including: an input unit 906, such as a keyboard, a mouse, etc.; an output unit 907, such as various types of displays, speakers, etc.; a storage unit 908, such as a disk, an optical disk, etc.; and a communication unit 909, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 909 allows the device 900 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0105] The processing unit 901 performs the various methods and processes described above, such as methods 200, 400, and / or 600. For example, in some embodiments, methods 200, 400, and / or 600 may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 908. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 900 via the ROM 902 and / or the communication unit 909. When the computer program is loaded into the RAM 903 and executed by the CPU 901, one or more steps of the methods 200, 400, and / or 600 described above may be performed. Alternatively, in other embodiments, the CPU 901 may be configured to perform methods 200, 400, and / or 600 in any other suitable manner (e.g., by means of firmware).
[0106] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip systems (SOCs), load programmable logic devices (CPLDs), and the like.
[0107] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0108] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0109] In addition, although each operation is described in a specific order, this should be understood as requiring such operation to be performed in the specific order shown or in a sequential order, or requiring that all illustrated operations should be performed to obtain desired results. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single implementation in combination. On the contrary, the various features described in the context of a single implementation can also be implemented in multiple implementations individually or in any suitable sub-combination mode.
[0110] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.
Claims
1. A method for navigation, comprising: receiving first user input from a user regarding a navigation destination; determining at least one destination address associated with the navigation destination and parking difficulty information of its surroundings; as well as The at least one destination address and the parking difficulty information of its surrounding area are simultaneously provided to the user, wherein determining the parking difficulty information comprises: determining a time at which the user arrives at the at least one destination address; and Predicting the parking difficulty information around the at least one destination address at the time, including: determining a parking area corresponding to the at least one destination address and including one or more parking lots surrounding the at least one destination address; predicting a parking demand of the parking area at the time based on historical parking information of at least one parking lot, the historical parking information reflecting the parking demand of the at least one parking lot at a historical time corresponding to the time; and predicting parking difficulty information around each of the at least one destination address at the time based on the parking demand of the parking area at the time, The predicting of the parking demand of the parking area at the time comprises: Determining, based on the historical parking information, a historical parking demand of the at least one parking lot at the historical time; Determining a mapping relationship between the historical parking demand and the spatial characteristics of the at least one parking lot; and The parking demand of the parking area at the time is predicted based on the spatial feature of the parking area and the mapping relationship.
2. The method according to claim 1, wherein the at least one destination application number: 201910878173.6 The parking difficulty information of the address and its surroundings provided to the user at the same time includes: The parking difficulty information of the at least one destination address and its surroundings is simultaneously presented to the user.
3. The method according to claim 1 or 2, wherein the parking difficulty information includes at least one of the following: An index indicating the ease of parking; and Number of empty parking spaces.
4. The method according to claim 1 or 2, further comprising: in response to the user selecting one of the at least one destination address based on the parking difficulty information, receiving a second user input from the user regarding the selected destination address; determining a navigation route from the user's current location to the selected destination address; as well as The navigation route is provided to the user.
5. The method according to claim 1 or 2, wherein the spatial characteristics include at least one of the following: the distance to at least one point of interest; and The number of nearby points of interest.
6. The method according to claim 1 or 2, further comprising: Based on the parking demand, parking difficulty information of each of the one or more parking lots at the time is predicted, wherein the one or more parking lots include a parking lot that cannot provide historical parking information.
7. A device for navigation, comprising: A first receiving module is configured to receive a first user input about a navigation destination from a user; A first determination module is configured to determine at least one destination address associated with the navigation destination and parking difficulty information of its surroundings; as well as The first providing module is configured to simultaneously provide the parking difficulty information of the at least one destination address and its surroundings to the user, wherein the first determining module application number: 201910878173.6 include: a determining unit configured to determine a time when the user arrives at the at least one destination address; and a prediction unit configured to predict the parking difficulty information around the at least one destination address at the time, wherein the prediction unit is further configured to determine a parking area, the parking area corresponding to the at least one destination address and including one or more parking lots around the at least one destination address; predicting a parking demand of the parking area at the time based on historical parking information of at least one parking lot, the historical parking information reflecting the parking demand of the at least one parking lot at a historical time corresponding to the time; and predicting parking difficulty information around each of the at least one destination address at the time based on the parking demand of the parking area at the time, The prediction unit is further configured to: Determining, based on the historical parking information, a historical parking demand of the at least one parking lot at the historical time; Determining a mapping relationship between the historical parking demand and the spatial characteristics of the at least one parking lot; and The parking demand of the parking area at the time is predicted based on the spatial feature of the parking area and the mapping relationship.
8. The apparatus according to claim 7, wherein the first providing module comprises: A presentation unit is configured to present the parking difficulty information of the at least one destination address and its surroundings to the user at the same time.
9. The device according to claim 7 or 8, wherein the parking difficulty information includes at least one of the following: An index indicating the ease of parking; and Number of empty parking spaces.
10. The device according to claim 7 or 8, further comprising: The second receiving module is configured to respond to the user based on the parking difficulty application number: 201910878173.6 selecting one of the at least one destination address based on the information, and receiving a second user input from the user regarding the selected destination address; a second determination module configured to determine a navigation route from the user's current location to the selected destination address; as well as The second providing module is configured to provide the navigation route to the user.
11. The device according to claim 7 or 8, wherein the spatial characteristics include at least one of the following: the distance to at least one point of interest; and The number of nearby points of interest.
12. The apparatus according to claim 7 or 8, wherein the prediction unit is further configured to: Based on the parking demand, parking difficulty information of each of the one or more parking lots at the time is predicted, wherein the one or more parking lots include a parking lot that cannot provide historical parking information.
13. A device for navigation, comprising: at least one processing unit; as well as At least one memory, the at least one memory being coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions, when executed by the at least one processing unit, causing the device to perform the method according to any one of claims 1-6.
14. A computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a device, the device is caused to perform the method according to any one of claims 1 to 6.
Citation Information
Patent Citations
Navigation method for providing information of parking lot near destination
CN105987703A
Information processing method and device for parking
CN108154706A
Parking navigation method and relevant device
CN109615918A
Parking based route navigation
US20130268187A1
Parking Information Based on Destination
US20140278081A1
