Path planning method, device, equipment and medium

Abstract

Embodiments of the present application provide a path planning method, device, equipment and medium. The method can be applied in the path planning scene of an electronic map. The method comprises: in response to a first drawing operation in a first electronic map application, displaying a target pattern corresponding to the first drawing operation in a display interface of the first electronic map application; outputting M planning paths matched with the target pattern; M is a positive integer; and in response to a selection operation on the M planning paths, performing path navigation in the first electronic map application based on a target planning path triggered by the selection operation. The embodiments of the present application can enrich the path planning mode and enhance the interest of the electronic map in use.

Description

Technical Field

[0001] This application relates to the field of electronic navigation technology, and in particular to a path planning method, apparatus, device, and medium. Background Technology

[0002] In current electronic map applications, after a user provides their origin and destination, the system can provide a travel route based on current road congestion. However, in this existing technology, route planning can only be performed on the electronic map if the user provides accurate origin and destination information. This means that route planning is based solely on the user's provided origin and destination, resulting in a limited and simplistic approach to route planning. Summary of the Invention

[0003] This application provides a route planning method, apparatus, device, and medium, which can enrich route planning methods and enhance the fun of using electronic maps.

[0004] This application provides a path planning method, including:

[0005] In response to the first drawing operation in the first electronic map application, the target pattern corresponding to the first drawing operation is displayed in the display interface of the first electronic map application;

[0006] Output M planned paths that match the target pattern; M is a positive integer;

[0007] In response to a selection operation on M planned paths, path navigation is performed in the first electronic map application based on the target planned path triggered by the selection operation.

[0008] One embodiment of this application provides a path planning device, including:

[0009] The pattern drawing module is used to respond to the first drawing operation in the first electronic map application and display the target pattern corresponding to the first drawing operation in the display interface of the first electronic map application.

[0010] The path output module is used to output M planned paths that match the target pattern; M is a positive integer.

[0011] The path navigation module is used to respond to the selection operation of M planned paths and perform path navigation based on the target planned path triggered by the selection operation in the first electronic map application.

[0012] The device also includes;

[0013] The map zoom module is used to respond to the map zoom operation in the first electronic map application and zoom the first map area displayed on the display interface of the first electronic map application to the second map area determined by the map zoom operation.

[0014] The pattern drawing module is specifically used for:

[0015] In response to the first drawing operation targeting the second map region, draw and display the target pattern within the second map region.

[0016] The pattern drawing module includes:

[0017] The pattern display unit is used to respond to a first drawing operation in a first electronic map application and to display at least two initial patterns drawn by the first drawing operation within the map area displayed on the display interface; the at least two initial patterns are not connected to each other.

[0018] The pattern connection unit is used to connect adjacent initial patterns among at least two initial patterns, determine the connected at least two initial patterns as the target pattern, and display the target pattern in the map area.

[0019] The device also includes:

[0020] The prompt information display module is used to display connection prompt information for at least two initial patterns; the connection prompt information includes a connection confirmation control, which is used to prompt the target user to connect at least two initial patterns.

[0021] Among them, at least two initial patterns include a first initial pattern and a second initial pattern;

[0022] The pattern connection unit is specifically used for:

[0023] Based on the endpoint position of the first initial pattern and the starting position of the second initial pattern, a recommended connection path is generated;

[0024] The first initial pattern, the recommended connection path, and the second initial pattern are determined as the target pattern.

[0025] The first electronic map application runs on a first terminal device, which also includes:

[0026] The pattern sharing module is used to share a target pattern to a social platform or at least one second terminal device, so that when the second terminal device accesses the social platform or receives the target pattern, the target pattern is displayed in the display interface of the second electronic map application on the second terminal device, and a second drawing operation is received from the second terminal device to form a new target pattern based on the target pattern and the second drawing operation.

[0027] The path output module includes:

[0028] The search area determination unit is used to determine the path search area of ​​the target pattern in the map area based on the coordinate information of the target pattern in the map area displayed on the display interface.

[0029] The path matching unit is used to perform path matching processing on the target pattern in the path search area and output M planned paths that match the target pattern.

[0030] The search area determination unit includes:

[0031] The road data acquisition subunit is used to acquire the road data corresponding to the target pattern based on the coordinate information of the target pattern in the map area;

[0032] The boundary addition sub-unit is used to add contour boundaries to the target pattern based on the road width contained in the road data, thereby obtaining the path search area containing the target pattern.

[0033] The path matching unit includes:

[0034] The candidate path generation subunit is used to generate K candidate planning paths associated with the target pattern in the road grid contained in the path search area, based on the starting point and ending point positions corresponding to the target pattern; K is a positive integer greater than or equal to M.

[0035] The feature point acquisition subunit is used to obtain the first feature point set corresponding to the target pattern from the set of contour boundary points corresponding to the target pattern, and to obtain the second feature point set corresponding to the K candidate planning paths from the shape data points corresponding to the K candidate planning paths respectively; the shape point data refers to the coordinate point data used to characterize the road shape in the path search area;

[0036] The first feature segment acquisition subunit is used to acquire N contour boundary points adjacent to the first feature point Pi in the first feature point set in the target pattern, and to form the first feature point Pi and the N contour boundary points into a first feature segment; i is a positive integer less than or equal to the number of first feature points contained in the first feature point set, and N is a positive integer;

[0037] The second feature segment acquisition subunit is used to acquire N shape point data adjacent to the second feature point Pj in the t-th candidate planning path to which the second feature point Pj belongs in the t-th second feature point set, and to form the second feature segment by combining the second feature point Pj and the N shape point data; j is a positive integer less than or equal to the number of second feature points contained in the t-th second feature point set, the t-th candidate planning path belongs to K candidate planning paths, and t is a positive integer less than or equal to K;

[0038] The path planning output sub-unit is used to obtain the path matching degree between the target pattern and the t-th candidate planning path based on the distance between the first feature segment and the second feature segment, and output M planning paths that match the target pattern based on the path matching degree between the target pattern and K candidate planning paths respectively.

[0039] Specifically, the feature point acquisition subunit is used for:

[0040] Obtain the set of contour boundary points corresponding to the target pattern, and perform convolution integral processing on the contour boundary points contained in the set of contour boundary points to obtain the set of denoised boundary points.

[0041] Based on the distance between two adjacent denoised boundary points in the denoised boundary point set, interpolation is performed on the denoised boundary points in the denoised boundary point set to obtain the sampling boundary point set corresponding to the target pattern.

[0042] Based on the curvature corresponding to each sampling boundary point in the sampling boundary point set, the local extreme points in the sampling boundary point set are obtained;

[0043] When a local extreme point satisfies the feature selection condition, the local extreme point is determined as the first feature point of the target pattern, and the local extreme point is added to the first feature point set.

[0044] Specifically, the planned path output sub-unit is used for:

[0045] Based on the path matching degree between the target pattern and the K candidate planning paths, the K candidate planning paths are sorted to obtain the sorted K candidate planning paths.

[0046] If among the sorted K candidate planning paths, there is a candidate planning path whose path matching degree is greater than the matching threshold, then the candidate planning path with a path matching degree greater than the matching threshold is determined as M planning paths.

[0047] Output M planned routes, along with the corresponding mode of transportation, travel distance, travel time, and route matching degree for each of the M planned routes.

[0048] The path planning output sub-unit is also used for:

[0049] If the path matching degree of the K candidate planning paths after sorting is less than or equal to the matching threshold, then find the first similar road with the same road level as the road in the path search area in the electronic map.

[0050] Based on the first similar road, generate one or more first recommended paths associated with the target pattern;

[0051] If, among one or more first recommended paths, there exists a first recommended path whose path matching degree with the target pattern is greater than a matching threshold, then the first recommended path whose path matching degree is greater than the matching threshold is determined as one of the M planned paths.

[0052] The path planning output sub-unit is also used for:

[0053] If the path matching value corresponding to one or more first recommended paths is less than or equal to the matching threshold, then a second similar road with a different road level than the road in the path search area is found in the electronic map.

[0054] Based on the second similar roads, generate one or more second recommended paths associated with the target pattern;

[0055] If, among one or more second recommended paths, there exists a path matching degree between the second recommended path and the target pattern that is greater than the matching threshold, then the second recommended path with a path matching degree greater than the matching threshold is determined as one of the M planned paths.

[0056] The device also includes:

[0057] The mode of transportation selection module is used to respond to input operations on the target driving image and to determine the mode of transportation specified by the input operation as the target mode of transportation for the target user.

[0058] The path planning output sub-unit is specifically used for:

[0059] Obtain the transportation modes corresponding to M planned paths. Among the M planned paths, the planned path with the target transportation mode is determined as the planned path to be displayed.

[0060] Display the planned route to be shown, along with the target mode of transportation, travel distance, travel time, and route matching degree corresponding to the planned route to be shown. Hide the planned routes other than the planned route to be shown among the M planned routes.

[0061] Specifically, the path navigation module is used for:

[0062] In response to the selection operation of M planned paths, the planned path triggered by the selection operation is determined as the target planned path, the target planned path is highlighted in the map area of ​​the first electronic map application, and the target planned path is broadcast aloud.

[0063] The device also includes:

[0064] The location information acquisition module is used to acquire the real-time location information of the target user.

[0065] The route deviation alert module outputs a route adjustment prompt when the real-time location information deviates from the planned path; the route adjustment prompt is used to remind the target user to adjust the route.

[0066] One aspect of this application provides a computer device, including a memory and a processor. The memory is connected to the processor, the memory is used to store computer programs, and the processor is used to call the computer programs so that the computer device executes the method provided in one aspect of this application.

