Path planning method, device, electronic device and readable storage medium

Through the path planning method, users can select multiple destinations and determine a reasonable destination combination based on carbon emission limits, solving the problems of rigid navigation methods and insufficient carbon emission attention in the prior art, and realizing multi-destination navigation and carbon emissions Effective management.

CN114111823BActive Publication Date: 2024-12-27SHANDONG ENERGY CHAIN HLDG CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111215437.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-10-19
Publication Date
2024-12-27
Estimated Expiration
2041-10-19

AI Technical Summary

Technical Problem

Existing path navigation technologies cannot support scenarios in multiple destinations on a single trip, and lack attention to carbon emissions, especially inadequate design and planning for individuals.

Method used

Provide a path planning method where users can select multiple destinations, determine several groups of destination combinations based on the expected carbon emission limit, and recommend them to users to ensure that carbon emissions meet personal requirements, and obtain the user's current location and purpose. The land type and historical travel records, combined with the vehicle's remaining energy volume, determine a reasonable destination combination, and plan energy supply stations if necessary.

Benefits of technology

A flexible navigation method is realized, and users can choose multiple destinations to minimize carbon emissions, ensure that carbon emissions meet personal limits, and provide reasonable planning and savings on carbon emissions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114111823B_ABST
    Figure CN114111823B_ABST
Patent Text Reader

Abstract

The present application discloses a route planning method, device, electronic device and readable storage medium, the method comprising: determining the current location of the user; obtaining the user's destination type and the expected carbon emission limit for this trip; determining at least one set of destination combinations and recommending them to the user based on the expected carbon emission limit, the user's current location, and the user's destination type. The navigation method of the present application supports users to select multiple destinations, the navigation method is flexible, and enables users to achieve reasonable route planning with the least or less carbon emissions, so as to achieve the purpose of saving carbon emissions as much as possible, so that the user's carbon emissions meet the requirements of personal carbon emission limits.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of path navigation technology, and in particular to a path planning method, device, electronic device and readable storage medium. Background Art

[0002] The carbon trading market is gradually developing, and in the future, both companies and individuals will have corresponding carbon emission limits.

[0003] In the existing path navigation technology, users can only choose one destination, and it does not support scenarios where one trip corresponds to multiple destinations. The navigation method is rigid and lacks attention to carbon emissions, especially the lack of design and planning for personal carbon emissions. Summary of the invention

[0004] An embodiment of the present application provides a route planning method and device, in which a user can select multiple destinations, and according to the expected carbon emission limit, several groups of destination combinations are planned for the user to choose from, which not only ensures that the user can reach the expected destination, but also reduces the carbon emissions for the user as much as possible, so that the user's carbon emissions meet the personal carbon emission requirements.

[0005] In a first aspect, a path planning method is provided, the method comprising:

[0006] Determine the user's current location;

[0007] Obtain the user's destination type and the expected carbon emission limit for this trip;

[0008] At least one destination combination is determined based on the expected carbon emission limit, the current location of the user, and the user destination type, and is recommended to the user.

[0009] Optionally, in the above method, the destinations are combined into multiple groups, and the method further includes:

[0010] Receive user's filter criteria;

[0011] At least one group of intended destination combinations is selected from the multiple groups of destination combinations according to the screening conditions for selection by the user.

[0012] Optionally, in the above method, at least one group of intended destination combinations is selected from the multiple groups of destination combinations according to the screening condition, including

[0013] If a set of destination combinations satisfies at least one of the total driving time not exceeding a preset time threshold, the driving mileage not exceeding a preset mileage threshold, and the distance between destinations not exceeding a preset distance threshold, then the destination combination is determined to be an intended destination combination.

[0014] Optionally, the above method further includes:

[0015] Determine the energy requirements for the vehicle to complete the entire journey to each destination combination;

[0016] Obtain the remaining energy of the user's vehicle;

[0017] If it is determined that the remaining energy amount is less than the energy demand corresponding to any destination combination; then the energy refueling stations within the preset range of the destination combination are determined so that the user's vehicle can be refueled, wherein the total carbon emissions required for the user to complete the entire journey to the energy refueling stations and the destination combination is not greater than the expected carbon emission limit.

