Navigation method, device, navigation equipment and computer readable storage medium

Abstract

The present invention discloses a navigation method, device, navigation equipment and computer-readable storage medium, wherein the method comprises: obtaining a destination type corresponding to a user's travel intention; planning and obtaining m first paths according to the destination type and the navigation departure point; screening the m first paths to obtain n second paths; calculating the carbon emissions of each second path; and determining a target navigation path from the n second paths according to the carbon emissions. The present invention can solve the technical problems in the prior art of being unable to calculate the carbon emissions of a path and selecting a more energy-saving and environmentally friendly path navigation.

Description

Technical Field

[0001] The present invention relates to the field of vehicle navigation technology, and in particular to a navigation method, device, navigation equipment and computer-readable storage medium. Background Art

[0002] With the development of navigation technology, navigation is becoming more and more intelligent. For ordinary users, traveling becomes relatively simple through navigation technology.

[0003] However, in addition to daily or periodic fixed trips such as going to work, school, cram school, picking up family members or returning home, most people often need to go to additional temporary travel destinations, such as going to supermarkets to buy daily necessities, going to convenience stores to shop, going to restaurants to order food, going to banks to handle business, etc. In these complex destination planning, existing navigation devices can only support simple route query and navigation functions, such as querying which path from the departure point to the destination is the shortest, which path takes the shortest time, etc., which cannot take into account personal carbon emission indicators and is not conducive to users choosing more energy-saving paths.

[0004] Therefore, it is urgent to propose an energy-saving and environmentally friendly driving navigation method. Summary of the invention

[0005] The embodiment of the present application provides a navigation method to solve the technical problem in the prior art that it is impossible to calculate the carbon emissions of a route and select a more energy-saving and environmentally friendly route for navigation.

[0006] On the one hand, the present application provides a navigation method through an embodiment of the present application, the method comprising:

[0007] Get the destination type corresponding to the user's travel intention;

[0008] According to the destination type and the navigation departure point, m first paths are planned and obtained, where m is a positive integer;

[0009] Screening the m first paths to obtain n second paths, where n is a positive integer not exceeding m;

[0010] Calculating the carbon emissions of each of the second paths;

[0011] According to the carbon emissions, a target navigation path is determined from the n second paths.

[0012] Optionally, screening the m first paths to obtain n second paths includes:

[0013] According to the road condition of each of the first paths, m first paths are screened to obtain n second paths.

[0014] Optionally, the screening of m first paths according to the road condition of each first path to obtain n second paths includes:

[0015] estimating the travel time of each first path according to the road congestion condition of each first path and / or the distance of the first path;

[0016] According to the travel time of each of the first paths, n second paths whose travel time is less than a preset time are selected from the m first paths.

[0017] Optionally, screening the m first paths to obtain n second paths includes:

[0018] estimating the travel cost of each of the first paths according to the toll road sections included in each of the first paths;

[0019] According to the travel cost of each of the first paths, n second paths are selected from the m first paths.

[0020] Optionally, screening the m first paths to obtain n second paths includes:

[0021] According to the distance of each of the first paths, n second paths having a distance shorter than a preset distance are selected from the m first paths.

[0022] Optionally, there are multiple destination types, and each of the first paths includes multiple navigation destinations corresponding to multiple destination types, and the screening of m first paths to obtain n second paths includes:

[0023] According to the distance between any two of the navigation destinations in each of the first paths, n second paths are selected from the m first paths, wherein the distance between any two adjacent navigation destinations is less than a preset distance.

[0024] Optionally, the method further comprises:

[0025] Selecting a common route matching the destination type from historical driving records;

[0026] Calculating the carbon emissions of the common routes;

[0027] The carbon emission reduction corresponding to the target navigation route is calculated according to the carbon emission of the target navigation route and the carbon emission of the common route.

[0028] On the other hand, the present application provides a navigation device through an embodiment of the present application, the device includes an acquisition module, a planning module, a screening module, a calculation module and a determination module, wherein:

[0029] The acquisition module is used to acquire the destination type corresponding to the user's travel intention;

[0030] The planning module is used to plan and obtain m first paths according to the destination type and the navigation departure point, where m is a positive integer;

[0031] The screening module is used to screen the m first paths to obtain n second paths, where the second path is one of the m first paths, and n is a positive integer not exceeding m;

