Includes route recommendation methods, electronic devices, and storage media for parking planning.

Abstract

This application proposes a route recommendation method, electronic device, and storage medium that includes parking planning, belonging to the field of parking planning technology. When there are no available parking spaces at the target parking lot at the destination and there is a queue to enter, the method can solve the parking difficulties in popular parking lots such as scenic spots, hospitals, and sports venues by recommending at least one of the following: the route with the highest recommendation value, the route carrying advertising information, and the route carrying a link to claim benefits. This can be combined with consideration of advertising placements by third-party merchants and resource rights granted by the government, carrying relevant information during the recommendation process. This can divert parking demand from popular parking lots to nearby vacant parking lots, effectively alleviating parking pressure in popular parking lots and increasing the utilization rate of surrounding parking lots, thus bringing more operational benefits. At the same time, third-party merchants can also benefit from precise advertising placement. Furthermore, it helps users choose the most suitable route for themselves.

Description

Technical Field

[0001] This application relates to the field of parking planning technology, and more particularly to a route recommendation method, electronic device, and storage medium that includes parking planning. Background Technology

[0002] Currently, while electronic maps can display the locations of nearby parking lots, they cannot provide information on available parking spaces. Drivers arriving at a parking lot are unsure of availability, which can easily lead to situations where they arrive at their destination but are unable to park. In such cases, drivers can only wait to enter or go to another parking lot. However, since they cannot know the availability of spaces in other parking lots, they may need to visit multiple parking lots, causing considerable inconvenience and wasting time. Summary of the Invention

[0003] The main objective of this application is to propose a route recommendation method, electronic device, and storage medium that includes parking planning. When it is detected that there are no available parking spaces in the target parking lot and a queue is required to enter, the method recommends at least one feasible solution that includes parking planning to the user. This can divert the parking demand of the popular target parking lot to the surrounding vacant parking lots, effectively alleviate the parking pressure of the target parking lot, solve the traffic congestion problem, and also improve the utilization rate of the surrounding parking lots.

[0004] To achieve the above objectives, a first aspect of this application proposes a route recommendation method including parking planning, the method comprising:

[0005] When it is detected that the target parking lot of the destination has no available parking spaces and there is a queue to enter, search for all parking lots around the destination.

[0006] From all parking lots around the destination, select available parking lots with vacant spaces as candidate parking lots to obtain a candidate parking lot set;

[0007] A set of planned paths is obtained by acquiring the planned path corresponding to each candidate parking lot in the candidate parking lot set. The planned path is the path from the current location to the candidate parking lot and then to the destination.

[0008] Based on the time, cost, and number of transfers for each of the planned routes, a recommended value is calculated for each of the planned routes.

[0009] The advertising information is matched and analyzed with the candidate parking lots to bind the advertising information with the corresponding planned route;

[0010] Based on the attribute information of the candidate parking lots, the benefit claim link is bound to the corresponding planned path;

[0011] At least one of the following is selected from the set of planned paths: the planned path with the highest recommendation value, the planned path carrying the advertising information, and the planned path carrying the benefit redemption link.

[0012] In one embodiment of this application, calculating the recommended value for each planned route based on the time spent, cost, and number of transfers for each planned route includes:

[0013] Obtain the time, cost, and number of transfers for each of the planned routes;

[0014] Obtain the parking fee and waiting time for entering the target parking lot;

[0015] Based on the target user's attribute information, the destination's attribute information, the parking fee, the waiting time, the current environmental information, and the transportation used in the planned route, a first weight corresponding to the time spent, a second weight corresponding to the cost, and a third weight corresponding to the number of transfers are determined. The environmental information includes the current time and the current weather conditions.

[0016] Based on the time, cost, and number of transfers for each planned route, and the corresponding first weight, second weight, and third weight, a recommended value is obtained for each planned route.

[0017] In one embodiment of this application, obtaining the waiting time to enter the target parking lot includes:

[0018] Obtain the interval between the opening and closing of the gate in the target parking lot;

[0019] Obtain the first distance of the congested section on the road leading to the target parking lot;

[0020] The waiting time to enter the target parking lot is calculated based on the interval duration and the first distance.

[0021] In one embodiment of this application, the step of matching and analyzing the advertising information with the candidate parking lots to bind the advertising information with the corresponding planned path includes:

[0022] The advertising information is matched and analyzed with parking lots to obtain first advertising information related to parking lots;

[0023] Identify the first parking lot corresponding to the first advertisement information, and determine whether the first parking lot belongs to the candidate parking lot set;

[0024] When the first parking lot belongs to the candidate parking lot set, all planned paths corresponding to the first parking lot are determined, and the first advertising information is bound to all planned paths corresponding to the first parking lot.

[0025] In one embodiment of this application, binding the rights claim link to the corresponding planned path based on the attribute information of the candidate parking lot includes:

[0026] Based on the attribute information of the candidate parking lots, a first type of candidate parking lot is selected from the candidate parking lot set. The first type of candidate parking lot is a parking lot of a non-profit organization.

[0027] Obtain all planned paths corresponding to the first type of candidate parking lots;

[0028] The rights claim link is bound to all planned paths corresponding to the first type of candidate parking lot.

[0029] In one embodiment of this application, the step of selecting at least one of the following from the set of planned paths—the planned path with the highest recommendation value, the planned path carrying the advertising information, and the planned path carrying the benefit redemption link—for recommendation includes:

[0030] When the planned path set contains both the planned path carrying the advertising information and the planned path carrying the benefit redemption link, the planned path with the highest recommendation value, the planned path carrying the advertising information, and the planned path carrying the benefit redemption link will all be recommended.

[0031] When the planned path set contains a planned path carrying the advertising information, but does not contain a planned path carrying the benefit claim link, the planned path with the highest recommendation value and the planned path carrying the advertising information are recommended.

[0032] When there is no planned path carrying the advertising information in the planned path set, but there is a planned path carrying the benefit redemption link, both the planned path with the highest recommendation value and the planned path carrying the benefit redemption link will be recommended.

[0033] When neither the planned path carrying the advertising information nor the planned path carrying the benefit claim link exists in the planned path set, the planned path with the highest recommendation value will be recommended.

[0034] In one embodiment of this application, when all parking lots surrounding the destination have no available parking spaces, the method includes:

[0035] Obtain all first-category candidate parking lots in the area where the destination is located, wherein the first-category candidate parking lots are parking lots of non-profit organizations;

[0036] Select parking lots with available spaces from all candidate parking lots of the first type as target candidate parking lots;

[0037] Obtain the planned path corresponding to each of the target candidate parking lots;

[0038] Based on the time, cost, and number of transfers for each of the planned routes, a recommended value is calculated for each of the planned routes.

[0039] The path with the highest recommendation value is selected as the target path, and the benefit claim link is bound to the target path.

[0040] The target planning path carrying the link to claim the aforementioned rights will be recommended.

[0041] In one embodiment of this application, when all candidate parking lots of the first type have no available parking spaces, the method includes:

[0042] Expand the search area to retrieve all parking lots around the destination;

[0043] Return to the step of filtering out available parking lots with vacant spaces from all parking lots around the destination as candidate parking lots to obtain a candidate parking lot set.

[0044] A second aspect of this application provides an electronic device comprising a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for enabling communication between the processor and the memory. When the program is executed by the processor, it performs the steps of the method described in any embodiment of this application.

