Navigation route planning method, navigation route planning device, and electronic device

Abstract

A navigation route planning method, device and electronic equipment are disclosed. The navigation route planning method comprises: obtaining a navigation request, the navigation request comprising at least a starting point and a destination of navigation; recalling candidate navigation routes from the starting point to the destination based on a navigation route recall algorithm; generating a candidate road network graph based on the candidate routes; determining a common road network graph corresponding to the navigation request based on the starting point and the destination; obtaining a personalized road network graph based on the candidate road network graph and the common road network graph; and generating a recommended navigation route based on the personalized road network graph through the navigation route recall algorithm. In this way, a recommended route that is more in line with the personalized preferences of the requester can be generated, and the recommendation effect is improved.

Description

Technical Field

[0001] The present application relates to the field of navigation, and more specifically, to a navigation route planning method, a navigation route planning device and an electronic device. Background Art

[0002] In travel scenarios, navigation is a very important function. A person requesting a navigation route (hereinafter referred to as the requester) can easily obtain a navigation route to a destination and follow the navigation prompts to reach the destination along the navigation route.

[0003] Existing navigation functions first recall navigation routes from the requesting origin to the destination, based on the requester's request. Then, they filter the recalled routes to recommend to the requester. However, how to make the recommended routes more consistent with the requester's travel habits remains a challenge for those skilled in the art. Summary of the Invention

[0004] The present application is proposed to address the above-mentioned technical problems. Embodiments of the present application provide a navigation route planning method, apparatus, and electronic device that combine an alternative route network map formed by alternative routes recalled by a navigation route recall algorithm with a frequently used route network map corresponding to the requester's navigation request to recall more routes, generate recommended routes that better meet the requester's personalized preferences, and improve recommendation effectiveness.

[0005] According to one aspect of the present application, a navigation route planning method is provided, comprising: obtaining a navigation request, the navigation request including at least a navigation starting point and an end point; recalling alternative navigation routes from the starting point to the end point based on a navigation route recall algorithm; generating an alternative road network map based on the alternative routes; determining a common road network map corresponding to the navigation request based on the starting point and the end point; obtaining a personalized road network map based on the alternative road network map and the common road network map; and generating a recommended navigation route based on the personalized road network map through a navigation route recall algorithm.

[0006] In the above-mentioned navigation route planning method, based on the navigation route recall algorithm, recalling the alternative navigation routes from the starting point to the end point includes: based on the starting point and the end point, obtaining all alternative navigation routes recalled by the navigation route recall algorithm, the alternative navigation routes are a sequence of segment links, and each segment link in the segment link sequence has a link identifier and a link attribute.

[0007] In the navigation route planning method, generating the candidate road network graph based on the candidate routes comprises: generating the candidate road network graph as a directed and unweighted graph based on the candidate routes, wherein nodes of the directed and unweighted graph are the road links, and edges of the directed and unweighted graph are the connectivity of the road links, and the nodes store link identifiers and link attributes of the road links.

[0008] In the navigation route planning method, the link attributes of the road links comprise the start point and the end point of the link.

[0009] In the navigation route planning method, determining the frequently-taken road network graph corresponding to the navigation request based on the start point and the end point comprises: determining terminal device identification information corresponding to the navigation request; determining historical preferred road links within a range determined by the start point and the end point based on the identification information; and determining the frequently-taken road network graph corresponding to the navigation request based on the historical preferred road links.

[0010] In the navigation route planning method, generating the recommended navigation route based on the personalized road network graph through the navigation route planning algorithm comprises: determining all connected routes between the start point and the end point based on the personalized road network graph through the navigation route recall algorithm; and performing route sorting and filtering on the all connected routes to obtain the recommended navigation route.

[0011] In the navigation route planning method, the navigation route recall algorithm comprises at least one of a depth-first search (DFS) algorithm, a bidirectional Dijkstra algorithm, and a grid-based route calculation (CBR) algorithm.