[0067] One aspect of this application provides a computer-readable storage medium storing a computer program adapted to be loaded and executed by a processor, so that a computer device having a processor performs the method provided in one aspect of this application.

[0068] According to one aspect of this application, a computer program product or computer program is provided, comprising computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the method provided in the above aspect.

[0069] This application embodiment can respond to a first drawing operation in a first electronic map application, displaying the target pattern corresponding to the first drawing operation on the display interface of the first electronic map application. Then, it can output M planned paths matching the target pattern, where M is a positive integer. The target user can select one of the M planned paths as their travel destination and navigate to that path in the first electronic map application. Therefore, the target user can draw target patterns of any shape within the electronic map application's display interface, enhancing the fun of using the electronic map. By using the target pattern drawn by the target user for path planning, multiple planned paths matching the target pattern can be found in the electronic map, and a suitable target planned path can be selected from these multiple planned paths, enriching the path planning methods of the electronic map. Attached Figure Description

[0070] To more clearly illustrate the technical solutions in one or more embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0071] Figure 1This is a schematic diagram of the network architecture provided in one or more embodiments of this application;

[0072] Figure 2 This is a schematic diagram of a navigation path planning scenario provided in one or more embodiments of this application;

[0073] Figure 3 This is a flowchart illustrating a path planning method provided in one or more embodiments of this application;

[0074] Figure 4 This is a schematic diagram of an interface for a target pattern provided in one or more embodiments of this application;

[0075] Figure 5 This is a schematic diagram of an interface for a target pattern provided in one or more embodiments of this application;

[0076] Figure 6a and Figure 6b This is a schematic diagram of a path planning scenario in an electronic map provided in one or more embodiments of this application;

[0077] Figure 7 This is a flowchart illustrating a path matching method provided in one or more embodiments of this application;

[0078] Figure 8 This is a flowchart illustrating a path planning method provided in one or more embodiments of this application;

[0079] Figure 9 This is a schematic diagram of the structure of a path planning device provided in one or more embodiments of this application;

[0080] Figure 10 This is a schematic diagram of the structure of a computer device provided in one or more embodiments of this application. Detailed Implementation

[0081] The technical solutions will now be clearly and completely described with reference to the accompanying drawings of one or more embodiments of this application. Obviously, the described one or more embodiments are only some embodiments of this application, and not all embodiments. Based on one or more embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0082] Please see Figure 1 , Figure 1 This is a schematic diagram of a network architecture provided in one or more embodiments of this application. Figure 1 As shown, this network architecture may include a server 10d and a user terminal cluster. The user terminal cluster may include one or more user terminals; the number of user terminals is not limited here. Figure 1 As shown, the user terminal cluster may specifically include user terminal 10a, user terminal 10b, and user terminal 10c, etc.; Figure 1 As shown, user terminals 10a, 10b, and 10c can each connect to server 10d via a network, allowing each user terminal to interact with server 10d through this network connection. Server 10d can be an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. User terminals 10a, 10b, and 10c can include: smartphones, tablets, laptops, in-vehicle devices, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches and smart bracelets), and smart TVs—all intelligent terminals with application installation and location functions.

[0083] For example, with Figure 1Taking the user terminal 10a as an example, an electronic map application can be installed in the user terminal 10a. When user A (who can be the holder of user terminal 10a) starts the electronic map application installed in user terminal 10a and enters the homepage of the electronic map application, the first map area currently displayed on the electronic map application can be zoomed to the map area that user A wants to drive in. Then, a target pattern of any shape can be drawn in the map area, and the target pattern drawn by user A can be displayed in the map area of ​​the electronic map application. The target pattern includes, but is not limited to: graphics (e.g., circles, quadrilaterals, etc.), text (e.g., English letters such as "K" and "E"), numbers (e.g., "2021"), and animal shapes (e.g., "dog" and "cat"). User terminal 10a can determine the road containing the outline of the target pattern drawn by user A within the electronic map application. By calculating the path matching degree between the target pattern and different roads, it recommends M planned paths matching the target pattern to user A, where M is a positive integer, such as 1, 2, ... User A can choose a suitable planned path A from the above M planned paths as the target planned path. After user A selects planned path A, it can be displayed on the electronic map, and navigation can be performed based on planned path A to help user A complete the trip. In other words, user A can draw any shape of target pattern in the electronic map application according to personal needs or interests, and the user terminal can find a matching planned path on the electronic map, which enriches the path planning methods and enhances the operability and interactivity of the electronic map during use.

[0084] Please see Figure 2 , Figure 2 This is a schematic diagram of a navigation path planning scenario provided in one or more embodiments of this application. For example... Figure 2 The user terminal 20a shown can be the one described above. Figure 1 This application uses user terminal 20a as an example to illustrate the path planning method in the electronic map, taking any user terminal selected in the user cluster shown.

[0085] like Figure 2As shown, the current display interface of user terminal 20a can be the homepage 20b of an electronic map application. The electronic map displayed on the homepage 20b is located in map area A obtained after the target user performs a map zoom operation, which is the geographical area where the user's expected travel route is located. The user terminal 20a may have an electronic map application installed. The owner of the user terminal 20a can be referred to as the target user. When the target user performs a trigger operation on the electronic map application installed on the user terminal 20a (e.g., clicking the electronic map application icon), the user terminal 20a can launch the installed electronic map application and enter the homepage 20b of the electronic map application. After entering the homepage 20b of the electronic map application, the homepage 20b can default to displaying the geographical area where the current user's location is located within the electronic map included in the electronic map application (for convenience, it can be referred to as map area B). When the geographical area where the target user wants to travel is not the map area B where the current user's location is located, the target user can zoom the electronic map displayed on the homepage 20b from map area B where the current user's location is located to map area A where the target user wants to travel. For example, when user terminal 20a launches an electronic map application, user terminal 20a can obtain the current location of the target user through the positioning module (e.g., represented by latitude and longitude), and determine the map area B where the current user location is located in the electronic map. At this time, the homepage 20b can display the aforementioned map area B. When map area B is not the area where the target user wants to travel, the target user can switch and zoom the map area B displayed on the homepage 20b to map area A. In one or more embodiments, when map area B is the area where the target user wants to travel, it is not necessary to zoom the map area B displayed on the homepage 20b. Here, map area A and map area B can be different districts in the same city, or different cities, or different neighborhoods in the same district, etc., and this application does not make specific limitations in this regard.

[0086] Understandably, the homepage 20b can also include a search box, message control, layer control, reporting control, etc. The search box can be used to search for locations, buses, subways, etc. The message control can be used to view notification messages in the electronic map application. The layer control can be used to view information about various layers in the electronic map application. For example, the layers in the electronic map application can include the bottom layer (used to display geographic information), the drawing layer (used to display various geometric shapes, which can be expanded according to business needs), the control layer (used to display operation buttons for the electronic map, such as zoom and pan functions), and the prompt layer (used to display prompt boxes, such as an information box popping up after the target user clicks on a certain label).

[0087] In one or more embodiments, the target user can draw a desired route pattern in map area A displayed on the homepage 20b. For example, the target user can determine their starting point (also known as the origin) within map area A. Figure 1 As shown at position S1), a pattern is drawn starting from position S1. The user terminal 20a can respond to the target user's drawing operation within map area A, obtain the target user's drawing trajectory within map area A, draw the target pattern 20c in map area A, and display the target pattern 20c (e.g., ...). Figure 2 The “O” character shown can be drawn in a clockwise direction (the trajectory of the target pattern 20c can be clockwise).

[0088] User terminal 20a can add outer boundaries 20d and 20e to the target pattern 20c based on its outline and the corresponding road level. The annular area between outer boundaries 20d and 20e can be called the path search area for the target pattern 20c. This path search area can be understood as the recognition range of the target pattern 20c, avoiding large-scale search matching and thus improving the search efficiency for the target pattern 20c. The road levels mentioned above can include, but are not limited to: expressways, national highways, provincial highways, county roads, township roads, and urban expressways. The outer boundaries 20d and 20e can be determined by the actual width (in meters) of the road where the target pattern 20c is located, which can also be called the road segment width.

[0089] In one or more embodiments, user terminal 20a can match all roads with different road levels in the path search area. By calculating the matching degree between the target pattern 20c and the road paths, road paths with a matching degree greater than a matching threshold (e.g., 0.8, 0.75, etc., the value of the matching threshold is not limited in this application) are determined as planned paths that match the target pattern 20c. If no planned path similar to the target pattern 20c is matched in the path search area, a planned path with the same road level can be recommended to the target user. If no planned path with the same road level is matched, a driving route plan with different road levels can be recommended to the target user. In other words, user terminal 20a can determine the planned path that matches the target pattern 20c according to the matching priority. The order of matching priority from high to low can be: path matching within the path search range, path matching with the same road level, and path matching with different road levels. For example, assuming that no national highway route matching target pattern 20c is found in the path search area during the search for target pattern 20c, other national highway routes outside the path search area can be recommended to the target user; if no national highway route matching target pattern 20c is found, provincial highway routes, county road routes, expressways, etc., can be searched for. It should be noted that the matching degree between the national highway routes or other routes with different road levels recommended to the target user and target pattern 20c still needs to be greater than the aforementioned matching threshold.

