A navigation path planning method

By monitoring the road condition information of the navigation route in real time and automatically adjusting the navigation path, the problem that the existing navigation system fails to consider the real-time road conditions is solved, and the intelligence of the navigation system is improved to ensure the safety and efficiency of the itinerary.

CN113188551BActive Publication Date: 2024-11-12FORYOU GENERAL ELECTRONICS
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110344320.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-03-31
Publication Date
2024-11-12
Estimated Expiration
2041-03-31

AI Technical Summary

Technical Problem

The existing navigation system fails to consider real-time road conditions when planning navigation routes, resulting in the inability to automatically adjust the route in traffic accidents or special weather conditions, resulting in trip delays and safety hazards.

Method used

By monitoring the preset road conditions information of the navigation route in real time, we can determine whether the route needs to be re-planned, and generate the updated navigation path according to the re-planning instructions, automatically adjust the route, and improve the intelligence of the navigation system.

Benefits of technology

It realizes automatic adjustment of navigation routes when real-time road conditions change, improves the intelligence of the navigation system, and ensures trip safety and efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113188551B_ABST
    Figure CN113188551B_ABST
Patent Text Reader

Abstract

The present invention provides a navigation path planning method, which includes: step 1, receiving the current location information and destination information of the client to perform path planning and obtain a navigation route; step 2, sending the navigation route to the client; step 3, real-time monitoring of preset road condition information on the remaining path of the navigation route, judging whether it meets the conditions for triggering re-planning of the route, if so, generating a re-planning instruction and entering the next step, otherwise looping this step; step 4, re-planning the navigation path according to the re-planning instruction to obtain an updated navigation route; step 5, sending the updated navigation route to the client, and returning to step 3. The present invention realizes automatic route planning of the navigation route when the conditions for triggering re-planning of the route are triggered, thereby improving the intelligence of the navigation technology.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of navigation technology, and in particular to a navigation path planning method. Background Art

[0002] With the development of road construction and the increasing popularity of transportation, road conditions have become increasingly complex and changeable, so people are increasingly relying on the path planning function provided by the navigation system when driving.

[0003] However, the current navigation system does not take into account the current real-time traffic conditions, which may easily lead to traffic accidents on the pre-planned route or sections that the vehicle cannot pass under special weather conditions, thereby delaying the owner's trip and causing unnecessary losses. At present, there are also related traffic radio stations that collect real-time traffic information on some roads and then broadcast it to the car owners to listen to, but this method of information transmission is inefficient and requires the car owner to manually change the navigation route. The operation steps are complicated and easily lead to safety issues, and it cannot really solve the above problems.

[0004] Therefore, the prior art needs to be further improved. Summary of the invention

[0005] The present invention provides a navigation path planning method, which aims to solve the defects in the prior art, realize automatic route planning of the navigation route when the conditions for re-planning the route are triggered, and improve the intelligence level of the navigation technology.

[0006] In order to achieve the above object, the technical solution adopted by the present invention is:

[0007] The present invention provides a navigation path planning method, comprising:

[0008] Step 1: Receive the client's current location information and destination information to perform path planning and obtain a navigation route;

[0009] Step 2: Send the navigation route to the client;

[0010] Step 3: monitor the preset road condition information on the remaining path of the navigation route in real time to determine whether the conditions for triggering route re-planning are met. If yes, generate a re-planning instruction and proceed to the next step; otherwise, execute this step in a loop;

[0011] Step 4: re-plan the navigation path according to the re-planning instruction to obtain an updated navigation route;

[0012] Step 5: Send the updated navigation route to the client and return to step 3.

[0013] Furthermore, after step 3 and before step 4, the method further includes:

[0014] Step 3A: determine whether the client has sent a request for a seamless route change, if yes, proceed to the next step, otherwise send a preset prompt message and a route change request to the client;

[0015] Step 3B: Determine whether confirmation information of route change is received, if yes, proceed to the next step, otherwise return to step 3.

[0016] Specifically, the determining whether confirmation information of route change is received includes:

[0017] Step 3B-1, determining whether the prompt information contains road section water accumulation information, if yes, detecting whether there is chassis minimum ground clearance data of the requested vehicle in the confirmation information, if yes, proceeding to step 4, otherwise proceeding to the next step;