[0012] According to another aspect of the present application, a navigation route planning method is provided, comprising: generating a navigation request in response to terminal operation, wherein the navigation request comprises at least a start point and an end point of navigation; obtaining candidate navigation routes from the start point to the end point recalled by a navigation route recall algorithm based on the start point and the end point; generating a candidate road network graph based on the candidate routes; determining a frequently-taken road network graph corresponding to the navigation request based on the start point and the end point; obtaining a personalized road network graph based on the candidate road network graph and the frequently-taken road network graph; and generating a recommended navigation route based on the personalized road network graph through a navigation route planning algorithm.

[0013] According to still another aspect of the present application, a navigation route planning apparatus is provided, comprising: a request obtaining unit configured to obtain a navigation request, the navigation request comprising at least a starting point and a destination of navigation; an alternative recalling unit configured to recall alternative navigation routes from the starting point to the destination based on a navigation route recalling algorithm; an alternative generating unit configured to generate an alternative road network graph based on the alternative routes; a regular route determining unit configured to determine a regular route road network graph corresponding to the navigation request based on the starting point and the destination; a personalized generating unit configured to obtain a personalized road network graph based on the alternative road network graph and the regular route road network graph; and a navigation recommendation unit configured to generate a recommended navigation route by a navigation route planning algorithm based on the personalized road network graph.

[0014] According to still another aspect of the present application, an electronic device is provided, comprising: a processor; and a memory having computer program instructions stored therein, the computer program instructions, when executed by the processor, causing the processor to perform the navigation route planning method as described above.

[0015] According to still another aspect of the present application, a computer readable medium having computer program instructions stored therein is provided, the computer program instructions, when executed by a processor, causing the processor to perform the navigation route planning method as described above.

[0016] The navigation route planning method, the navigation route planning apparatus and the electronic device provided by the present application can combine the alternative road network graph formed by the alternative routes recalled by the navigation route recalling algorithm and the regular route road network graph corresponding to the navigation request of the requester, to recall more routes, generate a recommended route more in line with the personalized preferences of the requester, and improve the recommendation effect. BRIEF DESCRIPTION OF DRAWINGS

[0017] The above and other objects, features and advantages of the present application will become more apparent from the following detailed description of embodiments of the present application taken in conjunction with the accompanying drawings. The drawings provided in the specification and the embodiments of the present application will help further understand the present application. The drawings provided in the specification and the embodiments of the present application serve as a part of the specification and are intended to explain the present application together with the specification, but do not limit the present application. In the drawings, the same reference numerals generally designate the same components or steps throughout the specification.

[0018] Figure 1 FIG. 1 illustrates a schematic diagram of an application scenario of the navigation route planning method according to an embodiment of the present application.

[0019] Figure 2 FIG. 2 illustrates a flowchart of a first example of the navigation route planning method according to an embodiment of the present application.

[0020] Figure 3 FIG. 3 illustrates a flowchart of a second example of the navigation route planning method according to an embodiment of the present application.

[0021] Figure 4 Fig. 1 illustrates a block diagram of a first example of a navigation route planning device according to an embodiment of the present application.

[0022] Figure 5 Fig. 2 illustrates a block diagram of a second example of a navigation route planning device according to an embodiment of the present application.

[0023] Figure 6 Fig. 3 illustrates a block diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0024] In the following, example embodiments according to the present application will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments of the present application, and it should be understood that the present application is not limited to the example embodiments described herein.

[0025] Scenario overview

[0026] Figure 1 Fig. 4 illustrates a schematic diagram of an application scenario of a navigation route planning method according to an embodiment of the present application.

[0027] As Figure 1 shown, when a requestor of a navigation route, such as a driver U, needs to use the navigation function of a terminal device T, first, an operation for making a navigation request is made, for example, a destination is specified. Then, the terminal device T generates a navigation request based on the operation of the requestor, the navigation request including information of a start point and an end point, for example, the start point is the current location of the terminal device T, and the end point is the destination specified by the operation of the requestor.

