Long-distance driving route planning method, device and terminal equipment

Abstract

The present invention is applicable to the technical field of route planning, and provides a long-distance driving route planning method, device and terminal equipment. The method includes obtaining the destination, departure place and single driving time set by the user at the current moment; calculating the driving time and driving path between the destination and the departure place; dividing the driving time into K single driving periods according to the single driving time, marking K-1 endpoints in the driving path; obtaining N service points in the driving path; obtaining the service point with the shortest distance from the kth endpoint based on the kth endpoint, and obtaining K-1 stop points; adjusting the driving path according to the K-1 stop points, and outputting a complete long-distance driving route. The present invention can keep the vehicle and the user in a good state, thereby providing the user with a good long-distance driving experience.

Description

Technical Field

[0001] The present invention relates to the technical field of route planning, and in particular to a long-distance driving route planning method, device and terminal equipment. Background Art

[0002] Route planning is the premise of navigation. According to the destination, departure point and path strategy settings, a travel plan is designed for the user. In traditional navigation, the route between two points is usually planned based on the destination set by the user.

[0003] However, if the destination is far away, resulting in a long driving time, the vehicle and the user will not be able to maintain a good condition for a long time. Therefore, the user usually does not directly reach the destination according to the route planned by the navigation. Summary of the invention

[0004] The main purpose of the present invention is to propose a long-distance driving route planning method, device and terminal equipment to solve the problem that traditional navigation in the prior art is not suitable for long-distance driving and cannot guarantee the status of the vehicle and the user.

[0005] To achieve the above objectives, a first aspect of an embodiment of the present invention provides a long-distance driving route planning method, comprising:

[0006] Get the destination, departure place, and single driving time set by the user at the current moment;

[0007] Calculate the travel time and travel route between the destination and the departure place;

[0008] Dividing the driving time into K single driving periods according to the single driving time, and marking K-1 endpoints in the driving path;

[0009] Obtain N service points in the driving path, where K and N are positive integers;

[0010] Based on the kth endpoint, obtain the service point with the shortest distance to it, and obtain K-1 stop points, where k is a positive integer less than or equal to K-1;

[0011] The driving path is adjusted according to the K-1 stop points, and a complete long-distance driving route is output.

[0012] In combination with the first aspect of the embodiment of the present invention, in the first implementation mode of the present invention, obtaining the single driving time set by the user at the current moment includes:

[0013] If the user has not set a single driving time at the current moment, a default single driving time is set according to the historical single driving time as the single driving time set by the user at the current moment.

[0014] In combination with the first aspect of the embodiment of the present invention, in a second implementation of the present invention, after adjusting the driving path according to the K-1 stop points and outputting a complete long-distance driving route, the method includes:

[0015] Obtaining the stay time based on each of the stay points;

[0016] The travel time and the stay time are summed up and then outputted.

[0017] In combination with the first aspect of the embodiment of the present invention, in a third implementation mode of the present invention, the present invention further includes:

[0018] Get the type and model of the vehicle;

[0019] When the user drives to the kth stop point, the energy required for the vehicle to travel from the kth stop point to the next stop point is calculated according to the type and model of the vehicle;

[0020] If the energy required to be used is greater than the current remaining energy of the vehicle, an energy replenishment station is searched and added between the kth stop point and the next stop point.

[0021] In combination with the third implementation manner of the first aspect of the embodiment of the present invention, in the fourth implementation manner of the present invention, before calculating the energy required for the vehicle to travel from the kth stop point to the next stop point according to the type and model of the vehicle, the method further includes:

[0022] Obtaining traffic information of each road section in the first path planning scheme;

[0023] The energy required for the vehicle to travel from the kth stop point to the next stop point is modified according to the road condition information.

[0024] In combination with the first aspect of the embodiment of the present invention, the fifth implementation of the present invention further includes:

[0025] Get the service point type selected by the user;

[0026] Before acquiring the service point with the shortest distance to the kth endpoint based on the kth endpoint, the N service points are screened according to the service point type selected by the user.

[0027] In combination with the first aspect of the embodiment of the present invention, in a sixth implementation of the present invention, the following further includes:

[0028] Calculate the time node when the user passes the kth stop point;

[0029] Before obtaining the service point with the shortest distance to the kth endpoint, the N service points are screened according to the time node to which the kth endpoint belongs.

[0030] A second aspect of an embodiment of the present invention provides a long-distance driving route planning device, comprising:

[0031] The user information acquisition module is used to obtain the destination, departure place, and single driving time set by the user at the current moment;