[0018] Optionally, in the above method, obtaining the user's destination type and the expected carbon emission limit for this trip includes:

[0019] Get the user's historical travel records;

[0020] The expected carbon emission limit for the current trip is determined based on the historical travel records of the user.

[0021] Optionally, in the above method, determining at least one set of destination combinations according to the expected carbon emission limit, the current location of the user, and the user destination type includes:

[0022] Determine the maximum drivable distance based on the remaining energy of the vehicle;

[0023] Determine a candidate destination range according to the maximum drivable distance and the current location of the user;

[0024] Determine a plurality of destinations within the candidate destination range according to the user destination type;

[0025] Combining multiple destinations to determine multiple candidate destination combinations;

[0026] At least one destination combination is determined from the plurality of candidate destination combinations according to the expected carbon emission limit and the maximum drivable distance.

[0027] In a second aspect, a path planning device is provided, the device comprising:

[0028] A positioning unit, used to determine the current location of the user;

[0029] An acquisition unit, used to acquire the user's destination type and the expected carbon emission limit for this trip;

[0030] A selection unit is used to determine at least one set of destination combinations and recommend them to the user based on the expected carbon emission limit, the current location of the user and the user destination type.

[0031] In a third aspect, an embodiment of the present application further provides an electronic device, comprising: a processor; and a memory arranged to store computer executable instructions, wherein the executable instructions, when executed, cause the processor to perform any of the above methods.

[0032] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, which stores one or more programs, and when the one or more programs are executed by an electronic device including multiple applications, the electronic device executes any of the above methods.

[0033] At least one of the above technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects:

[0034] This application determines multiple destinations according to the user's expected carbon emission limit and the type of destination selected by the user, and forms multiple destination combinations from the multiple destinations. The user can select one group from the multiple destination combinations for travel reference. The navigation method of this application supports users to select multiple destinations, and the navigation method is flexible, and enables users to achieve reasonable route planning with the least or less carbon emissions, so as to achieve the purpose of saving carbon emissions as much as possible, so that the user's carbon emissions meet the requirements of personal carbon emission limits. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0036] Figure 1 A schematic diagram showing a flow chart of a path planning method according to an embodiment of the present application;

[0037] Figure 2 A schematic diagram showing a flow chart of a path planning method according to another embodiment of the present application;

[0038] Figure 3 A schematic diagram showing the structure of a path planning device according to an embodiment of the present application is shown;

[0039] Figure 4 This is a schematic diagram of the structure of an electronic device in an embodiment of the present application. DETAILED DESCRIPTION

[0040] In order to make the purpose, technical solution and advantages of the present application clearer, the technical solution of the present application will be clearly and completely described below in combination with the specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0041] The technical solutions provided by various embodiments of the present application are described in detail below in conjunction with the accompanying drawings.

[0042] In the prior art, when navigating for users, users can usually only select a specific destination, such as Supermarket A. The navigation method is rigid and does not pay attention to the user's carbon emissions, which cannot meet the future requirements for personal carbon emissions.

[0043] Figure 1 A schematic diagram showing a flow chart of a path planning method according to an embodiment of the present application is shown. Figure 1 It can be seen that the present application at least includes steps S110 to S140:

[0044] Step S110: Determine the current location of the user.

[0045] This application aims to solve the defects in the existing navigation technology and provides a path planning method. First, the user's current location information is obtained through the positioning system of the user's terminal device, such as a mobile phone, tablet computer, or vehicle-mounted terminal. The positioning system includes but is not limited to the global positioning system GPS or Beidou system.

[0046] Step S120: Obtain the user's destination type and the expected carbon emission limit for this trip.

[0047] Then obtain the user's destination type. This application can be applied to situations where there is only one destination or multiple destinations. In local applications, users do not need to specify a specific destination, but only need to specify the destination type, such as providing a selection page for users to select their intended destination. For example, if a user wants to go to a supermarket, he does not need to specify the destination as Supermarket A, but only needs to specify the destination type as a supermarket. When a user wants to go to multiple destinations, he can select multiple destination types, such as supermarkets, cinemas, and gyms.