[0028] Next, the navigation request is sent to a server S, for example, a server of an electronic map service provider, and at the server S, all possible routes are recalled based on the information of the start point and the end point. Then, for all possible routes, sorting and filtering of the routes are performed, so as to determine an optimal route recommended to the requestor by the sorting, and to ensure that the recommended route meets predetermined criteria, for example, is not a route that cannot be traveled, etc.

[0029] Finally, the recommended route is sent by the server S to the terminal device T, and presented to the requestor at the terminal device T.

[0030] Here, it is worth noting that when the electronic map application is locally run on the terminal device T, the functions performed by the server S as Figure 1 shown can also be all locally performed on the terminal device T, or part of the functions performed by the server S can be locally performed on the terminal device T, such as sorting and filtering of the routes based on the personalized preferences of the requestor.

[0031] As described above, in order to improve the effect of route recommendation, in addition to improving the ranking and filtering effect of routes, it is also desirable to recall more possible routes. Therefore, the core of the technical solution of the present application is to provide a personalized route recall scheme, which can recall routes containing the preferred road segments of the requestor for a specific requestor, so that more personalized routes of the requestor can be recalled on the basis of the existing general route recall algorithm.

[0032] In this way, through personalized route recall, the effect of personalized route recommendation can be further improved.

[0033] In the following, the exemplary navigation route planning method according to the embodiments of the present application will be further described with reference to the accompanying drawings.

[0034] Exemplary method one

[0035] Figure 2 A flowchart of a first example of the navigation route planning method according to the embodiments of the present application is shown.

[0036] As Figure 2 shown, the first example of the navigation route planning method according to the embodiments of the present application includes the following steps.

[0037] S110, obtaining a navigation request, the navigation request at least including a starting point and a terminal point of navigation. Here, the first example of the navigation route planning method according to the embodiments of the present application corresponds to the case where the route recall, ranking and filtering functions as described above are implemented on a server. Therefore, as described above, first, the server S obtains the navigation request from the terminal device T of the requestor of the navigation request.

[0038] That is, in the navigation route planning method according to the embodiments of the present application, obtaining a navigation request can include obtaining a navigation request from a terminal device of a requestor.

[0039] And, as described above, for the information of the starting point and the terminal point of the requested route, the information of the terminal point can be specified by the requestor making the navigation request, for example, specifying a predetermined destination as the terminal point of the navigation request, and the information of the starting point can be determined by the current location of the terminal device T of the requestor.

[0040] Therefore, in the above navigation route planning method, obtaining a navigation request can include: obtaining the current location of the terminal device of the requestor as the information of the starting point; and determining the information of the terminal point from the navigation request.

[0041] S120, recalling candidate navigation routes from the start point to the end point based on a navigation route recalling algorithm. In embodiments of the present application, the candidate navigation route is a sequence of route segments, such as Link 1-Link 2-Link 3-Link 4. And each link has a link identification, i.e., a link ID, and link attributes, such as location coordinate information of the start and end points of the link.

[0042] That is, through the navigation route recalling algorithm, all candidate navigation routes recalled can be obtained based on the information of the start and end points, and these candidate navigation routes are a sequence of route segments, which is composed of a series of route segments.

[0043] Therefore, in the navigation route planning method according to embodiments of the present application, recalling candidate navigation routes from the start point to the end point based on a navigation route recalling algorithm includes: based on the start and end points, obtaining all candidate navigation routes recalled by the navigation route recalling algorithm, the candidate navigation routes being a sequence of route segments, and each route segment in the sequence of route segments having a link identification and link attributes.

[0044] In embodiments of the present application, the above navigation route recalling algorithm can be various general and special algorithms for recalling navigation routes, such as a Depth-First Search (DFS) algorithm, a bidirectional Dijkstra algorithm, and a Cell-Based Routing (CBR) algorithm based on a grid.