[0045] A third aspect of this application provides a storage medium, which is a computer-readable storage medium for computer-readable storage, characterized in that the storage medium stores one or more programs, which can be executed by one or more processors to implement the steps of the method described in any embodiment of this application.

[0046] This application proposes a route recommendation method, electronic device, and storage medium that includes parking planning. When the target parking lot at the destination is found to have no available spaces and requires queuing, the method first searches for all parking lots around the destination, and then selects available parking lots as candidate parking lots. By obtaining the planned route corresponding to each candidate parking lot, the time, cost, and number of transfers for each planned route can be obtained. Based on the time, cost, and number of transfers for each planned route, a recommendation value can be calculated. Simultaneously, matching and analyzing advertising information with candidate parking lots allows binding the advertising information to the corresponding planned route. Based on the attribute information of the candidate parking lots, a benefit redemption link can be bound to the corresponding planned route. Therefore, at least one of the following can be selected from the set of planned routes for recommendation: the planned route with the highest recommendation value, the planned route carrying advertising information, and the planned route carrying a benefit redemption link. This application, by recommending at least one feasible solution including parking planning to users, can divert parking demand from popular target parking lots to surrounding vacant parking lots, effectively alleviating parking pressure at the target parking lot, solving traffic congestion problems, and also improving the utilization rate of surrounding parking lots. Attached Figure Description

[0047] Figure 1 This is a flowchart of a route recommendation method including parking planning provided in an embodiment of this application;

[0048] Figure 2 This is a schematic diagram of all planned paths containing only one candidate parking lot, provided in an embodiment of this application.

[0049] Figure 3 This is a schematic diagram of all planned paths including multiple candidate parking lots provided in an embodiment of this application;

[0050] Figure 4 This is a flowchart of the steps for obtaining the target parking lot corresponding to the destination based on the destination, provided in an embodiment of this application.

[0051] Figure 5 This is a flowchart illustrating the steps for obtaining all parking lots around a destination based on the destination, as provided in an embodiment of this application.

[0052] Figure 6 This is a flowchart of the steps performed after determining whether there are target shared bicycle stations, target shared electric vehicle stations, target bus stations, and target subway stations within a target distance range, with the destination as the center, according to an embodiment of this application.

[0053] Figure 7This is a flowchart of the steps to calculate the recommended value for each planned route based on the time, cost and number of transfers for each planned route, as provided in the embodiments of this application.

[0054] Figure 8 This is a flowchart of the steps for obtaining the waiting time to enter the target parking lot, provided in an embodiment of this application.

[0055] Figure 9 This is a flowchart of the steps provided in this application embodiment to match and analyze advertising information with candidate parking lots, so as to bind the advertising information with the corresponding planned path;

[0056] Figure 10 This is a flowchart of the steps provided in this application embodiment to bind the rights claim link with the corresponding planned path based on the attribute information of the candidate parking lot;

[0057] Figure 11 This is a flowchart of the steps provided in this application embodiment to recommend at least one of the following: the planning path with the highest recommendation value, the planning path carrying advertising information, and the planning path carrying a link to claim benefits.

[0058] Figure 12 This is a flowchart of the steps to be performed when all parking spaces around the destination are unavailable, as provided in an embodiment of this application.

[0059] Figure 13 This is another flowchart of a route recommendation method including parking planning provided in an embodiment of this application;

[0060] Figure 14 This is a schematic diagram of the hardware structure of the electronic device provided in the embodiments of this application. Detailed Implementation

[0061] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0062] It should be noted that although functional modules are divided in the device schematic diagram and a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the device or the order in the flowchart. The terms "first," "second," etc., in the specification, claims, and the aforementioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0063] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to limit this application.

[0064] The problem of "driving is easy, parking is difficult" has always plagued car owners. When users choose to drive to their destination, they may find that there are no available parking spaces or they cannot enter the parking lot upon arrival. In this situation, users need to wait to enter or find another suitable parking lot. However, it is common for users to be unable to find a suitable parking lot, such as because there are no available parking spaces, the parking lot is too far from their destination, or the parking fee is too high. Moreover, users often only find out about these situations after arriving at the parking lot, which leads to an unnecessary increase in parking time and costs.

[0065] Based on this, this application proposes a route recommendation method that includes parking planning. When it is detected that there are no available parking spaces in the target parking lot and a queue is required to enter, it can recommend at least one of the following to the target user: the route with the highest recommendation value, the route with advertising information, and the route with a link to claim benefits. This can effectively alleviate the parking pressure in the target parking lot, solve the traffic congestion problem, and also improve the utilization rate of surrounding parking lots.

[0066] Reference Figure 1 , Figure 1 This is a flowchart of a route recommendation method including parking planning provided in an embodiment of this application. Figure 1 The method may include, but is not limited to, steps S110 to S160.

[0067] Step S110: When it is detected that there are no available parking spaces in the target parking lot of the destination and a queue is required to enter, search for all parking lots around the destination.

[0068] In this embodiment, after obtaining the user's input destination, the target parking lot corresponding to the destination can be obtained. When the user's input destination is the target parking lot, the target parking lot can be directly determined as the destination parking lot.

[0069] For example, if a car owner finds they cannot park at a target parking lot before setting off for their destination or upon arrival, they can run a parking management application on their mobile device and input their destination through the parking planning function within the application. For instance, a user could input "Angel Children's Hospital" as their destination, and the system would then determine that the target parking lot is the Angel Children's Hospital parking lot.

[0070] In this embodiment, after obtaining the target parking lot, the parking lot data can be queried from the parking management system cloud platform, including: parking lot name, parking lot location, current available parking spaces, parking fee rules, distance from the destination, etc. Simultaneously, the road conditions at the target parking lot entrance and the gate opening status can be obtained through the parking management system cloud platform or the target parking lot's local parking management system, etc. Based on the current available parking spaces, the road conditions at the target parking lot entrance, and the gate opening status, it can be determined whether the target parking lot has available parking spaces and whether queuing is required to enter. When it is detected that the target parking lot has no available parking spaces and queuing is required to enter, all parking lots around the destination can be obtained. For example, all parking lots within a 5-kilometer radius of the destination can be obtained by querying the parking management system cloud platform.

[0071] Step S120: Select available parking lots with vacant spaces from all parking lots around the destination as candidate parking lots to obtain a candidate parking lot set.

[0072] In this embodiment, considering that among all the parking lots around the destination, there may be parking lots without available spaces, meaning users cannot park there even after arriving, it is necessary to filter out parking lots with available spaces from all the parking lots around the destination as candidate parking lots, thus obtaining a candidate parking lot set. Specifically, parking lot data for all parking lots around the destination can be obtained from the parking management system cloud platform. Based on the parking lot data, it can be determined which parking lots around the destination currently have available spaces and which do not. This allows parking lots without available spaces to be filtered out, thus obtaining parking lots with available spaces as candidate parking lots.

[0073] Step S130: Obtain the planned path corresponding to each candidate parking lot in the candidate parking lot set to obtain the planned path set. The planned path is the path from the current location to the candidate parking lot and then to the destination.

[0074] In this embodiment, after obtaining candidate parking lots, a planned route corresponding to each candidate parking lot can be generated based on the user's current location and destination. The route from the current location to the candidate parking lot is achieved via the user's vehicle and can be generated using navigation. The route from the candidate parking lot to the destination is determined by the distance between the candidate parking lot and the destination, and can utilize a combination of various modes of transportation such as subway, bus, shared bicycle, shared electric vehicle, and walking. This embodiment requires obtaining all feasible routes from the candidate parking lots to the destination.