[0048] In addition to the user's destination type, it is also necessary to know the user's expected carbon emission limit for this trip. In some embodiments of the present application, this value can be specified by the user; in other embodiments of the present application, since the user is not particularly aware of the remaining carbon emission limit for this trip in this carbon emission measurement cycle, the user may not specify the expected carbon emission limit for this trip, but the server that executes this application obtains the user's historical travel records; based on the user's historical travel records, the remaining carbon emission limit for the user in this carbon emission measurement cycle is determined, and the expected carbon emission limit is allocated for this trip.

[0049] Step S130: Determine at least one set of destination combinations and recommend them to the user based on the expected carbon emission limit, the user's current location, and the user's destination type.

[0050] Then, based on the expected carbon emission quota of the user's trip, the user's current location and the user's destination type, one or more destination combinations are determined and recommended to the user for selection. The carbon value required for the user to reach any combination of destinations is not greater than the expected carbon emission quota of this trip, so as to achieve reasonable planning and utilization of carbon emissions.

[0051] This application does not limit the method for determining the destination combination. For example, the maximum distance that can be traveled for this trip can be determined based on the expected carbon emission limit of the user's trip, and then a geographical range, i.e., the candidate destination range, can be determined based on the user's current location and the maximum distance that can be traveled for this trip. Within this geographical range, multiple destinations are determined based on the user's destination type, and multiple destinations are combined according to type. The distance that the user needs to travel to reach all destinations in each combination is calculated, and the destination combination that needs to travel a distance less than the maximum distance that can be traveled for this trip and whose carbon emissions do not exceed the expected carbon emission limit is recommended to the user as the selected target destination combination. The multiple destinations included in each destination combination correspond to a user's destination type, so that the user can reach destinations that include all destination types.

[0052] In some embodiments of the present application, the maximum traversable distance for this trip can be determined based on the remaining battery power / fuel level, etc.; in other embodiments of the present application, the user's personalized factors can also be taken into account, such as the average level of the user's historical travel, etc., which is not limited by the present application.

[0053] The following example describes in detail the selection process for the destination combination. If the user has only one destination type, such as a supermarket, assuming that the maximum drivable distance is 10km, all supermarkets within a 10km radius of the user's current location can be determined, and each supermarket is a destination combination. Supermarkets whose carbon emissions consumed by driving to multiple supermarkets do not exceed the expected carbon emission limit are pushed to the user for selection. In some embodiments of the present application, in order to facilitate the user's selection, the specific information of the user when arriving at each supermarket can also be marked, such as the distance, the carbon emissions required to be consumed, the expected arrival time, etc.

[0054] If the user has multiple destination types, multiple destinations around the user's current location can be determined based on the maximum drivable distance for this trip and the destination type, and then the multiple destinations can be combined. The destination combinations can be filtered by the maximum drivable distance for this trip. When filtering, the distance from the user's current location to all destinations in the destination combination must not be greater than the maximum drivable distance for this trip.

[0055] Taking supermarkets and gyms as an example of destination types, and still assuming that the maximum drivable distance for this trip is 10km, all supermarkets and all gyms within 10km of the user's current location can be determined. Assuming that there are supermarkets A and supermarket B, and gyms include gym a and gym b, further, the above two supermarkets and two gyms can be fully permuted and combined to determine candidate destination combinations. The candidate destination combinations are supermarket A+gym a, supermarket A+gym b, supermarket B+gym a and supermarket B+gym b.

[0056] Assume that the distances that users need to travel to reach supermarket A + gym a, supermarket A + gym b, supermarket B + gym a and supermarket B + gym b are 11km, 9km, 10km and 8km respectively. The maximum drivable distance for this trip is 10km, which can eliminate the candidate destination combination of supermarket A + gym a, and thus determine the destination combinations of supermarket A + gym b, supermarket B + gym a and supermarket B + gym b. Then calculate the carbon emissions required for users to reach each candidate destination combination, and select the combination that meets the expected carbon emission limit for users to choose.

[0057] Of course, the method of selecting destination combinations will not be limited to the above-mentioned forms. The above-mentioned forms are merely illustrative. Any method that can meet the restrictive conditions of the expected carbon emission limit is acceptable, and there is no restriction without application.