[0032] The calculation module is used to calculate the carbon emissions of each second path;

[0033] The determination module is used to determine a target navigation path from the n second paths according to the carbon emissions.

[0034] On the other hand, the present application provides a terminal device through an embodiment of the present application, and the terminal device includes: a processor, a memory, a communication interface and a bus; the processor, the memory and the communication interface are connected through the bus and communicate with each other; the memory stores executable program code; the processor runs a program corresponding to the executable program code by reading the executable program code stored in the memory, so as to execute the navigation method as described above.

[0035] On the other hand, the present application provides a computer-readable storage medium through an embodiment of the present application, wherein the computer-readable storage medium stores a program, and when the program is run on a terminal device, the navigation method as described above is executed.

[0036] One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages: the present application obtains the destination type corresponding to the user's travel intention, obtains m first paths according to the destination type and the navigation departure point planning, and then screens the m first paths to obtain n second paths, and calculates the carbon emissions of each second path, and finally determines from the n second paths according to the carbon emissions of each second path a target navigation path corresponding to a carbon emission less than the carbon emission of the previous navigation path. This is conducive to selecting a navigation route with less carbon emissions (energy saving) for driving while ensuring user needs, thereby achieving the purpose of protecting the environment. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0038] Figure 1 It is a flowchart of a navigation method provided in an embodiment of the present application.

[0039] Figure 2 It is a structural schematic diagram of a navigation device provided in an embodiment of the present application.

[0040] Figure 3 It is a structural diagram of a terminal device provided in an embodiment of the present application.

[0041] Figure 4 It is a structural schematic diagram of a storage medium provided in an embodiment of the present application. DETAILED DESCRIPTION

[0042] The embodiment of the present application provides a navigation method to solve the technical problem in the prior art that it is impossible to calculate the carbon emissions of a route and select a more energy-saving and environmentally friendly route for navigation.

[0043] The technical solution of the embodiment of the present application is to solve the above-mentioned technical problems, and the overall idea is as follows: obtain the destination type corresponding to the user's travel intention; plan and obtain m first paths according to the destination type and the navigation departure point, where m is a positive integer; screen the m first paths to obtain n second paths, where n is a positive integer not exceeding m; calculate the carbon emissions of each second path; and determine the target navigation path from the n second paths according to the carbon emissions.

[0044] In order to better understand the above technical solution, the above technical solution will be described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0045] First of all, the term "and / or" in this article is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0046] See also Figure 1 , is a flowchart of a navigation method provided by an embodiment of the present application. Figure 1 The method shown includes the following implementation steps:

[0047] S101. Obtain the destination type corresponding to the user's travel intention.

[0048] The destination type described in this application is the type of destination that the user wants to go to, that is, the destination type corresponding to the user's travel intention, and the destination type includes but is not limited to shopping malls, banks, gyms, restaurants, canteens or other types, etc. The number of the destination types is not limited, and it can be one or more. For example, if the user wants to go to a department store first and then go to a gym, the destination types selected by the user specifically include shopping malls and gyms.

[0049] The destination type may be a terminal device providing a front-end configured user interaction interface to obtain the destination type input by the user in the user interaction interface according to actual needs, or a destination type received from other terminal devices, etc. This application does not limit this.

[0050] S102. Plan and obtain m first paths according to the destination type and the navigation departure point, where m is a positive integer.

[0051] The navigation departure point described in the present application is the departure position obtained by the terminal device through a positioning system (such as a global positioning system GPS), or a departure point customized by the system or user. Specifically, the present application searches for a navigation destination that matches the destination type on the map according to the destination type. For example, if the destination type is a shopping mall, the present application can search for shopping malls within the preset range of the navigation departure point on the map. The preset range is customized by the system, such as a range with the navigation departure point as the center and a radius of 1 kilometer. Then, the present application obtains m first paths based on the navigation departure point and the matching navigation destination, combined with map planning. Among them, m is a positive integer customized by the system.

[0052] S103 . Screen the m first paths to obtain n second paths, where n is a positive integer not exceeding m.

[0053] In a specific implementation, the present application may screen m first paths according to the road conditions of each first path to obtain n second paths. The road conditions include but are not limited to road surface conditions and congestion conditions, etc. The road surface conditions are used to indicate / describe the integrity of the road surface, which may include but are not limited to the flatness, slope, whether there are obstacles, whether there are potholes, etc. The congestion conditions are used to indicate / describe the degree of congestion on the road surface, for example, it can be divided into multiple congestion levels according to the traffic congestion index, such as unimpeded, light congestion, moderate congestion, and severe congestion, etc.