[0075] For example, refer to Figure 2 , Figure 2 This is a schematic diagram illustrating all planned paths containing only one candidate parking lot, provided in an embodiment of this application. Figure 2 As shown, there are 5 planned routes from the current location to the destination via candidate parking lot A. Route 1 involves driving from the current location to candidate parking lot A, then taking the subway and walking from candidate parking lot A to the destination. Route 2 involves driving from the current location to candidate parking lot A, then taking public transportation and walking from candidate parking lot A to the destination. Route 3 involves driving from the current location to candidate parking lot A, then taking the subway, shared bicycles, and walking from candidate parking lot A to the destination. Route 4 involves driving from the current location to candidate parking lot A, then taking public transportation, shared bicycles, and walking from candidate parking lot A to the destination. Route 5 involves driving from the current location to candidate parking lot A, then taking a shared electric scooter and walking from candidate parking lot A to the destination. It is evident that each candidate parking lot corresponds to at least one planned route.

[0076] It should be noted that each planned route can display its corresponding time, cost, and number of transfers in detail. Taking planned route 3 as an example, planned route 3 will show that driving from the current location to candidate parking lot A takes time T1, and the hourly parking fee at candidate parking lot A is W1; then walking from candidate parking lot A to subway station a takes time T2; from subway station a to subway station c takes time T3, and the cost is W2; therefore, walking from subway station C to shared bicycle station N takes time T4; from shared bicycle station N to shared bicycle station M takes time T5, and the cost is W3; and walking from shared bicycle station M to the destination takes time T6. Therefore, the time T for planned route 3 can be calculated as T = T1 + T2 + T3 + T4 + T5 + T6; the cost W = W1 + W2 + W3; and the number of transfers is 2.

[0077] Reference Figure 3 , Figure 3 This is a schematic diagram of all planned paths including multiple candidate parking lots provided in an embodiment of this application. In this embodiment, it is assumed that through step S130, four candidate parking lots are selected from all parking lots around the destination, namely candidate parking lot A, candidate parking lot B, candidate parking lot C, and candidate parking lot D. Among them, there are 5 planned paths including candidate parking lot A, 3 planned paths including candidate parking lot B, 2 planned paths including candidate parking lot C, and 5 planned paths including candidate parking lot D. Therefore, there are a total of 15 planned paths from the current location to the candidate parking lots and then to the destination.

[0078] Step S140: Calculate the recommended value for each planned route based on the time, cost, and number of transfers for each planned route.

[0079] In this embodiment of the application, after obtaining each planned route, the time, cost, and number of transfers corresponding to each planned route can be calculated. Based on the time, cost, and number of transfers corresponding to each planned route and their corresponding weights, a recommended value for each planned route can be calculated.

[0080] Step S150: Match the advertising information with the candidate parking lots to bind the advertising information with the corresponding planned path.

[0081] In this embodiment, considering the inclusion of third-party merchants, it is necessary to perform matching analysis on all advertising information that these third-party merchants wish to place to determine whether all advertising information is related to parking lots. If so, the specific parking lot to which it is related to.

[0082] For example, a third-party merchant is the operator of parking lot C. To encourage more people to park in parking lot C and increase operational efficiency, they can offer various forms of advertising, such as discount coupons for parking lot C, or free subway or bus tickets from the parking lot to the destination. By analyzing these advertisements, it can be determined that they are related to parking lot C, which is part of a pool of candidate parking lots. Therefore, it is necessary to bind these advertisements to all planned routes corresponding to parking lot C, so that when recommending these planned routes to users, these advertisements are pushed along with the information.

[0083] For example, a third-party merchant, acting as a restaurant operator, might offer various advertising formats to attract more customers and increase operational efficiency. These include discount coupons, vouchers for spending a certain amount, or parking vouchers for nearby parking lot C. Analyzing these advertisements reveals their connection to parking lot C, which is part of a pool of potential parking lots. Therefore, these advertisements need to be linked to all planned routes corresponding to parking lot C, so that they are included when recommending these routes to users.

[0084] Step S160: Based on the attribute information of the candidate parking lot, bind the benefit claim link with the corresponding planned path.

[0085] In this embodiment, the candidate parking lots in the candidate parking lot pool include parking lots of for-profit and non-profit organizations. Considering that when the target parking lot at the destination has no available spaces and requires queuing to enter, guiding users to park in parking lots of some non-profit organizations can optimize social resources and better solve the traffic congestion problem at popular destinations. Therefore, to guide users to park in non-profit organization parking lots, it is necessary to bind the benefit redemption link with the corresponding planned route and then recommend it to the user. Thus, users may choose the corresponding planned route because they can redeem the corresponding benefits through the benefit redemption link. The benefit redemption link includes various resources and services provided by the government, such as library cards, museum admission tickets, and admission tickets for certain scenic spots.

[0086] Step S170: Select at least one of the following from the set of planned paths: the planned path with the highest recommendation value, the planned path carrying advertising information, and the planned path carrying a link to claim benefits.

[0087] In this embodiment, when it is detected that there are no available parking spaces in the target parking lot and a queue is required to enter, at least one of the following can be selected from the set of planned routes: the planned route with the highest recommendation value, the planned route carrying advertising information, and the planned route carrying a link to claim benefits. By recommending at least one feasible solution that includes parking planning to users, the parking demand of popular target parking lots can be diverted to surrounding vacant parking lots, effectively alleviating parking pressure in the target parking lot, solving traffic congestion problems, and also improving the utilization rate of surrounding parking lots.

[0088] In one embodiment of this application, reference is made to Figure 4 , Figure 4 This is a flowchart of the steps for obtaining the target parking lot corresponding to the destination based on the destination, provided in the embodiments of this application, including but not limited to steps S410 to S420.

[0089] Step S410: If a parking lot is available at the destination, then the parking lot at the destination shall be used as the target parking lot.

[0090] Step S420: If there is no parking lot at the destination, the parking lot closest to the destination will be used as the target parking lot.

[0091] In this embodiment, it is considered that some destinations may not have parking lots, therefore the destination parking lot cannot be directly used as the target parking lot. When there is no parking lot at the destination, the parking lot closest to the destination needs to be used as the target parking lot. Accurate determination of the target parking lot is an important prerequisite for accurate recommendations.

[0092] In one embodiment of this application, reference is made to Figure 5 , Figure 5 This is a flowchart of the steps for obtaining all parking lots around a destination based on the destination, including but not limited to steps S510 to S560, provided in the embodiments of this application.

[0093] Step S510: Using the destination as the center, obtain all first parking lots within the target distance range.

[0094] In this embodiment, considering that directly selecting all parking lots within a certain range, such as a 5-kilometer radius, centered on the destination might result in a large number of selected parking lots, some of which might not have corresponding transportation options for reaching the destination, yet would still be included in the calculation queue, thus increasing unnecessary computation. Therefore, this embodiment selects all parking lots around the destination from the perspective of transportation. First, all first parking lots within a target distance range, such as 500 meters, are selected centered on the destination.

[0095] It should be noted that the target distance can be determined based on the availability of parking spaces around the destination. Generally, for a comfortable walking distance, the target distance should be set at less than 500 meters.

[0096] It is understandable that there may be multiple parking lots or no parking lots within a 500-meter radius of the destination.