[0058] It should be noted that on the interface of the user terminal, the specific navigation conditions of various destination combinations can be pushed to the user together, which is the same as the prior art and will not be described in detail in this application.

[0059] from Figure 1 It can be seen from the method shown that the present application determines multiple destinations according to the user's expected carbon emission limit and the destination type selected by the user, and forms multiple destination combinations from the multiple destinations. The user can select one group from the multiple destination combinations for travel reference. The navigation method of the present application supports users to select multiple destinations, and the navigation method is flexible, and enables users to achieve reasonable route planning with the least or less carbon emissions, so as to achieve the purpose of saving carbon emissions as much as possible, so that the user's carbon emissions meet the requirements of personal carbon emission limits.

[0060] In some embodiments of the present application, in the above method, the destination combination is a plurality of groups, and the method further includes: receiving filtering conditions of the user; and selecting at least one group of intended destination combination from the plurality of destination combinations according to the filtering conditions for the user to select.

[0061] After selecting multiple destination combinations, one or more intended destination combinations of the user may be further selected from the multiple destination combinations according to the user's personalized requirements for the user to choose.

[0062] For example, when receiving the user's destination type and the expected carbon emission limit for this trip, the user's personalized screening conditions can also be received at the same time, such as one or a combination of total mileage restrictions, total driving time restrictions, and distance restrictions before the destination, etc. When screening the user's intended destination combinations, it is determined whether the destination combination is retained based on these conditions.

[0063] If a set of destination combinations satisfies at least one of the following conditions: the total driving time is not greater than the preset time threshold, the driving mileage is not greater than the preset mileage threshold, and the distance between the destinations is not greater than the preset distance threshold, then the destination combination is determined to be an intended destination combination. If a set of destination combinations does not meet the above conditions, then the destination combination can be excluded. This application does not limit the selection method of the intended destination combination, and it can be flexibly adjusted according to the user's personalized preferences.

[0064] In some embodiments of the present application, the above method also includes: determining the energy requirement of the user to reach each destination combination; obtaining the remaining energy of the user's vehicle; separately determining whether the remaining energy of the user's vehicle is greater than the energy requirement of the user to reach each destination combination; and taking the destination combination in which the remaining energy of the user's vehicle is greater than the energy requirement as the final destination combination for the user to select.

[0065] In some embodiments of the present application, it is also possible to consider whether the remaining fuel or remaining power of the user's vehicle can meet the energy requirements of the user to reach all locations in the destination combination. If so, all destination combinations can be pushed to the user. If there are destination combinations whose energy requirements are greater than the remaining fuel of the user's vehicle, these destination combinations will be excluded.

[0066] In other embodiments of the present application, the above method also includes: determining the energy demand required for the vehicle to complete the entire journey of each destination combination; obtaining the remaining energy of the user's vehicle; if it is determined that the remaining energy is less than the energy demand corresponding to any destination combination; then determining an energy refueling station within a preset range of the destination combination so that the user's vehicle can be refueled, wherein the sum of the carbon emissions required for the user to reach the energy refueling station and the destination combination is not greater than the expected carbon emission limit.

[0067] In other embodiments of the present application, one or more energy refueling stations, such as gas stations, may be planned on the route to the destination combination according to the remaining energy of the vehicle and the total energy demand of the user to reach all locations in the selected destination combination for the user to refuel. It should be noted that during planning, the total carbon emissions required for the user to complete the energy refueling station and the entire journey of the destination combination shall not exceed the expected carbon emission limit.

[0068] For example, if a user is traveling to a destination in a destination combination, the user's vehicle can travel 40 km based on the remaining energy of the user's vehicle, and the distance to the last destination in the destination combination is still 60 km. In this case, one or more energy refueling stations with a reasonable distance can be found within the preset range between the current location and the path to the destination combination, so that the user's vehicle can be refueled. However, the total carbon emissions required for the user to reach the energy refueling station and the destination combination must not exceed the expected carbon emission limit.