[0054] In a specific embodiment, the present application may estimate the travel time of each first path according to the road congestion condition of each first path and / or the distance of the first path. Specifically, the present application may predict and estimate the travel time of each first path according to the road congestion condition of each component road segment in each first path and the obtained road travel speed. And / or, the present application may predict and estimate the travel time of each first path according to the distance of each first path and the obtained road travel speed.

[0055] Further, the present application can select n second paths whose driving time is less than a preset time from the m first paths according to the driving time of each first path. The preset time is a system-defined setting, such as an experience value set according to user experience or set according to actual system requirements, etc.

[0056] In another specific embodiment, the present application may call a pre-trained neural network model to select n second paths from the m first paths according to the road conditions of the m first paths.

[0057] In another specific embodiment, the present application may score the m first paths according to the road conditions of the constituent sections of each of the first paths, and obtain a score for each of the first paths. Specifically, the present application may use a road surface scoring model to score the road conditions of each of the m first paths to obtain a score for each first path, and the road surface scoring model is a model pre-customized and set by the system, which may include but is not limited to a convolutional neural network model, a feedforward neural network model, a deep neural network model, a recurrent neural network model, or other deep learning models, etc. Then, according to the score of each of the first paths, the present application may select n second paths whose scores exceed a first threshold from the m first paths, that is, select n second paths with better scores. The first threshold is custom set by the system, such as an experience value set according to user experience, etc.

[0058] In another specific embodiment, the present application may score the m first paths according to the congestion conditions of the constituent sections of each of the first paths, and obtain a score for each of the first paths. Specifically, the present application may use a congestion scoring model to score the road congestion conditions of each of the m first paths to obtain a score for each of the first paths, and the congestion scoring model is a model pre-customized and set by the system, which may include but is not limited to a convolutional neural network model, a feedforward neural network model, a deep neural network model, a recurrent neural network model, or other deep learning models, etc. Further, the present application may select n second paths whose scores exceed a second threshold from the m first paths according to the score of each of the first paths. The second threshold is custom set by the system, such as 70 points.

[0059] In another specific embodiment, the present application can estimate the driving cost of each first path based on the toll sections in each first path. Specifically, the present application can estimate the driving cost of each first distance based on the charging standards of the toll sections in each first path (such as road type and unit price per unit distance, etc.) and the distance of the toll sections.

[0060] Further, the present application can select n second paths from m first paths according to the travel cost of each first path, for example, select n second paths with the lowest travel cost from m first paths, or select any n second paths with travel costs less than a preset cost, etc. The preset cost is a system-defined setting, such as 100 yuan, etc.

[0061] In another specific embodiment, the present application can select n second routes with the shortest distance from m first routes according to the distance of each first route; or select any n second routes with a distance less than a preset distance from m first routes, etc. The preset distance is a system-defined setting, such as 1 kilometer, etc.

[0062] In another specific embodiment, when there are multiple types of destinations, each of the first paths includes multiple navigation destinations corresponding to multiple types of destinations, and the present application can calculate the distance between any two of the navigation destinations in each of the first paths according to the map. Then, according to the distance between any two of the navigation destinations in each of the first paths, n second paths with the smallest distance between two adjacent navigation destinations are selected from the m first paths; or n second paths with the distance between any two adjacent navigation destinations less than a preset distance are selected from the m first paths. The preset distance is a system-defined setting, such as 1 kilometer.

[0063] S104: Calculate the carbon emissions of each of the second paths.

[0064] After obtaining n second paths, the present application can calculate the carbon emissions of each second path. Specifically:

[0065] In a fuel-consuming vehicle, the present application can use the vehicle mileage method to calculate the carbon emissions of each of the second paths, and the specific calculation is shown in the following formula (1):

[0066]