[0032] A path calculation module, used to calculate the travel time and travel path between the destination and the departure point;

[0033] A time period division marking module, used for dividing the driving time into K single driving time periods according to the single driving time, and marking K-1 endpoints in the driving path;

[0034] A service point acquisition module, used to acquire N service points in the driving path, where K and N are positive integers;

[0035] A stay point acquisition module, used to acquire the service point with the shortest distance from the kth endpoint based on the kth endpoint, and obtain K-1 stay points, where k is a positive integer less than or equal to K-1;

[0036] The complete long-distance driving route output module is used to adjust the driving path according to the K-1 stop points and output a complete long-distance driving route.

[0037] The third aspect of an embodiment of the present invention provides a terminal device, including a memory, a processor, and a computer program stored in the above memory and executable on the above processor, and when the above processor executes the above computer program, the steps of the method provided in the first aspect are implemented.

[0038] A fourth aspect of an embodiment of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method provided in the first aspect are implemented.

[0039] An embodiment of the present invention proposes a long-distance driving route planning method, which divides the driving time into multiple single driving time periods according to the single driving time set by the user, and sets appropriate service points as stop points during the time periods, providing corresponding services to users and vehicles, so that the vehicles can maintain a good driving state, and the users can maintain a good driving state, thereby providing users with a good long-distance driving experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 A schematic diagram of the implementation process of the long-distance driving route planning method provided by an embodiment of the present invention;

[0041] Figure 2 A schematic diagram of the structure of a long-distance driving route planning device provided in an embodiment of the present invention.

[0042] The realization of the purpose, functional features and advantages of the present invention will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0043] It should be understood that the specific embodiments described herein are only used to explain the present invention, and are not used to limit the present invention.

[0044] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0045] In this document, suffixes such as "module", "component" or "unit" used to represent elements are only used to facilitate the description of the present invention, and have no specific meanings. Therefore, "module" and "component" can be used interchangeably.

[0046] like Figure 1 As shown, an embodiment of the present invention provides a long-distance driving route planning method, which is applicable to long-distance driving scenarios and can keep the user and the vehicle in a good state, including but not limited to the following steps:

[0047] S101. Obtain the destination, departure place, and single driving time currently set by the user.

[0048] In the above step S101, the destination, the departure point, and the single driving time are set in real time so that the route planning result is close to the current needs of the user.

[0049] However, in actual applications, the user may not have specific requirements for a single driving time. Therefore, in one embodiment, an implementation of the above step S101 may be:

[0050] If the user has not set a single driving time at the current moment, a default single driving time is set according to the historical single driving time as the single driving time set by the user at the current moment.

[0051] S102: Calculate the travel time and travel route between the destination and the departure point.

[0052] In the above step S102, the travel time and the travel path are obtained according to the destination and the departure point, and a conventional route planning algorithm can be used, such as the Dijkstra algorithm, the Bellman-Ford algorithm, the SPFA algorithm, etc., which will not be described in detail in this embodiment.

[0053] S103, dividing the driving time into K single driving time periods according to the single driving time, and marking K-1 endpoints in the driving path.

[0054] The K-1 endpoints obtained by the above step S103 are endpoints in a mathematical sense. In an actual driving route, a vehicle cannot stay in one place for a long time at will, but can only stay in a specific location for a long time, such as a parking lot, a service area, etc.

[0055] S104: Acquire N service points in the driving route.

[0056] Wherein, K and N are positive integers.

[0057] In the above step S104, the service point may be a gas station, a charging station, a restaurant, a service area, etc.

[0058] In a specific application, the implementation process of N service points in the driving path can be:

[0059] Set the extension distance and use it to vertically extend the driving path;

[0060] The N service points in the expanded area are counted as the N service points in the driving path.

[0061] In practical applications, taking a straight-line driving path as an example, after the driving path is extended using the extended distance, it appears as a rectangle, and then the service points are obtained in the rectangle.

[0062] S105. Based on the kth endpoint, obtain the service point with the shortest distance to it, and obtain K-1 stop points.

[0063] Wherein k is a positive integer less than or equal to K-1.

[0064] S106: Adjust the driving path according to the K stop points and output a complete long-distance driving route.

[0065] Through the above steps S105 and S106, the complete long-distance driving route includes K-1 stop points.

[0066] In one embodiment, while outputting the complete long-distance driving route, the time required for the trip can also be output to the user. Therefore, after the above step S106, the following may also be included:

[0067] Obtaining the stay time based on each of the stay points;

[0068] The travel time and the stay time are summed up and then outputted.