[0090] like Figure 2 As shown, user terminal 20a can obtain the most matching planned path 20f by performing path search and matching on target pattern 20c, and display the planned path 20f on the path recommendation page 20g of the electronic map application. The recommendation page 20g may also include region 20h and region 20i. Region 20h can be used to display the starting and ending points of the planned path 20f, and region 20i can be used to display recommended transportation methods (e.g., taxi, driving) based on the distance to target pattern 20c, the distance of the planned path 20f (e.g., XX kilometers), and the time required for the planned path 20f (e.g., XX minutes). Region 20i may also include a navigation control 20j, which the target user can trigger to navigate the planned path 20f in the electronic map application.

[0091] In one or more embodiments of this application, the target user can draw a target pattern of any shape in an electronic application. Based on the target pattern drawn by the target user, a matching path can be found in the electronic map application. This not only enriches the path planning methods in the electronic map, but also enhances the fun of using the electronic map.

[0092] Please see Figure 3 , Figure 3 This is a flowchart illustrating a path planning method provided in one or more embodiments of this application. It is understood that the path planning method proposed in this application can be executed by a computer device, which can be a user terminal (as described above). Figure 1 The corresponding user terminal 10a in the embodiment, or a server (as described above) Figure 1 The server 10d in the corresponding embodiment can be a system consisting of a user terminal and a server, or a computer program application (including program code), without specific limitations here. Figure 3 As shown, the path planning method may include the following steps S101-S103:

[0093] Step S101: In response to the first drawing operation in the first electronic map application, the target pattern corresponding to the first drawing operation is displayed in the display interface of the first electronic map application.

[0094] In one or more embodiments, a computer device may install a first electronic map application. When a target user using the computer device performs a launch trigger operation on the first electronic map application, the computer device may respond to the launch trigger operation for the first electronic map application, launch the first electronic map application, and enter the homepage of the first electronic map application (e.g., the one described above). Figure 2 The homepage 20b in the corresponding embodiment); at the same time, the current location of the computer device can be determined by the positioning module. At this time, the current location of the computer device can be considered as the current location of the target user (hereinafter referred to as the current user location for ease of description). Based on the current user location, the map area of ​​the electronic map contained in the first electronic map application displayed on the homepage is determined. In other words, the geographical range where the current user location is located can be used as the default geographical range displayed on the homepage (e.g., the first map area mentioned above).

[0095] When the default geographical area displayed in the first electronic map region is not the region the target user wants to travel to, the target user can zoom in and out of the electronic map according to their travel needs, so that the homepage of the first electronic map application displays the region the target user wants to travel to. Then, a target pattern of any shape can be drawn within the zoomed region. When the target user zooms in and out of the electronic map, the computer device can respond to the map zooming operation in the first electronic map application, zooming the first map region displayed on the first electronic map application's display interface to the second map region determined by the map zooming operation. Then, it can respond to the first drawing operation for the second map region, drawing and displaying the target pattern within the second map region. This target pattern can be any shape drawn by the target user. Here, the first map region can be understood as the default geographical area displayed after the first electronic map application starts, based on the current user's location; the second map region can be understood as the region the target user wants to travel to, obtained by zooming in and out of the first map region. For example, if the target user wants to travel on a national highway, expressway, or provincial highway, the target user can locate the desired geographical area on the electronic map and zoom in to display the map at the national highway, expressway, or provincial highway level. If the target user wants to travel on a county road or township road, the target user can zoom in to the township or county road level. In general, the target user can zoom in and out on the electronic map according to the road level to find a map area that meets the target user's travel needs.

[0096] In one or more embodiments, a target user can draw one or more patterns within a map area displayed on the electronic map's display interface. When the target user draws only one pattern within the map area, that single pattern can be directly identified as the target pattern. When the target user draws multiple patterns within the map area displayed on the display interface, and these patterns are not connected, the multiple patterns can be connected, and the connected patterns can be identified as the target pattern. For example, a computer device can respond to a first drawing operation in a first electronic map application and display at least two initial patterns drawn by the first drawing operation within the map area displayed on the first electronic map application's display interface. These at least two initial patterns are not connected. By connecting adjacent initial patterns among the at least two initial patterns, the connected at least two initial patterns can be identified as the target pattern, and the target pattern can be displayed within the map area displayed on the display interface.

[0097] The aforementioned map area can refer to the geographical area that the target user wants to travel to. When the default geographical area displayed by the first electronic map application happens to be the geographical area that the target user wants to travel to, this default geographical area can be considered as the aforementioned map area. That is, the map area here and the aforementioned first map area represent the same geographical area, and the target user does not need to zoom the electronic map and can directly draw the target pattern within the first map area. When the default geographical area displayed by the first electronic map application is not the geographical area that the target user wants to travel to, the electronic map can be zoomed to the map area that the target user wants to travel to. In this case, the map area and the aforementioned second map area represent the same geographical area, and the target user can draw the target pattern within the second map area.

[0098] In one or more embodiments, when the number of the at least two initial patterns is two, and the two initial patterns include a first initial pattern and a second initial pattern, the process of connecting the at least two initial patterns may include: a computer device can obtain the endpoint position when the target user draws the first initial pattern and the starting position when drawing the second initial pattern, and generate a recommended connection path based on the endpoint position of the first initial pattern and the starting position of the second initial pattern; then, the first initial pattern, the recommended connection path, and the second initial pattern can be determined as the target pattern. It should be noted that the target user draws the first initial pattern in a time sequence earlier than the second initial pattern.

[0099] In one or more embodiments, the computer device may further determine the target position closest to the endpoint position of the first initial pattern from the second initial pattern, and generate a recommended path for connecting the first initial pattern and the second initial pattern based on the endpoint position of the first initial pattern and the target position on the second initial pattern; thereby, the pattern composed of the first initial pattern, the recommended path and the second initial pattern may be determined as the target pattern.

[0100] Figure 4 This is a schematic diagram of an interface for a target pattern provided in one or more embodiments of this application. For example... Figure 4The user terminal 30a shown can be a computer device used by the target user. The current display interface of the user terminal 30a is the homepage 30b in the first electronic map application. At this time, the homepage 30b displays the initial pattern 30c (i.e. the first initial pattern mentioned above) and the initial pattern 30d (i.e. the second initial pattern mentioned above). The initial pattern 30c and the initial pattern 30d are both patterns drawn by the target user. When user terminal 30a detects that initial pattern 30c and initial pattern 30d are not connected, it can obtain the endpoint position S2 of the target user when drawing initial pattern 30c and the starting point position S3 of the target user when drawing initial pattern 30d. Then, it can use the endpoint position S2 of initial pattern 30c as the starting point and the starting point position S3 of initial pattern 30d as the endpoint to recommend a corresponding path to the target user, namely, recommend connection path 30e, so as to realize the connection between initial pattern 30c and initial pattern 30d. Then, the pattern composed of initial pattern 30c, recommended connection path 30e and initial pattern 30d can be determined as the target pattern and displayed on the homepage of the first electronic map application.

[0101] In one or more embodiments, when at least two initial patterns are displayed in the display interface of the first electronic map application, connection prompts for the at least two initial patterns can be displayed in the first electronic map application. The connection prompts can be used to prompt the target user whether they need to connect the at least two initial patterns. For example, the connection prompts can include connection confirmation controls (e.g., "Yes", "Confirm" controls, etc.) and connection denial controls (e.g., "No", "Cancel" controls, etc.). The confirmation controls can be used to prompt the target user to connect the at least two initial patterns, and the denial controls can be used to prompt the target user to deny connecting the at least two initial patterns.

[0102] Figure 5 This is a schematic diagram of an interface for a target pattern provided in one or more embodiments of this application. When the user terminal 30a detects that the target user has drawn two unconnected initial patterns on the homepage 30b of the first electronic map application (as described above) Figure 4 As shown, initial patterns 30c and 30d are respectively, which can generate patterns such as... Figure 5 The connection prompt message 30f shown (for example, it can be specifically expressed as "connect the two drawn patterns") may include two controls: "Yes" (the connection confirmation control mentioned above) and "No" (the connection denial control mentioned above). When the target user selects to perform a trigger operation on the "Yes" control, the user terminal 30a can perform the operation as described above. Figure 4The operations described in the corresponding embodiments will not be elaborated here. When the target user selects to perform a trigger operation on the "No" control, the user terminal 30a can close the connection prompt information 30f, not perform a connection operation on the initial patterns 30c and 30d, and directly determine the unconnected initial patterns 30c and 30d as the target patterns. For example, when the initial patterns 30c and 30d displayed on the display interface of the first electronic map application are patterns drawn by the target user for themselves and their friends respectively, the target user can choose not to connect the initial patterns 30c and 30d, directly determine the initial patterns 30c and 30d as the target patterns, and share the electronic map displaying the target patterns with their friends, so that they can complete the target planning path corresponding to the target pattern together. For example, the target user can complete the target planning path corresponding to the initial pattern 30c by themselves, and their friends can complete the target planning path corresponding to the initial pattern 30d. The target pattern can be shared with friends as social information, inviting friends to complete the target planning path corresponding to the target pattern together, thereby enhancing the interactivity between different users.

[0103] Step S102: Output M planned paths that match the target pattern, where M is a positive integer.

[0104] In one or more embodiments, after a target user draws a target pattern in a first electronic map application, the computer device can calculate the path search area of ​​the target pattern. This can be used to confirm the recognition range of the target pattern, reduce the search and matching range for the target pattern, and thus improve the search and matching efficiency of the target pattern. The computer device can determine the path search area of ​​the target pattern in the map area displayed on the interface based on the coordinate information of the target pattern. Then, it can perform path matching processing on the target pattern within this path search area and output M planned paths that match the target pattern, where M is a positive integer.