[0097] Step S520: Using the destination as the center, determine whether there are target shared bicycle stations, target shared electric vehicle stations, target bus stations, and target subway stations within the target distance range.

[0098] In this embodiment, considering that if there are transportation stops near the destination, the user may be able to choose the appropriate means of transportation to reach the transportation stop near the destination after arriving at the candidate parking lot, and then walk to the destination. Therefore, the destination can be used as the center to determine whether there are target shared bicycle stops, target shared electric vehicle stops, target bus stops, and target subway stations within a target distance range, such as within 500 meters.

[0099] Step S530: If there is a target shared bicycle station within the target distance range, then take the target shared bicycle station as the center and obtain all the second parking lots within the first preset distance range.

[0100] In this embodiment of the application, if there is a shared bicycle station within the target distance range of the destination, then all parking lots within a first preset range, such as a range of 1 kilometer, are selected with the shared bicycle station as the center.

[0101] It should be noted that, in order to reduce the number of parking lots selected, after obtaining the second parking lot, it is possible to verify whether there are also shared bicycle stations near the second parking lot. If there are, they are kept; if not, they are filtered out.

[0102] Understandably, even without verification, if there are no shared bicycle stations near the second parking lot after obtaining it, it can be filtered out in subsequent calculations.

[0103] Step S540: If there is a target shared electric vehicle station within the target distance range, then take the target shared electric vehicle station as the center and obtain all third parking lots within the second preset distance range.

[0104] In this embodiment of the application, similarly, if there is a shared electric vehicle station within the target distance range of the destination, then all parking lots within a second preset range, such as a range of 2 kilometers, are selected with the shared electric vehicle station as the center.

[0105] It should be noted that, in order to reduce the number of parking lots selected, after obtaining the third parking lot, it is possible to verify whether there are also shared electric vehicle stations near the third parking lot. If there are, they are kept; if not, they are filtered out.

[0106] Understandably, even without verification after obtaining the third parking lot, if there are no shared electric vehicle stations nearby, it can be filtered out in subsequent calculations.

[0107] Step S550: If a target bus stop exists within the target distance range, then, taking the target bus stop as the center, obtain all fourth parking lots within the distance range of a preset number of bus stops.

[0108] In this embodiment of the application, similarly, if there is a bus stop within the target distance range of the destination, then, taking the bus stop as the center, all fourth parking lots within the distance range of a preset number of bus stops are obtained, for example, all parking lots within the distance range of 3 bus stops are obtained.

[0109] It should be noted that, in order to reduce the number of parking lots selected, after obtaining the fourth parking lot, it is possible to verify whether there is also a bus stop near the fourth parking lot. If there is, it is kept; if not, it is filtered out.

[0110] Understandably, even without verification, if there is no bus stop near the fourth parking lot after obtaining it, it can be filtered out in subsequent calculations.

[0111] Step S560: If there is a target subway station within the target distance range, then take the target subway station as the center and obtain all fifth parking lots within the distance range of a preset number of subway stations.

[0112] In this embodiment of the application, similarly, if there is a subway station within the target distance range of the destination, then, taking that subway station as the center, all fifth parking lots within the distance range of a preset number of subway stations are obtained, for example, all parking lots within the distance range of 3 subway stations are obtained.

[0113] It should be noted that, in order to reduce the number of parking lots selected, after obtaining the fifth parking lot, it is possible to verify whether there is a subway station near the fifth parking lot. If there is, it is kept; if not, it is filtered out.

[0114] Understandably, even without verification, if there is no subway station near the fifth parking lot after obtaining it, it can be filtered out in subsequent calculations.

[0115] Step S570: Include all parking lots in Parking Lot 1, Parking Lot 2, Parking Lot 3, Parking Lot 4, and Parking Lot 5 as all parking lots surrounding the destination.

[0116] In this embodiment, all the first, second, third, fourth, and fifth parking lots are considered as all parking lots surrounding the destination. When identical parking lots exist and are included in the list of all parking lots surrounding the destination, only one identical parking lot is selected. For example, if parking lot A is included in the parking lots selected based on shared bicycle stations and also in the parking lots selected based on shared electric vehicle stations, then only one parking lot A needs to be included in the final list of all parking lots surrounding the destination.

[0117] In one embodiment of this application, reference is made to Figure 6 , Figure 6 This is a flowchart of the steps to be performed after determining whether there is a target shared bicycle station, target shared electric vehicle station, target bus station and target subway station within the target distance range, with the destination as the center, including but not limited to steps S610 to S650.

[0118] Step S610: If a target bus stop exists within the target distance range, obtain all bus routes that include the target bus stop.

[0119] Step S620: Obtain the first route from the bus routes, and obtain all the sixth parking lots within the third preset distance range on the first route. The first route is the route from the preset number of bus stops before the target bus station to the preset number of bus stops after the target bus station.

[0120] Step S630: If a target subway station exists within the target distance range, obtain all subway routes that include the target subway station.

[0121] Step S640: Obtain the second route from the subway route, and obtain all seventh parking lots within the third preset distance range on the second route. The second route is the route from a preset number of subway stations before the target subway station to a preset number of subway stations after the target subway station.

[0122] Step S650: Include all parking lots in Parking Lot 1, Parking Lot 2, Parking Lot 3, Parking Lot 6, and Parking Lot 7 as all parking lots surrounding the destination.

[0123] In this embodiment, considering that although there may be bus stops or subway stations near the destination, there may not be bus stops or subway stations near the parking lots selected centered on the bus stops or subway stations, resulting in the selected parking lots being invalid parking lots. To reduce the number of selected parking lots and thus reduce the subsequent computational load, this embodiment, when determining that there is a target bus stop within the target distance centered on the destination, obtains all bus routes containing the target bus stop, and obtains a first route from the bus routes, that is, the route from a preset number of bus stops before the target bus stop to a preset number of bus stops after the target bus stop, for example, the route from the 4 bus stops before the target bus stop to the 4 bus stops after the target bus stop (8 bus stops in total). Thus, all parking lots within a third preset distance range on the first route, such as 600 meters, can be obtained. Similarly, when it is determined that a target subway station exists within a target distance range centered on the destination, all subway routes containing the target subway station are obtained. From these subway routes, a second route is obtained, which is the route from a predetermined number of subway stations before the target subway station to a predetermined number of subway stations after the target subway station. For example, the route on a subway line from the four subway stations before the target subway station to the four subway stations after the target subway station (a total of eight subway stations). Thus, all parking lots within a third predetermined distance range on the second route, such as a range of 600 meters, can be obtained.

[0124] This application embodiment, by selecting parking lots from bus or subway lines, ensures that each selected parking lot is near a bus or subway station. This allows users to choose a bus or subway to reach their destination after arriving at the parking lot. It guarantees that the selected parking lots are valid and eliminates invalid parking lots, thus reducing the number of selected parking lots and minimizing subsequent computational load.

[0125] In one embodiment of this application, reference is made to Figure 7 , Figure 7 This is a flowchart of the steps provided in this application embodiment to calculate the recommended value for each planned path based on the time, cost and number of transfers for each planned path, including but not limited to steps S710 to S740.

[0126] Step S710: Obtain the time, cost, and number of transfers for each planned route.

[0127] In this embodiment of the application, after obtaining the planned route corresponding to each candidate parking lot, the time, cost and number of transfers for each planned route can be calculated.