[0069] In an embodiment of the present invention, the service point may be a gas station, a charging pile, a restaurant, a service area, etc. Based on this, the embodiment of the present invention also provides an optimization solution to improve the user's driving state and the vehicle's driving state.

[0070] In one embodiment, the optimization scheme includes:

[0071] Get the service point type selected by the user;

[0072] Before acquiring the service point with the shortest distance to the kth endpoint based on the kth endpoint, the N service points are screened according to the service point type selected by the user.

[0073] In a specific application, in the complete long-distance driving route provided by the above steps S101 to S106, the service points are screened according to the endpoints and the shortest distance constraints to obtain the stop points. In the embodiment of the present invention, through the above steps, the user can set the service point type of each stop point by himself, so that the selection of the stop point is more in line with the user's current needs. For example, the stop point obtained by the kth endpoint through the shortest distance constraint is a dining point, but the user wants to replenish energy in advance. At this time, the user can manually change the dining point to an energy replenishment station.

[0074] The embodiment of the present invention also shows a solution for modifying the stay point according to the time node. In another embodiment, the optimization solution includes:

[0075] Calculate the time node when the user passes the kth stop point;

[0076] Before obtaining the service point with the shortest distance to the kth endpoint, the N service points are screened according to the time node to which the kth endpoint belongs.

[0077] In a specific application, in the complete long-distance driving route provided by the above steps S101 to S106, the service points are screened to obtain the stop points according to the endpoints and the shortest distance constraints. The embodiment of the present invention can automatically set the service point type of each stop point according to the time node through the above steps, so that the selection of the stop point is more in line with the current needs of the user. For example, if the time node when the user passes the kth endpoint is the meal time, then when screening the N service points, the type of the service point is set to catering.

[0078] It should be noted that the complete long-distance driving route is the route planning result before the long-distance driving. Therefore, before the long-distance driving, the service points are screened only according to the shortest distance to obtain the stop points. The above optimization scheme can be applied to the route planning before the long-distance driving, and can also be applied to the modification of the complete long-distance driving route during the long-distance driving.

[0079] For example, if the above solution is applied to long-distance driving, the type of service point selected by the user is obtained before the user reaches the kth endpoint, and the time node to which the user belongs is obtained before the user reaches the kth endpoint. Among them, since the stop point is obtained based on the endpoint constraint, the user's position is predicted using the distance between the endpoint and the vehicle, which can reduce the degree of modification of the entire long-distance driving route compared to predicting the user's position using the distance between the stop point and the vehicle.

[0080] In practical applications, the energy replenishment reminder for the vehicle is usually recommended after reaching the destination, so there is a situation where the remaining energy is insufficient before reaching the destination. Therefore, in another embodiment, the long-distance driving route planning method further includes:

[0081] Get the type and model of the vehicle;

[0082] When the user drives to the kth stop point, the energy required for the vehicle to travel from the kth stop point to the next stop point is calculated according to the type and model of the vehicle;

[0083] If the energy required to be used is greater than the current remaining energy of the vehicle, an energy replenishment station is searched and added between the kth stop point and the next stop point.

[0084] In a specific application, the type and model of the vehicle may affect the energy consumption rate during the vehicle's driving process. Therefore, in the above steps, the energy required for the vehicle to travel from the initial position to the destination set by the user is calculated based on the type and model of the vehicle.

[0085] In the above step, before calculating the energy required for the vehicle to travel from the kth stop point to the next stop point according to the type and model of the vehicle, the following step is also included:

[0086] Obtaining traffic information of each road section in the first path planning scheme;

[0087] The energy required for the vehicle to travel from the kth stop point to the next stop point is modified according to the road condition information.

[0088] In practical applications, if the current traffic information is relatively congested, the energy consumption rate will increase, so the energy required for the vehicle to travel from the kth stop to the next stop will be modified.

[0089] like Figure 2 As shown, an embodiment of the present invention provides a long-distance driving route planning device 20, comprising:

[0090] The user information acquisition module 21 is used to obtain the destination, departure place, and single driving time set by the user at the current moment;

[0091] A path calculation module 22, used to calculate the travel time and travel path between the destination and the departure place;

[0092] A time period division marking module 23 is used to divide the driving time into K single driving time periods according to the single driving time, and mark K-1 endpoints in the driving path;

[0093] A service point acquisition module 24 is used to acquire N service points in the driving path, where K and N are positive integers;

[0094] The stay point acquisition module 25 is used to acquire the service point with the shortest distance from the kth endpoint based on the kth endpoint, and obtain K-1 stay points, where k is a positive integer less than or equal to K-1;