[0045] S130, generating a candidate road network graph based on the candidate routes. In embodiments of the present application, the symbol of a graph is often represented by G, and a graph is defined as a tuple with the core elements of a vertex set V and an edge set E, i.e., G=(V, E). From the perspective of data, a vertex can be understood as modeling for entities and objects, and an edge is used to describe the association or interaction between two vertices. Given two vertices u, v, the edge between the two points is represented by (u, v). In embodiments of the present application, a vertex is a route segment link, and an edge is the connectivity relationship of a route segment link. For example, if there are two links 1 and 2, if it is possible to go from link 1 to link 2, then there is an edge from link 1 to link 2 between link 1 and link 2.

[0046] Corresponding to the real world, a road network graph can be represented as Link 1-x-Link 2-x-Link 3-x-Link 4, where x represents the connectivity relationship between two adjacent links, which can also be understood as an intersection between two links, but this intersection contains directional information.

[0047] Therefore, in the navigation route planning method according to the embodiments of the present application, the generating the candidate road network graph based on the candidate route comprises: generating the candidate road network graph as a directed and weightless graph based on the candidate route, wherein the nodes of the directed and weightless graph are the road links, and the edges of the directed and weightless graph are the connection relationships of the road links, and the nodes store the link identifiers and link attributes of the road links.

[0048] S140, determining a frequently-traveled road network graph corresponding to the navigation request based on the start point and the end point. That is, in the embodiments of the present application, in order to supplement the recalled route containing the preferred road segment of the requestor, such as the frequently-traveled road segment, for a specific requestor, the candidate navigation route obtained as described above and the preferred road segment of the requestor need to be combined. Specifically, in the navigation route planning method according to the embodiments of the present application, the combination of the candidate road network graph generated by the candidate navigation route recalled by the navigation route recall algorithm and the frequently-traveled road network graph generated from the preferred road segment of the requestor is implemented.

[0049] Specifically, in order to combine the preferred road segment of the requestor, such as the road segment frequently traveled by the requestor within the range of the start point and the end point, in the candidate navigation route recalled by the navigation route recall algorithm, first, the identification information of the requestor corresponding to the route request needs to be determined, then the preferred road segment of the requestor is determined based on the identification information of the requestor, and the personal road network graph is generated based on the preferred road segment of the requestor.

[0050] Therefore, in the navigation route planning method according to the embodiments of the present application, the determining the frequently-traveled road network graph corresponding to the navigation request based on the start point and the end point comprises: determining the terminal device identification information corresponding to the navigation request; determining the historical preferred road segment within the range determined by the start point and the end point based on the identification information; and determining the frequently-traveled road network graph corresponding to the navigation request based on the historical preferred road segment.

[0051] S150, obtaining a personalized road network graph based on the candidate road network graph and the frequently-traveled road network graph. In this way, by combining the candidate road network graph and the frequently-traveled road network graph, a new road network graph is formed, and the new road network graph contains the personalized information of the requestor, i.e., the preferred road segment of the requestor, and therefore, can be called a personalized road network graph.

[0052] S160, generating a recommended navigation route by the navigation route recall algorithm based on the personalized road network graph. That is, after obtaining the personalized road network graph containing the personalized information of the requestor, the possible routes can be determined from the personalized road network graph by the navigation route recall algorithm as described above, and sorted and filtered to obtain the route recommended to the requestor.

[0053] Specifically, first, all connected routes between the start point and the end point can be determined from the personalized road network graph using a navigation route recall algorithm, such as using a depth-first search (DFS) algorithm to traverse the sub-road network to calculate all connected routes before the start point and the end point. Alternatively, to improve the performance of route calculation, a more efficient algorithm such as bidirectional Dijkstra or CBR can also be used for route calculation. In this way, in the routes recalled using the above algorithm, not only the personalized routes of the preferred road segments of the requester are included, but also the spliced routes of the original recalled routes, further expanding the recall set.