[0105] The process of determining the path search area may include: The computer device can obtain road data within the map area based on the coordinate information of the target pattern's outline in the map area; and based on the road width (also known as road segment width) contained in the road data, add outline boundaries to the target pattern (e.g., the aforementioned...). Figure 2The outer boundaries 20d and 20e in the corresponding embodiments are used to obtain a path search area containing the target pattern. The road data can refer to road Link (which can be used to provide a data interface) data and node information stored in the first electronic map application. Road Link data can include information such as road width, road direction, and road grade, while node information can include information such as intersections and traffic lights. The computer device can add an outer boundary to the outline of the target pattern based on its road grade to generate the path search area corresponding to the target pattern. For example, as described above... Figure 4 The initial pattern 30c shown is a closed-loop pattern, therefore two contour boundaries need to be added to it; as described above. Figure 4 The initial pattern 30d shown is not a closed loop diagram, so it is only necessary to determine one of the contour boundaries of the initial pattern 30d.

[0106] In one or more embodiments, a computer device can find all candidate planned paths associated with a target pattern in a path search area. A matching algorithm can calculate the path matching degree between each candidate planned path and the target pattern, resulting in M ​​planned paths that match the target pattern. The path matching degree between all M planned paths and the target pattern is greater than a matching threshold, which can be set according to actual needs, such as 0.8 or 0.85. During the acquisition of the M planned paths, the user terminal can employ different matching strategies to perform path matching on the target pattern. Different matching strategies can have different priorities, for example, arranged in descending order of priority. Each matching strategy can be represented as: ① In the path search area, find road shape points that match the target pattern. Roads with different road levels can be matched in this path search area. Road shape points can refer to coordinate point data used to describe the shape of a road; ② Among roads with the same road level, find road trajectories with a path matching degree greater than the matching threshold; ③ Among roads with different road levels, find road trajectories with a path matching degree greater than the matching threshold. In other words, the priority of matching strategy ① is higher than that of matching strategy ②, and the priority of matching strategy ② is higher than that of matching strategy ③. Naturally, the higher the priority, the higher the weight the computer device can assign to the planned path generated by that matching strategy, thus recommending the most suitable planned path to the target user. It should be noted that the matching algorithms used to calculate path matching degree may include, but are not limited to: two-dimensional fragment contour curve matching algorithms, structural similarity (SSIM) algorithms, image vector cosine similarity, and histogram similarity.

[0107] After determining M planned paths that match the target pattern, the computer device can output these M planned paths in the first electronic map application. It can also output information such as the mode of transportation (e.g., walking, cycling, driving, taxi, public transport, etc.), travel distance, travel time, and path matching degree for each planned path in the first electronic map application.

[0108] Step S103: In response to the selection operation for M planned paths, perform path navigation in the first electronic map application based on the target planned path triggered by the selection operation.

[0109] In one or more embodiments, a target user can select a suitable planned path from M planned paths as their travel route. When the target user selects a planned path from the M planned paths, the computer device can respond to the selection operation for the M planned paths, determine the planned path triggered by the selection operation as the target planned path, highlight the target planned path in the map area of ​​the first electronic map application, and perform route navigation based on the target planned path. During the navigation process of the target planned path, the target planned path can be broadcast in real time, which helps the target user complete the corresponding travel task based on the target planned path, avoids the target user taking the wrong route, and thus enhances the target user experience.

[0110] In one or more embodiments, during the navigation process of the target planned path, the real-time location information of the target user can also be obtained; when the real-time location information deviates from the target planned path, route adjustment prompts are output, which are used to prompt the target user to adjust the route. In other words, once the computer device detects that the real-time location information of the target user deviates from the target planned path, it will output route adjustment information in the first electronic map application. The route adjustment information can be text prompts, voice broadcasts, or device vibration prompts, etc. This application does not limit the presentation method of the route adjustment information.

[0111] In one or more embodiments, the computer device used by the target user can be referred to as the first terminal device, and the aforementioned first electronic map application can refer to an electronic map application running on the first terminal device. Regarding the target pattern and target planning path in the first electronic map application, the target user can choose to share the current target planning path to a social platform or at least one or more second terminal devices (here, the second terminal device can refer to a device used by users other than the target user) to enhance interaction between the target user and friends. Alternatively, the target user can choose to share the target pattern to a social platform or at least one or more second terminal devices, so that when each second terminal device accesses the social platform or receives the target pattern, the target pattern is displayed in the display interface of the second electronic map application on the second terminal device, and a second drawing operation is received from the second terminal device. Based on the target pattern and the second drawing operation, a new target pattern is formed; that is, the user holding the second terminal device can continue to draw patterns based on the target pattern to form a new target pattern. Alternatively, the user can choose to share the target pattern in the first electronic map application and the target planning path selected by the target user together to a social platform or at least one or more second terminal devices to enhance the social attributes between users. For example, a target pattern containing at least two initial patterns can be regarded as a task. This task can be broken down with friends to jointly complete the target planning path associated with the target pattern. This can be applied to group activities, team building, and other activities. Alternatively, the target pattern and the target planning path completed by the target user can be shared on the social platform through the information publishing function, which can improve the interactivity between users.

[0112] In this application, the first electronic map application and the second electronic map application are electronic map applications installed on different terminal devices (or computer devices). The first electronic map application and the second electronic map application can be different electronic map applications, or the same version of the same electronic map application, or different versions of the same electronic map application. This application does not limit this.

[0113] Figure 6a and Figure 6b This is a schematic diagram of a path planning scenario in an electronic map provided by one or more embodiments of this application. For example... Figure 6aAs shown, user terminal 40a can be a computer device used by the target user. The current display interface of user terminal 40a can be the homepage 40b of the first electronic map application. The homepage 40b can display the first map area in the electronic map where the current user's location is located, as well as various transportation modes provided by the first electronic map application for the target user, such as public transportation, taxi, driving, cycling, and walking. The target user can directly select a suitable transportation mode from the various transportation modes displayed on the homepage 40b. For example, the target user can select walking and cycling from the homepage 40b. At this time, user terminal 40a can respond to the selection operation for various transportation modes and determine walking and cycling as the target transportation modes. In one or more embodiments, the target user can perform a trigger operation on the search box in the homepage 40b, and enter the text content "cycling, walking" in the search box of the homepage 40b. User terminal 40a can respond to the input operation on the search box and determine walking and cycling as the target transportation modes based on the text content entered in the search box.

[0114] The target user can zoom in on the first map area displayed on the homepage 40b to the map area they want to travel to, and draw patterns 40c and 40d within that map area. During the target user's drawing process, the user terminal 40a can monitor the target user's drawing operations in real time, displaying the corresponding patterns based on the target user's drawing trajectory. After the target user completes drawing, patterns 40c and 40d (which can be referred to as target patterns) are displayed in the map area of ​​the homepage 40b. The computer device can determine the path search area 40e for pattern 40c based on the road data corresponding to the outline of pattern 40c; similarly, it can determine the path search area 40f for pattern 40d based on the road data corresponding to the outline of pattern 40d.

[0115] Within the road grid of the path search area 40e, a path matching algorithm is used to perform path matching processing on pattern 40c to obtain a planned path that matches pattern 40c. Within the road grid of the path search area 40f, a path matching algorithm is used to perform path matching processing on pattern 40d to obtain a planned path that matches pattern 40d. Additionally, user terminal 40a can obtain the endpoint position when the target user draws pattern 40c and the starting position when drawing pattern 40d. Using the endpoint position of pattern 40c and the starting position of pattern 40d, path recommendation is performed to obtain the optimal recommended path. Then, the planned path matched by pattern 40c, the recommended path, and the planned path matched by pattern 40d can be combined to form the planned path corresponding to the target pattern, and the recommended search results corresponding to the planned path are displayed on the recommended search page 40g of the first electronic map application. For example, the planned path corresponding to the target pattern may include planned path 40j and planned path 40k.

[0116] like Figure 6a As shown, the recommended search page 40g displays the target pattern, the corresponding mode of transportation (which can be the target mode of transportation selected by the user, specifically including cycling and walking), road level (which can be determined based on the target mode of transportation, specifically including urban roads, country roads, urban areas, provincial highways, etc.), and recommended search results. These recommended search results can include Recommended Result 1 displayed in region 40h and Recommended Result 2 displayed in region 40i. Recommended Result 1 can include the driving distance (24 km) corresponding to the planned path 40j, the matching degree with the target pattern (95%), the recommended mode of transportation (cycling), and the travel time (120 minutes). Recommended Result 2 can include the driving distance (14 km) corresponding to the planned path 40k, the matching degree with the target pattern (91%), the recommended mode of transportation (walking), and the travel time (110 minutes). When a user selects recommended result 1 in region 40h, the user terminal 40a can respond to a trigger operation (e.g., a click operation) for region 40h, highlight the planned path 40j corresponding to recommended result 1 in the electronic map of the first electronic map application, and perform route navigation based on the planned path 40j.

[0117] like Figure 6b As shown, when the user selects recommended result 2 in area 40i, the user terminal 40a can respond to the trigger operation (e.g., click operation) for area 40i, highlight the planned path 40k corresponding to recommended result 2 in the electronic map of the first electronic map application, and perform route navigation based on the planned path 40k.

