Charging recommendation method and device

Abstract

The present application relates to the technical field of route recommendation, and particularly relates to a charging recommendation method and device, which comprises the following steps: obtaining one or more destination types to which a user's vehicle is about to go; determining a destination combination according to the one or more destination types; determining a plurality of candidate charging stations based on the destination combination; matching the plurality of candidate charging stations with the destination combination to form a matching group; and recommending the matching group to the user, so that the user is provided with the most economical matching group through the combination matching mode, and the energy efficiency of the user's vehicle is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of route recommendation, and in particular to a charging recommendation method and device. Background Art

[0002] Existing charging station application software will recommend charging stations to users, such as newly opened charging stations or the nearest charging stations. However, if the user needs to visit many destinations that meet the user's screening criteria during travel, in such a case, the user needs to filter the charging stations near these destinations based on the destinations to be reached. For a moving vehicle, this recommendation method is relatively simple and cannot meet the economic efficiency of travel.

[0003] Therefore, how to improve the energy efficiency of vehicles when recommending charging stations to users is a technical problem that needs to be solved urgently. Summary of the Invention

[0004] In view of the above problems, the present invention is proposed to provide a charging recommendation method and device that overcome the above problems or at least partially solve the above problems.

[0005] In a first aspect, the present invention provides a charging recommendation method, comprising:

[0006] Obtain one or more destination types that the user's vehicle is about to travel to;

[0007] determining a destination combination based on the one or more destination types;

[0008] determining a plurality of candidate charging stations based on the destination combination;

[0009] matching the plurality of candidate charging stations with the destination combination to form a matching group;

[0010] The matching group is recommended to the user.

[0011] Furthermore, determining a destination combination according to the one or more destination types includes:

[0012] determining a candidate destination based on the one or more destination types;

[0013] determining a plurality of candidate destination combinations based on the candidate destinations;

[0014] The plurality of candidate destination combinations are filtered based on any one or more of the following filtering conditions:

[0015] Time limit for user vehicle driving, mileage limit for user vehicle driving, and distance limit between destinations in a destination combination;

[0016] Get a destination combination that meets the filtering condition.

[0017] Furthermore, determining a plurality of candidate charging stations based on the destination combination includes:

[0018] Determine the center point of each destination combination;

[0019] A plurality of candidate charging stations are determined within a first preset range of the central point.

[0020] Furthermore, determining the center point of each destination combination includes:

[0021] Connecting the destinations in each destination combination in sequence to form a polygon;

[0022] The center point of the polygon is determined as the center point of the corresponding destination combination.

[0023] Furthermore, determining a plurality of candidate charging stations based on the destination combination includes:

[0024] Connecting the destinations in the destination combinations in sequence to form a formal path;

[0025] The charging stations within the second preset range of the driving route are determined as candidate charging stations.

[0026] Furthermore, after matching the plurality of candidate charging stations with the destination combination to form a matching group, the method further includes:

[0027] Obtaining the remaining power of the user's vehicle;

[0028] Obtaining the user's range based on the remaining power;

[0029] Based on the cruising range, matching groups corresponding to candidate charging stations that are not covered by the cruising range are eliminated to obtain remaining matching groups.

[0030] Furthermore, the destination types include:

[0031] At least one of a shopping type, a stadium type, a hospital type, and a tourist attraction type.

[0032] In a second aspect, the present invention further provides a charging recommendation device, comprising:

[0033] A first acquisition module is used to acquire one or more destination types that the user's vehicle is about to go to;

[0034] a second acquisition module, configured to determine a full destination combination according to the one or more destination types;

[0035] a determination module, configured to determine a plurality of candidate charging stations based on the destination combination;

[0036] a forming module, configured to match the plurality of candidate charging stations with the destination combination to form a matching group;

[0037] The recommendation module is used to recommend the matching group to the user.

[0038] In a third aspect, the present invention further provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned method steps when executing the program.

[0039] In a fourth aspect, the present invention further provides a computer-readable storage medium having a computer program stored thereon, which implements the above-mentioned method steps when executed by a processor.

[0040] One or more technical solutions in the embodiments of the present invention have at least the following technical effects or advantages:

[0041] The present invention provides a charging recommendation method, comprising: obtaining one or more destination types that a user's vehicle is about to travel to; determining a destination combination based on the one or more destination types; determining multiple candidate charging stations based on the destination combination; matching the multiple candidate charging stations with the destination combination to form a matching group; making recommendations to the user based on the matching group, and then providing the user with the most economical matching group through combined matching, thereby improving the energy efficiency of the user's vehicle. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Various other advantages and benefits will become apparent to those skilled in the art upon reading the detailed description of the preferred embodiment below. The accompanying drawings are for illustration purposes only and are not to be considered as limiting the present invention. Throughout the drawings, the same reference figures denote the same components. In the drawings:

[0043] Figure 1 A schematic diagram showing the steps of the charging recommendation method in the first embodiment of the present invention is shown;

[0044] Figure 2 A schematic diagram showing multiple destination types obtained in the first embodiment of the present invention is shown;

[0045] Figure 3 A schematic diagram showing the demarcation of a preset range in the first embodiment of the present invention is shown;

[0046] Figure 4 It shows a schematic structural diagram of a charging recommendation device in a second embodiment of the present invention;

[0047] Figure 5A structural schematic diagram of a computer device for implementing the charging recommendation method in Embodiment Three of the present application is shown. DETAILED DESCRIPTION

[0048] Exemplary embodiments of the present disclosure will be described in greater detail below with reference to the accompanying drawings. Although exemplary embodiments of the present disclosure are shown in the drawings, it is understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided so that the present disclosure can be more thoroughly understood and the scope of the present disclosure can be accurately conveyed to those skilled in the art.

[0049] Embodiment One

[0050] Embodiment One of the present application provides a charging recommendation method, which is applied in the process of a user's trip. The user does not determine a specific destination in this trip, but only determines the destination type, such as a shopping type destination, a stadium type destination, a hospital type destination, a scenic spot type destination, etc.

[0051] In this trip, a suitable charging station needs to be recommended to the user. The charging recommendation method provided by the present application includes the following steps: Figure 1

[0052] S101, obtaining one or more destination types to which a user's vehicle is about to go;

[0053] S102, determining a destination combination according to the one or more destination types;

[0054] S103, determining a plurality of candidate charging stations based on the destination combination;

[0055] S104, matching the plurality of candidate charging stations with the destination combination to form a matching group;

[0056] S105, recommending the matching group to the user.

[0057] In a specific embodiment, first, the one or more destination types to which the user's vehicle is about to go are determined according to the step of S101, such as the user's trip in this time needs to go shopping, fitness and medical treatment.

[0058] Specifically, the one or more destination types can be determined by the user's search record using a mobile phone or voice intent, which is not limited herein.

[0059] Thus, the plurality of destination types to which the user's vehicle is about to go are determined as a shopping type destination, a stadium type destination, and a hospital type destination.

[0060] ​Next, step S102 is executed to determine a destination combination according to one or more destination types.

[0061] In an optional embodiment, candidate destinations are determined based on one or more destination types; and then, based on the candidate destinations, multiple candidate destination combinations are determined.

[0062] For example, Figure 2 As shown, there are three destination types, namely shopping, hospital and stadium, thus obtaining candidate destinations: three shopping places, three hospitals and two stadiums.

[0063] Next, based on the three shopping places, three hospitals and two stadiums, approximately 18 destination combinations of shopping places, hospitals and stadiums are obtained.

[0064] Then, multiple candidate destination combinations are filtered based on any one or more of the following filtering conditions:

[0065] The time limit for user's vehicle driving, the mileage limit for user's vehicle driving, and the distance limit between destinations in the destination combination.

[0066] In this way, a combination of destinations that meets the filtering conditions is obtained.

[0067] For example, since the current cruising range of the vehicle is 30 km, that is, the mileage limit of the vehicle is 30 km, among all candidate destination combinations, candidate destination combinations with a range greater than 30 km are screened out to obtain destination combinations that meet the screening condition.

[0068] Or the user sets the travel time to 3 hours, and among all candidate destination combinations, the candidate destination combinations with a travel time exceeding 3 hours are filtered out to obtain the destination combinations that meet the screening condition.

[0069] Or if the user sets the distance between the hospital and the stadium to be within 2 km, then among all candidate destination combinations, the candidate destination combinations with a distance between the hospital and the stadium greater than 2 km are screened out to obtain destination combinations that meet the screening condition.

[0070] The above screening conditions can be one or a combination of multiple conditions, which is not limited here.

[0071] Of course, there may be other screening conditions, which are not described here.

[0072] Then, S103 is executed to determine a plurality of candidate charging stations based on the destination combination.

[0073] In an optional embodiment, a center point of each destination combination is determined; and then, a plurality of candidate charging stations are determined within a first preset range of the center point.

[0074] The center point may be a point with the same driving distance to each destination type in each combination, or a point with the same straight-line distance to each destination type, which is not limited here.