[0054] Next, for the recalled route set, route sorting and filtering are further performed to determine the route recommended to the requester.

[0055] That is, in the navigation route planning method according to the embodiment of the present application, the recommended navigation route is generated based on the personalized road network graph through a navigation route planning algorithm, including: determining all connected routes between the start point and the end point based on the personalized road network graph through the navigation route recall algorithm; and performing route sorting and filtering on the all connected routes to obtain the recommended navigation route.

[0056] In addition, as described above, after determining the recommended route, the server S also needs to send the recommended route to the terminal device T for presentation to the requester. That is, in the navigation route planning method according to the embodiment of the present application, further including: sending the recommended route to the terminal device of the requester.

[0057] In summary, the navigation route planning method according to the embodiment of the present application improves the performance of route recommendation by integrating the personal road network into the candidate road network recalled by the navigation route recall algorithm and calculating the route on this basis, thereby expanding the recalled route set and achieving personalized route recall.

[0058] Figure 3 Fig. 2 illustrates a flowchart of a second example of the navigation route planning method according to the embodiment of the present application. As described above, Figure 3 The second example of the navigation route planning method according to the embodiment of the present application includes: S210, generating a navigation request in response to terminal operation, the navigation request including at least a start point and an end point of navigation; S220, obtaining candidate navigation routes from the start point to the end point recalled by a navigation route recall algorithm based on the start point and the end point; S230, generating a candidate road network graph based on the candidate routes; S240, determining a commonly traveled road network graph corresponding to the navigation request based on the start point and the end point; S250, obtaining a personalized road network graph based on the candidate road network graph and the commonly traveled road network graph; and S260, generating a recommended navigation route based on the personalized road network graph through a navigation route planning algorithm.

[0059] Here, a second example of the navigation route planning method according to an embodiment of the present application is illustrated, corresponding to the situation where the algorithm described above is run on a terminal device. Those skilled in the art can understand that its various steps are exactly the same as the first example of the navigation route planning method according to an embodiment of the present application, and will not be repeated here.

[0060] Exemplary apparatus

[0061] Figure 4 A block diagram of a first example of a navigation route planning device according to an embodiment of the present application is illustrated.

[0062] like Figure 4 As shown, the navigation route planning device 300 according to an embodiment of the present application includes: a request acquisition unit 310, used to obtain a navigation request, and the navigation request includes at least a navigation starting point and an end point; an alternative recall unit 320, used to recall an alternative navigation route from the starting point to the end point based on a navigation route recall algorithm; an alternative generation unit 330, used to generate an alternative road network map based on the alternative route; a frequently traveled determination unit 340, used to determine a frequently traveled road network map corresponding to the navigation request based on the starting point and the end point; a personalized generation unit 350, used to obtain a personalized road network map based on the alternative road network map and the frequently traveled road network map; and a navigation recommendation unit 360, used to generate a recommended navigation route based on the personalized road network map through a navigation route planning algorithm.

[0063] In one example, in the above-mentioned navigation route planning device 300, the alternative recall unit 320 is used to: obtain all alternative navigation routes recalled by the navigation route recall algorithm based on the starting point and the end point, the alternative navigation route is a segment link sequence, and each segment link in the segment link sequence has a link identifier and a link attribute.

[0064] In one example, in the above-mentioned navigation route planning device 300, the alternative generation unit 330 is used to: generate an alternative road network graph as a directed unweighted graph based on the alternative route, the nodes of the directed unweighted graph are the road segment links, and the edges of the directed unweighted graph are the connectivity relationships of the road segment links, and the nodes store the link identifiers and link attributes of the road segment links.

[0065] In one example, in the navigation route planning device 300 , the link attributes of the road segment link include the starting point and the end point of the link.