[0067] Where, E is the greenhouse gas emissions of the vehicle operation system (i.e., carbon emissions in this application), in tCO2e. j is the vehicle type. TMj ECPUM is the total mileage of all vehicles of type j in the quantification and reporting year (in this application, it is the distance of the second route), in 100 kilometers. j EF is the average energy consumption per unit mileage of the j-type vehicle, in kg fuel / 100km or kWh / 100km. TF(j) is the emission factor of the TF(j) energy source, expressed in tCO2 / t fuel or tCO2 / MWh. TF(j) is the energy type used by the j-type vehicle. GWP is the global warming potential, and the GWP value of carbon dioxide greenhouse gas is 1.

[0068] In vehicles other than fuel-consuming vehicles, such as electric-consuming vehicles, the present application may use the following formula (2) to calculate the carbon emissions of each of the second paths.

[0069] E=L×α Formula (2)

[0070] Wherein, E is the carbon emission, L is the distance of the second path, and α is the emission factor, which can be pre-defined by the system, such as 0.785, etc.

[0071] S105: Determine a target navigation path from the n second paths according to the carbon emissions.

[0072] After calculating and obtaining the carbon emissions of each of the n second paths, the present application can select a target navigation path from the n second paths, and then navigate according to the target navigation path. The carbon emissions of the target navigation path are less than the carbon emissions of the navigation paths already used in the vehicle. Preferably, the target navigation path is the path with the least carbon emissions among the n second paths.

[0073] In an optional embodiment, the present application may also select a path that matches the destination type from the historical driving record as a common path, for example, the path that the user often drives home from the company is a common path, etc. Further, the present application may calculate the carbon emissions of the common path in the manner of step S104, and optionally, the present application may also store the carbon emissions of the common path to push to the user or store for the user to view at any time. Further, the present application may calculate the carbon emission reduction of the target navigation path based on the carbon emissions of the target navigation path and the carbon emissions of the common path, which may be specifically the difference between the carbon emissions of the target navigation path and the carbon emissions of the common path.

[0074] By implementing the present application, the present application obtains the destination type corresponding to the user's travel intention, obtains m first paths according to the destination type and the navigation departure point planning, and then screens the m first paths to obtain n second paths, and calculates the carbon emissions of each second path. Finally, according to the carbon emissions of each second path, the target navigation path corresponding to the carbon emissions less than the carbon emissions of the previous navigation path is determined from the n second paths. This is conducive to the user choosing a navigation route with less carbon emissions (energy saving) for driving, thereby achieving the purpose of protecting the environment.

[0075] Based on the same inventive concept, another embodiment of the present application provides an apparatus, a terminal device and a storage medium corresponding to the navigation method described in the embodiment of the present application.

[0076] See also Figure 2 , is a schematic diagram of the structure of a navigation device provided in an embodiment of the present application. Figure 2 The device shown includes: an acquisition module 201, a planning module 202, a screening module 203, a calculation module 204 and a determination module 205, wherein:

[0077] The acquisition module 201 is used to acquire the destination type corresponding to the user's travel intention;

[0078] The planning module 202 is used to plan and obtain m first paths according to the destination type and the navigation departure point, where m is a positive integer;

[0079] The screening module 203 is used to screen the m first paths to obtain n second paths, where the second path is one of the m first paths, and n is a positive integer not exceeding m;

[0080] The calculation module 204 is used to calculate the carbon emission of each second path;

[0081] The determination module 205 is used to determine a target navigation path from the n second paths according to the carbon emissions.

[0082] Optionally, the screening module 203 is specifically used for:

[0083] According to the road condition of each of the first paths, m first paths are screened to obtain n second paths.

[0084] Optionally, the screening module 203 is specifically used for:

[0085] estimating the travel time of each first path according to the road congestion condition of each first path and / or the distance of the first path;

[0086] According to the travel time of each of the first paths, n second paths whose travel time is less than a preset time are selected from the m first paths.

[0087] Optionally, the screening module 203 is specifically used for:

[0088] estimating the travel cost of each of the first paths according to the toll road sections included in each of the first paths;

[0089] According to the travel cost of each of the first paths, n second paths are selected from the m first paths.

[0090] Optionally, the screening module 203 is specifically used for:

[0091] According to the distance of each of the first paths, n second paths having a distance shorter than a preset distance are selected from the m first paths.

[0092] Optionally, there are multiple destination types, and each of the first paths includes multiple navigation destinations corresponding to multiple destination types. The screening module 203 is specifically configured to:

[0093] According to the distance between any two of the navigation destinations in each of the first paths, n second paths are selected from the m first paths, wherein the distance between any two adjacent navigation destinations is less than a preset distance.