[0128] Step S720: Obtain the parking fee and waiting time for entering the target parking lot.

[0129] In this embodiment, the waiting time to enter the target parking lot can be determined based on the acquired data, such as the availability of parking spaces, the road conditions at the entrance, and the gate opening status. Simultaneously, the parking fee can be obtained based on the acquired data, such as the parking fee schedule.

[0130] Step S730: Based on the target user's attribute information, destination's attribute information, parking fees, waiting time, current environmental information, and the transportation used in the planned route, determine the first weight corresponding to the time spent, the second weight corresponding to the cost, and the third weight corresponding to the number of transfers. The current environmental information includes the current time and current weather conditions.

[0131] In this embodiment of the application, in order to make the final recommended planned route more accurate and better match the user, it is necessary to comprehensively consider the target user's attribute information, the destination's attribute information, the waiting time, the current environment information, and the means of transportation used in the planned route, etc., to determine the first weight corresponding to the time spent, the second weight corresponding to the cost, and the third weight corresponding to the number of transfers.

[0132] For example, based on the target user's basic data, historical behavior data, and historical travel data, if the target user is determined to be someone who is time-sensitive, then the weight of time spent should be increased accordingly, meaning that parking routes with shorter time spent should be recommended to this target user. If the target user is price-sensitive, then recommending parking routes with lower costs is more likely to be a better match, and the weight of cost should be increased accordingly. Based on destination attributes, such as a hospital, recommending parking routes with shorter time spent might be more accurate, so the weight of time spent should also be increased. If the destination is a scenic spot, recommending parking routes with higher comfort levels might be more accurate, so the weight of the number of transfers should be increased accordingly. Furthermore, the weights can also be adjusted in conjunction with current environmental information. For example, if the current time is night, it may be more accurate to recommend parking routes with shorter travel time and fewer transfers to the target user. In this case, it is necessary to increase the weight of travel time and the weight of transfers.

[0133] In this embodiment, the weight corresponding to the time spent is also adjusted in conjunction with the waiting time to enter the target parking lot. For example, if the weight corresponding to the pre-determined time spent is 'a', and the time spent for planned path 1 is T1, while the waiting time to enter the target parking lot is T2, then the weight corresponding to the time spent can be adjusted to T2 / T1*a. That is, when the time spent for the planned path is greater than the waiting time, the weight corresponding to the time spent will decrease, and when the time spent for the planned path is less than the waiting time, the weight corresponding to the time spent will increase.

[0134] In this embodiment, the weight of the cost is also adjusted in conjunction with the parking fee of the target parking lot. For example, if the predetermined weight of the cost is b, and the cost of planned path 1 is W1, while the parking fee of the target parking lot is W2, then the weight of the cost can be adjusted to W2 / W1*b. That is, when the cost of the planned path is greater than the parking fee of the target parking lot, the weight of the cost will decrease, and when the cost of the planned path is less than the parking fee of the target parking lot, the weight of the cost will increase.

[0135] In this embodiment, the weight of the number of transfers is adjusted based on the mode of transportation used in the planned route. For example, if the mode of transportation used for transfers is the subway or bus, the weight corresponding to the number of transfers is appropriately increased. For instance, if the weight corresponding to the number of transfers is C, then C = C1 + C2, where C1 represents the mode of transportation used for transfers being the subway or bus, and C2 represents the mode of transportation used for transfers not being the subway or bus, but rather a shared bicycle, shared electric scooter, or walking. C1 is greater than C2. Through this weighting method, when the recommended planned route includes transfers, it will be more inclined to recommend planned routes corresponding to transfers using the subway or bus to the user.

[0136] Step S740: Based on the time, cost, and number of transfers for each planned route, as well as the corresponding first, second, and third weights, obtain the recommended value for each planned route.

[0137] In this embodiment, after determining the first weight corresponding to the travel time, the second weight corresponding to the travel cost, and the third weight corresponding to the number of transfers, a recommended value for each planned route can be obtained based on the travel time, travel cost, and number of transfers, as well as the corresponding first, second, and third weights. The recommended value can be calculated using the following formula:

[0138] S = a*X + b*Y + c*Z;

[0139] In the formula, S represents the recommended value, a represents the first weight corresponding to the time spent, X represents the time spent on the planned route, b represents the second weight corresponding to the cost, Y represents the cost of the planned route, c represents the third weight corresponding to the number of transfers, and Z represents the number of transfers on the planned route.

[0140] In this embodiment of the application, in order to ensure that the final recommended route not only matches the user but also solves the user's parking problem to the greatest extent, the availability of parking spaces in the target candidate parking lots can be adjusted to the obtained recommendation value.

[0141] For example, although the candidate parking lots in the final recommended target planning path may have available spaces, the number of remaining spaces is very small, such as only 2 or 3. In this case, if the user arrives at the candidate parking lot immediately, they can park smoothly. However, the user's actual arrival time at the candidate parking lot will definitely be later than the current time, so when the user arrives at the candidate parking lot, there may be no available spaces, thus preventing the user from successfully entering the candidate parking lot to park. Therefore, this embodiment of the application can adjust the calculated recommendation value by increasing the parking availability of the target candidate parking lot. The adjusted recommendation value can be calculated using the following formula:

[0142] S = λ*(a*X+b*Y+c*Z);

[0143] In the formula, λ is the coefficient of the probability of parking availability for the target candidate parking lot. For example, if the target candidate parking lot has a large number of available parking spaces, it is considered to have a higher probability of parking availability, and λ is increased. If the target candidate parking lot has a small number of available parking spaces, it is considered to have a lower probability of parking availability, and λ is decreased.

[0144] In this embodiment of the application, the calculation of the recommendation value takes into account the attribute information of the target user, the attribute information of the destination, the parking fee of the target parking lot, the waiting time, the current environmental information, and the influence of the means of transportation used in the planned route, which can make the final recommendation result more accurate.

[0145] In one embodiment of this application, reference is made to Figure 8 , Figure 8 This is a flowchart of the steps for obtaining the waiting time to enter the target parking lot provided in the embodiments of this application, including but not limited to steps S810 to S830.

[0146] Step S810: Obtain the interval duration of the gate opening in the target parking lot;

[0147] Step S820: Obtain the first distance of the congested section on the road leading to the target parking lot;

[0148] Step S830: Calculate the waiting time to enter the target parking lot based on the interval duration and the first distance.

[0149] In this embodiment, the interval time of the gate opening in the target parking lot is first obtained, and then the first distance of the congested road segment on the road segment leading to the target parking lot is obtained. Thus, the waiting time to enter the target parking lot can be calculated based on the interval time and the first distance.

[0150] For example, if the interval between gate openings in the target parking lot is T minutes, the distance of the congested section on the road leading to the parking lot is S meters, the distance between vehicles during congestion is M, and the length of each vehicle can be approximated as L, then the number of vehicles waiting to enter the parking lot on the congested section can be calculated as follows: This allows us to calculate the waiting time to enter the target parking lot.

[0151] In this embodiment, the waiting time to enter the target parking lot can be calculated by the interval between the opening of the gate in the target parking lot and the first distance of the congested road segment on the road segment leading to the target parking lot. This waiting time can be used to adjust the weight corresponding to the time spent on the planned route, thereby making the recommendation results more accurate.