[0069] In some embodiments of the present application, in the above method, obtaining the user's destination type and the expected carbon emission limit for the trip includes: providing a front-end page, the front-end page including multiple user travel information configuration items, the user travel information configuration items including destination type configuration items and expected carbon emission limit configuration items; in response to configuration instructions for the user travel information configuration items, obtaining the user's destination type and the expected carbon emission limit for the trip through the front-end page.

[0070] In order to facilitate the use of users, a front-end page can be provided on the user's terminal device, such as a mobile phone, tablet computer, car navigation, etc. The front-end page contains multiple configuration items that can be selected or filled in. The user can fill in the user's travel information in the configuration items, including but not limited to the destination type and the expected carbon emission limit, and can also include some route deviations or requirements, etc. In response to the user clicking the configuration instruction on the terminal device, specifically, it can be a navigation instruction of the front-end page, and the destination type and the expected carbon emission limit of this trip entered by the user are obtained through the front-end page.

[0071] Correspondingly, a control corresponding to the user travel information configuration item of the front-end page is set on the server side. The control is used to control the display of the front-end page. The control can be configured according to the information required to execute this application once, such as which are mandatory items or mandatory selection items that the user must fill in or select, and which are optional items or optional selection items.

[0072] In other embodiments of the present application, if the user does not have a clear plan for the carbon emissions of this trip, the expected carbon emission limit may not be filled in. In this case, the expected carbon emission limit can be automatically generated. Specifically, the user's historical travel records are obtained; based on the user's historical travel records, the expected carbon emission limit for this trip is determined. More specifically, the user's historical travel records of one or more times in this carbon emission measurement period can be obtained. According to the historical travel records, the carbon emissions that the user has generated in this carbon emission measurement period are calculated, and the remaining carbon emissions are obtained by subtracting the carbon emissions that have been generated from the total carbon emission limit of this carbon emission measurement period. The remaining carbon emissions can be directly used as the expected carbon emission limit for this trip; further, the time factor can also be taken into account. For example, if October 2020 is the current carbon emission measurement period and the current time is October 15, 2020, the remaining carbon emissions can be divided into multiple equal parts, and one part can be used as the expected carbon emission limit for this trip.

[0073] In some embodiments of the present application, the following methods can also be used to select destination combinations. Specifically, the maximum drivable distance can be determined based on the remaining energy of the vehicle; the range of candidate destinations can be determined based on the maximum drivable distance and the user's current location; multiple destinations can be determined within the candidate destination range based on the user's destination type; multiple destinations can be combined to determine multiple candidate destination combinations; and at least one group of destination combinations can be determined from multiple candidate destination combinations based on the expected carbon emission limit.

[0074] That is to say, the maximum drivable distance for this trip is first calculated based on the remaining energy of the vehicle, and based on the maximum drivable distance, a range of candidate destinations is planned around the current location of the user, multiple destination combinations are determined from the range of candidate destinations, and the carbon emissions required for the user to reach each set of destination combinations are calculated, and destination combinations whose required carbon emissions are greater than the expected carbon emission limit for this trip and whose total driving distance is greater than the maximum driving distance are excluded from the multiple candidate destination combinations, and one or more sets of destination combinations are recommended to the user for selection.

[0075] Figure 2 A schematic diagram showing a flow chart of a path planning method according to another embodiment of the present application is shown. Figure 2 It can be seen that this implementation includes the following steps:

[0076] Determine the user's current location, obtain the user's destination type, and personalize restrictions.

[0077] Obtain all the user's historical trips in this emission measurement period, and determine the expected carbon emission limit for this trip based on the historical trips.

[0078] The remaining energy amount of the user's vehicle is obtained, and based on the remaining energy amount, the maximum drivable distance is determined.

[0079] Multiple destinations are determined according to the maximum drivable distance, the user's current location information, and the destination type, and the multiple destinations are combined to obtain multiple groups of candidate destination combinations.

[0080] It is determined whether the distance from the user's current location to all destinations in each candidate destination combination is greater than the maximum drivable distance. If so, the candidate destination combination is excluded; if not, the candidate destination combination is retained.

[0081] It is determined whether the carbon emissions required for the user to reach each reserved candidate destination combination are greater than the expected carbon emissions of this trip. If so, the candidate destination combination is excluded; if not, the candidate destination combination is retained.