[0095] The complete long-distance driving route output module 26 is used to adjust the driving path according to the K-1 stop points and output a complete long-distance driving route.

[0096] An embodiment of the present invention also provides a terminal device including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, each step in the long-distance driving route planning method described in the above embodiment is implemented.

[0097] An embodiment of the present invention further provides a storage medium, which is a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, each step in the long-distance driving route planning method described in the above embodiment is implemented.

[0098] The embodiments described above are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the foregoing embodiments describe the present invention in detail, those skilled in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or replace some of the technical features therein by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be included in the protection scope of the present invention.

Claims

1. A long-distance driving route planning method, characterized in that: include: Get the destination, departure place, and single driving time set by the user at the current moment; Calculate the travel time and travel route between the destination and the departure place; Dividing the driving time into K single driving periods according to the single driving time, and marking K-1 endpoints in the driving path; Obtain N service points in the driving path, where K and N are positive integers; Based on the kth endpoint, obtain the service point with the shortest distance to it, and obtain K-1 stop points, where k is a positive integer less than or equal to K-1; Adjust the driving path according to the K-1 stop points and output a complete long-distance driving route; The method also includes: obtaining the type and model of the vehicle; when the user drives to the kth stop point, calculating the energy required for the vehicle to travel from the kth stop point to the next stop point according to the type and model of the vehicle; if the energy required is greater than the current remaining energy of the vehicle, searching for and adding an energy replenishment station between the kth stop point and the next stop point; Before calculating the energy required for the vehicle to travel from the kth stop point to the next stop point according to the type and model of the vehicle, the method also includes: obtaining road condition information for the vehicle from the kth stop point to the next stop point; and modifying the energy required for the vehicle to travel from the kth stop point to the next stop point according to the road condition information.

2. The long-distance driving route planning method according to claim 1, characterized in that: The method of obtaining the single driving time currently set by the user includes: If the user has not set a single driving time at the current moment, a default single driving time is set according to the historical single driving time as the single driving time set by the user at the current moment.

3. The long-distance driving route planning method according to claim 1, characterized in that: After adjusting the driving path according to the K-1 stop points and outputting a complete long-distance driving route, the method includes: Obtaining the stay time based on each of the stay points; The travel time and the stay time are summed up and then outputted.

4. The long-distance driving route planning method according to claim 1, characterized in that: Also includes: Get the service point type selected by the user; Before acquiring the service point with the shortest distance to the kth endpoint based on the kth endpoint, the N service points are screened according to the service point type selected by the user.

5. The long-distance driving route planning method according to claim 1, characterized in that: Also includes: Calculate the time node when the user passes the kth stop point; Before obtaining the service point with the shortest distance to the kth endpoint, the N service points are screened according to the time node to which the kth endpoint belongs.

6. A long-distance driving route planning device, characterized in that: include: The user information acquisition module is used to obtain the destination, departure place, and single driving time set by the user at the current moment; A path calculation module, used to calculate the travel time and travel path between the destination and the departure place; A time period division marking module, used for dividing the driving time into K single driving time periods according to the single driving time, and marking K-1 endpoints in the driving path; A service point acquisition module, used to acquire N service points in the driving path, where K and N are positive integers; A stay point acquisition module, used to acquire the service point with the shortest distance from the kth endpoint based on the kth endpoint, and obtain K-1 stay points, where k is a positive integer less than or equal to K-1; A complete long-distance driving route output module, used to adjust the driving path according to the K-1 stop points and output a complete long-distance driving route; The method also includes: obtaining the type and model of the vehicle; when the user drives to the kth stop point, calculating the energy required for the vehicle to travel from the kth stop point to the next stop point according to the type and model of the vehicle; if the energy required is greater than the current remaining energy of the vehicle, searching for and adding an energy replenishment station between the kth stop point and the next stop point; Before calculating the energy required for the vehicle to travel from the kth stop point to the next stop point according to the type and model of the vehicle, the method also includes: obtaining road condition information for the vehicle from the kth stop point to the next stop point; and modifying the energy required for the vehicle to travel from the kth stop point to the next stop point according to the road condition information.

7. A terminal device, characterized in that: The method comprises a memory, a processor and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, each step in the long-distance driving route planning method as claimed in any one of claims 1 to 5 is implemented.

8. A storage medium, the storage medium being a computer-readable storage medium, on which a computer program is stored, characterized in that: When the computer program is executed by a processor, each step in the long-distance driving route planning method as described in any one of claims 1 to 5 is implemented.

Images