[0018] Step 3B-2, check whether the confirmation information contains the vehicle model identification of the requested vehicle. If so, query the chassis minimum ground clearance data of the requested vehicle according to the vehicle model identification, and proceed to step 4. Otherwise, send the request information for obtaining the chassis minimum ground clearance data of the requested vehicle again.

[0019] Specifically, the step 1 includes:

[0020] Step 1-1, obtaining the number of road layers in the electronic map;

[0021] Step 1-2, setting a search range corresponding to the road level;

[0022] Step 1-3, calculate the straight-line distance between the current location and the destination;

[0023] Step 1-4, comparing the straight-line distance with the search range, and listing the road level corresponding to the search range to which the straight-line distance belongs and the road levels above it as the road levels to be searched;

[0024] Step 1-5, perform path search within a preset range;

[0025] Step 1-6, determine whether there is an avoidance section, if yes, set the avoidance section as an impassable section, otherwise proceed to the next step;

[0026] Step 1-7, establishing a topological structure of an adjacency matrix based on the path search results;

[0027] Steps 1-8: Obtain the planned path through the A-star algorithm.

[0028] Specifically, the determination in step 3 whether the route re-planning is triggered includes:

[0029] Step 3-1, determine whether the accident section is unique, if yes, determine that it does not meet the conditions for triggering re-routing, and send a preset prompt message to the client, otherwise proceed to the next step;

[0030] Step 3-2, determine whether the accident section is completely blocked, if yes, it is determined to meet the conditions for triggering route replanning, otherwise proceed to the next step;

[0031] Step 3-3, calculating a first time and a first fuel consumption required to reach the destination according to the current navigation route, and a second time and a second fuel consumption required to reach the destination according to the changed navigation route;

[0032] Step 3-4, calculating a time difference between the first time and the second time, and a fuel consumption difference between the first fuel consumption and the second fuel consumption;

[0033] Step 3-5: determine whether the time difference and the fuel consumption difference are within a preset range. If yes, determine that the conditions for triggering route replanning are not met; otherwise, determine that the conditions for triggering route replanning are met.

[0034] Specifically, step 4 includes:

[0035] Step 4-1, detecting whether the re-planning instruction contains a water accumulation condition, if yes, proceeding to step 4-3, otherwise proceeding to the next step;

[0036] Step 4-2: After the accident section is listed as an impassable section, the route is planned according to the default route planning method;

[0037] Step 4-3, obtaining the water depth of the flooded road section and requesting the minimum ground clearance of the vehicle chassis;

[0038] Step 4-4, determining the traffic attribute of the flooded road section according to the water depth and the minimum ground clearance of the chassis of the requesting vehicle, including: if the water depth is greater than or equal to the minimum ground clearance of the chassis of the requesting vehicle, marking the flooded road section as an impassable road section, otherwise marking the flooded road section as a passable road section;

[0039] Step 4-5, if the pass attribute is an impassable road section, return to step 4-2, otherwise proceed to the next step;

[0040] Step 4-6, obtaining the average wading height of each type of vehicle;

[0041] Step 4-7, obtaining the current node J(k) of the current position of the requesting vehicle in the electronic map;

[0042] Step 4-8, search for adjacent nodes from the current node J(k) according to a preset algorithm, select the node with the smallest estimated cost among the adjacent nodes as the next node J(k+1), and determine whether the next node J(k+1) is the destination. If yes, proceed to the next step, otherwise, execute this step repeatedly;

[0043] Step 4-9: Output the navigation route.

[0044] Specifically, the preset algorithm is: F(k)=H(k)+q*G(n), wherein F(k) represents the estimated cost of requesting the vehicle to move from the current node J(k) to the next node, H(k) is the estimated cost of the best route from the current node J(k) to the next node, G(n) is the actual cost from the current node J(k) to the pre-selected node J(n), and q represents the weight.

[0045] Specifically, the method for determining the weight q is:

[0046] When Sc≤H1, q=D / Sc;

[0047] When H(x-1)<Sc<Hx(x≤m), q=(D-Hx) / (Sc-Hx);

