CN113984075A - Navigation method, navigation device, navigation equipment and computer readable storage medium - Google Patents
Navigation method, navigation device, navigation equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN113984075A CN113984075A CN202111224939.2A CN202111224939A CN113984075A CN 113984075 A CN113984075 A CN 113984075A CN 202111224939 A CN202111224939 A CN 202111224939A CN 113984075 A CN113984075 A CN 113984075A
- Authority
- CN
- China
- Prior art keywords
- paths
- path
- navigation
- carbon emission
- screening
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 claims abstract description 67
- 229910052799 carbon Inorganic materials 0.000 claims abstract description 67
- 238000012216 screening Methods 0.000 claims abstract description 37
- 238000004891 communication Methods 0.000 claims description 10
- 238000004364 calculation method Methods 0.000 claims description 7
- 230000009467 reduction Effects 0.000 claims description 5
- 238000001914 filtration Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 13
- 238000004590 computer program Methods 0.000 description 10
- 238000003062 neural network model Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 3
- CURLTUGMZLYLDI-UHFFFAOYSA-N Carbon dioxide Chemical compound O=C=O CURLTUGMZLYLDI-UHFFFAOYSA-N 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000013527 convolutional neural network Methods 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 2
- 238000013136 deep learning model Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000446 fuel Substances 0.000 description 2
- 239000005431 greenhouse gas Substances 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 229910002092 carbon dioxide Inorganic materials 0.000 description 1
- 239000001569 carbon dioxide Substances 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000010792 warming Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3469—Fuel consumption; Energy use; Emission aspects
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3461—Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
The invention discloses a navigation method, a navigation device, navigation equipment and a computer readable storage medium, wherein the method comprises the following steps: obtaining a destination type corresponding to the travel intention of the user; planning and obtaining m first paths according to the destination type and the navigation starting place; screening m first paths to obtain n second paths; calculating the carbon emission of each second path; and determining a target navigation path from the n second paths according to the carbon emission. By adopting the method and the device, the technical problems that the carbon emission of the path cannot be calculated and the energy-saving and environment-friendly path navigation can be selected in the prior art can be solved.
Description
Technical Field
The present invention relates to the field of vehicle navigation technologies, and in particular, to a navigation method, an apparatus, a navigation device, and a computer-readable storage medium.
Background
With the development of navigation technology, navigation is more and more intelligent, and for common users, traveling is relatively simple through the navigation technology.
However, in a trip, most people go to an extra temporary planned trip place, such as go to a supermarket to purchase living goods, go to a convenience store for shopping, go to a restaurant to order, go to a bank for business, and the like, in addition to completing daily or periodic fixed trips, such as going to a work place, a school, a study-taking shift, a family-taking person, or returning to a home. In such complicated destination planning, the conventional navigation device can only support simple functions of route inquiry and navigation, such as functions of inquiring which route from the departure point to the destination is shortest in distance and which route is shortest in time, and cannot give consideration to individual carbon emission indexes, which is not favorable for a user to select a route with relatively high energy saving.
Therefore, it is necessary to provide an energy-saving and environment-friendly driving navigation method.
Disclosure of Invention
The embodiment of the application provides a navigation method, and solves the technical problems that in the prior art, the carbon emission of a path cannot be calculated, and energy-saving and environment-friendly path navigation is selected.
In one aspect, the present application provides a navigation method according to an embodiment of the present application, where the method includes:
obtaining a destination type corresponding to the travel intention of the user;
planning and obtaining m first paths according to the destination type and the navigation departure place, wherein m is a positive integer;
screening m first paths to obtain n second paths, wherein n is a positive integer not exceeding m;
calculating the carbon emission of each second path;
and determining a target navigation path from the n second paths according to the carbon emission.
Optionally, the screening the m first paths to obtain n second paths includes:
and screening m first paths according to the road condition of each first path to obtain n second paths.
Optionally, the screening m first paths according to the road condition of each first path to obtain n second paths includes:
estimating the driving time of each first path according to the road congestion condition of each first path and/or the distance of each first path;
and selecting n second paths with the running time less than the preset time from the m first paths according to the running time of each first path.
Optionally, the screening m first paths to obtain n second paths includes:
estimating the running cost of each first path according to the charging road section included in each first path;
and selecting n second paths from m first paths according to the running cost of each first path.
Optionally, the screening m first paths to obtain n second paths includes:
and selecting n second paths with the routes smaller than the preset routes from the m first paths according to the routes of the first paths.
Optionally, the number of the destination types is multiple, each of the first paths includes multiple navigation destinations corresponding to multiple destination types, and the screening m first paths to obtain n second paths includes:
and selecting n second paths, of which the distances between any two adjacent navigation destinations are smaller than a preset distance, from m first paths according to the distance between any two navigation destinations in each first path.
Optionally, the method further comprises:
selecting a common path matched with the destination type from historical driving records;
calculating carbon emissions of the common path;
and calculating the carbon emission reduction amount corresponding to the target navigation route according to the carbon emission amount of the target navigation route and the carbon emission amount of the common route.
On the other hand, the present application provides a navigation device through an embodiment of the present application, the device includes an obtaining module, a planning module, a screening module, a calculating module, and a determining module, wherein:
the obtaining module is used for obtaining a destination type corresponding to the trip intention of the user;
the planning module is used for planning and obtaining m first paths according to the destination type and the navigation departure place, wherein m is a positive integer;
the screening module is used for screening m first paths to obtain n second paths, wherein the second path is one of the m first paths, and n is a positive integer not exceeding m;
the calculation module is used for calculating the carbon emission of each second path;
and the determining module is used for determining a target navigation path from the n second paths according to the carbon emission.
On the other hand, the present application provides a terminal device according to an embodiment of the present application, where 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 complete mutual communication; the memory stores executable program code; the processor executes a program corresponding to the executable program code by reading the executable program code stored in the memory for performing the navigation method as described above.
On the other hand, the present application provides a computer-readable storage medium storing a program that executes the navigation method described above when the program runs on a terminal device, through an embodiment of the present application.
One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages: according to the method and the device, the destination type corresponding to the travel intention of the user is obtained, m first paths are obtained according to the destination type and the navigation departure place planning, m second paths are obtained by screening the m first paths, the carbon emission of each second path is calculated, and finally a target navigation path corresponding to the carbon emission of the previous navigation path is determined from the n second paths according to the carbon emission of each second path, so that the navigation path with the lower carbon emission (energy saving) is selected for running under the condition that the user requirement is guaranteed, and the purpose of protecting the environment is achieved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a navigation method according to an embodiment of the present application.
Fig. 2 is a schematic structural diagram of a navigation device according to an embodiment of the present application.
Fig. 3 is a schematic structural diagram of a terminal device according to an embodiment of the present application.
Fig. 4 is a schematic structural diagram of a storage medium according to an embodiment of the present application.
Detailed Description
The embodiment of the application provides a navigation method, and solves the technical problems that in the prior art, the carbon emission of a path cannot be calculated, and energy-saving and environment-friendly path navigation is selected.
In order to solve the technical problems, the general idea of the embodiment of the application is as follows: obtaining a destination type corresponding to the travel intention of the user; planning and obtaining m first paths according to the destination type and the navigation departure place, wherein m is a positive integer; screening m first paths to obtain n second paths, wherein n is a positive integer not exceeding m; calculating the carbon emission of each second path; and determining a target navigation path from the n second paths according to the carbon emission.
In order to better understand the technical solution, the technical solution will be described in detail with reference to the drawings and the specific embodiments.
First, it is stated that the term "and/or" appearing herein is merely one type of associative relationship that describes an associated object, meaning that three types of relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
Please refer to fig. 1, which is a flowchart illustrating a navigation method according to an embodiment of the present disclosure. The method as shown in fig. 1 comprises the following implementation steps:
s101, obtaining a destination type corresponding to the trip intention of the user.
The destination type is a type of destination that the user wants to go to, i.e., a destination type corresponding to the user's travel intention, and includes, but is not limited to, a mall, a bank, a gymnasium, a restaurant or other types. The number of destination types is not limited and may be one or more, for example, if the user wants to go to a department store before going to a gym, the destination type selected by the user specifically includes a mall and a gym.
The destination type may be a destination type input by the user in the user interaction interface according to actual requirements by the terminal device by providing a user interaction interface configured at the front end, or a destination type received from other terminal devices, and the like, which is not limited in the present application.
And S102, planning and obtaining m first paths according to the destination type and the navigation departure place, wherein m is a positive integer.
The navigation starting place is a starting place position obtained by positioning the terminal equipment through a positioning system (such as a Global Positioning System (GPS)), or a starting place set by the system or a user in a customized way. Specifically, the navigation destination matched with the destination type is searched on the map according to the destination type, for example, the destination type is a shopping mall, and then the shopping mall within the preset range of the navigation departure place can be searched on the map. The preset range is set by a system in a self-defined mode, for example, the navigation starting place is used as a circle center, and 1 kilometer is used as a range within a radius. And then according to the navigation starting place and the matched navigation destination, combining map planning to obtain m first paths. Wherein m is a positive integer set by the system in a self-defining way.
S103, screening m first paths to obtain n second paths, wherein n is a positive integer not more than m.
In a specific embodiment, the method and the device can screen m first paths according to the road condition of each first path to obtain n second paths. The road conditions include, but are not limited to, road surface conditions, road congestion conditions, etc., which are used to indicate/describe the integrity of the road surface, which may include, but are not limited to, the flatness of the road surface, the slope, whether there are obstacles, whether there are potholes, etc. The congestion status is used for indicating/describing the congestion degree of the road surface, for example, the congestion status can be divided into a plurality of congestion levels according to the traffic congestion index, such as clear congestion, light congestion, medium congestion, severe congestion and the like.
In an embodiment, the method may estimate the travel time of each first route according to the road congestion condition of each first route and/or the distance of each first route. Specifically, the method can predict and estimate the running time of each first path according to the road congestion condition of each component road section in each first path and the acquired road running speed. And/or predicting and estimating the driving time of each first path according to the distance of each first path and the acquired road driving speed.
Further, according to the method and the device, n second paths with the running time being less than the preset time can be selected from the m first paths according to the running time of each first path. The preset time period is set by the system in a self-defined way, for example, an experience value set according to the experience of a user or set according to the actual requirement of the system, and the like.
In another embodiment, the method can call a pre-trained neural network model, and screen n second paths from m first paths according to road conditions of the m first paths.
In yet another embodiment, the method may further include scoring m first paths according to road surface conditions of constituent road segments of each first path to obtain a score of each first path. Specifically, the method can use a road surface scoring model to score the road surface condition of each of the m first paths to obtain the score of each first path, wherein the road surface scoring model is a model set by a system in a pre-customized manner, and the model can include but is not limited to a convolutional neural network model, a feed-forward neural network model, a deep neural network model, a cyclic neural network model, or other deep learning models. Then, according to the score of each first path, n second paths with scores exceeding a first threshold value are selected from the m first paths, namely the n second paths with better scores are selected. The first threshold is set by the system in a self-defined way, such as an empirical value set according to the experience of the user, and the like.
In yet another embodiment, the method may further include scoring m first paths according to congestion conditions of the road segments forming each first path to obtain a score of each first path. Specifically, the congestion scoring model can be used for scoring the road congestion conditions of the m first paths to obtain the score of each first path, and the congestion scoring model is a model set by a system in a pre-defined manner, and may include but is not limited to a convolutional neural network model, a feed-forward neural network model, a deep neural network model, a cyclic neural network model, or other deep learning models. Further, according to the score of each first path, n second paths with the score exceeding a second threshold value are selected from the m first paths. The second threshold is set by the system in a self-defined way, for example, 70 points and the like.
In a further embodiment, the present application may estimate the driving cost of each of the first routes according to the toll road segment in each of the first routes, and specifically, the present application may estimate the driving cost of each of the first routes according to the charging standard (such as the road type and the charging unit price per unit route) of the toll road segment in each of the first routes and the route of the toll road segment.
Further, according to the driving cost of each first path, n second paths may be selected from m first paths, for example, n second paths with the lowest driving cost may be selected from m first paths, or any n second paths with the driving cost less than the preset cost may be selected. The preset fee is set by the system in a self-defining mode, such as 100 yuan.
In another embodiment, the present application may select n second routes with the smallest routes from m first routes according to the routes of each first route; or any n second routes and the like with routes smaller than a preset route are selected from the m first routes. Wherein the preset distance is set by a system user, for example, 1 km and the like.
In yet another specific embodiment, when there are a plurality of destination types, each of the first paths includes a plurality of navigation destinations corresponding to the plurality of destination types, and the application may calculate a distance between any two navigation destinations in each of the first paths according to a map. Then according to the distance between any two navigation destinations in each first path, selecting n second paths with the minimum distance between two adjacent navigation destinations from m first paths; or selecting n second paths from the m first paths, wherein the distance between any two adjacent navigation destinations is smaller than a preset distance. The preset distance is set by a system in a self-defined mode, for example, 1 kilometer.
And S104, calculating the carbon emission of each second path.
After n second paths are obtained, the carbon emission amount of each second path can be calculated. Specifically, the method comprises the following steps:
in the fuel-consuming vehicle, the carbon emission of each second path can be calculated by adopting a vehicle mileage method, and the specific calculation is as shown in the following formula (1):
wherein E is the greenhouse gas emission (carbon emission in this application) of the vehicle operation system, and the unit is tCO2e. j is the vehicle type. TMjThe total miles traveled (i.e., the second route in this application) for all vehicles of type j in the quantified and reported year is in the units of hundred kilometers. ECPUMjThe average energy consumption of the j type vehicle model in unit of mileage is Kg fuel/hundred kilometers or kWh/hundred kilometers. EFTF(j)Is the emission factor of the TF (j) energy source and has the unit of tCO2T fuel or tCO2The ratio of the molecular weight to the molecular weight of the MWh. TF (j) is the energy type used by the jth type vehicle model. GWP is the global warming potential, and the GWP of carbon dioxide greenhouse gas is 1.
In other vehicles than the fuel-consuming vehicle, for example, the fuel-consuming vehicle, the present application may calculate the carbon emission amount of each of the second paths using the following equation (2).
E is L x a formula (2)
Wherein E is the carbon emission. L is the path of the second path. α is an emission factor, which may be pre-custom set for the system, e.g., 0.785, etc.
And S105, determining a target navigation path from the n second paths according to the carbon emission.
After the carbon emission of each of the n second paths is obtained through calculation, a target navigation path can be selected from the n second paths, and navigation driving is conducted according to the target navigation path. Wherein the target navigation path has a carbon emission amount less than a carbon emission amount of a navigation path already used in the vehicle. Preferably, the target navigation path is n paths with the least amount of carbon emission in the second path.
In an optional embodiment, the method and the device for obtaining the destination type of the vehicle can further select a path matched with the destination type from historical driving records as a common path, for example, a path corresponding to a user who frequently drives from a company to home is a common path, and the like. Further, the carbon emission amount of the common path can be calculated according to the method of the step S104, and optionally, the carbon emission amount of the common path can be stored so as to be pushed to a user or stored for the user to check at any time. Further, the carbon emission reduction amount of the target navigation path may be calculated according to the carbon emission amount of the target navigation path and the carbon emission amount of the common path, and specifically may be a difference between the carbon emission amount of the target navigation path and the carbon emission amount of the common path.
By implementing the method, the destination type corresponding to the travel intention of the user is obtained, m first paths are obtained according to the destination type and the navigation departure place planning, m first paths are further screened to obtain n second paths, the carbon emission of each second path is calculated, and finally a target navigation path corresponding to the carbon emission of the previous navigation path, which is less than the carbon emission of the previous navigation path, is determined from the n second paths according to the carbon emission of each second path, so that the method is beneficial for the user to select a navigation path with less carbon emission (energy saving) to drive, and the purpose of protecting the environment is achieved.
Based on the same inventive concept, another embodiment of the present application provides a device, a terminal device, and a storage medium corresponding to the navigation method implemented in the embodiment of the present application.
Please refer to fig. 2, which is a schematic structural diagram of a navigation device according to an embodiment of the present application. The apparatus shown in fig. 2 comprises: an acquisition module 201, a planning module 202, a screening module 203, a calculation module 204, and a determination module 205, wherein:
the obtaining module 201 is configured to obtain a destination type corresponding to a trip intention of a user;
the planning module 202 is configured to plan and obtain m first paths according to the destination type and the navigation departure place, where m is a positive integer;
the screening module 203 is configured to screen 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 greater than m;
the calculating module 204 is configured to calculate a carbon emission amount of each of the second paths;
the determining module 205 is configured to determine a target navigation path from the n second paths according to the carbon emission.
Optionally, the screening module 203 is specifically configured to:
and screening m first paths according to the road condition of each first path to obtain n second paths.
Optionally, the screening module 203 is specifically configured to:
estimating the driving time of each first path according to the road congestion condition of each first path and/or the distance of each first path;
and selecting n second paths with the running time less than the preset time from the m first paths according to the running time of each first path.
Optionally, the screening module 203 is specifically configured to:
estimating the running cost of each first path according to the charging road section included in each first path;
and selecting n second paths from m first paths according to the running cost of each first path.
Optionally, the screening module 203 is specifically configured to:
and selecting n second paths with the routes smaller than the preset routes from the m first paths according to the routes of the first paths.
Optionally, the number of the destination types is multiple, each of the first paths includes multiple navigation destinations corresponding to multiple destination types, and the filtering module 203 is specifically configured to:
and selecting n second paths, of which the distances between any two adjacent navigation destinations are smaller than a preset distance, from m first paths according to the distance between any two navigation destinations in each first path.
Optionally, the apparatus further comprises a matching module 206 and a calculating module 207, wherein:
the matching module 206 is configured to select a common path matched with the destination type from historical driving records;
the calculation module 207 is used for calculating the carbon emission of the common path;
the calculating module 207 is further configured to calculate a carbon emission reduction amount corresponding to the target navigation route according to the carbon emission amount of the target navigation route and the carbon emission amount of the common route.
Please refer to fig. 3, which is a schematic structural diagram of a terminal device according to an embodiment of the present application. The terminal device 30 shown in fig. 3 includes: at least one processor 301, a communication interface 302, a user interface 303, and a memory 304, wherein the processor 301, the communication interface 302, the user interface 303, and the memory 304 may be connected by a bus or by other means, and the embodiment of the present invention is exemplified by being connected by the bus 305. Wherein the content of the first and second substances,
The communication interface 302 may be a wired interface (e.g., an ethernet interface) or a wireless interface (e.g., a cellular network interface or using a wireless local area network interface) for communicating with other terminals or websites. In this embodiment of the present invention, the communication interface 302 is specifically configured to obtain the destination type.
The user interface 303 may specifically be a touch panel, including a touch screen and a touch screen, for detecting an operation instruction on the touch panel, and the user interface 303 may also be a physical button or a mouse. The user interface 303 may also be a display screen for outputting, displaying images or data.
The Memory 304 may include Volatile Memory (Volatile Memory), such as Random Access Memory (RAM); the Memory may also include a Non-Volatile Memory (Non-Volatile Memory), such as a Read-Only Memory (ROM), a Flash Memory (Flash Memory), a Hard Disk (Hard Disk Drive, HDD), or a Solid-State Drive (SSD); the memory 304 may also comprise a combination of the above-described types of memory. The memory 304 is used for storing a set of program codes, and the processor 301 is used for calling the program codes stored in the memory 304 and executing the following operations:
obtaining a destination type corresponding to the travel intention of the user;
planning and obtaining m first paths according to the destination type and the navigation departure place, wherein m is a positive integer;
screening m first paths to obtain n second paths, wherein n is a positive integer not exceeding m;
calculating the carbon emission of each second path;
and determining a target navigation path from the n second paths according to the carbon emission.
Optionally, the screening the m first paths to obtain n second paths includes:
and screening m first paths according to the road condition of each first path to obtain n second paths.
Optionally, the screening m first paths according to the road condition of each first path to obtain n second paths includes:
estimating the driving time of each first path according to the road congestion condition of each first path and/or the distance of each first path;
and selecting n second paths with the running time less than the preset time from the m first paths according to the running time of each first path.
Optionally, the screening m first paths to obtain n second paths includes:
estimating the running cost of each first path according to the charging road section included in each first path;
and selecting n second paths from m first paths according to the running cost of each first path.
Optionally, the screening m first paths to obtain n second paths includes:
and selecting n second paths with the routes smaller than the preset routes from the m first paths according to the routes of the first paths.
Optionally, the number of the destination types is multiple, each of the first paths includes multiple navigation destinations corresponding to multiple destination types, and the screening m first paths to obtain n second paths includes:
and selecting n second paths, of which the distances between any two adjacent navigation destinations are smaller than a preset distance, from m first paths according to the distance between any two navigation destinations in each first path.
Optionally, the processor 301 is further configured to:
selecting a common path matched with the destination type from historical driving records;
calculating carbon emissions of the common path;
and calculating the carbon emission reduction amount corresponding to the target navigation route according to the carbon emission amount of the target navigation route and the carbon emission amount of the common route.
Since the terminal device described in this embodiment is a terminal device used for implementing the navigation method in this embodiment, based on the navigation method described in this embodiment, a person skilled in the art can understand the specific implementation of the terminal device in this embodiment and various variations thereof, so that a detailed description of how to implement the method in this embodiment by the terminal device is omitted here. The terminal device used by a person skilled in the art to implement the method for processing information in the embodiment of the present application is within the scope of the protection intended by the present application.
Based on the same inventive concept, the embodiment of the present invention further provides a computer-readable storage medium 40, as shown in fig. 4, on which a computer program 401 is stored, and when the computer program 401 is executed by a processor, the computer program 401 implements any one of the method steps provided by the embodiment of the present application.
The technical scheme in the embodiment of the application at least has the following technical effects or advantages: according to the method and the device, the destination type corresponding to the travel intention of the user is obtained, m first paths are obtained according to the destination type and the navigation departure place planning, m first paths are further screened to obtain n second paths, the carbon emission of each second path is calculated, and finally a target navigation path corresponding to the carbon emission which is less than that of the previous navigation path is determined from the n second paths according to the carbon emission of each second path, so that the method and the device are beneficial for the user to select a navigation path with less carbon emission (energy saving) to drive, and the purpose of protecting the environment is achieved.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such 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 such modifications and variations.
Claims (10)
1. A method of navigation, the method comprising:
obtaining a destination type corresponding to the travel intention of the user;
planning and obtaining m first paths according to the destination type and the navigation departure place, wherein m is a positive integer;
screening m first paths to obtain n second paths, wherein n is a positive integer not exceeding m;
calculating the carbon emission of each second path;
and determining a target navigation path from the n second paths according to the carbon emission.
2. The method of claim 1, wherein the screening the m first paths to obtain n second paths comprises:
and screening m first paths according to the road condition of each first path to obtain n second paths.
3. The method as claimed in claim 2, wherein the screening m first paths according to the road condition of each first path to obtain n second paths comprises:
estimating the driving time of each first path according to the road congestion condition of each first path and/or the distance of each first path;
and selecting n second paths with the running time less than the preset time from the m first paths according to the running time of each first path.
4. The method of claim 1, wherein the screening the m first paths to obtain n second paths comprises:
estimating the running cost of each first path according to the charging road section included in each first path;
and selecting n second paths from m first paths according to the running cost of each first path.
5. The method of claim 1, wherein the screening the m first paths to obtain n second paths comprises:
and selecting n second paths with the routes smaller than the preset routes from the m first paths according to the routes of the first paths.
6. The method according to claim 1, wherein there are a plurality of destination types, each of the first paths includes a plurality of navigation destinations corresponding to the plurality of destination types, and the filtering m of the first paths to obtain n second paths includes:
and selecting n second paths from the m first paths, wherein the distance between any two adjacent navigation destinations is smaller than a preset distance.
7. The method of claim 1, further comprising:
selecting a common path matched with the destination type from historical driving records;
calculating carbon emissions of the common path;
and calculating the carbon emission reduction amount corresponding to the target navigation route according to the carbon emission amount of the target navigation route and the carbon emission amount of the common route.
8. A navigation device, comprising: the system comprises an acquisition module, a planning module, a screening module, a calculation module and a determination module, wherein:
the obtaining module is used for obtaining a destination type corresponding to the trip intention of the user;
the planning module is used for planning and obtaining m first paths according to the destination type and the navigation departure place, wherein m is a positive integer;
the screening module is used for screening m first paths to obtain n second paths, wherein the second path is one of the m first paths, and n is a positive integer not exceeding m;
the calculation module is used for calculating the carbon emission of each second path;
and the determining module is used for determining a target navigation path from the n second paths according to the carbon emission.
9. A navigation device, comprising: a processor, a memory, a communication interface, and a bus; the processor, the memory and the communication interface are connected through the bus and complete mutual communication; 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 for performing the navigation method of any one of claims 1 to 7 above.
10. A computer-readable storage medium characterized by storing a program which, when run on a navigation device, executes the navigation method according to any one of claims 1 to 7 above.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111224939.2A CN113984075A (en) | 2021-10-21 | 2021-10-21 | Navigation method, navigation device, navigation equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111224939.2A CN113984075A (en) | 2021-10-21 | 2021-10-21 | Navigation method, navigation device, navigation equipment and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113984075A true CN113984075A (en) | 2022-01-28 |
Family
ID=79739832
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111224939.2A Pending CN113984075A (en) | 2021-10-21 | 2021-10-21 | Navigation method, navigation device, navigation equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113984075A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114999202A (en) * | 2022-05-30 | 2022-09-02 | 中邮建技术有限公司 | Vehicle route guidance method and device considering carbon emission of motor vehicle |
| CN115839724A (en) * | 2023-02-13 | 2023-03-24 | 交通运输部规划研究院 | Truck navigation method and device based on pollutant discharge amount |
| CN116045982A (en) * | 2022-12-23 | 2023-05-02 | 中国船舶集团有限公司综合技术经济研究院 | Ship path planning method and device for emergency rescue |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101413805A (en) * | 2007-09-26 | 2009-04-22 | 株式会社电装 | Route search apparatus |
| CN102538807A (en) * | 2010-12-27 | 2012-07-04 | 宇达电脑（上海）有限公司 | Method and device for planning navigation paths |
| CN106323304A (en) * | 2015-06-15 | 2017-01-11 | 腾讯科技（深圳）有限公司 | Path recommending method and apparatus |
| CN108592933A (en) * | 2018-05-29 | 2018-09-28 | 深圳市元征科技股份有限公司 | A kind of guidance path recommends method and server |
| US20210018324A1 (en) * | 2019-07-18 | 2021-01-21 | Cummins Inc. | Optimal route planning for electric vehicles |
| CN113469620A (en) * | 2021-06-30 | 2021-10-01 | 北京三快在线科技有限公司 | Dispatching method, device and equipment for distribution resources and computer readable storage medium |
| CN113959458A (en) * | 2021-10-21 | 2022-01-21 | 车主邦（北京）科技有限公司 | Navigation method, navigation device, terminal equipment and computer readable storage medium |
-
2021
- 2021-10-21 CN CN202111224939.2A patent/CN113984075A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101413805A (en) * | 2007-09-26 | 2009-04-22 | 株式会社电装 | Route search apparatus |
| CN102538807A (en) * | 2010-12-27 | 2012-07-04 | 宇达电脑（上海）有限公司 | Method and device for planning navigation paths |
| CN106323304A (en) * | 2015-06-15 | 2017-01-11 | 腾讯科技（深圳）有限公司 | Path recommending method and apparatus |
| CN108592933A (en) * | 2018-05-29 | 2018-09-28 | 深圳市元征科技股份有限公司 | A kind of guidance path recommends method and server |
| US20210018324A1 (en) * | 2019-07-18 | 2021-01-21 | Cummins Inc. | Optimal route planning for electric vehicles |
| CN113469620A (en) * | 2021-06-30 | 2021-10-01 | 北京三快在线科技有限公司 | Dispatching method, device and equipment for distribution resources and computer readable storage medium |
| CN113959458A (en) * | 2021-10-21 | 2022-01-21 | 车主邦（北京）科技有限公司 | Navigation method, navigation device, terminal equipment and computer readable storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114999202A (en) * | 2022-05-30 | 2022-09-02 | 中邮建技术有限公司 | Vehicle route guidance method and device considering carbon emission of motor vehicle |
| CN116045982A (en) * | 2022-12-23 | 2023-05-02 | 中国船舶集团有限公司综合技术经济研究院 | Ship path planning method and device for emergency rescue |
| CN115839724A (en) * | 2023-02-13 | 2023-03-24 | 交通运输部规划研究院 | Truck navigation method and device based on pollutant discharge amount |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113984075A (en) | Navigation method, navigation device, navigation equipment and computer readable storage medium | |
| CN103270391B (en) | Navigation system with ecological route based destination guidance mechanism and method of operation thereof | |
| US8554473B2 (en) | Energy efficient routing using an impedance factor | |
| US9671237B1 (en) | Optimized generation of navigation instructions based on computed parking probability values | |
| CN105210119B (en) | The location data points provided by computing device determine the number of pass cost | |
| CN111326015A (en) | Parking spot recommendation method and device | |
| CN102119320A (en) | Travel route evaluation system and travel route evaluation program | |
| US9754226B2 (en) | Urban computing of route-oriented vehicles | |
| EP3683549A1 (en) | Method, apparatus, and computer program product for lane-level route guidance | |
| CN103620345A (en) | Providing routes through information collection and retrieval | |
| CN108225356B (en) | Freight navigation method and device based on historical track of truck | |
| CN111177572A (en) | Personalized tour route recommendation method based on dynamic interest of user | |
| US20220005140A1 (en) | Method, apparatus, and system for providing a contextually relevant vehicle comparison | |
| US9983016B2 (en) | Predicting short term travel behavior with unknown destination | |
| CN109084797B (en) | Navigation path recommendation method and device | |
| CN111325986B (en) | Abnormal parking monitoring method and device, electronic equipment and storage medium | |
| CN108168566B (en) | Road determination method and device and electronic equipment | |
| EP4235476A1 (en) | Method, apparatus, and computer program product for anonymizing trajectories | |
| CN113959458A (en) | Navigation method, navigation device, terminal equipment and computer readable storage medium | |
| CN111858790A (en) | Detour reminding method and device, electronic equipment and medium | |
| CN109214827A (en) | A kind of method and apparatus that identification vehicle brush list deceives benefit behavior | |
| US20230137263A1 (en) | Method and apparatus for generating structured trajectories from geospatial observations | |
| CN111862587B (en) | Travel guidance strategy generation method and device | |
| US11428534B2 (en) | Method, apparatus, and computer program product for map matching location data to a map | |
| CN114413923B (en) | Driving route recommendation method, device, storage medium and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20240417 Address after: Room 2101, Block B, Platinum Plaza, 5-15 Wenling Road, Laoshan District, Qingdao City, Shandong Province, 266100 Applicant after: Shandong Energy Chain Holding Co.,Ltd. Country or region after: China Address before: 100020 room A221, 2nd floor, building 4, yard 1, yaojiayuan South Road, Chaoyang District, Beijing Applicant before: CHEZHUBANG (BEIJING) TECHNOLOGY Co.,Ltd. Country or region before: China |
|
| TA01 | Transfer of patent application right |