[0066] In one example, in the navigation route planning apparatus 300 described above, the frequently-taken determining unit 340 is configured to: determine terminal device identification information corresponding to the navigation request; determine a historical preferred route segment within a range determined by the start point and the end point based on the identification information; and determine a frequently-taken road network graph corresponding to the navigation request based on the historical preferred route segment.

[0067] In one example, in the navigation route planning apparatus 300 described above, the navigation recommendation unit 360 is configured to: determine all connected routes between the start point and the end point by the navigation route recall algorithm based on the personalized road network graph; and perform route sorting and filtering on the all connected routes to obtain the recommended navigation route.

[0068] In one example, in the navigation route planning apparatus 300 described above, the navigation route recall algorithm includes at least one of a depth-first search (DFS) algorithm, a bidirectional Dijkstra algorithm, and a grid-based route calculation (CBR) algorithm.

[0069] Figure 5 FIG. 2 illustrates a block diagram of a first example of a navigation route planning apparatus according to an embodiment of the present application.

[0070] As Figure 5 shown, the navigation route planning apparatus 400 according to an embodiment of the present application includes: a request generating unit 410 configured to generate a navigation request in response to terminal operation, the navigation request including at least a start point and an end point of navigation; an alternative recalling unit 420 configured to obtain alternative navigation routes from the start point to the end point recalled by a navigation route recall algorithm based on the start point and the end point; an alternative generating unit 430 configured to generate an alternative road network graph based on the alternative routes; a frequently-taken determining unit 440 configured to determine a frequently-taken road network graph corresponding to the navigation request based on the start point and the end point; a personalized generating unit 450 configured to obtain a personalized road network graph based on the alternative road network graph and the frequently-taken road network graph; and a navigation recommendation unit 460 configured to generate a recommended navigation route by a navigation route planning algorithm based on the personalized road network graph.

[0071] Here, FIG. 2 illustrates a case where the second example of the navigation route planning apparatus according to an embodiment of the present application corresponds to the algorithm running on a terminal device as described above, and those skilled in the art can understand that each step thereof is exactly the same as the first example of the navigation route planning apparatus according to an embodiment of the present application described above, and thus will not be described herein.

[0072] Here, those skilled in the art can understand that the specific functions and operations of each unit and module in the navigation route planning apparatuses 300 and 400 described above have been described above with reference to Figures 1 to 3The description of the navigation route planning method is described in detail in the foregoing, and thus, the repeated description will be omitted.

[0073] As described above, the navigation route planning apparatus 300 and 400 according to embodiments of the present application can be implemented in various terminal devices, such as a cloud server of a map service provider, or a mobile device of a requestor, such as a smart phone, etc. In one example, the navigation route planning apparatus 300 and 400 according to embodiments of the present application can be integrated into a terminal device as a software module and / or a hardware module. For example, the navigation route planning apparatus 300 and 400 can be a software module in an operating system of the terminal device, or can be an application developed for the terminal device; of course, the navigation route planning apparatus 300 and 400 can also be one of many hardware modules of the terminal device.

[0074] Alternatively, in another example, the navigation route planning apparatus 300 and 400 can also be a separate device from the terminal device, and the navigation route planning apparatus 300 and 400 can be connected to the terminal device through a wired and / or wireless network, and transmit interactive information in an agreed data format.

[0075] Exemplary electronic device

[0076] In the following, an electronic device according to embodiments of the present application will be described with reference to Figure 6

[0077] Figure 6 FIG. 1 illustrates a block diagram of an electronic device according to embodiments of the present application.

[0078] As shown in Figure 6 , the electronic device 10 includes one or more processors 11 and a memory 12.

[0079] The processor 11 can be a central processing unit (CPU) or other form of processing unit having data processing and / or instruction execution capabilities, and can control other components in the electronic device 10 to perform desired functions.