[0048] Among them, Sc represents the minimum ground clearance of the chassis of the requesting vehicle, D represents the depth of the accumulated water, H1 represents the minimum average wading height, and Hx represents the average wading height of the sequence number x.

[0049] The beneficial effect of the present invention is that the present invention monitors the preset road condition information on the remaining path of the navigation route in real time, and re-plans the navigation path when the conditions that trigger re-planning of the route appear to obtain an updated navigation route, thereby improving the intelligence level of navigation technology. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] Figure 1 It is a flowchart of the navigation path planning method of the present invention. DETAILED DESCRIPTION

[0051] The following specifically describes the embodiments of the present invention in conjunction with the accompanying drawings, which are only for reference and illustration and do not constitute a limitation on the scope of patent protection of the present invention.

[0052] Example 1

[0053] This embodiment provides a navigation path planning method, including:

[0054] Step 1: Receive the client's current location information and destination information to perform path planning and obtain a navigation route.

[0055] The client (in-vehicle navigation) is installed on the vehicle that sends the route planning request (hereinafter referred to as the requesting vehicle). The current location information and destination information are sent by the client to the server (cloud) when making a route planning request. The current location information can be obtained by the client through a satellite positioning system or mobile data positioning or manual input method. The destination information can be obtained by the user by selecting POI (Point of Interest) on the electronic map of the client, or by manual input (such as touch, handwriting or voice recognition), and then sent to the server through a communication network.

[0056] Step 2: Send the navigation route to the client.

[0057] After completing the path planning and obtaining the navigation route, the server sends the navigation route data packet to the client through the relevant protocol. After receiving the navigation route data packet, the client parses it, displays the navigation route, and starts navigation based on the current location information.

[0058] Step 3: monitor the preset road condition information on the remaining path of the navigation route in real time to determine whether the conditions for triggering route re-planning are met. If yes, generate a re-planning instruction and proceed to the next step; otherwise, execute this step in a loop.

[0059] The preset road condition information includes traffic accidents, temporary road closures, vehicle flow, water accumulation conditions, etc., and can be set by the server according to actual needs.

[0060] The conditions for triggering the re-routing include one or more of the following conditions: a traffic accident or temporary road closure leading to road interruption, the traffic volume reaching a threshold, and water accumulation affecting the normal passage of the requesting vehicle.

[0061] The re-planning instruction includes road condition information that triggers the re-planning of the route.

[0062] Step 4: re-plan the navigation path according to the re-planning instruction to obtain an updated navigation route.

[0063] The server marks the road section (accident section) that triggers the condition of re-planning the route as an avoidance section. Specifically, the accident section is temporarily marked as an impassable section, and then the navigation path is re-planned.

[0064] Step 5: Send the updated navigation route to the client and return to step 3.

[0065] After the server completes the path replanning and obtains the updated navigation route, it sends the data packet of the updated navigation route to the client through the relevant protocol. After receiving the data packet of the updated navigation route, the client parses it, displays the updated navigation route, and starts navigation in combination with the current location information.

[0066] Example 2

[0067] Different from Example 1, this embodiment further includes after step 3 and before step 4 of Example 1:

[0068] Step 3A: determine whether the client has sent a request for a seamless route change. If yes, proceed to the next step. Otherwise, send a preset prompt message and a route change request to the client.

[0069] The senseless route change request means that after the current road conditions trigger the conditions for re-planning the route, the navigation route can be automatically re-planned without the confirmation of the vehicle owner, and the user will not feel the change of the navigation route. The senseless route change request can be sent by the client to the server at the same time as requesting navigation route planning.

[0070] The preset prompt information includes the road condition information ahead and the impact degree information on the requesting vehicle, for example, "a traffic accident has occurred ahead, and the journey of this vehicle will be delayed by approximately 30 minutes", or "there is 1 meter deep water on the road ahead, and this vehicle may not be able to pass safely."

[0071] Step 3B: Determine whether confirmation information of route change is received, if yes, proceed to the next step, otherwise return to step 3.

[0072] In this embodiment, the determining whether confirmation information of route change is received includes:

[0073] Step 3B-1, determining whether the prompt information contains road section water accumulation information, if yes, detecting whether there is chassis minimum ground clearance data of the requested vehicle in the confirmation information, if yes, proceeding to step 4, otherwise proceeding to the next step;

[0074] Step 3B-2, check whether the confirmation information contains the vehicle model identification of the requested vehicle. If so, query the chassis minimum ground clearance data of the requested vehicle according to the vehicle model identification, and proceed to step 4. Otherwise, send the request information for obtaining the chassis minimum ground clearance data of the requested vehicle again.

[0075] Example 3

[0076] Different from Example 1, this example provides a specific method for step 1:

[0077] Step 1-1, obtain the number of road levels in the electronic map.

[0078] In this embodiment, the number of road levels is set to k, and from high level to low level, they are L1, L2, ..., Lk. For example, L1 represents national-level roads, L2 represents provincial-level roads, L3 represents city-county-level roads, and so on.

[0079] Step 1-2: Set a search range corresponding to the road hierarchy.

[0080] In this embodiment, the number of search ranges is set to k, which are W1, W2, ... Wk from large to small, that is, W1 corresponds to L1 level roads, W2 corresponds to L2 level roads, and W3 corresponds to L3 level roads. For example, W1>500km, 500km≤W2<100km, W3≤100km.

[0081] Step 1-3: Calculate the straight-line distance between the current location and the destination.

[0082] The straight-line distance between the current location and the destination can be calculated using the latitude and longitude of the destination.

[0083] Step 1-4: compare the straight-line distance with the search range, and list the road levels corresponding to the search range to which the straight-line distance belongs and the road levels above it as the road levels to be searched.

[0084] For example, if the straight-line distance is 600km, it belongs to W1, and the road level corresponding to W1 is L1, so the roads at the L1 level are listed as the road level to be searched; if the straight-line distance is 200km, it belongs to W2, and the road level corresponding to W2 is L2, so the roads at the L2 and L1 levels are selected; if the straight-line distance is 80km, it belongs to W3, so the roads at the L3, L2, and L1 levels are selected.

[0085] Steps 1-5: Perform path search within a preset range.

[0086] The preset range is a circular area with the midpoint of the straight line between the current position and the destination as the center and α*S as the radius, where S represents the straight-line distance between the current position and the destination, α<1, and can be set according to actual conditions.

[0087] Step 1-6, determine whether there is an avoidance section, if so, set the avoidance section as an impassable section, otherwise proceed to the next step.

[0088] Step 1-7: Establish a topological structure of an adjacency matrix based on the path search results.

[0089] Steps 1-8: Obtain the planned path through the A-star algorithm.

[0090] The A-Star algorithm is the most effective direct search method for finding the shortest path in a static road network and has been widely used in navigation route planning.

[0091] Example 4

[0092] Different from Example 1, this embodiment provides a specific method for determining whether the conditions for triggering route replanning in step 3 are met:

[0093] Step 3-1: Determine whether the accident section is unique. If so, it is determined that the conditions for triggering re-routing are not met, and a preset prompt message is sent to the client. Otherwise, proceed to the next step.

[0094] The uniqueness means that the accident section is a must-go place and cannot be avoided by changing the navigation route.

[0095] The preset prompt information includes the road condition information ahead and the impact degree information on the requesting vehicle, for example, "a traffic accident has occurred ahead, and the journey of this vehicle will be delayed by approximately 30 minutes", or "there is 1 meter deep water on the road ahead, and this vehicle may not be able to pass safely."

[0096] Step 3-2: Determine whether the accident section is completely blocked. If so, it is determined to meet the conditions for triggering route replanning, otherwise proceed to the next step.

[0097] The total blocking type means that all lanes of the accident section are blocked from traffic.

[0098] Step 3-3, calculating a first time and a first fuel consumption required to reach the destination according to the current navigation route, and a second time and a second fuel consumption required to reach the destination according to the changed navigation route.

[0099] Step 3-4: Calculate the time difference between the first time and the second time, and the fuel consumption difference between the first fuel consumption and the second fuel consumption.

[0100] Step 3-5: determine whether the time difference and the fuel consumption difference are within a preset range. If yes, determine that the conditions for triggering route replanning are not met; otherwise, determine that the conditions for triggering route replanning are met.