[0118] In one or more embodiments of this application, target users can draw target patterns of any shape within the display interface of an electronic map application, enhancing the operability and fun of using the electronic map; by performing path planning based on the target patterns drawn by the target users, multiple planned paths matching the target patterns can be found in the electronic map, and then a suitable target planned path can be selected from the multiple planned paths, enriching the path planning methods of the electronic map; by sharing the target patterns and target planned paths, the interactivity and fun between users can be enhanced, thereby increasing the usage rate of the electronic map.

[0119] Please see Figure 7 , Figure 7 This is a flowchart illustrating a path matching method provided in one or more embodiments of this application. It should be noted that this path matching method is based on the above... Figure 3 Further explanation of step S102 in the corresponding embodiment will be provided below, taking the matching algorithm of two-dimensional fragment contour curves as an example. Figure 7 Steps S201-S205, as shown, detail the path matching process for the target pattern.

[0120] Step S201: Based on the starting point and ending point of the target pattern, generate K candidate planning paths associated with the target pattern in the road grid contained in the path search area.

[0121] In one or more embodiments, the computer device can acquire all road data contained within the path search area, and generate K candidate planned paths associated with the target pattern based on the starting and ending points of the target pattern in the map area, as well as information such as road grade and road direction contained in the road data, where K is a positive integer greater than or equal to M. In other words, the computer device can randomly combine all roads contained within the path search area according to road direction to obtain K candidate planned paths associated with the target pattern, where the starting point of each of the K candidate planned paths is the starting point of the target pattern, and the ending point of each candidate planned path is the ending point of the target pattern.

[0122] Step S202: Obtain the first feature point set corresponding to the target pattern from the set of contour boundary points corresponding to the target pattern, and obtain the second feature point set corresponding to the K candidate planning paths from the shape data points corresponding to the K candidate planning paths respectively.

[0123] In one or more embodiments, a computer device can employ a two-dimensional fragment contour curve matching algorithm to calculate the path matching degree between the target pattern and K candidate planning paths. The algorithm calculates the feature points of the curves corresponding to the target pattern and the K candidate planning paths, and uses each feature point and a certain number of points on either side as feature segments. By calculating the Hausdorff distance (a measure of similarity between two sets of points) between the feature segments in the target pattern and the feature segments in each candidate planning path, matchable feature points are obtained. Based on this, rigid body transformation can be used to achieve the actual assembly of the two-dimensional fragments. This Hausdorff distance algorithm fully utilizes the geometric information of the contour lines, reduces computation, and improves the matching efficiency between the target pattern and the K candidate planning paths.

[0124] It is understandable that the contour boundary of the target pattern in the first electronic map application can be represented as a set of discrete boundary point sequences (for example, a set of discrete boundary point sequences can be obtained by sampling the contour boundary of the target pattern). Therefore, the computer device can obtain the set of contour boundary points corresponding to the target pattern, and perform convolution integral processing on the contour boundary points contained in the set of contour boundary points to obtain a denoised boundary point set. The denoised boundary points contained in the denoised boundary point set can be: a new set of discrete points obtained from the contour boundary of the target pattern. The contour boundary points in the set of contour boundary points are denoised by convolution integral processing to minimize the errors caused by various reasons (e.g., the influence of noise, uneven sampling of curves, etc.).

[0125] In one or more embodiments, a computer device can interpolate the denoised boundary points in the denoised boundary point set based on the distance between two adjacent denoised boundary points to obtain a sampled boundary point set corresponding to the target pattern. The sampled boundary points in the sampled boundary point set can refer to discrete points obtained by resampling from the contour boundary of the target pattern. The computer device can obtain local extrema in the sampled boundary point set based on the curvature corresponding to each sampled boundary point. When a local extrema satisfies the feature selection condition, the local extrema is determined as a first feature point of the target pattern and added to the first feature point set. The curvature of a sampled boundary point can refer to the rate of rotation of the tangent direction angle of the sampled boundary point with respect to the arc length, which can be defined by differentiation, indicating the degree to which the curve deviates from a straight line.