[0152] In one embodiment of this application, reference is made to Figure 9 , Figure 9 This is a flowchart of the steps provided in this application embodiment to match and analyze advertising information with candidate parking lots in order to bind the advertising information with the corresponding planned path, including but not limited to steps S910 to S930.

[0153] Step S910: Perform matching analysis between advertising information and parking lots to obtain first advertising information related to parking lots.

[0154] In this embodiment, considering that multiple third-party merchants need to place advertisements, resulting in a wide variety of advertising information and content, it is necessary to first match and analyze all advertising information with parking lots to obtain all first advertising information related to parking lots.

[0155] For example, if an advertisement is for a parking voucher or discount coupon, or if the third-party merchant associated with the advertisement is a parking lot, or if the third-party merchant associated with the advertisement is located within a certain distance of the parking lot, then such advertisements can be considered parking lot-related. However, some advertisements are not related to parking lots, such as discount coupons from an online store.

[0156] Step S920: Determine the first parking lot corresponding to the first advertisement information, and determine whether the first parking lot belongs to the candidate parking lot set.

[0157] In this embodiment of the application, after obtaining the first advertising information related to the parking lot, it is necessary to further determine the first parking lot corresponding to the first advertising information. For example, if the first advertising information is a discount coupon for parking lot A, then the first parking lot corresponding to the first advertising information can be determined to be parking lot A. Next, it is determined whether the first parking lot belongs to the candidate parking lots, that is, it is then determined whether parking lot A is one of the candidate parking lots in the candidate parking lot set.

[0158] Step S930: When the first parking lot belongs to the candidate parking lot set, determine all the planned paths corresponding to the first parking lot, and bind the first advertising information to all the planned paths corresponding to the first parking lot.

[0159] In this embodiment, if the first parking lot is a candidate parking lot in the candidate parking lot set, all planned paths corresponding to the first parking lot can be directly obtained. Then, the first advertising information is bound to all planned paths corresponding to the first parking lot. If the first parking lot is not a candidate parking lot in the candidate parking lot set, binding is not required.

[0160] In this embodiment, by binding advertising information related to the candidate parking lot with the corresponding candidate parking lot, the corresponding advertising information can be recommended along with the planned route that includes the candidate parking lot to the user. On the one hand, this can guide users to choose the planned route that includes the candidate parking lot to a certain extent; on the other hand, it can also enable third-party merchants to accurately deliver advertising information.

[0161] In one embodiment of this application, reference is made to Figure 10 , Figure 10 This is a flowchart of the steps for binding the rights claim link with the corresponding planned path based on the attribute information of the candidate parking lot, as provided in the embodiments of this application, including but not limited to steps S1010 to S1030.

[0162] Step S1010: Based on the attribute information of the candidate parking lots, select the first type of candidate parking lots from the candidate parking lot set. The first type of candidate parking lots are parking lots of non-profit organizations.

[0163] Step S1020: Obtain all planned paths corresponding to the first type of candidate parking lots;

[0164] Step S1030: Bind the rights claim link to all planned paths corresponding to the first type of candidate parking lots.

[0165] In this embodiment, the candidate parking lots in the candidate parking lot set may be parking lots belonging to for-profit or non-profit organizations. Therefore, it is necessary to select a first type of candidate parking lot from the candidate parking lot set based on the attribute information of the candidate parking lots, that is, parking lots belonging to non-profit organizations. Then, all planning paths corresponding to the first type of candidate parking lots are determined, and the rights claiming link is bound to all planning paths corresponding to the first type of candidate parking lots.

[0166] In this embodiment, by binding the benefit redemption link to the corresponding first-type candidate parking lot, the benefit redemption link can be recommended along with the planned route that includes the first-type candidate parking lot when recommending it to the user. This can guide users to choose planned routes that include the first-type candidate parking lot to a certain extent, thereby optimizing public resources and better scheduling users to effectively alleviate parking pressure in popular parking lots and solve traffic congestion problems.

[0167] In one embodiment of this application, reference is made to Figure 11 , Figure 11 This is a flowchart of the steps provided in this application embodiment to select at least one of the following from the set of planned paths: the planned path with the highest recommendation value, the planned path carrying advertising information, and the planned path carrying a link to claim benefits, including but not limited to steps S1110 to S1140.

[0168] Step S1110: When the planned path set contains both planned paths carrying advertising information and planned paths carrying benefit redemption links, the planned path with the highest recommendation value, the planned path carrying advertising information, and the planned path carrying benefit redemption links are all recommended.

[0169] Step S1120: When there are planned paths carrying advertising information in the planned path set, but no planned paths carrying benefit redemption links, the planned path with the highest recommendation value and the planned path carrying advertising information are recommended.

[0170] Step S1130: When there are no planned paths carrying advertising information in the planned path set, but there are planned paths carrying benefit redemption links, both the planned path with the highest recommendation value and the planned path carrying benefit redemption links are recommended.

[0171] Step S1140: When there are no planned paths carrying advertising information or planned paths carrying benefit redemption links in the planned path set, the planned path with the highest recommendation value is recommended.

[0172] In this embodiment of the application, there are multiple scenarios for the planned path, including Figure 3 For example, the candidate parking lot set includes four parking lots: Parking Lot A, Parking Lot B, Parking Lot C, and Parking Lot D. There are 15 planned routes from the current location to the destination via these candidate parking lots. Based on the time, cost, and number of transfers for each planned route, a recommendation value can be calculated. The route with the highest recommendation value can then be selected from these 15 routes. Simultaneously, by matching advertising information with the candidate parking lots, it can be determined whether any of these 15 planned routes contain advertising information. Based on the attribute information of the candidate parking lots, it can be determined whether any of these 15 planned routes contain links to claim benefits. Therefore, if any of these 15 planned routes contain advertising information, the route with the highest recommendation value, the route containing advertising information, and the route containing the benefit claim link will all be recommended.

[0173] Understandably, when multiple planned paths within these 15 planned paths contain advertising information, all of them can be recommended, or the path with the highest recommendation value can be selected. Similarly, when multiple planned paths within these 15 planned paths contain links to claim benefits, all of them can be recommended, or the path with the highest recommendation value can be selected.

[0174] In this embodiment, when the planned path set contains planned paths carrying advertising information but no planned paths carrying benefit redemption links, the planned path with the highest recommendation value and the planned path carrying advertising information can be recommended. When the planned path set does not contain planned paths carrying advertising information but contains planned paths carrying benefit redemption links, both the planned path with the highest recommendation value and the planned path carrying benefit redemption links can be recommended. When the planned path set does not contain either planned paths carrying advertising information or planned paths carrying benefit redemption links, only the planned path with the highest recommendation value is recommended.

[0175] In this embodiment, at least one of the following is recommended to the target user: a planning path with the highest recommendation value, a planning path carrying advertising information, and a planning path carrying a link to claim benefits. The target user then selects a suitable planning path from these options. Giving the target user the choice ensures that the final determined target planning path is more closely matched to the target user.

[0176] In one embodiment of this application, reference is made to Figure 12 , Figure 12 This is a flowchart of the steps to be performed when all parking spaces around the destination are unavailable, as provided in the embodiments of this application, including but not limited to steps S1210 to S1260.

[0177] Step S1210: Obtain all first-class candidate parking lots in the area where the destination is located. The first-class candidate parking lots are parking lots of non-profit organizations.