[0101] Example 5

[0102] Different from Example 1, this example provides a specific method for step 4:

[0103] Step 4 includes:

[0104] Step 4-1, check whether the re-planning instruction contains water accumulation conditions, if yes, proceed to step 4-3, otherwise proceed to the next step.

[0105] Step 4-2: After the accident section is listed as an impassable section, the route is planned according to the default route planning method.

[0106] The method for planning the default route may refer to the method in Example 3, or may be other appropriate methods.

[0107] Step 4-3: Obtain the water depth of the flooded road section and request the minimum ground clearance of the vehicle's chassis.

[0108] In specific implementation, a water level meter may be installed on a road section that is more prone to waterlogging to measure the water depth D, and the water depth D may be sent to the service end.

[0109] Step 4-4, determining the traffic properties of the flooded road section according to the water depth and the minimum ground clearance of the chassis of the requesting vehicle, including: if the water depth is greater than or equal to the minimum ground clearance of the chassis of the requesting vehicle, marking the flooded road section as an impassable section, otherwise marking the flooded road section as a impassable section.

[0110] Step 4-5: If the traffic attribute is an impassable road section, return to step 4-2, otherwise proceed to the next step.

[0111] Step 4-6: Obtain the average wading height of each type of vehicle.

[0112] In specific implementation, the average wading heights of various types of vehicles are recorded from low to high as H1, H2...Hx...Hm, that is, H1 represents the lowest average wading height, Hm represents the highest average wading height, and Hx represents the average wading height of serial number x.

[0113] Step 4-7: Obtain the current node J(k) of the current position of the requesting vehicle in the electronic map.

[0114] Step 4-8: Search for adjacent nodes from the current node J(k) according to a preset algorithm, select the node with the smallest estimated cost among the adjacent nodes as the next node J(k+1), and determine whether the next node J(k+1) is the destination. If so, proceed to the next step, otherwise, execute this step in a loop.

[0115] The preset algorithm is: F(k)=H(k)+q*G(n), where F(k) represents the estimated cost of requesting the vehicle to move from the current node J(k) to the next node, H(k) is the estimated cost of the best route from the current node J(k) to the next node, G(n) is the actual cost from the current node J(k) to the pre-selected node J(n), and q represents the weight.

[0116] The method for determining the weight q is:

[0117] When Sc≤H1, q=D / Sc;

[0118] When H(x-1)<Sc<Hx(x≤m), q=(D-Hx) / (Sc-Hx);

[0119] Among them, Sc represents the minimum ground clearance of the chassis of the requesting vehicle, D represents the depth of the accumulated water, H1 represents the minimum average wading height, and Hx represents the average wading height of the sequence number x.

[0120] Step 4-9: Output the navigation route.

[0121] The above disclosure is only a preferred embodiment of the present invention, which cannot be used to limit the scope of protection of the present invention. Therefore, equivalent changes made according to the scope of the patent application of the present invention are still within the scope covered by the present invention.

Claims