[0094] Optionally, the device further includes a matching module 206 and a calculation module 207, wherein:

[0095] The matching module 206 is used to select a common route matching the destination type from the historical driving records;

[0096] The calculation module 207 is used to calculate the carbon emissions of the common routes;

[0097] The calculation module 207 is further used to calculate the carbon emission reduction corresponding to the target navigation route according to the carbon emission of the target navigation route and the carbon emission of the common route.

[0098] Please refer to 3, which is a schematic diagram of the structure of a terminal device provided in an embodiment of the present application. Figure 3 The terminal device 30 shown includes: at least one processor 301, a communication interface 302, a user interface 303 and a memory 304. The processor 301, the communication interface 302, the user interface 303 and the memory 304 can be connected via a bus or other means. The embodiment of the present invention takes the connection via a bus 305 as an example.

[0099] The processor 301 may be a general-purpose processor, such as a central processing unit (CPU).

[0100] The communication interface 302 may be a wired interface (eg, an Ethernet interface) or a wireless interface (eg, a cellular network interface or a wireless local area network interface) for communicating with other terminals or websites. In the embodiment of the present invention, the communication interface 302 is specifically used to obtain the destination type.

[0101] The user interface 303 may be a touch panel, including a touch screen and a touch screen, for detecting operation instructions on the touch panel, a physical button or a mouse, or a display screen for outputting and displaying images or data.

[0102] The memory 304 may include a volatile memory, such as a random access memory (RAM); the memory may also include a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk drive (HDD) or a solid-state drive (SSD); the memory 304 may also include a combination of the above-mentioned types of memory. The memory 304 is used to store a set of program codes, and the processor 301 is used to call the program codes stored in the memory 304 to perform the following operations:

[0103] Get the destination type corresponding to the user's travel intention;

[0104] According to the destination type and the navigation departure point, m first paths are planned and obtained, where m is a positive integer;

[0105] Screening the m first paths to obtain n second paths, where n is a positive integer not exceeding m;

[0106] Calculating the carbon emissions of each of the second paths;

[0107] According to the carbon emissions, a target navigation path is determined from the n second paths.

[0108] Optionally, screening the m first paths to obtain n second paths includes:

[0109] According to the road condition of each of the first paths, m first paths are screened to obtain n second paths.

[0110] Optionally, the screening of m first paths according to the road condition of each first path to obtain n second paths includes:

[0111] estimating the travel time of each first path according to the road congestion condition of each first path and / or the distance of the first path;

[0112] According to the travel time of each of the first paths, n second paths whose travel time is less than a preset time are selected from the m first paths.

[0113] Optionally, screening the m first paths to obtain n second paths includes:

[0114] estimating the travel cost of each of the first paths according to the toll road sections included in each of the first paths;

[0115] According to the travel cost of each of the first paths, n second paths are selected from the m first paths.

[0116] Optionally, screening the m first paths to obtain n second paths includes:

[0117] According to the distance of each of the first paths, n second paths having a distance shorter than a preset distance are selected from the m first paths.

[0118] Optionally, there are multiple destination types, and each of the first paths includes multiple navigation destinations corresponding to multiple destination types, and the screening of m first paths to obtain n second paths includes:

[0119] According to the distance between any two of the navigation destinations in each of the first paths, n second paths are selected from the m first paths, wherein the distance between any two adjacent navigation destinations is less than a preset distance.

[0120] Optionally, the processor 301 is further configured to:

[0121] Selecting a common route matching the destination type from historical driving records;

[0122] Calculating the carbon emissions of the common routes;

[0123] The carbon emission reduction corresponding to the target navigation route is calculated according to the carbon emission of the target navigation route and the carbon emission of the common route.

[0124] Since the terminal device introduced in this embodiment is a terminal device used to implement the navigation method in the embodiment of the present application, based on the navigation method introduced in the embodiment of the present application, a person skilled in the art can understand the specific implementation of the terminal device in this embodiment and its various variations, so how the terminal device implements the method in the embodiment of the present application is not described in detail here. As long as a terminal device used by a person skilled in the art to implement the method of information processing in the embodiment of the present application is adopted, it belongs to the scope of protection of this application.