[0178] In this embodiment, when all parking lots around the destination have no available spaces, it indicates that there are no parking lots available in the vicinity of the destination. However, to alleviate traffic congestion and prevent all users from waiting in the destination parking lot, even if it takes longer than the waiting time to enter the target parking lot, users still need to be guided to parking lots further away. In this case, it is necessary to obtain all first-category candidate parking lots in the area where the destination is located. First-category candidate parking lots are parking lots of non-profit organizations. For example, obtaining all first-category candidate parking lots in the district where the destination is located means obtaining all parking lots of non-profit organizations open to the public in the district where the destination is located.

[0179] Step S1220: Select parking lots with available spaces from all first-class candidate parking lots as target candidate parking lots.

[0180] Step S1230: Obtain the planned path corresponding to each target candidate parking lot.

[0181] Step S1240: Calculate the recommended value for each planned route based on the time, cost, and number of transfers.

[0182] Step S1250: Obtain the planning path with the highest recommendation value as the target planning path, and bind the rights claim link to the target planning path.

[0183] Step S1260: Recommend the target planning path carrying the rights claim link.

[0184] In this embodiment of the application, after obtaining all the first-type candidate parking lots in the area where the destination is located, it is necessary to select parking lots with available spaces from all the first-type candidate parking lots as target candidate parking lots.

[0185] For example, a total of 7 candidate parking lots of the first category are identified in the destination area. Among these 7 parking lots, 2 have available parking spaces. Therefore, 2 parking lots with available spaces can be selected as target candidate parking lots. Similarly, after obtaining the target candidate parking lots, the planned route corresponding to each target candidate parking lot can be obtained. Based on the time, cost, and number of transfers for each planned route, a recommendation value is calculated. The planned route with the highest recommendation value is then selected as the target planned route, and a benefit redemption link is bound to this target planned route. Finally, the target planned route carrying the benefit redemption link can be recommended.

[0186] In this embodiment of the application, when all parking spaces around the destination are unavailable, and parking is impossible in all parking lots around the destination, the system recommends a target planning route with a benefit redemption link to the user. This guides the user to choose the planning route with the highest recommendation value among the planning routes of the first type of candidate parking lots, thereby effectively alleviating parking pressure in popular parking lots and avoiding traffic congestion.

[0187] In one embodiment of this application, when all candidate parking lots of the first type have no available parking spaces, the route recommendation method includes:

[0188] Expand the search area to retrieve all parking lots around the destination;

[0189] Return to the step of filtering out available parking lots with vacant spaces from all parking lots around the destination as candidate parking lots, and obtain the candidate parking lot set.

[0190] In this embodiment, when the target parking lot at the destination has no available spaces and a queue is required to enter, all parking lots surrounding the destination are first searched. If all parking lots surrounding the destination have no available spaces, all candidate parking lots of type I in the area where the destination is located need to be obtained. If all candidate parking lots of type I in the area where the destination is located also have no available spaces, the user can be guided to continue waiting to enter the target parking lot. However, if the waiting time is too long, it will cause traffic congestion near the target parking lot. Therefore, it is necessary to guide the user to park in a more distant parking lot. At this time, it is necessary to expand the search range to re-obtain all parking lots surrounding the destination, and return to the step of filtering out available parking lots with spaces from all parking lots surrounding the destination as candidate parking lots to obtain a set of candidate parking lots.

[0191] Reference Figure 13 , Figure 13 This is another flowchart of a route recommendation method including parking planning provided in the embodiments of this application, including but not limited to steps S1310 to S13130.

[0192] Step S1310: Check if the target parking lot at the destination has no available parking spaces and requires queuing to enter;

[0193] Step S1320: If not, proceed to the target parking lot;

[0194] Step S1330: If yes, then search for all parking lots around the destination;

[0195] Step S1340: Check if there are any available parking spaces in all parking lots around the destination.

[0196] Step S1350: If it exists, obtain the available parking lots with vacant parking spaces as candidate parking lots to obtain a set of candidate parking lots;

[0197] Step S1360: Obtain the planning path set for each candidate parking lot in the candidate parking lot set;

[0198] Step S1370: Calculate the recommended value for each planned route based on the time, cost, and number of transfers for each planned route.

[0199] Step S1380: Match and analyze the advertising information with the candidate parking lots to bind the advertising information with the corresponding planned path;

[0200] Step S1390: Based on the attribute information of the candidate parking lot, bind the rights claim link with the corresponding planned path;

[0201] Step S13100: Select at least one of the following from the set of planned paths: the planned path with the highest recommendation value, the planned path carrying advertising information, and the planned path carrying a link to claim benefits;

[0202] Step S13110: If it does not exist, then obtain all first-type candidate parking lots in the area to which the destination belongs;

[0203] Step S13120: Detect whether there are any available parking lots with vacant spaces among all the first-type candidate parking lots. If so, return to step S1350.

[0204] In step S13130, if the parking lot does not exist, the search range is increased to retrieve all parking lots around the destination, and the process returns to step S1340.

[0205] In this embodiment, when a target parking lot has no available spaces and requires queuing to enter, if there are available candidate parking lots around the destination, at least one of the following is recommended to the target user: the highest recommended route, the route carrying advertising information, and the route carrying a benefit redemption link. If there are available candidate parking lots around the destination, it is determined whether all first-type candidate parking lots in the destination area are available. If they are available, the target user is recommended the target route corresponding to the first-type candidate parking lot with a benefit redemption link. If none of the first-type candidate parking lots in the destination area are available, all parking lots around the destination are re-acquired by expanding the search scope, so that at least one of the following can be recommended to the user: the highest recommended route, the route carrying advertising information, and the route carrying a benefit redemption link. This effectively alleviates parking pressure in the target parking lot, solves traffic congestion problems, and also improves the utilization rate of surrounding parking lots.

[0206] In one embodiment of this application, after determining the planned route ultimately selected by the target user, a target candidate parking lot to which the target user is to be located can be identified. At this point, the target user can be further shown a parking space reservation page for the target candidate parking lot, allowing the target user to reserve a parking space and ensuring that the target user can smoothly enter and park upon arrival at the target candidate parking lot.

[0207] In this embodiment, after determining the final planned route selected by the target user, a parking space reservation request for the target candidate parking lot can be sent to the parking management system cloud platform. Upon receiving the parking space reservation request, the parking management system cloud platform sends the reservation information to the local parking management system, which then generates a corresponding vehicle parking reservation order. After successful reservation, the target user drives to the target candidate parking lot. The gate recognizes the license plate and reports the license plate information to the local parking management system. The local parking management system, after determining that the vehicle is a reserved vehicle based on the license plate number, issues an opening command. Upon receiving the opening command, the gate raises the barrier, allowing the driver to directly enter and park. After parking, the driver selects the corresponding mode of transportation (subway, bus, bicycle, walking) to proceed to their destination according to the chosen planned route.

[0208] This application also provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the aforementioned route recommendation method including parking planning. This electronic device can be any smart terminal, including a tablet computer, an in-vehicle computer, or similar device.

[0209] Please see Figure 14 , Figure 14 The hardware structure of an electronic device according to another embodiment is illustrated. The electronic device includes:

[0210] The processor 1401 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this application.

[0211] The memory 1402 can be implemented as a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1402 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1402 and is called and executed by the processor 1401 to execute the route recommendation method including parking planning in the embodiments of this application.

[0212] The input / output interface 1403 is used to implement information input and output;