1. A navigation path planning method, It is characterized in that include: Step 1: Receive the client's current location information and destination information to perform path planning and obtain a navigation route; Step 2: Send the navigation route to the client; Step 3: monitor the preset road condition information on the remaining path of the navigation route in real time to determine whether the conditions for triggering re-routing are met. If yes, generate a re-routing instruction and proceed to the next step; otherwise, execute this step in a loop; the preset road condition information includes traffic accidents, temporary road closures, vehicle flow, and water accumulation; the conditions for triggering re-routing include one or more of the following conditions: traffic accidents or temporary road closures leading to road interruption, vehicle flow reaching a threshold, and water accumulation affecting the normal passage of the requesting vehicle; Step 3A: determine whether the client has sent a request for a seamless route change, if yes, proceed to the next step, otherwise send a preset prompt message and a route change request to the client; Step 3B: Determine whether confirmation information of route change is received, if yes, proceed to the next step, otherwise return to step 3, wherein the determination of whether confirmation information of route change is received includes: Step 3B-1, determining whether the prompt information contains road section water accumulation information, if yes, detecting whether there is chassis minimum ground clearance data of the requested vehicle in the confirmation information, if yes, proceeding to step 4, otherwise proceeding to the next step; Step 3B-2, checking whether the confirmation information contains the vehicle model identification of the requested vehicle, if yes, querying the chassis minimum ground clearance data of the requested vehicle according to the vehicle model identification, and proceeding to step 4, otherwise, sending request information for obtaining the chassis minimum ground clearance data of the requested vehicle again; Step 4: re-plan the navigation path according to the re-planning instruction to obtain an updated navigation route; Step 5: Send the updated navigation route to the client, and return to step 3; The step 4 comprises: Step 4-1, detecting whether the re-planning instruction contains a water accumulation condition, if yes, proceeding to step 4-3, otherwise proceeding to the next step; Step 4-2: After the accident section is listed as an impassable section, the route is planned according to the default route planning method; Step 4-3, obtaining the water depth of the flooded road section and requesting the minimum ground clearance of the vehicle chassis; Step 4-4, determining the traffic attribute of the flooded road section according to the water depth and the minimum ground clearance of the chassis of the requesting vehicle, including: if the water depth is greater than or equal to the minimum ground clearance of the chassis of the requesting vehicle, marking the flooded road section as an impassable road section, otherwise marking the flooded road section as a passable road section; Step 4-5, if the pass attribute is an impassable road section, return to step 4-2, otherwise proceed to the next step; Step 4-6, obtaining the average wading height of each type of vehicle; Step 4-7, obtaining the current node J(k) of the current position of the requesting vehicle in the electronic map; Step 4-8, search for adjacent nodes from the current node J(k) according to a preset algorithm, select the node with the smallest estimated cost among the adjacent nodes as the next node J(k+1), and determine whether the next node J(k+1) is the destination. If yes, proceed to the next step, otherwise, execute this step repeatedly; Step 4-9, output the navigation route; The preset algorithm is: F(k)=H(k)+q*G(n), where F(k) represents the estimated cost value generated by requesting the vehicle to move from the current node J(k) to the next node, H(k) is the estimated cost value of the best route from the current node J(k) to the next node, G(n) is the actual cost value generated from the current node J(k) to the pre-selected node J(n), and q represents the weight; The method for determining the weight q is: When Sc≤H1, q=D / Sc; When H(x-1)<Sc<Hx(x≤m), q=(D-Hx) / (Sc-Hx); Among them, Sc represents the minimum ground clearance of the chassis of the requesting vehicle, D represents the depth of the accumulated water, H1 represents the minimum average wading height, and Hx represents the average wading height of the sequence number x.

2. The navigation path planning method according to claim 1, It is characterized in that The step 1 comprises: Step 1-1, obtaining the number of road layers in the electronic map; Step 1-2, setting a search range corresponding to the road level; Step 1-3, calculate the straight-line distance between the current location and the destination; Step 1-4, comparing the straight-line distance with the search range, and listing the road level corresponding to the search range to which the straight-line distance belongs and the road levels above it as the road levels to be searched; Step 1-5, perform path search within a preset range; Step 1-6, determine whether there is an avoidance section, if yes, set the avoidance section as an impassable section, otherwise proceed to the next step; Step 1-7, establishing a topological structure of an adjacency matrix based on the path search results; Steps 1-8: Obtain the planned path through the A-star algorithm.

3. The navigation path planning method according to claim 1, It is characterized in that The determination in step 3 of whether the route re-planning is triggered includes: Step 3-1, determine whether the accident section is unique, if yes, determine that it does not meet the conditions for triggering re-routing, and send a preset prompt message to the client, otherwise proceed to the next step; Step 3-2, determine whether the accident section is completely blocked, if yes, it is determined to meet the conditions for triggering route replanning, otherwise proceed to the next step; Step 3-3, calculating a first time and a first fuel consumption required to reach the destination according to the current navigation route, and a second time and a second fuel consumption required to reach the destination according to the changed navigation route; Step 3-4, calculating a time difference between the first time and the second time, and a fuel consumption difference between the first fuel consumption and the second fuel consumption; Step 3-5: determine whether the time difference and the fuel consumption difference are within a preset range. If yes, determine that the conditions for triggering route replanning are not met; otherwise, determine that the conditions for triggering route replanning are met.