[0080] ​The memory 12 can include one or more computer program products that can include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory, for example, can include random access memory (RAM), cache memory, and / or the like. The non-volatile memory, for example, can include read only memory (ROM), hard disk drives, flash memory, and / or the like. The computer-readable storage media can store one or more computer program instructions implementing the navigation route planning method according to various embodiments of the present application described above and / or other desired functions. The computer-readable storage media can also store various contents such as an alternative road network map, a frequently traveled road network map, a personalized road network map, and / or the like.

[0081] In one example, the electronic device 10 can further include an input device 13 and an output device 14, which are interconnected through a bus system and / or other forms of connection mechanisms (not shown).

[0082] The input device 13 can include, for example, a keyboard, a mouse, and / or the like.

[0083] The output device 14 can output various information including the recommended navigation route and the like to the outside. The output device 14 can include, for example, a display, a speaker, a printer, a communication network and a remote output device connected thereto, and / or the like.

[0084] Of course, in order to simplify, Figure 6 Only some of the components in the electronic device 10 related to the present application are shown in FIG. 1, and components such as a bus, an input / output interface, and / or the like are omitted. In addition to this, the electronic device 10 can include any other appropriate components according to the specific application.

[0085] Exemplary computer program product and computer readable storage medium

[0086] In addition to the above-described method and device, an embodiment of the present application can be a computer program product including computer program instructions that, when executed by a processor, cause the processor to perform the steps of the navigation route planning method according to various embodiments of the present application described in the above "Exemplary Methods" section of the specification.

[0087] The computer program product can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the first user's computing device, partly on the first user's computing device, as a stand-alone software package, partly on the first user's computing device and partly on a remote computing device or entirely on the remote computing device or server. The embodiments were described in

[0088] In addition, the embodiments of the present application can also be a computer readable storage medium, which stores computer program instructions, and the computer program instructions, when executed by a processor, cause the processor to perform the steps in the navigation route planning method according to various embodiments of the present application described in the above "Exemplary Method" section of the specification.

[0089] The computer readable storage medium can be any combination of one or more computer readable medium(s). The computer readable medium can be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the above. More specific examples (a non-exhaustive list) of the computer readable storage medium include an electrical connection having one or more wires, a portable disc, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0090] The above describes the basic principles of the present application in combination with specific embodiments, but it should be noted that the advantages, advantages, effects and the like mentioned in the present application are only examples and are not limiting, and these advantages, advantages, effects and the like cannot be considered as the must-have of each embodiment of the present application. In addition, the above specific details are only for the purpose of example and understanding, and are not limiting, and the above details do not limit the present application to the must-have of the above specific details.

[0091] The block diagrams of the devices, devices, equipment, and systems involved in this application are merely illustrative examples and are not intended to require or imply that they must be connected, arranged, or configured in the manner shown in the block diagrams. As will be appreciated by those skilled in the art, these devices, devices, equipment, and systems can be connected, arranged, or configured in any manner. Words such as "include," "comprise," "have," and the like are open-ended words, meaning "including but not limited to," and can be used interchangeably therewith. The words "or" and "and" used herein refer to the words "and / or" and can be used interchangeably therewith, unless the context clearly indicates otherwise. The word "such as" used herein refers to the phrase "such as but not limited to," and can be used interchangeably therewith.

[0092] It should also be noted that in the apparatus, device, and method of the present application, each component or each step can be decomposed and / or recombined, and such decomposition and / or recombination should be regarded as equivalent solutions of the present application.

[0093] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present application. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of the present application. Therefore, the present application is not intended to be limited to the aspects shown herein, but rather to be accorded the widest scope consistent with the principles and novel features disclosed herein.

[0094] The above description has been provided for the purpose of illustration and description. Furthermore, this description is not intended to limit the embodiments of the present application to the forms disclosed herein. Although a number of example aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, alterations, additions, and sub-combinations thereof.

Claims

