Navigation path planning method and device
Through clustering and scheduling algorithms, the problem of low navigation path planning efficiency in the existing technology is solved, automatic planning and efficient delivery of a large number of orders is realized, and user experience and delivery efficiency are improved.
Patent Information
- Application Number
- CN202411195211.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-28
- Publication Date
- 2024-12-06
AI Technical Summary
The existing navigation path planning methods are inefficient and have poor experience in the delivery of a large number of orders, which cannot meet the needs of B2B tasks, and rely on third-party navigation software, which limits the planning capabilities of delivery routes.
By obtaining the address information of the order to be delivered, clustering and generating a distribution point set, and using scheduling algorithms and timeout prediction algorithms to plan navigation paths, automatically planning navigation paths, without relying on third-party navigation software, improving efficiency and user experience.
Automatic navigation path planning for a large number of orders is realized, distribution efficiency and user experience are improved, delivery costs and time are reduced, and the needs of B2B tasks are met.
Smart Images

Figure CN119090105A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of computer technology, and in particular to a navigation path planning method and device. Background Art
[0002] When delivering a large number of user orders to multiple points, the existing navigation route planning method is to manually input the target addresses of all orders into the navigation software and save them, view the overall distribution of the destination points, and plan the delivery sequence and route.
[0003] In the process of implementing the present invention, the inventors found that there are at least the following problems in the related art:
[0004] Manually inputting addresses and frequently switching software are inefficient and provide a poor user experience, and cannot meet the delivery needs of a large number of orders. Summary of the invention
[0005] In view of this, an embodiment of the present invention provides a navigation path planning method and device, which can automatically plan navigation paths for a large number of orders without relying on third-party navigation software, and improves planning efficiency and user experience.
[0006] To achieve the above object, according to one aspect of an embodiment of the present invention, a method for planning a navigation path is provided, comprising:
[0007] Get the address information of the order to be delivered;
[0008] Clustering is performed according to the address information of the orders to be delivered to generate a delivery point set;
[0009] A navigation path for the order to be delivered is planned based on the delivery point set.
[0010] Furthermore, clustering is performed according to the address information of the orders to be delivered to generate a delivery point set, including:
[0011] The address information of the order to be delivered is deduplicated, and a delivery point set is generated according to the deduplicated address information of the order to be delivered.
[0012] Further, planning a navigation path of the order to be delivered based on the delivery point set includes:
[0013] Using a scheduling algorithm to sort the delivery point set to obtain a delivery point sequence;
[0014] Performing a feasibility analysis on the delivery point sequence, and in response to a failure result of the feasibility analysis, re-sorting the delivery point sequence to obtain a final delivery point sequence;
[0015] Based on the final delivery point sequence and the pre-acquired current location of the user, a navigation path for the order to be delivered is generated.
[0016] Furthermore, planning the navigation path of the order to be delivered based on the delivery point set also includes:
[0017] Arranging the delivery points in the delivery point set to obtain a delivery path set;
[0018] Based on the delivery route set and the pre-acquired time information of the to-be-delivered order, a preset timeout prediction algorithm is used to perform timeout prediction to obtain a prediction result;
[0019] The navigation path of the order to be delivered is determined according to the prediction result; wherein the navigation path includes a path with the shortest comprehensive distance and a path with the shortest comprehensive time.
[0020] Further, determining the navigation path of the order to be delivered according to the prediction result includes:
[0021] The delivery paths predicted as timed out in the delivery path set are deleted, and the navigation path of the order to be delivered is determined based on the deleted delivery path set.
[0022] Furthermore, the method further comprises:
[0023] The navigation path is displayed to the user through a navigation interface, so that the user can deliver the order to be delivered according to the navigation path.
[0024] According to a second aspect of an embodiment of the present invention, there is provided a navigation path planning device, comprising:
[0025] The acquisition module is used to obtain the address information of the order to be delivered;
[0026] A clustering module, used for clustering the address information of the orders to be delivered to generate a set of delivery points;
[0027] A planning module is used to plan the navigation path of the order to be delivered based on the delivery point set.
[0028] According to a third aspect of an embodiment of the present invention, there is provided an electronic device, including:
[0029] one or more processors;
[0030] a memory for storing one or more programs,
[0031] When the one or more programs are executed by the one or more processors, the one or more processors are enabled to implement the method described in any one of the above embodiments.
[0032] According to a fourth aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored, and when the program is executed by a processor, the method described in any one of the above embodiments is implemented.
[0033] According to a fifth aspect of an embodiment of the present invention, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the method described in any one of the above embodiments is implemented.
[0034] An embodiment of the above invention has the following advantages or beneficial effects: by acquiring the address information of the orders to be delivered; clustering the address information of the orders to be delivered to generate a set of delivery points; planning the navigation paths of the orders to be delivered based on the set of delivery points; being able to automatically plan navigation paths for a large number of orders without relying on third-party navigation software, and improving planning efficiency and user experience.
[0035] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with the specific implementation manner. BRIEF DESCRIPTION OF THE DRAWINGS
[0036] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.
[0037] Figure 1 is a schematic diagram of the main process of a navigation path planning method according to an embodiment of the present invention;
[0038] Figure 2 is a schematic diagram of the main process of a navigation path planning method according to a reference embodiment of the present invention;
[0039] Figure 3 is a schematic diagram of the main process of a navigation path planning method according to another reference embodiment of the present invention;
[0040] Figure 4 is a schematic diagram of main modules of a navigation path planning device according to an embodiment of the present invention;
[0041] Figure 5 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;
[0042] Figure 6 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION
[0043] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.
[0044] It should be noted that the acquisition, storage and application of personal information involved in the embodiments of the present invention are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.
[0045] When processing transportation orders for B2B tasks (Business to Business), there are a large number of order details under one task. When personnel carry out point-to-point delivery of these order details, the existing delivery route planning method is to enter the destinations of all orders into the navigation software and collect them, look at the overall distribution of the destination points, and plan the delivery sequence and route. The above existing solutions make it difficult for personnel to plan and deliver point-to-point. They have to jump back and forth between different software, and use navigation software to repeatedly enter the address, which has a poor user experience and low efficiency. In addition, the maximum number of waypoints supported by third-party navigation software is relatively small, which cannot meet the needs of a large number of point-to-point B2B tasks. It is difficult to locate the location of items, which cannot meet the user's requirement for full visibility of the location of items, and the cost of users purchasing positioning equipment by themselves is high.
[0046] In view of this, according to one aspect of an embodiment of the present invention, a method for planning a navigation path is provided.
[0047] Figure 1 FIG. 1 is a schematic diagram of the main process of the navigation path planning method according to an embodiment of the present invention. Figure 1 As shown, the navigation path planning method according to an embodiment of the present invention includes:
[0048] Step S101, obtaining the address information of the order to be delivered.
[0049] The to-be-delivered order refers to an order that has not yet completed the delivery process, and the order information of the delivery order includes the order number, customer information, address information (delivery address), delivery time, order content, etc. The address information refers to the specific delivery destination corresponding to the order, that is, the specific address or location to which the order needs to be delivered. Specifically, the address information includes the detailed address of the user or consignee, such as street, house number, city, state, province, etc.
[0050] To obtain the address information of the above-mentioned orders to be delivered, the information can be collected through the query function or API interface (Application Programming Interface) provided by the order management system, database or related business system. Based on the corresponding search conditions entered (such as pending status, time range, etc.), the query operation is performed and the returned order information list is obtained, which can then be viewed through the system interface or exported to a file for further processing and analysis, and the address information of the orders to be delivered is obtained based on the analysis results.
[0051] Step S102: clustering is performed according to the address information of the orders to be delivered to generate a set of delivery points.
[0052] First, the address information of the delivery orders can be cleaned and preprocessed, including removing duplicate data, unifying the format (such as converting uppercase and lowercase letters, removing spaces, etc.), and processing missing values; feature engineering can be performed on the address information, such as extracting keywords or features of the address (such as street name, city name, postal code, etc.). According to the data characteristics and business needs, determine the appropriate clustering algorithm, which includes K-means clustering, hierarchical clustering, DBSCAN (Density-Based Spatial Clustering of Applications with Noise, density-based clustering algorithm), etc. Apply the above-determined clustering algorithm to cluster the address information after feature engineering. Specifically, clustering operations can be performed based on the determined number of clusters to divide address information into different categories or clusters. In addition, for algorithms such as hierarchical clustering that do not require a specified number of clusters, analysis and adjustments can be made based on the clustering results. Internal evaluation indicators (such as silhouette coefficient, DB index, etc.) or external evaluation indicators (such as expert evaluation, business demand comparison, etc.) can be used to evaluate the clustering results to check whether the clustering effect meets expectations. Based on the clustering results, a distribution point set is generated, and each category or cluster represents a group of similar or identical address information, namely, a distribution point. Finally, the clustering results can also be visualized, such as drawing a distribution map or heat map of the clustered address clusters, so that users can understand the clustering effect more intuitively.
[0053] Step S103: planning a navigation path for the order to be delivered based on the delivery point set.
[0054] Path planning is performed based on the set of delivery points. The goal of path planning is to determine an optimal route to make the delivery process as efficient as possible. A navigation path is a driving or walking route planned in a navigation system or map application to guide users on how to get from a starting point to a destination. A navigation path includes determining the starting point (such as a delivery center or the user's current location), the delivery points along the way, and the end point (such as the last delivery point).
[0055] Path planning can be based on the distance between delivery points, traffic conditions, delivery priority, time window restrictions (i.e., delivery must be made within a specific time period), etc. The system calculates the optimal path between each delivery point by calling the map service or the internal path planning algorithm, such as using the Dijkstra algorithm, A* algorithm, or other customized path optimization algorithms. In addition, the route can be dynamically adjusted during the planning process to adapt to real-time traffic conditions or other emergencies. For example, if the system detects congestion or construction on a certain section of the road, the path can be recalculated to avoid delays. After obtaining the navigation path, it is displayed on the user's navigation device or application so that the user can complete the delivery task according to the navigation route.
[0056] The embodiment of the present invention obtains address information of orders to be delivered; clusters the address information of the orders to be delivered to generate a delivery point set; and plans navigation paths of the orders to be delivered based on the delivery point set. It can automatically plan navigation paths for a large number of orders without relying on third-party navigation software, and improves planning efficiency and user experience.
[0057] Optionally, clustering is performed according to the address information of the orders to be delivered to generate a delivery point set, including: deduplicating the address information of the orders to be delivered, and generating a delivery point set according to the deduplicated address information of the orders to be delivered.
[0058] Specifically, the address information of all orders to be delivered is deduplicated. Deduplication refers to deleting duplicate address information to avoid unnecessary repeated path planning calculations due to the same address for multiple orders to be delivered. The system identifies and removes duplicate address entries by comparing various fields of address information, such as street name, floor information, city, and postal code. In addition, for some slight differences in address information (such as spelling errors or different formats), the system can also apply certain rules or algorithms for fuzzy matching to improve the comprehensiveness of deduplication. After the deduplication process is completed, a distribution point set is generated based on the deduplicated address information. The distribution point set can be generated by a clustering algorithm. The clustering algorithm groups addresses with similar geographical locations into the same distribution point. First, each address information is converted into corresponding geographic coordinates (i.e., longitude and latitude), and then these geographic coordinates are used to measure the distance between each address. The clustering algorithm can use K-means clustering, hierarchical clustering, DBSCAN (Density-Based Spatial Clustering of Applications with Noise, density-based clustering algorithm), etc. The specific choice depends on the characteristics of the delivery task. For example, the K-means clustering algorithm can cluster according to the preset delivery quantity, while the DBSCAN algorithm can automatically determine the number of delivery points and adapt to address distributions of different densities. During the clustering process, the system can repeatedly adjust the position of the cluster center to ultimately determine the composition of each delivery point, ensuring that the address information represented by the same delivery point is close to each other, thereby optimizing subsequent delivery routes. After clustering is completed, the system saves these delivery points and generates a set of delivery points. This embodiment can not only reduce the length of the delivery path, but also improve delivery efficiency and reduce delivery costs.
[0059] In addition, the geographical features of the address information can be used for partitioning, and the distribution area can be divided into multiple geographical partitions, such as by city, district, county, or postal code area, etc. The address information belonging to the same area is classified as a distribution point, and a distribution point set is generated based on the distribution point. The partitioning processing of the present invention can reduce the computational complexity of the clustering algorithm, and also help to improve the efficiency of distribution within the region.
[0060] Figure 2 FIG. 1 is a schematic diagram of the main process of a navigation path planning method according to a reference embodiment of the present invention. Figure 2 As shown, planning the navigation path of the order to be delivered based on the delivery point set includes:
[0061] Step S201, using a scheduling algorithm to sort the delivery point set to obtain a delivery point sequence.
[0062] Step S202, performing a feasibility analysis on the delivery point sequence, and in response to a failure in the feasibility analysis, re-sorting the delivery point sequence to obtain a final delivery point sequence.
[0063] Step S203, generating a navigation path for the order to be delivered based on the final delivery point sequence and the pre-acquired current location of the user.
[0064] Among them, the order of delivery points refers to the order in which personnel pass through the delivery points when delivering. Specifically, the delivery point set can be analyzed and calculated using a scheduling algorithm, which includes a greedy algorithm, a dynamic programming algorithm, or a genetic algorithm, etc. The scheduling algorithm can comprehensively consider multiple factors, such as the distance between delivery points, the priority of each delivery point, the delivery time window, and traffic conditions, to generate a preliminary delivery point order. This sorting process aims to shorten the total distance of the delivery path as much as possible and meet the time requirements of each order.
[0065] For example, the delivery points are sorted according to the delivery priority, and the high-priority delivery points are placed in front; for another example, the delivery points are sorted according to the distance optimization, and the delivery points are arranged in the order of the closest distance or the optimal path; for another example, the delivery points are sorted according to the time window, and the delivery order is determined according to the delivery time window requirements. According to the sorted delivery point sequence, a delivery point sequence list is generated. The delivery point sequence list is used to guide personnel to complete the delivery task in sequence. The generated delivery point sequence can also be combined with a map service or navigation system to plan the delivery route, and more accurately determine the driving route of personnel to optimize the delivery efficiency. The delivery point sequence is displayed on the user's navigation device or application.
[0066] After generating the preliminary delivery point sequence, the system can also perform a feasibility analysis on it. The feasibility analysis mainly evaluates the executability of the generated delivery point sequence in actual operation. The analysis includes checking whether each delivery point in the route can be delivered within the specified time window, evaluating the impact of current traffic conditions on the delivery path, and confirming whether each delivery point sequence meets business logic or special requirements. The system predicts possible delays or conflicts by simulating driving routes and times. If the analysis results show that some delivery points cannot be delivered smoothly as planned, or there are potential traffic obstacles, the system will mark the delivery point sequence as infeasible. If the delivery point sequence is judged to be infeasible, the system will re-sort it, and the scheduling algorithm will be adjusted according to the problems identified in the previous feasibility analysis. For example, the system may choose to bypass traffic congestion, re-prioritize time-critical orders, or change the order of visiting delivery points to ensure that all business needs are met. Through this iterative optimization, a verified final delivery point sequence that meets all requirements is generated.
[0067] The user's current location information is obtained through GPS (Global Positioning System) positioning or user input. Navigation route planning is performed based on the final delivery point sequence and the user's current location. The user's current location can be used as the starting point, and the route points can be set in sequence according to the final delivery point sequence, with the last delivery point as the end point for navigation route planning; a navigation route is generated through a map navigation service or navigation system, including specific driving routes, navigation instructions and other information; the generated navigation route is displayed on the navigation device or application of the delivery person or driver.
[0068] The embodiment of the present invention determines the final order of delivery points based on feasibility analysis, so that users can complete tasks in the best route order. The generated navigation path can improve delivery efficiency, reduce user driving time and distance, optimize delivery service quality, and improve user experience.
[0069] According to a preferred embodiment of the present invention, intelligent scheduling is performed based on the distribution points. First, the unclosed-loop vehicle dispatch order details under the distribution task (a vehicle dispatch order detail status of which is delivery, rejection, or partial receipt is considered a closed loop) are clustered according to the detailed address of the destination to generate a distribution point set. Each vehicle dispatch order detail has an initial distribution order, and most of the sources of the initial distribution order (such as 85%) are output by the intelligent scheduling algorithm, and a small part (such as 15%) are manual scheduling selections; since the initial distribution order is determined for the distribution order details, and multiple distribution order details may correspond to one distribution point, it is necessary to convert the initial distribution order to obtain the distribution point order. Specifically, the smallest one of the initial distribution orders under each distribution point is used as the sorting basis. For example, if the initial distribution orders corresponding to distribution point A are 1, 3, and 4, respectively, the sorting basis of distribution point A is 1, and the initial distribution order is arranged from small to large, which is the distribution point order. The driver's current location is taken as the starting point, and the delivery points are taken as the waypoints in the order of delivery points. The last delivery point is taken as the end point. The GIS (Geographic Information System) path planning service is input. After GIS returns the trajectory, the front end will display it.
[0070] Optionally, Figure 3 FIG. 1 is a schematic diagram of the main process of a navigation path planning method according to another reference embodiment of the present invention. Figure 3 As shown, planning the navigation path of the order to be delivered based on the delivery point set also includes:
[0071] Step S301, arranging the delivery points in the delivery point set to obtain a delivery path set.
[0072] Step S302, based on the delivery path set and the pre-acquired time information of the to-be-delivered order, a preset timeout prediction algorithm is used to perform timeout prediction to obtain a prediction result.
[0073] Step S303, determining a navigation path of the order to be delivered according to the prediction result; wherein the navigation path includes a path with the shortest comprehensive distance and a path with the shortest comprehensive time.
[0074] Arrange the delivery points in the delivery point set to generate different delivery path sets. For example, for the starting point A, the passing point B, and the end point C, the path set can be generated as [ABC, ACB, BAC, BCA, CAB, CBA]. The time information of the order to be delivered includes the distance of each path, the estimated time, and the time requirement of the order. According to the delivery path set and time information, a preset algorithm is used to perform timeout prediction to predict whether each path will time out, obtain the timeout prediction result of each delivery path, and mark which paths may time out.
[0075] The navigation path of the order to be delivered is determined based on the prediction results, including the path with the shortest comprehensive distance and the path with the shortest comprehensive time. The path with the shortest comprehensive distance is to select the path with the shortest distance from the delivery path set as the navigation path. The path with the shortest comprehensive time is to select the path with the shortest time from the paths without timeout as the navigation path. According to business needs and priorities, the distance and time are comprehensively considered to select the most suitable navigation path as the final delivery path.
[0076] For example, the tasks issued by the B2B business can be summarized as a one-load-multiple-unload type, that is, path planning from the starting point to N destinations, according to the permutations and combinations * *…… =Num planning method.
[0077] Trajectory acquisition (taking 3 destination points as an example), assuming that the current position is a and the current time is , the destination points are b, c, d, and the estimated arrival times of the destination points are , .
[0078]
[0079] As shown in Table 1, when there is a planning method that makes the arrival time at the destination less than the estimated arrival time, the planning method with the shortest total distance and the shortest total time is calculated respectively. , When all planning methods cannot guarantee that all destinations arrive on time, calculate the planning method that reaches the most destinations on time, and calculate the planning method with the shortest total distance and the shortest total time from the obtained results. , ; When the destination cannot be reached on time in all planning methods, calculate the planning method with the shortest total distance and the least total time , .
[0080] For the planning method that has the highest probability of arriving at the destination on time, the path can be further optimized and a more appropriate path plan can be determined to ensure that the destination is reached on time to the greatest extent possible. Delivery scheduling adjustments can be made based on the calculated planning method. After the adjustments are made, real-time monitoring and execution are required to ensure that the delivery process proceeds smoothly and that the destination is reached on time.
[0081] Optionally, determining the navigation path of the order to be delivered according to the prediction result includes: deleting the delivery paths with the prediction result of timeout in the delivery path set, and determining the navigation path of the order to be delivered based on the deleted delivery path set.
[0082] According to the preset timeout prediction algorithm, each path in the delivery path set is predicted, and the delivery path with the prediction result is marked as timed out; all delivery paths marked as timed out are deleted from the delivery path set to obtain a deleted delivery path set; based on the deleted delivery path set, a navigation path is determined, for example, the path with the shortest total distance is selected from the deleted delivery path set as the navigation path, and the path with the shortest total time is selected from the deleted delivery path set as the navigation path, and the most suitable navigation path is determined by comprehensively considering distance, time and other factors.
[0083] The embodiments of the present invention can prevent timeouts from occurring during the delivery process, thereby improving delivery efficiency and user satisfaction.
[0084] Optionally, the method further includes: displaying the navigation path to the user through a navigation interface, so that the user delivers the order to be delivered according to the navigation path.
[0085] A user navigation interface can be designed to display the navigation path that the delivery person or driver needs to follow, where the navigation interface includes map display, route diagram, navigation instructions and other information; the determined navigation path is displayed to the user on the navigation interface, which can display the starting point, waypoints, end point, and the overall delivery path trajectory; clear navigation instructions can also be provided, including turn prompts, intersection signs, driving distance, estimated arrival time and other information; interactive functions can also be added, such as real-time positioning, re-routing, reporting problems, etc., so that the delivery person or driver can make real-time adjustments and feedback during the delivery process.
[0086] The user-friendly visual interface can also intuitively display the whole process information of the goods to users in the form of charts, maps, etc., so that users can view the goods status, transportation route, estimated arrival time, etc. in real time. In addition, a real-time alarm mechanism is set up. When the goods are abnormal or overdue, the system can promptly issue an alarm and notify relevant personnel to handle it.
[0087] The embodiment of the present invention can improve the user's execution efficiency and accuracy by displaying the navigation path to the user, and also improve the user's experience of the delivery process.
[0088] According to a second aspect of an embodiment of the present invention, a navigation path planning device 400 is provided, comprising:
[0089] The acquisition module 401 is used to acquire the address information of the order to be delivered;
[0090] A clustering module 402, configured to cluster the address information of the orders to be delivered to generate a set of delivery points;
[0091] The planning module 403 is used to plan the navigation path of the order to be delivered based on the delivery point set.
[0092] Optionally, the clustering module 402 is further used for:
[0093] The address information of the order to be delivered is deduplicated, and a delivery point set is generated according to the deduplicated address information of the order to be delivered.
[0094] Optionally, the planning module 403 is further used for:
[0095] Using a scheduling algorithm to sort the delivery point set to obtain a delivery point sequence;
[0096] Performing a feasibility analysis on the delivery point sequence, and in response to a failure result of the feasibility analysis, re-sorting the delivery point sequence to obtain a final delivery point sequence;
[0097] Based on the final delivery point sequence and the pre-acquired current location of the user, a navigation path for the order to be delivered is generated.
[0098] Optionally, the planning module 403 is further used for:
[0099] Arranging the delivery points in the delivery point set to obtain a delivery path set;
[0100] Based on the delivery route set and the pre-acquired time information of the to-be-delivered order, a preset timeout prediction algorithm is used to perform timeout prediction to obtain a prediction result;
[0101] The navigation path of the order to be delivered is determined according to the prediction result; wherein the navigation path includes a path with the shortest comprehensive distance and a path with the shortest comprehensive time.
[0102] Optionally, the planning module 403 is further used for:
[0103] The delivery paths predicted as timed out in the delivery path set are deleted, and the navigation path of the order to be delivered is determined based on the deleted delivery path set.
[0104] Optionally, the planning device 400 further includes an interface display module, and the interface display module is used to:
[0105] The navigation path is displayed to the user through a navigation interface, so that the user can deliver the order to be delivered according to the navigation path.
[0106] It should be noted that the specific implementation content of the navigation path planning device of the present invention has been described in detail in the above-mentioned navigation path planning method, so the repeated content will not be described again here.
[0107] According to a third aspect of an embodiment of the present invention, there is provided an electronic device, comprising: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method provided by the first aspect of the embodiment of the present invention.
[0108] According to a fourth aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored, and when the program is executed by a processor, the method provided by the first aspect of the embodiment of the present invention is implemented.
[0109] According to a fifth aspect of an embodiment of the present invention, there is provided a computer program product, including a computer program, wherein when the computer program is executed by a processor, the method provided in the first aspect of the embodiment of the present invention is implemented.
[0110] Figure 5 An exemplary system architecture 500 is shown to which a method for planning a navigation path or an apparatus for planning a navigation path according to an embodiment of the present invention may be applied.
[0111] like Figure 5 As shown, system architecture 500 may include terminal devices 501, 502, 503, a network 504 and a server 505. Network 504 is used to provide a medium for communication links between terminal devices 501, 502, 503 and server 505. Network 504 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.
[0112] Users can use terminal devices 501, 502, 503 to interact with server 505 through network 504 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 501, 502, 503, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only for example).
[0113] The terminal devices 501 , 502 , and 503 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.
[0114] The server 505 may be a server that provides various services, such as a backend management server (only an example) that provides support for shopping websites browsed by users using the terminal devices 501, 502, and 503. The backend management server may analyze and process the received planning request and other data, and feed back the processing results (such as navigation paths - only an example) to the terminal device.
[0115] It should be noted that the navigation path planning method provided in the embodiment of the present invention is generally executed by the server 505 , and accordingly, the navigation path planning device is generally disposed in the server 505 .
[0116] It should be understood that Figure 5 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.
[0117] Reference below Figure 6 , which shows a schematic diagram of the structure of a computer system 600 of a terminal device suitable for implementing an embodiment of the present invention. Figure 6 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.
[0118] like Figure 6 As shown, the computer system 600 includes a central processing unit (CPU) 601, which can execute various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage part 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the system 600 are also stored. The CPU 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.
[0119] The following components are connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 runs a communication process via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed, so that a computer program read therefrom is installed into the storage section 608 as needed.
[0120] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for running the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 609, and / or installed from the removable medium 611. When the computer program is executed by the central processing unit (CPU) 601, the above-mentioned functions defined in the system of the present invention are executed.
[0121] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.
[0122] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operations of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually run basically in parallel, and they can sometimes run in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that runs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0123] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor. For example, they may be described as: a processor includes an acquisition module, a clustering module, and a planning module. The names of these modules do not, in some cases, constitute limitations on the modules themselves. For example, the acquisition module may also be described as a "module for acquiring address information of orders to be delivered."
[0124] As another aspect, the present invention further provides a computer-readable medium, which may be included in the device described in the above embodiment; or may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by the device, the device includes: obtaining address information of orders to be delivered; clustering the address information of the orders to be delivered to generate a delivery point set; and planning the navigation path of the orders to be delivered based on the delivery point set.
[0125] The computer program product provided by the embodiment of the present invention includes a computer program. When the computer program is executed by a processor, the navigation path planning method in the embodiment of the present invention is implemented.
[0126] The technical solution according to the embodiment of the present invention has the following advantages or beneficial effects: by acquiring the address information of the orders to be delivered; clustering the address information of the orders to be delivered to generate a delivery point set; planning the navigation path of the orders to be delivered based on the delivery point set; being able to automatically plan navigation paths for a large number of orders without relying on third-party navigation software, and improving planning efficiency and user experience.
[0127] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
[0128] It should be noted that the acquisition, storage and application of user personal information involved in the technical solution of the present disclosure are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.
Claims
1. A navigation path planning method, It is characterized in that include: Get the address information of the order to be delivered; Clustering is performed according to the address information of the orders to be delivered to generate a delivery point set; A navigation path for the order to be delivered is planned based on the delivery point set.
2. The planning method according to claim 1, It is characterized in that Clustering is performed according to the address information of the orders to be delivered to generate a delivery point set, including: The address information of the order to be delivered is deduplicated, and a delivery point set is generated according to the deduplicated address information of the order to be delivered.
3. The planning method according to claim 1, It is characterized in that Planning the navigation path of the order to be delivered based on the delivery point set includes: Using a scheduling algorithm to sort the delivery point set to obtain a delivery point sequence; Performing a feasibility analysis on the delivery point sequence, and in response to a failure result of the feasibility analysis, re-sorting the delivery point sequence to obtain a final delivery point sequence; Based on the final delivery point sequence and the pre-acquired current location of the user, a navigation path for the order to be delivered is generated.
4. The planning method according to claim 1, It is characterized in that Planning the navigation path of the order to be delivered based on the delivery point set also includes: Arranging the delivery points in the delivery point set to obtain a delivery path set; Based on the delivery route set and the pre-acquired time information of the to-be-delivered order, a preset timeout prediction algorithm is used to perform timeout prediction to obtain a prediction result; The navigation path of the order to be delivered is determined according to the prediction result; wherein the navigation path includes a path with the shortest comprehensive distance and a path with the shortest comprehensive time.
5. The planning method according to claim 4, It is characterized in that Determining the navigation path of the order to be delivered according to the prediction result includes: The delivery paths predicted as timed out in the delivery path set are deleted, and the navigation path of the order to be delivered is determined based on the deleted delivery path set.
6. The planning method according to claim 1, It is characterized in that The method further comprises: The navigation path is displayed to the user through a navigation interface, so that the user can deliver the order to be delivered according to the navigation path.
7. A navigation path planning device, It is characterized in that include: The acquisition module is used to obtain the address information of the order to be delivered; A clustering module, used for clustering the address information of the orders to be delivered to generate a set of delivery points; A planning module is used to plan the navigation path of the order to be delivered based on the delivery point set.
8. An electronic device, It is characterized in that include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 6.
9. A computer readable medium having a computer program stored thereon, It is characterized in that When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.
10. A computer program product comprising a computer program, It is characterized in that When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.