[0082] It is determined whether the candidate destination combination retained again satisfies the personalized restriction condition of the user, and the candidate destination combination satisfying the personalized restriction condition is used as the destination combination and recommended to the user.

[0083] Figure 3 A schematic diagram of the structure of a path planning device according to an embodiment of the present application is shown. Figure 3 It can be seen that the device 300 comprises:

[0084] A positioning unit 310, used to determine the current location of the user;

[0085] An acquisition unit 320 is used to acquire a user's destination type and an expected carbon emission limit for this trip;

[0086] The selection unit 330 is used to determine at least one set of destination combinations and recommend them to the user according to the expected carbon emission limit, the current location of the user and the user destination type.

[0087] In some embodiments of the present application, in the above-mentioned device, the destination combination is a plurality of groups, and the acquisition unit 320 is further used to receive the user's filtering conditions; the selection unit 330 is further used to select at least one group of intended destination combination from the plurality of destination combinations according to the filtering conditions for the user to select.

[0088] In some embodiments of the present application, in the above-mentioned device, the selection unit 330 is used to determine that a group of destination combinations is an intended destination combination if the total driving time is not greater than a preset time threshold, the driving mileage is not greater than a preset mileage threshold, and the distance between the destinations is not greater than a preset distance threshold. At least one of the following conditions is met:

[0089] In some embodiments of the present application, in the above-mentioned device, the acquisition unit 320 is also used to determine the energy demand required for the vehicle to complete the entire journey of each destination combination; obtain the remaining energy of the user's vehicle; the positioning unit 310 is also used to determine an energy refueling station within a preset range of the destination combination if it is determined that the remaining energy is less than the energy demand corresponding to any destination combination, so that the user's vehicle can be refueled, wherein the sum of the carbon emissions required for the user to reach the energy refueling station and the destination combination is not greater than the expected carbon emission limit.

[0090] In some embodiments of the present application, in the above-mentioned device, the acquisition unit 320 is used to obtain the user's historical travel records; and determine the expected carbon emission limit of the current trip according to the user's historical travel records.

[0091] In some embodiments of the present application, in the above-mentioned device, the selection unit 330 is used to determine the maximum drivable distance based on the remaining energy of the vehicle; determine the range of candidate destinations according to the maximum drivable distance and the current location of the user; determine multiple destinations within the candidate destination range according to the user's destination type; combine multiple destinations to determine multiple candidate destination combinations; and determine at least one group of destination combinations from the multiple candidate destination combinations according to the expected carbon emission limit.

[0092] It should be noted that the above-mentioned path planning device can implement the above-mentioned path planning method one by one, and will not be repeated here.

[0093] Figure 4 This is a schematic diagram of the structure of an electronic device according to an embodiment of the present application. Figure 4 At the hardware level, the electronic device includes a processor, and optionally also includes an internal bus, a network interface, and a memory. The memory may include a memory, such as a high-speed random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk storage. Of course, the electronic device may also include hardware required for other services.

[0094] The processor, network interface and memory can be interconnected through an internal bus, which can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 4 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0095] The memory is used to store the program. Specifically, the program may include a program code, and the program code includes a computer operation instruction. The memory may include a memory and a non-volatile memory, and provides instructions and data to the processor.

[0096] The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it, forming a path planning device at the logical level. The processor executes the program stored in the memory and is specifically used to perform the following operations:

[0097] Determine the user's current location;

[0098] Obtain the user's destination type and the expected carbon emission limit for this trip;

[0099] At least one destination combination is determined based on the expected carbon emission limit, the current location of the user, and the user destination type, and is recommended to the user.

[0100] The above application Figure 3The method performed by the path planning device disclosed in the illustrated embodiment can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware decoding processor for execution, or a combination of hardware and software modules in the decoding processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0101] The electronic device may also perform Figure 3 The method executed by the path planning device in Figure 3 The functions of the illustrated embodiment will not be described in detail in the embodiments of the present application.