[0125] Based on the same inventive concept, the embodiment of the present invention further provides a computer readable storage medium 40, such as Figure 4 As shown, a computer program 401 is stored thereon, and when the computer program 401 is executed by a processor, any method step provided in the embodiments of the present application is implemented.

[0126] The technical solution in the above-mentioned embodiment of the present application has at least the following technical effects or advantages: the present application obtains the destination type corresponding to the user's travel intention, obtains m first paths according to the destination type and the navigation departure point planning, and then screens the m first paths to obtain n second paths, and calculates the carbon emissions of each second path, and finally determines from the n second paths according to the carbon emissions of each second path a target navigation path corresponding to a carbon emission less than the carbon emissions of the previous navigation path. This is conducive to the user choosing a navigation route with less carbon emissions (energy saving) for driving, thereby achieving the purpose of protecting the environment.

[0127] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take 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.) containing computer-usable program code.

[0128] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks 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 produce 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 1A device that provides the functions specified in a block or multiple blocks.

[0129] 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 including 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.

[0130] 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 in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0131] Although the preferred embodiments of the present invention have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.

[0132] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A navigation method, characterized in that: The method comprises: Get the destination type corresponding to the user's travel intention; According to the destination type and the navigation departure point, m first paths are planned and obtained, where m is a positive integer; Screening the m first paths to obtain n second paths, where n is a positive integer not exceeding m; Calculating the carbon emissions of each of the second paths; Determining a target navigation path from the n second paths according to the carbon emissions; wherein the carbon emissions of the target navigation path are less than the carbon emissions of the navigation paths already used in the vehicle; There are multiple destination types, and each of the first paths includes multiple navigation destinations corresponding to multiple destination types. The m first paths are screened to obtain n second paths, including: Select n second paths from the m first paths, wherein the distance between any two adjacent navigation destinations is less than a preset distance.

2. The method according to claim 1, characterized in that The screening of the m first paths to obtain n second paths includes: According to the road condition of each of the first paths, m first paths are screened to obtain n second paths.

3. The method according to claim 2, characterized in that The step of screening m first paths according to the road condition of each first path to obtain n second paths includes: estimating the travel time of each first path according to the road congestion condition of each first path and / or the distance of the first path; According to the travel time of each of the first paths, n second paths whose travel time is less than a preset time are selected from the m first paths.

4. The method according to claim 1, characterized in that The screening of the m first paths to obtain n second paths includes: estimating the travel cost of each of the first paths according to the toll road sections included in each of the first paths; According to the travel cost of each of the first paths, n second paths are selected from the m first paths.

5. The method according to claim 1, characterized in that The screening of the m first paths to obtain n second paths includes: According to the distance of each of the first paths, n second paths having a distance shorter than a preset distance are selected from the m first paths.

6. The method according to claim 1, characterized in that The method further comprises: Selecting a common route matching the destination type from historical driving records; Calculating the carbon emissions of the common routes; The carbon emission reduction corresponding to the target navigation route is calculated according to the carbon emission of the target navigation route and the carbon emission of the common route.

7. A navigation device, characterized in that: include: Acquisition module, planning module, screening module, calculation module and determination module, wherein: The acquisition module is used to acquire the destination type corresponding to the user's travel intention; The planning module is used to plan and obtain m first paths according to the destination type and the navigation departure point, where m is a positive integer; The screening module is used to screen the m first paths to obtain n second paths, where the second path is one of the m first paths, and n is a positive integer not exceeding m; The calculation module is used to calculate the carbon emissions of each second path; The determination module is used to determine a target navigation path from the n second paths according to the carbon emissions; wherein the carbon emissions of the target navigation path are less than the carbon emissions of the navigation paths already used in the vehicle; There are multiple destination types, and each of the first paths includes multiple navigation destinations corresponding to multiple destination types. The screening module is specifically used for: According to the distance between any two of the navigation destinations in each of the first paths, n second paths are selected from the m first paths, wherein the distance between any two adjacent navigation destinations is less than a preset distance.

8. A navigation device, characterized in that: include: Processors, memories, communication interfaces and buses; The processor, the memory and the communication interface are connected via the bus and communicate with each other; The memory stores executable program code; The processor runs a program corresponding to the executable program code by reading the executable program code stored in the memory, so as to execute the navigation method as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a program, and when the program is run on a navigation device, the navigation method as described in any one of claims 1 to 6 is executed.

Images