[0075] To determine the center point of each destination combination, the destinations in each destination combination are sequentially connected to form a polygon. For example, connecting Shopping 1, Stadium 2, and Hospital 2 forms a triangle. The center point of this polygon is determined as the center point of the corresponding destination combination. In other words, the center point of the triangle is determined as the center point of the corresponding destination combination.

[0076] Of course, the destinations in each destination combination can be connected in sequence to form a quadrilateral or a pentagon, which will not be described in detail here.

[0077] After determining the center point of each destination combination, the first preset range is determined with the center point as the center of the circle and the length of the distance from the center point that meets the preset distance as the radius. The first preset distance is the distance corresponding to the destination type that is farthest from the center point.

[0078] Specific as Figure 3 As shown, in the destination combination consisting of shopping 1, stadium 2 and hospital 2, the determined center point O is used as the center of the circle, and the length from the hospital 2 farthest from the center point O to the center point O is used as the radius to determine the first preset range, that is, the range of the circle with the center point O as the center.

[0079] Next, multiple candidate charging stations are determined within the first preset range, that is, multiple candidate charging stations within the range of a circle with the center point O as the center.

[0080] In an optional implementation, each destination may be used as a center point in each destination combination, so that charging stations within a preset range around each destination are selected as multiple candidate charging stations.

[0081] In an optional implementation, the destinations in each destination combination are sequentially connected to form a driving route; and the charging stations within a second preset range of the driving route are determined as candidate charging stations.

[0082] Determining candidate charging stations along the driving route can effectively save driving time and improve travel efficiency. The second preset range is a range that meets the preset distance from the driving route.

[0083] Then, S104 is executed to match multiple candidate charging stations with destination combinations to form a matching group.

[0084] For example, within the above preset range, four candidate charging stations are determined. These four candidate charging stations are matched with the destination combination respectively. After obtaining the matching group, it also includes:

[0085] Eliminate matching groups that do not meet the conditions.

[0086] In an optional implementation, matching groups that do not meet the cruising range are eliminated.

[0087] Specifically, the remaining power of the user's vehicle is first obtained; based on the remaining power, the user's cruising range is obtained; finally, based on the cruising range, the matching groups corresponding to the candidate charging stations that are not covered by the cruising range are eliminated to obtain the remaining matching groups.

[0088] The cruising range of the current remaining power is determined according to the remaining power of the user's vehicle, thereby eliminating matching groups that cannot be reached by the cruising range of the user's vehicle and retaining the remaining matching groups, thereby obtaining matching groups that can improve travel efficiency.

[0089] In an optional embodiment, matching groups whose driving time is longer than a preset time are eliminated.

[0090] For example, if some matching groups require the user to travel for a longer time than the preset 3 hours, the matching groups that exceed the 3-hour travel time will be eliminated. Since the preset travel time is the maximum travel time of the user, the matching groups that exceed the preset travel time need to be eliminated.

[0091] In an optional embodiment, matching groups with a mileage greater than a preset mileage are eliminated.

[0092] Some matching groups require the user's vehicle to travel more than 50km, and these matching groups with a mileage greater than 50km will be eliminated. Since the preset mileage is the maximum mileage set by the user, matching groups that exceed the preset mileage need to be eliminated.

[0093] Finally, the remaining matching groups are obtained. These matching groups have been screened layer by layer and can meet the vehicle's range or can save time for users.

[0094] Finally, S105 is executed to recommend the matching group to the user.

[0095] Recommendations can be made directly to users via mobile phones, and of course can also be pushed directly to the display screen on the user's vehicle, which is not limited here.

[0096] The user makes a selection based on the recommended matching groups, and navigation is then performed based on the user's selection.

[0097] This invention is suitable for situations where the user is unsure of the specific destination, but only determines the destination type. By adopting the charging recommendation method of the present invention, the user can find the best charging station and match the user with the best charging station based on time, mileage, and range, thus facilitating travel and saving energy.

[0098] One or more technical solutions in the embodiments of the present invention have at least the following technical effects or advantages:

[0099] The present invention provides a charging recommendation method, comprising: obtaining one or more destination types that a user's vehicle is about to travel to; determining a destination combination based on the one or more destination types; determining multiple candidate charging stations based on the destination combination; matching the multiple candidate charging stations with the destination combination to form a matching group; recommending the matching group to the user, and then providing the user with the most economical matching group through combined matching, thereby improving the energy efficiency of the user's vehicle.

[0100] Example 2

[0101] Based on the same inventive concept, the second embodiment of the present invention provides a charging recommendation device, such as Figure 4 Shown, including:

[0102] The first acquisition module 401 is used to obtain one or more destination types that the user's vehicle is about to go to;

[0103] A second acquisition module 402 is configured to determine a destination combination based on one or more destination types;

[0104] A determination module 403 is configured to determine a plurality of candidate charging stations based on the destination combination;

[0105] a forming module 404 for matching the plurality of candidate charging stations with the destination combination to form a matching group;

[0106] The recommendation module 405 is configured to recommend the matching group to the user.

[0107] In an optional implementation, the first acquisition module 401 includes:

[0108] a first determining unit, configured to determine a candidate destination according to the one or more destination types;

[0109] a second determining unit, configured to determine a plurality of candidate destination combinations based on the candidate destinations;

[0110] The screening unit is configured to screen the plurality of candidate destination combinations based on any one or more of the following screening conditions:

[0111] a time limit of driving of the user vehicle, a mileage limit of driving of the user vehicle, a distance limit between two adjacent destination types in the plurality of destination types;

[0112] The obtaining unit is configured to obtain the destination combinations that satisfy the screening conditions.

[0113] In an optional implementation, the determining module 403 comprises:

[0114] The third determining unit is configured to determine a center point of each destination combination.

[0115] The fourth determining unit is configured to determine, within a first preset range of the center point, a plurality of candidate charging stations.

[0116] In an optional implementation, the third determining unit comprises:

[0117] The first forming sub-unit is configured to sequentially connect each destination type in the each destination combination to form a polygon.

[0118] The first determining sub-unit is configured to determine a center point of the polygon as the center point of the corresponding destination combination.

[0119] In an optional implementation, the determining module 403 comprises:

[0120] The second forming sub-unit is configured to sequentially connect each destination in the each destination combination to form a driving path.

[0121] The second determining sub-unit is configured to determine a charging station within a second preset range of the driving path as a candidate charging station.

[0122] In an optional implementation, the method further comprises:

[0123] The third obtaining module is configured to obtain a remaining power of the user vehicle.

[0124] The first obtaining module is configured to obtain a cruising range of the user based on the remaining power.

[0125] The second obtaining module is configured to, based on the cruising range, eliminate a matching group corresponding to a candidate charging station that cannot be covered by the cruising range, and obtain a remaining matching group.

[0126] In an optional implementation, the destination type comprises:

[0127] At least one of shopping type, stadium type, hospital type, and tourist attraction type.

[0128] Example 3

[0129] Based on the same inventive concept, a third embodiment of the present invention provides an electronic device, such as Figure 5 As shown, it includes a memory 504, a processor 502 and a computer program stored in the memory 504 and executable on the processor 502. When the processor 502 executes the program, the steps of the above-mentioned charging recommendation method are implemented.

[0130] Among them, Figure 5 In the embodiment of the present invention, a bus architecture (represented by bus 500) is shown. Bus 500 may include any number of interconnected buses and bridges, and bus 500 links together various circuits including one or more processors represented by processor 502 and memory represented by memory 504. Bus 500 may also link together various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. Bus interface 506 provides an interface between bus 500 and receiver 501 and transmitter 503. Receiver 501 and transmitter 503 may be the same component, namely a transceiver, which provides a unit for communicating with various other devices over a transmission medium. Processor 502 is responsible for managing bus 500 and general processing, while memory 504 may be used to store data used by processor 502 when performing operations.

[0131] Example 4

[0132] Based on the same inventive concept, a fourth embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon, which implements the steps of the above-mentioned charging recommendation method when executed by a processor.

[0133] The algorithm and display provided herein are not inherently related to any particular computer, virtual system or other device. Various general-purpose systems can also be used together with the teachings based on this. According to the above description, it is obvious that the structure required for constructing this type of system. In addition, the present invention is not directed to any specific programming language. It should be understood that various programming languages ​​can be utilized to realize the content of the present invention described herein, and the above description of specific languages ​​is for the purpose of disclosing the best mode of the present invention.

[0134] In the description provided herein, numerous specific details are described. However, it is understood that embodiments of the present invention may be practiced without these specific details. In some instances, well-known methods, structures, and techniques are not shown in detail so as not to obscure the understanding of this description.

[0135] Similarly, it is to be understood that the embodiments of the present application can be placed into practice notwithstanding modifications to form yet further embodiments of the present application. As such, the terms and expressions of the foregoing description are used solely by way of the example thereof, but to the extent possible no limitation is intended to the details of the construction described herein other than as described in the claims. In this manner, the embodiments of the present application as described herein are susceptible to modifications and alternative forms known to those skilled in the art. It is, therefore, desired to be protected in the broadest scope of the appended claims as they can be interpreted to cover the subject matter of the above description.