[0102] The present application also provides a computer-readable storage medium, which stores one or more programs, wherein the one or more programs include instructions, which, when executed by an electronic device including multiple application programs, enable the electronic device to execute Figure 3 The method performed by the path planning device in the illustrated embodiment is specifically used to perform:

[0103] Determine the user's current location;

[0104] Obtain the user's destination type and the expected carbon emission limit for this trip;

[0105] At least one destination combination is determined based on the expected carbon emission limit, the current location of the user, and the user destination type, and is recommended to the user.

[0106] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0107] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0108] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0109] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0110] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0111] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0112] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0113] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0114] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0115] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A path planning method, characterized in that: The method comprises: Determine the user's current location; Acquire multiple destination types of the user, the expected carbon emission limit for this trip, and personalized restriction conditions; determine at least one set of destination combinations and recommend them to the user based on the expected carbon emission limit, the current location of the user, and the user's destination type; The determining at least one destination combination and recommending it to the user according to the expected carbon emission limit, the current location of the user, and the user destination type includes: Obtaining the remaining energy of the user's vehicle and determining the maximum drivable distance based on the remaining energy; Determine a candidate destination range according to the maximum drivable distance and the current location of the user; Determine a plurality of destinations within the candidate destination range according to the user destination type; Arrange and combine multiple destinations according to their types to determine multiple candidate destination combinations; The distance from the user's current location to all destinations in each candidate destination combination is no greater than the maximum drivable distance, and the carbon emissions required for the user to reach each candidate destination combination is no greater than the expected carbon emissions this time, and the candidate destinations in each candidate destination combination that meet the user's personalized restrictions are used as the destination combination.

2. The method according to claim 1, characterized in that The destinations are combined into a plurality of groups, and the method further comprises: Receive user's filter criteria; At least one group of intended destination combinations is selected from the multiple groups of destination combinations according to the screening conditions for selection by the user.

3. The method according to claim 2, characterized in that The step of selecting at least one intended destination combination from the plurality of destination combinations according to the screening condition includes: If a set of destination combinations satisfies at least one of the total driving time not exceeding a preset time threshold, the driving mileage not exceeding a preset mileage threshold, and the distance between destinations not exceeding a preset distance threshold, then the destination combination is determined to be an intended destination combination.

4. The method according to claim 1, characterized in that The method further comprises: Determine the energy requirements for the vehicle to complete the entire journey to each destination combination; If it is determined that the remaining energy amount is less than the energy demand corresponding to any destination combination; then the energy refueling stations within the preset range of the destination combination are determined so that the user's vehicle can be refueled, wherein the total carbon emissions required for the user to complete the entire journey to the energy refueling stations and the destination combination is not greater than the expected carbon emission limit.

5. The method according to claim 1, characterized in that The method of obtaining the user's destination type and the expected carbon emission limit for this trip includes: Get the user's historical travel records; The expected carbon emission limit for this trip is determined based on the user's historical travel records.

6. A path planning device, characterized in that: The device comprises: A positioning unit, used to determine the current location of the user; An acquisition unit, used to acquire multiple destination types of the user and the expected carbon emission limit of this trip; A selection unit, configured to determine at least one set of destination combinations and recommend the combination to the user based on the expected carbon emission limit, the current location of the user, and the type of the user's destination; The selection unit is further used to obtain the remaining energy of the user's vehicle and determine the maximum drivable distance based on the remaining energy; determine a candidate destination range based on the maximum drivable distance and the user's current location; determine multiple destinations within the candidate destination range based on the user's destination type; combine multiple destinations according to type to determine multiple candidate destination combinations; the distance from the user's current location to all destinations in each candidate destination combination is no greater than the maximum drivable distance, and the carbon emissions required for the user to reach each candidate destination combination is no greater than the expected carbon emissions this time, and the candidate destinations in each candidate destination combination that meet the user's personalized restrictions are used as the destination combination.

7. An electronic device comprising: processor; as well as A memory arranged to store computer executable instructions, which, when executed, cause the processor to perform the method of any one of claims 1 to 5.

8. A computer-readable storage medium storing one or more programs, wherein when the one or more programs are executed by an electronic device including a plurality of application programs, the electronic device executes the method according to any one of claims 1 to 5.