[0126] The computer device can traverse all sampled boundary points in the sampled boundary point set by using the curvature corresponding to each sampled boundary point in the set, and find all local extrema in the set. If a local extrema in the sampled boundary point set simultaneously satisfies conditions 1 and 2, or simultaneously satisfies conditions 1 and 3, then this local feature point can be added to the first feature point set as the first feature point. Condition 1 can be expressed as: |k(D i )|>value(value), where D i It can be represented as the i-th local extremum point in the set of sampled boundary points, k(D i ) can be represented as the curvature corresponding to the i-th local extremum point, and value can be the threshold obtained by analyzing the curvature of each sampled boundary point in the sampled boundary point set; condition 2 can be represented as: k(D i-1 )×k(D i+1 )>0 and k(D) i )×k(D i+1 )<0, where D i-1 This can be represented as the (i-1)th local extremum (i.e., the local extremum preceding the ith local extremum), D i+1 It can be represented as the (i+1)th local extremum (i.e., the local extremum following the ith local extremum); condition 3 can be represented as: k(D i )>2×max(|k(D i-1 )|,|k(D i+1 The first feature point determined by the above conditions can be the point with significant curvature change among all local extreme points. Using it as the first feature point can effectively represent the curve characteristics of the target pattern.

[0127] Similarly, for each of the K candidate planning paths, the same processing method as the target pattern can be used to obtain the second feature point set corresponding to each candidate planning path. The same processing method will not be elaborated here.

[0128] Step S203: In the target pattern, obtain the first feature point P that matches the first feature point set. i The first feature point P is formed by N adjacent contour boundary points. i The first feature segment is formed by N contour boundary points.

[0129] In one or more embodiments, after obtaining the first feature point set corresponding to the target pattern, the computer device can take N / 2 sampling boundary points on both sides of each first feature point in the sampling boundary point set corresponding to the target pattern, and form a first feature segment by combining each first feature point and the N sampling feature points on both sides of the first feature point, where N is a positive integer and N is an even number. For any first feature point P in the first feature point set... i It can be obtained from the set of sampling boundary points corresponding to the target pattern, at the first feature point P i N / 2 sampling boundary points are taken from each side of the first feature point P, and then the first feature point P can be obtained. i The first feature segment is formed by N / 2 sampling boundary points on both sides, where i is a positive integer less than or equal to the number of first feature points contained in the set of first feature points.

[0130] Step S204, the second feature point P in the t-th set of second feature points. j In the t-th candidate planning path, obtain the second feature point P. j The data of N adjacent shape points will be used to determine the second feature point P. j The second feature segment is formed by N shape point data.

[0131] In one or more embodiments, the set of second feature points corresponding to the t-th candidate planning path among the K candidate planning paths can be referred to as the t-th second feature point set; for any first feature point P in the t-th second feature point set... j From the set of shape points corresponding to the t-th candidate planning path, at the first feature point P j Take N / 2 shape point data from each side of the shape, and then the first feature point P can be obtained. j The N / 2 shape points on both sides constitute the second feature segment; where j is a positive integer less than or equal to the number of second feature points contained in the t-th second feature point set, the t-th candidate planning path belongs to K candidate planning paths, and t is a positive integer less than or equal to K. Based on the same processing method described above, the second feature segment corresponding to each of the K candidate planning paths can be obtained.

[0132] Step S205: Based on the distance between the first feature segment and the second feature segment, obtain the path matching degree between the target pattern and the t-th candidate planning path. Based on the path matching degree between the target pattern and each of the K candidate planning paths, output the M planning paths that match the target pattern.

[0133] In one or more embodiments, a computer device can calculate the Hausdorff distance between a first feature segment in the target pattern and a second feature segment in the t-th candidate planning path, and obtain the path matching degree between the target pattern and the t-th candidate planning path based on the Hausdorff distance; sort the K candidate planning paths according to the path matching degree between the target pattern and each of the K candidate planning paths to obtain the sorted K candidate planning paths; if there is a candidate planning path among the sorted K candidate planning paths whose path matching degree is greater than a matching threshold, then the candidate planning paths with path matching degree greater than the matching threshold are determined as M planning paths; and then the M planning paths, as well as the traffic mode, driving distance, travel time, and path matching degree corresponding to the M planning paths, can be output in the first electronic map application.

[0134] In one or more embodiments, if the path matching degree corresponding to the sorted K candidate planning paths is less than or equal to the matching threshold, a first similar road with the same road level as the road in the path search area can be found in the electronic map; then, one or more first recommended paths associated with the target pattern can be generated based on the first similar road; if among the one or more first recommended paths, there is a first recommended path with a path matching degree greater than the matching threshold with the target pattern, the first recommended paths with a path matching degree greater than the matching threshold are determined as M planning paths. In other words, a planning path matching the target pattern can be recommended to the target user based on the first similar roads with the same road level.

[0135] In one or more embodiments, if the path matching values ​​corresponding to one or more first recommended paths are all less than or equal to a matching threshold, then a second similar road with a different road level than the road in the path search area is searched in the electronic map; then, one or more second recommended paths associated with the target pattern are generated based on the second similar roads; if among the one or more second recommended paths, there exists a second recommended path with a path matching degree greater than the matching threshold with the target pattern, the second recommended paths with a path matching degree greater than the matching threshold are determined as M planned paths. In other words, a planned path matching the target pattern can be recommended to the target user based on second similar roads with different road levels.

[0136] In one or more embodiments, the computer device can search for planned paths matching the target pattern in the path search area, and the matched planned paths can be assigned a weight value y1. Then, based on first similar roads with the same road level, a planned path matching the target pattern can be recommended to the target user, and the recommended planned path can be assigned a weight value y2. Then, based on second similar roads with different road levels, a planned path matching the target pattern can be recommended to the target user, and the recommended planned path can be assigned a weight value y3, where weight value y1 is greater than weight value y2, and weight value y2 is greater than weight value y3. All the planned paths obtained above can be determined as M planned paths matching the target pattern, and the weight values ​​corresponding to each planned path can be arranged in descending order and displayed to the target user in the first electronic map application.

[0137] In one or more embodiments, when a target user inputs a mode of transportation in the first electronic map application, the computer device can respond to the input operation associated with the target pattern and determine the mode of transportation determined by the input operation as the target mode of transportation corresponding to the target user. Then, after the user draws the target pattern, the computer device can obtain the modes of transportation corresponding to M planned paths. Among the M planned paths, the planned path with the target mode of transportation is determined as the planned path to be displayed. Then, the planned path to be displayed, as well as the target mode of transportation, travel distance, travel time, and path matching degree corresponding to the planned path to be displayed, can be displayed in the first electronic map application, while the planned paths other than the planned path to be displayed are hidden.

[0138] Please see Figure 8 , Figure 8 This is a flowchart illustrating a path planning method provided in one or more embodiments of this application. The path planning method can be implemented through the following steps S301-S304:

[0139] Step S301: Zoom the electronic map to the second map area and input the target pattern.

[0140] In one or more embodiments, after a target user launches a first electronic map application installed on a computer device (e.g., a user terminal used by the target user), the target user can zoom the first map area displayed on the display interface of the first electronic map application to a second map area where the target user wants to travel, and then input a target pattern in the second map area, such as drawing a target pattern directly in the second map area.

[0141] Step S302: The two-dimensional fragment contour algorithm is used to match the paths within the path search area corresponding to the target pattern to generate M planned paths.

[0142] In one or more embodiments, after a target user inputs a target pattern in a first electronic map application, the computer device can determine the path search area corresponding to the target pattern based on the outline boundary of the target pattern. Then, by matching the paths within the path search area using a two-dimensional fragment contour algorithm, M planned paths are generated. The path matching process within the path search area can participate in the above-described... Figure 8 The descriptions in the corresponding embodiments will not be repeated here.

[0143] Step S303: Select the desired planning path from the M planning paths.

[0144] In one or more embodiments, a computer device may display the above-mentioned M planned paths in a first electronic map application, and a target user may select their preferred planned path from the M planned paths as their target planned path.

[0145] Step S304: The planned path selected by the target user is taken as the target planned path, and navigation is performed on the target planned path in the electronic map.

[0146] In one or more embodiments, when a target user selects a preferred driving route from M planned routes, the computer device can respond to the selection operation for the M planned routes, determine the planned route triggered by the selection operation as the target planned route, highlight the target planned route in the second map area of ​​the electronic map, and perform route navigation based on the target planned route.

[0147] In one or more embodiments of this application, target users can draw target patterns of arbitrary shapes within the display interface of an electronic map application, enhancing the operability and fun of using the electronic map. Path planning is performed using the target patterns drawn by the target users, and a two-dimensional fragment contour algorithm is used to find multiple planned paths matching the target patterns from the electronic map. This provides multiple planned paths for the target users to choose from, improving the search and matching efficiency for target patterns. Path search and matching using target patterns enriches the path planning methods of electronic maps. Furthermore, sharing target patterns and target planned paths enhances interactivity and fun among users, thereby increasing the usage rate of the electronic map.

[0148] Please see Figure 9 , Figure 9 This is a schematic diagram of the structure of a path planning device provided in one or more embodiments of this application. It can be understood that this path planning device can be mounted on the computer equipment described in the above method embodiments. Figure 9 The path planning device 1 shown can be used to perform the above. Figure 3Some or all of the functions described in the method embodiments. For example... Figure 9 As shown, the path planning device 1 may include: a pattern drawing module 11, a path output module 12, and a path navigation module 13;

[0149] The pattern drawing module 11 is used to respond to the first drawing operation in the first electronic map application and display the target pattern corresponding to the first drawing operation in the display interface of the first electronic map application.

[0150] The path output module 12 is used to output M planned paths that match the target pattern; M is a positive integer.

[0151] The path navigation module 13 is used to respond to the selection operation for M planned paths and to perform path navigation based on the target planned path triggered by the selection operation in the first electronic map application.

[0152] In one or more embodiments, the path navigation module 13 may be specifically used for:

[0153] In response to the selection operation of M planned paths, the planned path triggered by the selection operation is determined as the target planned path, the target planned path is highlighted in the map area of ​​the first electronic map application, and the target planned path is broadcast aloud.

[0154] The specific functional implementation methods of the pattern drawing module 11, path output module 12, and path navigation module 13 can be found in the above description. Figure 3 Steps S101-S103 in the corresponding embodiments will not be described again here.

[0155] In one or more embodiments, the route planning device 1 may further include: a map zoom module 14;

[0156] The map zoom module 14 is used to respond to the map zoom operation in the first electronic map application and zoom the first map area displayed on the display interface of the first electronic map application to the second map area determined by the map zoom operation.

[0157] The pattern drawing module 11 is specifically used for:

[0158] In response to the first drawing operation targeting the second map region, draw and display the target pattern within the second map region.

[0159] In one or more embodiments, the pattern drawing module 11 may include: a pattern display unit 111 and a pattern connection unit 112;

[0160] The pattern display unit 111 is used to respond to a first drawing operation in the first electronic map application and display at least two initial patterns drawn by the first drawing operation within the map area displayed on the display interface; the at least two initial patterns are not connected to each other.

[0161] Pattern connection unit 112 is used to connect adjacent initial patterns among at least two initial patterns, determine the connected at least two initial patterns as target patterns, and display the target patterns in the map area.

[0162] In one or more embodiments, the path planning device 1 may further include: a prompt information display module 15;

[0163] The prompt information display module 15 is used to display connection prompt information for at least two initial patterns; the connection prompt information includes a connection confirmation control, which is used to prompt the target user to connect at least two initial patterns.

[0164] In one or more embodiments, at least two initial patterns include a first initial pattern and a second initial pattern;

[0165] The pattern connection unit 112 can be specifically used for:

[0166] Based on the endpoint position of the first initial pattern and the starting position of the second initial pattern, a recommended connection path is generated;

[0167] The first initial pattern, the recommended connection path, and the second initial pattern are determined as the target pattern.

[0168] The specific functional implementation methods of the map zoom module 14, pattern display unit 111, pattern connection unit 112, and prompt information display module 15 can be found above. Figure 3 Step S101 in the corresponding embodiment will not be described again here.

[0169] In one or more embodiments, the first electronic map application runs on the first terminal device, and the route planning device 1 may further include: a pattern sharing module 16;

[0170] The pattern sharing module 16 is used to share the target pattern to a social platform or at least one second terminal device, so that when the second terminal device accesses the social platform or receives the target pattern, the target pattern is displayed in the display interface of the second electronic map application on the second terminal device, the second drawing operation is received from the second terminal device, and a new target pattern is formed based on the target pattern and the second drawing operation.

[0171] The specific implementation of the pattern sharing module 16 can be found in the above description. Figure 3Step S103 in the corresponding embodiment will not be described again here.

[0172] In one or more embodiments, the path output module 12 may include: a search area determination unit 121 and a path matching unit 122;

[0173] The search area determination unit 121 is used to determine the path search area of ​​the target pattern in the electronic map area based on the coordinate information of the target pattern in the map area displayed on the display interface.

[0174] The path matching unit 122 is used to perform path matching processing on the target pattern in the path search area and output M planned paths that match the target pattern.

[0175] The specific functional implementation methods of the search area determination unit 121 and the path matching unit 122 can be found in the above description. Figure 3 Step S102 in the corresponding embodiment will not be described again here.

[0176] In one or more embodiments, the search area determination unit 121 includes: a road data acquisition subunit 1211 and a boundary addition subunit 1212;

[0177] The road data acquisition subunit 1211 is used to acquire the road data corresponding to the target pattern based on the coordinate information of the target pattern in the electronic map area;

[0178] Boundary addition subunit 1212 is used to add contour boundaries to the target pattern based on the road width contained in the road data, so as to obtain the path search area containing the target pattern.

[0179] The specific functional implementation methods of the road data acquisition subunit 1211 and the boundary addition subunit 1212 can be found in the above description. Figure 3 Step S102 in the corresponding embodiment will not be described again here.

[0180] In one or more embodiments, the path matching unit 122 includes: a candidate path generation subunit 1221, a feature point acquisition subunit 1222, a first feature segment acquisition subunit 1223, a second feature segment acquisition subunit 1224, and a planned path output subunit 1225.

[0181] The candidate path generation subunit 1221 is used to generate K candidate planning paths associated with the target pattern in the road grid contained in the path search area, based on the starting point position and ending point position corresponding to the target pattern; K is a positive integer greater than or equal to M.

[0182] The feature point acquisition subunit 1222 is used to acquire the first feature point set corresponding to the target pattern from the contour boundary point set corresponding to the target pattern, and to acquire the second feature point set corresponding to the K candidate planning paths from the shape data points corresponding to the K candidate planning paths respectively; the shape point data refers to the coordinate point data used to characterize the road shape in the path search area;

[0183] The first feature segment acquisition subunit 1223 is used to acquire, in the target pattern, the first feature point P in the first feature point set. i The first feature point P is formed by N adjacent contour boundary points. i The first feature segment is formed by N contour boundary points; i is a positive integer less than or equal to the number of first feature points contained in the set of first feature points, and N is a positive integer;

[0184] The second feature segment acquisition subunit 1224 is used for the second feature point P in the t-th second feature point set. j In the t-th candidate planning path, obtain the second feature point P. j The data of N adjacent shape points will be used to determine the second feature point P. j The second feature segment is composed of N shape point data; j is a positive integer less than or equal to the number of second feature points contained in the t-th second feature point set, and the t-th candidate planning path belongs to K candidate planning paths, where t is a positive integer less than or equal to K;

[0185] The path planning output subunit 1225 is used to obtain the path matching degree between the target pattern and the t-th candidate planning path based on the distance between the first feature segment and the second feature segment, and output M planning paths that match the target pattern based on the path matching degree between the target pattern and K candidate planning paths respectively.

[0186] Specifically, the feature point acquisition subunit 1222 can be used for:

[0187] Obtain the set of contour boundary points corresponding to the target pattern, and perform convolution integral processing on the contour boundary points contained in the set of contour boundary points to obtain the set of denoised boundary points.

[0188] Based on the distance between two adjacent denoised boundary points in the denoised boundary point set, interpolation is performed on the denoised boundary points in the denoised boundary point set to obtain the sampling boundary point set corresponding to the target pattern.

[0189] Based on the curvature corresponding to each sampling boundary point in the sampling boundary point set, the local extreme points in the sampling boundary point set are obtained;

[0190] When a local extreme point satisfies the feature selection condition, the local extreme point is determined as the first feature point of the target pattern, and the local extreme point is added to the first feature point set.

[0191] Specifically, the path planning output sub-unit 1225 can be used for:

[0192] Based on the path matching degree between the target pattern and the K candidate planning paths, the K candidate planning paths are sorted to obtain the sorted K candidate planning paths.

[0193] If among the sorted K candidate planning paths, there is a candidate planning path whose path matching degree is greater than the matching threshold, then the candidate planning path with a path matching degree greater than the matching threshold is determined as M planning paths.

[0194] Output M planned routes, along with the corresponding mode of transportation, travel distance, travel time, and route matching degree for each of the M planned routes.

[0195] In one or more embodiments, the path planning output subunit 1225 can also be used for:

[0196] If the path matching degree of the K candidate planning paths after sorting is less than or equal to the matching threshold, then find the first similar road with the same road level as the road in the path search area in the electronic map.

[0197] Based on the first similar road, generate one or more first recommended paths associated with the target pattern;

[0198] If, among one or more first recommended paths, there exists a first recommended path whose path matching degree with the target pattern is greater than a matching threshold, then the first recommended path whose path matching degree is greater than the matching threshold is determined as one of the M planned paths.

[0199] In one or more embodiments, the path planning output subunit 1225 can also be used for:

[0200] If the path matching value corresponding to one or more first recommended paths is less than or equal to the matching threshold, then a second similar road with a different road level than the road in the path search area is found in the electronic map.

[0201] Based on the second similar roads, generate one or more second recommended paths associated with the target pattern;

[0202] If, among one or more second recommended paths, there exists a path matching degree between the second recommended path and the target pattern that is greater than the matching threshold, then the second recommended path with a path matching degree greater than the matching threshold is determined as one of the M planned paths.

[0203] The specific implementation methods of the candidate path generation subunit 1221, feature point acquisition subunit 1222, first feature segment acquisition subunit 1223, second feature segment acquisition subunit 1224, and planned path output subunit 1225 can be found above. Figure 7 Steps S201-S205 in the corresponding embodiments will not be described again here.

[0204] In one or more embodiments, the route planning device may further include: a mode of transportation selection module 17;

[0205] The mode of transportation selection module 17 is used to respond to the input operation for the target driving image and to determine the mode of transportation determined by the input operation as the target mode of transportation corresponding to the target user.

[0206] The path planning output sub-unit 1225 can also be specifically used for:

[0207] Obtain the transportation modes corresponding to M planned paths. Among the M planned paths, the planned path with the target transportation mode is determined as the planned path to be displayed.

[0208] Display the planned route to be shown, along with the target mode of transportation, travel distance, travel time, and route matching degree corresponding to the planned route to be shown. Hide the planned routes other than the planned route to be shown among the M planned routes.

[0209] The specific functional implementation of the transportation mode selection module 17 and the planned route output subunit 1225 can be found in the above description. Figure 7 Step S205 in the corresponding embodiment will not be described again here.

[0210] In one or more embodiments, the route planning device may further include: a location information acquisition module 18 and a route deviation reminder module 19;

[0211] Location information acquisition module 18 is used to acquire the real-time location information of the target user;

[0212] The route deviation reminder module 19 is used to output route adjustment prompts when the real-time location information deviates from the target planned path; the route adjustment prompts are used to remind the target user to adjust the route.

[0213] The specific functional implementation methods of the location information acquisition module 18 and the route deviation reminder module 19 can be found in the above description. Figure 3 Step S103 in the corresponding embodiment will not be described again here.

[0214] In one or more embodiments of this application, target users can draw target patterns of arbitrary shapes within the display interface of an electronic map application, enhancing the operability and fun of using the electronic map. Path planning is performed using the target patterns drawn by the target users, and a two-dimensional fragment contour algorithm is used to find multiple planned paths matching the target patterns from the electronic map. This provides multiple planned paths for the target users to choose from, improving the search and matching efficiency for target patterns. Path search and matching using target patterns enriches the path planning methods of electronic maps. Furthermore, sharing target patterns and target planned paths enhances interactivity and fun among users, thereby increasing the usage rate of the electronic map.

[0215] Please see Figure 10 , Figure 10 This is a schematic diagram of the structure of a computer device provided in one or more embodiments of this application. Figure 10 As shown, the computer device 1000 can be a user terminal, for example, the one described above. Figure 1 The user terminal 10a in the corresponding embodiment can also be a server, for example, as described above. Figure 1 The server 10d in the corresponding embodiment will not be limited here. For ease of understanding, this application takes a computer device as a user terminal as an example. The computer device 1000 may include: a processor 1001, a network interface 1004, and a memory 1005. In addition, the computer device 1000 may also include: a target user interface 1003, and at least one communication bus 1002. The communication bus 1002 is used to realize the connection and communication between these components. The target user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may include a standard wired interface and a wireless interface (such as a Wi-Fi interface) in one or more embodiments. The memory 1004 may be a high-speed RAM memory or a non-volatile memory, such as at least one disk storage device. The memory 1005 may also be at least one storage device located remotely from the aforementioned processor 1001 in one or more embodiments. Figure 10 As shown, the memory 1005, which is a computer-readable storage medium, may include an operating system, a network communication module, a target user interface module, and a device control application.

[0216] The network interface 1004 in the computer device 1000 can also provide network communication functions, and the optional target user interface 1003 can also include a display screen and a keyboard. Figure 10In the computer device 1000 shown, the network interface 1004 provides network communication functionality; the target user interface 1003 is mainly used to provide an input interface for the target user; and the processor 1001 can be used to call the device control application stored in the memory 1005 to achieve:

[0217] In response to the first drawing operation in the first electronic map application, the target pattern corresponding to the first drawing operation is displayed in the display interface of the first electronic map application;

[0218] Output M planned paths that match the target pattern; M is a positive integer;

[0219] In response to a selection operation on M planned paths, path navigation is performed in the first electronic map application based on the target planned path triggered by the selection operation.

[0220] It should be understood that the computer device 1000 described in one or more embodiments of this application can perform the foregoing... Figure 3 , Figure 7 as well as Figure 8 The description of the path planning method in any of the corresponding embodiments can also be executed as described above. Figure 9 The description of the path planning device 1 in the corresponding embodiments will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated.

[0221] Furthermore, it should be noted that one or more embodiments of this application also provide a computer-readable storage medium storing a computer program executed by the aforementioned path planning device 1. The computer program includes program instructions, which, when executed by a processor, enable the execution of the aforementioned path planning device 1. Figure 3 , Figure 7 as well as Figure 8 The description of the path planning method in any corresponding embodiment will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated. For technical details not disclosed in the computer-readable storage medium embodiments related to this application, please refer to the description of the method embodiments of this application. As an example, program instructions can be deployed and executed on a single computing device, or on multiple computing devices located in one location, or on multiple computing devices distributed across multiple locations and interconnected via a communication network. These multiple computing devices distributed across multiple locations and interconnected via a communication network can constitute a blockchain system.

[0222] Furthermore, it should be noted that this application also provides a computer program product or computer program, which may include computer instructions, which may be stored in a computer-readable storage medium. The processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor may execute the computer instructions, causing the computer device to perform the aforementioned actions. Figure 3 , Figure 7 as well as Figure 8 The description of the path planning method in any corresponding embodiment is already provided, and therefore will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated. For technical details not disclosed in the computer program products or computer program embodiments related to this application, please refer to the description of the method embodiments of this application.

[0223] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0224] The steps in one or more embodiments of this application can be rearranged, combined, or deleted according to actual needs.

[0225] The modules in one or more embodiments of the device in this application can be merged, divided, and deleted according to actual needs.

[0226] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. The storage medium can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc.

[0227] The above-disclosed embodiments are merely preferred embodiments of this application and should not be construed as limiting the scope of this application. Therefore, any equivalent variations made in accordance with the claims of this application shall still fall within the scope of this application.

Claims

1. A path planning method, characterized in that, include: In response to a first drawing operation in the first electronic map application, the target pattern corresponding to the first drawing operation is displayed in the display interface of the first electronic map application; the target pattern refers to a pattern of any shape drawn within the geographical area displayed in the first electronic map application. In the electronic map included in the first electronic map application, according to the road level corresponding to the outline of the target pattern, the outline boundary of the target pattern is increased, and the area formed by the outline boundary is determined as the path search area containing the target pattern. Within the path search area, different matching strategies are employed to perform path matching processing on the target pattern, outputting M planned paths that match the target pattern. These different matching strategies have different priorities, arranged in descending order of priority. Each matching strategy includes: finding shape point data that conforms to the target pattern within the path search area; matching roads with different road levels within the path search area; the shape point data refers to coordinate point data used to characterize the shape of roads within the path search area; identifying road trajectories with a path matching degree greater than a matching threshold among roads of the same road level; and identifying road trajectories with a path matching degree greater than a matching threshold among roads of different road levels. M is a positive integer. In response to the selection operation of the M planned paths, path navigation is performed in the first electronic map application based on the target planned path triggered by the selection operation.

2. The method according to claim 1, characterized in that, Also includes; In response to a map zooming operation in the first electronic map application, the first map area displayed on the display interface of the first electronic map application is zoomed to a second map area determined by the map zooming operation. as well as The response to the first drawing operation in the first electronic map application, displaying the target pattern corresponding to the first drawing operation in the display interface of the first electronic map application, includes: In response to a first drawing operation for the second map region, the target pattern is drawn and displayed within the second map region.

3. The method according to claim 1, characterized in that, The response to the first drawing operation in the first electronic map application, displaying the target pattern corresponding to the first drawing operation in the display interface of the first electronic map application, includes: In response to the first drawing operation in the first electronic map application, at least two initial patterns drawn by the first drawing operation are displayed within the map area displayed on the display interface; the at least two initial patterns are not connected to each other. Connect adjacent initial patterns among the at least two initial patterns, determine the connected at least two initial patterns as the target pattern, and display the target pattern in the map area.

4. The method according to claim 3, characterized in that, Also includes: Display connection prompts for the at least two initial patterns; The connection prompt information includes a connection confirmation control, which is used to prompt the target user to connect the at least two initial patterns.

5. The method according to claim 3, characterized in that, The at least two initial patterns include a first initial pattern and a second initial pattern; The step of connecting adjacent initial patterns among the at least two initial patterns, and determining the connected at least two initial patterns as the target pattern, includes: Based on the endpoint position of the first initial pattern and the starting position of the second initial pattern, a recommended connection path is generated; The first initial pattern, the recommended connection path, and the second initial pattern are determined as the target pattern.

6. The method according to claim 1, characterized in that, The first electronic map application runs on a first terminal device, and the method further includes: The target pattern is shared to a social platform or at least one second terminal device, so that when the second terminal device accesses the social platform or receives the target pattern, the target pattern is displayed in the display interface of the second electronic map application of the second terminal device, and a second drawing operation is received from the second terminal device. Based on the target pattern and the second drawing operation, a new target pattern is formed.

7. The method according to claim 1, characterized in that, In the path search area, different matching strategies are used to perform path matching processing on the target pattern, and M planned paths that match the target pattern are output, including: Based on the starting and ending points of the target pattern, K candidate planning paths associated with the target pattern are generated in the road grid contained in the path search area; K is a positive integer greater than or equal to M. From the set of contour boundary points corresponding to the target pattern, obtain the first set of feature points corresponding to the target pattern; from the shape data points corresponding to the K candidate planning paths, obtain the second set of feature points corresponding to the K candidate planning paths respectively. In the target pattern, obtain the first feature point P from the first feature point set. i The first feature point P is formed by connecting N adjacent contour boundary points. i The N contour boundary points together form the first feature segment; i is a positive integer less than or equal to the number of first feature points contained in the first feature point set, and N is a positive integer; The second feature point P in the t-th set of second feature points j In the t-th candidate planning path, obtain the second feature point P. j The data of N adjacent shape points are used to make the second feature point P. j The N shape point data together constitute the second feature segment; j is a positive integer less than or equal to the number of second feature points contained in the t-th second feature point set, the t-th candidate planning path belongs to the K candidate planning paths, and t is a positive integer less than or equal to K; Based on the distance between the first feature segment and the second feature segment, the path matching degree between the target pattern and the t-th candidate planning path is obtained. Based on the path matching degree between the target pattern and the K candidate planning paths respectively, M planning paths that match the target pattern are output.

8. The method according to claim 7, characterized in that, The step of obtaining the first feature point set corresponding to the target pattern from the set of contour boundary points corresponding to the target pattern includes: Obtain the set of contour boundary points corresponding to the target pattern, and perform convolution integration on the contour boundary points contained in the set of contour boundary points to obtain a set of denoised boundary points. Based on the distance between two adjacent denoised boundary points in the denoised boundary point set, interpolation processing is performed on the denoised boundary points in the denoised boundary point set to obtain the sampling boundary point set corresponding to the target pattern. Based on the curvature corresponding to each sampling boundary point in the sampling boundary point set, the local extreme points in the sampling boundary point set are obtained; When the local extreme point satisfies the feature selection condition, the local extreme point is determined as the first feature point of the target pattern, and the local extreme point is added to the first feature point set.

9. The method according to claim 7, characterized in that, The step of outputting M planning paths that match the target pattern based on the path matching degree between the target pattern and the K candidate planning paths includes: Based on the path matching degree between the target pattern and the K candidate planning paths, the K candidate planning paths are sorted to obtain the sorted K candidate planning paths; If among the sorted K candidate planning paths, there is a candidate planning path whose path matching degree is greater than the matching threshold, then the candidate planning path whose path matching degree is greater than the matching threshold is determined as the M planning paths. Output the M planned paths, along with the corresponding mode of transportation, travel distance, travel time, and path matching degree for each of the M planned paths.

10. The method according to claim 9, characterized in that, Also includes: If the path matching degree corresponding to the sorted K candidate planning paths is less than or equal to the matching threshold, then the first similar road with the same road level as the road in the path search area is searched in the electronic map. Based on the first similar road, generate one or more first recommended paths associated with the target pattern; If, among the one or more first recommended paths, there exists a first recommended path with a path matching degree greater than the matching threshold with the target pattern, the first recommended path with a path matching degree greater than the matching threshold is determined as one of the M planned paths.

11. The method according to claim 10, characterized in that, Also includes: If the path matching value corresponding to one or more first recommended paths is less than or equal to the matching threshold, then a second similar road with a different road level than the road in the path search area is searched in the electronic map. Based on the second similar road, generate one or more second recommended paths associated with the target pattern; If, among the one or more second paths to be recommended, there exists a path matching degree between the second path to be recommended and the target pattern that is greater than the matching threshold, then the second path to be recommended with a path matching degree greater than the matching threshold is determined as one of the M planned paths.

12. The method according to claim 9, characterized in that, Also includes: In response to an input operation associated with the target pattern, the mode of transportation determined by the input operation is identified as the target mode of transportation for the target user. The output of the M planned routes, and the corresponding mode of transportation, travel distance, travel time, and path matching degree for each of the M planned routes, includes: Obtain the transportation modes corresponding to the M planned paths respectively, and determine the planned path with the target transportation mode as the planned path to be displayed among the M planned paths; The system displays the planned route to be shown, along with the target mode of transportation, travel distance, travel time, and route matching degree corresponding to the planned route to be shown. The planned routes other than the planned route to be shown are hidden from the M planned routes.

13. The method according to claim 1, characterized in that, The response addresses the selection operation of the M planned paths, and performs path navigation in the first electronic map application based on the target planned path triggered by the selection operation, including: In response to the selection operation of the M planned paths, the planned path triggered by the selection operation is determined as the target planned path, the target planned path is highlighted in the map area of ​​the first electronic map application, and the target planned path is broadcast aloud.

14. The method according to claim 1, characterized in that, Also includes: Obtain the real-time location information of the target user; When the real-time location information deviates from the target planned path, a route adjustment prompt message is output; The route adjustment prompt message is used to remind the target user to adjust their route.

15. A path planning device, characterized in that, include: The pattern drawing module is used to respond to a first drawing operation in the first electronic map application and display the target pattern corresponding to the first drawing operation in the display interface of the first electronic map application; the target pattern refers to a pattern of any shape drawn within the geographical area displayed in the first electronic map application. The path output module is used to add the outline boundary of the target pattern in the electronic map included in the first electronic map application according to the road level corresponding to the outline of the target pattern, and determine the area formed by the outline boundary as the path search area containing the target pattern. Within the path search area, different matching strategies are employed to perform path matching processing on the target pattern, outputting M planned paths that match the target pattern. These different matching strategies have different priorities, arranged in descending order of priority. Each matching strategy includes: finding shape point data that conforms to the target pattern within the path search area; matching roads with different road levels within the path search area; the shape point data refers to coordinate point data used to characterize the shape of roads within the path search area; identifying road trajectories with a path matching degree greater than a matching threshold among roads of the same road level; and identifying road trajectories with a path matching degree greater than a matching threshold among roads of different road levels. M is a positive integer. The path navigation module is used to respond to the selection operation of the M planned paths and perform path navigation based on the target planned path triggered by the selection operation in the first electronic map application.

16. A computer device, characterized in that, Including memory and processor; The memory is connected to the processor, the memory is used to store computer programs, and the processor is used to invoke the computer programs so that the computer device performs the method according to any one of claims 1-14.

17. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program adapted to be loaded and executed by a processor to cause a computer device having the processor to perform the method of any one of claims 1-14.

18. A computer program product, characterized in that, The computer program product includes computer instructions that, when executed by a processor, implement the method described in any one of claims 1-14.

Images