1. A method for navigation route planning, comprising: obtaining a navigation request, the navigation request comprising at least a start point and an end point of a navigation; recalling candidate navigation routes from the start point to the end point based on a navigation route recalling algorithm; generating a candidate road network graph based on the candidate navigation routes; determining a frequently-taken road network graph corresponding to the navigation request based on the start point and the end point and historical preferred road segments within a range determined by the start point and the end point; obtaining a personalized road network graph based on the candidate road network graph and the frequently-taken road network graph; and generating a recommended navigation route based on the personalized road network graph by a navigation route planning algorithm.

2. The navigation route planning method according to claim 1, wherein, The recalling candidate navigation routes from the start point to the end point based on a navigation route recalling algorithm comprises: obtaining all candidate navigation routes recalled by the navigation route recalling algorithm based on the start point and the end point, the candidate navigation routes being road segment link sequences, and each road segment link in the road segment link sequences having a link identifier and a link attribute.

3. The navigation route planning method according to claim 2, wherein, The generating a candidate road network graph based on the candidate navigation routes comprises: generating a candidate road network graph as a directed and unweighted graph based on the candidate navigation routes, nodes of the directed and unweighted graph being the road segment links, and edges of the directed and unweighted graph being connectivity relationships of the road segment links, the nodes storing the link identifiers and the link attributes of the road segment links.

4. The navigation route planning method according to claim 3, wherein, The link attribute of the road segment link comprises the start point and the end point of the link.

5. The navigation routing method according to claim 1, wherein, The determining a frequently-taken road network graph corresponding to the navigation request based on the start point and the end point and historical preferred road segments within a range determined by the start point and the end point comprises: determining terminal device identifier information corresponding to the navigation request; determining the historical preferred road segments within the range determined by the start point and the end point based on the identifier information; and determining the frequently-taken road network graph corresponding to the navigation request based on the historical preferred road segments.

6. The navigation routing method according to claim 1, wherein, The generating a recommended navigation route based on the personalized road network graph by a navigation route planning algorithm comprises: determining all connected routes between the start point and the end point based on the personalized road network graph by the navigation route recalling algorithm; performing route sorting and filtering on the all connected routes to obtain the recommended navigation route.

7. The navigation routing method according to claim 1, wherein, The navigation route recalling algorithm comprises at least one of a depth-first search (DFS) algorithm, a bidirectional Dijkstra algorithm and a grid-based route calculation (CBR) algorithm. 8.A method for navigation route planning, comprising: generating a navigation request in response to terminal operation, the navigation request comprising at least a start point and an end point of a navigation; obtaining candidate navigation routes from the start point to the end point recalled by a navigation route recalling algorithm based on the start point and the end point; generating a candidate road network graph based on the candidate navigation routes; determining a frequently-taken road network graph corresponding to the navigation request based on the start point and the end point and historical preferred road segments within a range determined by the start point and the end point; obtaining a personalized road network graph based on the candidate road network graph and the frequently-taken road network graph; and generating a recommended navigation route based on the personalized road network graph by a navigation route planning algorithm. 9.A device for navigation route planning, comprising: ​ The request obtaining unit is configured to obtain a navigation request, the navigation request comprising at least a start point and an end point of navigation; The alternative recalling unit is configured to recall, based on a navigation route recalling algorithm, alternative navigation routes from the start point to the end point; The alternative generating unit is configured to generate, based on the alternative navigation routes, an alternative road network graph; The regular route determining unit is configured to determine, based on the start point and the end point and historical preferred road segments within a range determined by the start point and the end point, a regular route road network graph corresponding to the navigation request; The personalized generating unit is configured to obtain, based on the alternative road network graph and the regular route road network graph, a personalized road network graph; and The navigation recommending unit is configured to generate, based on the personalized road network graph, a recommended navigation route through a navigation route planning algorithm.

10. An electronic device comprising: a processor; and a memory having computer program instructions stored therein, the computer program instructions, when executed by the processor, causing the processor to perform the navigation route planning method according to any one of claims 1-8. ​ ​

Images