[0213] The communication interface 1404 is used to enable communication and interaction between this device and other devices. Communication can be achieved through wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0214] Bus 1405 transmits information between various components of the device (e.g., processor 1401, memory 1402, input / output interface 1403, and communication interface 1404);

[0215] The processor 1401, memory 1402, input / output interface 1403 and communication interface 1404 are connected to each other within the device via bus 1405.

[0216] This application embodiment also provides a storage medium, which is a computer-readable storage medium, storing a computer program that, when executed by a processor, implements the above-described route recommendation method including parking planning.

[0217] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0218] The embodiments described in this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided by the embodiments of this application. As those skilled in the art will know, with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of this application are also applicable to similar technical problems.

[0219] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of this application, and may include more or fewer steps than shown, or combine certain steps, or different steps.

[0220] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0221] Those skilled in the art will understand that all or some of the steps in the methods disclosed above, as well as the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or suitable combinations thereof.

[0222] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0223] It should be understood that in this application, "at least one (item)" means one or more, and "more than" means two or more. "And / or" is used to describe the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0224] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of the units described above is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0225] The units described above as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0226] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0227] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0228] The preferred embodiments of the present application have been described above with reference to the accompanying drawings, but this does not limit the scope of the claims of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and substance of the embodiments of the present application shall be within the scope of the claims of the present application.

Claims

1. A route recommendation method incorporating parking planning, characterized in that, The method includes: When it is detected that the target parking lot at the destination has no available parking spaces and requires queuing to enter, all parking lots around the destination are searched. The steps of obtaining all parking lots around the destination include: taking the destination as the center, obtaining all first parking lots within the target distance range; taking the destination as the center, determining whether there is a target shared bicycle station, target shared electric vehicle station, target bus station, and target subway station within the target distance range; if there is a target shared bicycle station within the target distance range, taking the target shared bicycle station as the center, obtaining all second parking lots within a first preset distance range; if there is a target shared electric vehicle station within the target distance range, taking the target shared electric vehicle station as the center, obtaining all third parking lots within a second preset distance range; if there is a target bus station within the target distance range, taking the target bus station as the center, obtaining all fourth parking lots within the distance range of a preset number of bus stations; if there is a target subway station within the target distance range, taking the target subway station as the center, obtaining all fifth parking lots within the distance range of a preset number of subway stations; and taking all first, second, third, fourth, and fifth parking lots as all parking lots around the destination. From all parking lots around the destination, select available parking lots with vacant spaces as candidate parking lots to obtain a candidate parking lot set; A set of planned paths is obtained by acquiring the planned path corresponding to each candidate parking lot in the candidate parking lot set. The planned path is the path from the current location to the candidate parking lot and then to the destination. Based on the time spent, cost, and number of transfers for each planned route, a recommended value is calculated for each planned route. This includes: obtaining the time spent, cost, and number of transfers for each planned route; obtaining the parking fee and waiting time to enter the target parking lot; determining a first weight for the time spent, a second weight for the cost, and a third weight for the number of transfers based on the target user's attribute information, the destination's attribute information, the parking fee, the waiting time, the current environment information, and the transportation used in the planned route; the environment information includes the current time and current weather conditions; and obtaining a recommended value for each planned route based on the time spent, cost, and number of transfers, and the corresponding first, second, and third weights. Specifically, the weight corresponding to the time spent is adjusted based on the waiting time to enter the target parking lot, the weight corresponding to the cost is adjusted based on the parking fee of the target parking lot, and the weight corresponding to the number of transfers is adjusted based on the transportation used in the planned route. The advertising information is matched and analyzed with the candidate parking lots to bind the advertising information with the corresponding planned route; Based on the attribute information of the candidate parking lots, the benefit claim link is bound to the corresponding planned path; At least one of the following is selected from the set of planned paths: the planned path with the highest recommendation value, the planned path carrying the advertising information, and the planned path carrying the benefit redemption link.

2. The method according to claim 1, characterized in that, The process of obtaining the waiting time to enter the target parking lot includes: Obtain the interval between the opening and closing of the gate in the target parking lot; Obtain the first distance of the congested section on the road leading to the target parking lot; The waiting time to enter the target parking lot is calculated based on the interval duration and the first distance.

3. The method according to claim 1, characterized in that, The step of matching and analyzing the advertising information with the candidate parking lots to bind the advertising information with the corresponding planned path includes: The advertising information is matched and analyzed with parking lots to obtain first advertising information related to parking lots; Identify the first parking lot corresponding to the first advertisement information, and determine whether the first parking lot belongs to the candidate parking lot set; When the first parking lot belongs to the candidate parking lot set, all planned paths corresponding to the first parking lot are determined, and the first advertising information is bound to all planned paths corresponding to the first parking lot.

4. The method according to claim 1, characterized in that, The step of binding the benefit redemption link with the corresponding planned path based on the attribute information of the candidate parking lot includes: Based on the attribute information of the candidate parking lots, a first type of candidate parking lot is selected from the candidate parking lot set. The first type of candidate parking lot is a parking lot of a non-profit organization. Obtain all planned paths corresponding to the first type of candidate parking lots; The rights claim link is bound to all planned paths corresponding to the first type of candidate parking lot.

5. The method according to claim 1, characterized in that, The step of selecting at least one of the following from the set of planned paths for recommendation: the planned path with the highest recommendation value, the planned path carrying the advertising information, and the planned path carrying the benefit redemption link, includes: When the planned path set contains both the planned path carrying the advertising information and the planned path carrying the benefit redemption link, the planned path with the highest recommendation value, the planned path carrying the advertising information, and the planned path carrying the benefit redemption link will all be recommended. When the planned path set contains a planned path carrying the advertising information, but does not contain a planned path carrying the benefit claim link, the planned path with the highest recommendation value and the planned path carrying the advertising information are recommended. When there is no planned path carrying the advertising information in the planned path set, but there is a planned path carrying the benefit redemption link, both the planned path with the highest recommendation value and the planned path carrying the benefit redemption link will be recommended. When neither the planned path carrying the advertising information nor the planned path carrying the benefit claim link exists in the planned path set, the planned path with the highest recommendation value will be recommended.

6. The method according to claim 1, characterized in that, When all parking lots around the destination have no available parking spaces, the method includes: Obtain all first-category candidate parking lots in the area where the destination is located, wherein the first-category candidate parking lots are parking lots of non-profit organizations; Select parking lots with available spaces from all candidate parking lots of the first type as target candidate parking lots; Obtain the planned path corresponding to each of the target candidate parking lots; Based on the time, cost, and number of transfers for each of the planned routes, a recommended value is calculated for each of the planned routes. The path with the highest recommendation value is selected as the target path, and the benefit claim link is bound to the target path. The target planning path carrying the link to claim the aforementioned rights will be recommended.

7. The method according to claim 6, characterized in that, When all candidate parking lots of the first type have no available parking spaces, the method includes: Expand the search area to retrieve all parking lots around the destination; Return to the step of filtering out available parking lots with vacant spaces from all parking lots around the destination as candidate parking lots to obtain a candidate parking lot set.

8. An electronic device, characterized in that, The electronic device includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for enabling communication between the processor and the memory, wherein the program, when executed by the processor, implements the steps of the method as described in any one of claims 1 to 7.

9. A storage medium, said storage medium being a computer-readable storage medium for computer-readable storage, characterized in that, The storage medium stores one or more programs, which can be executed by one or more processors to implement the steps of the method according to any one of claims 1 to 7.

Images