[0136] Those skilled in the art can appreciate that modules in the apparatus in the embodiments can be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components in the embodiments can be combined into one module or unit or component, and further can be divided into multiple sub-modules or sub-units or sub-components. Any combination of all the features disclosed in the specification (including the accompanying claims, abstract and drawings), and any method or apparatus of all the processes or units disclosed in the specification as such can be adopted in any combination, except that at least some of such features and / or processes or units are mutually exclusive. Unless explicitly stated otherwise, each feature disclosed in the specification (including the accompanying claims, abstract and drawings) can be replaced by an alternative feature providing the same, equivalent or similar function.

[0137] Furthermore, those skilled in the art will appreciate that different embodiments of the application have different features and that not all embodiments of the application will exhibit all of the features described or claimed. It is therefore intended that the scope of the application extend to all features and embodiments disclosed or claimed herein, alone or in any combination with one another.

[0138] The various component embodiments of the present invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or digital signal processor (DSP) may be used in practice to implement some or all of the functions of some or all of the components of a charging recommendation device or electronic device according to an embodiment of the present invention. The present invention may also be implemented as a device or device program (e.g., a computer program and a computer program product) for executing part or all of the methods described herein. Such a program for implementing the present invention may be stored on a computer-readable medium, or may be in the form of one or more signals. Such a signal may be downloaded from an Internet website, or provided on a carrier signal, or provided in any other form.

[0139] It should be noted that the above embodiments illustrate rather than limit the invention, and that those skilled in the art may devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between brackets should not be construed as limiting the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The present invention may be implemented by means of hardware comprising several different elements and by means of appropriately programmed computers. In a unit claim enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third etc. does not indicate any order. These words may be interpreted as names.

Claims

1. A charging recommendation method for a user who does not determine a specific destination but only a destination type, characterized in that: include: Obtain one or more destination types that the user's vehicle is about to travel to; Determining a destination combination based on the one or more destination types includes: determining a candidate destination based on the one or more destination types; determining a plurality of combinations of the candidate destinations based on the candidate destinations; The plurality of candidate destination combinations are filtered based on any one or more of the following filtering conditions: Time limit for user vehicle driving, mileage limit for user vehicle driving, and distance limit between destinations in a destination combination; Obtaining the destination combination that meets the screening condition; determining a plurality of candidate charging stations based on the destination combination; matching the plurality of candidate charging stations with the destination combination to form a matching group; The matching group is recommended to the user.

2. The method according to claim 1, wherein The determining of a plurality of candidate charging stations based on the destination combination includes: Determine the center point of each destination combination; A plurality of candidate charging stations are determined within a first preset range of the central point.

3. The method according to claim 2, wherein Determining the center point of each destination combination includes: Connecting the destinations in each destination combination in sequence to form a polygon; The center point of the polygon is determined as the center point of the corresponding destination combination.

4. The method according to claim 1, wherein The determining of a plurality of candidate charging stations based on the destination combination includes: Connecting the destinations in the destination combinations in sequence to form a driving route; The charging stations within the second preset range of the driving route are determined as candidate charging stations.

5. The method according to claim 1, wherein After matching the plurality of candidate charging stations with the destination combination to form a matching group, the method further includes: Get the remaining power of the user's vehicle; Obtaining the user's range based on the remaining power; Based on the cruising range, matching groups corresponding to candidate charging stations that are not covered by the cruising range are eliminated to obtain remaining matching groups.

6. The method according to any one of claims 1 to 5, wherein: The destination types include: At least one of a shopping type, a stadium type, a hospital type, and a tourist attraction type.

7. A charging recommendation device for use when a user does not determine a specific destination but only a destination type, characterized in that: include: A first acquisition module is used to acquire one or more destination types that the user's vehicle is about to go to; The second acquisition module is configured to determine a destination combination according to the one or more destination types, including: determining a candidate destination based on the one or more destination types; determining a plurality of combinations of the candidate destinations based on the candidate destinations; The plurality of candidate destination combinations are filtered based on any one or more of the following filtering conditions: Time limit for user vehicle driving, mileage limit for user vehicle driving, and distance limit between destinations in a destination combination; Obtaining the destination combination that meets the screening condition; a determination module, configured to determine a plurality of candidate charging stations based on the destination combination; a forming module, configured to match the plurality of candidate charging stations with the destination combination to form a matching group; The recommendation module is used to recommend the matching group to the user.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the method steps according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method steps according to any one of claims 1 to 6 are implemented.

Images