Path planning method, device and equipment based on D*lite algorithm and improved DWA algorithm
By combining D*lite and improved DWA algorithm, using multi-level map and path optimization technology, the shortcomings of existing path planning algorithms in real-time and path quality are solved, and efficient navigation in complex environments is achieved.
Patent Information
- Application Number
- CN202410966435.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-18
- Publication Date
- 2024-11-08
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The existing path planning algorithms have shortcomings in real-time and path quality, especially when facing obstacles in large and complex maps and local environments, it is difficult to achieve efficient real-time obstacle avoidance.
Combining the D*lite algorithm and the improved DWA algorithm, the basic location information is obtained by loading multi-level maps, global path planning information is generated, and path planning is carried out locally, path updates are dynamically updated to deal with obstacles, and sparse processing and path optimization technology are adopted. Ensure global optimality and local real-time.
It realizes efficient path planning in complex environments, which not only retains the optimization of global planning, but also has the real-time obstacle avoidance ability of local planning, and improves the navigation performance of mobile robots.
Smart Images

Figure CN118913248A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of mobile robots, and in particular to a mobile robot based on D * Lite algorithm and improved DWA algorithm path planning method, device and equipment. Background Art
[0002] In recent years, with the rapid development of high-tech technologies such as artificial intelligence and chip integration, mobile robot technology has once again become a research direction that has attracted much attention. As an important technology in the field of mobile robots, path planning technology faces increasing challenges as the application scenarios of mobile robots become more diverse. The existing single path planning algorithm has problems such as insufficient real-time performance, poor path quality, and slow planning speed, which have become factors that restrict the further development of mobile robots.
[0003] For example, D * The Dstarlite algorithm is a global path planning algorithm used to find the optimal path. It adopts an incremental update idea similar to the LPA* algorithm while retaining the D * The algorithm's reverse search and "path field" maintenance, when the environmental information changes, D * The lite algorithm only needs to update a small part of the "path field" that is directly affected, which reduces a lot of calculations and improves the efficiency of path planning. However, due to the excessive information maintained by each node during the initial planning, the efficiency of the initial planning is often low when facing large and complex maps, and using D alone is not very efficient. * In the case of the lite algorithm, it is not possible to perform real-time obstacle avoidance when facing obstacles in the local environment.
[0004] For another example, the DWA (Dynamic Window Approach) algorithm is a local path planning algorithm suitable for mobile robots. The idea is to establish a dynamic window based on the robot's dynamic model and speed performance parameters (linear velocity, angular velocity, etc.). Combining this dynamic window with the robot's motion model, the algorithm can generate possible motion trajectories for the robot, and then evaluate these trajectories based on factors such as distance and collision risk, and select the best one from the candidate trajectories as the robot's path. However, since the local planning algorithm lacks consideration of the optimality of the global path, it is easy to fall into the local optimum, and the evaluation function of the DWA algorithm itself can only be set in advance and cannot dynamically adapt to the environment during operation.
[0005] Therefore, the existing path planning method still needs to be optimized to overcome the problems of insufficient real-time performance and poor path quality of a single path planning algorithm. Summary of the invention
[0006] In view of this, the purpose of the present invention is to provide a path planning method, device and equipment based on the D*lite algorithm and the improved DWA algorithm to overcome the problems of insufficient real-time performance and poor path quality of a single path planning algorithm.
[0007] To achieve the above objectives,
[0008] The present invention provides a method based on D * The path planning method of the lite algorithm and the improved DWA algorithm includes the following steps:
[0009] Step S1, loading a pre-stored multi-level map and obtaining basic position information of the mobile robot on the multi-level map; wherein the basic position information includes the current position, starting point, and end point;
[0010] Step S2, based on D * lite algorithm, generating global path planning information based on the multi-level map and the basic location information;
[0011] Step S3, based on the improved DWA algorithm, perform local path planning according to the global path planning information, and output and enable robot motion control instructions for local navigation;
[0012] Step S4, determining whether the mobile robot has reached the end point;
[0013] Step S5, if it has not been reached, determine whether an obstacle is currently encountered;
[0014] Step S6, if the obstacle is encountered, determining whether the global path planning information is feasible;
[0015] Step S7: If it is not feasible, update the current posture and the starting point, jump to step S2 and execute sequentially.
[0016] In some embodiments, after step S2 and before step S3, the method further includes:
[0017] Step S8, obtaining a global path point density according to the global path planning information, and determining whether the global path point density is greater than a first preset value;
[0018] Step S9: If it is greater than the first preset value, the global path points are thinned to update the global path planning information.
[0019] In some embodiments, step S6 further includes:
[0020] Step S10, if feasible, when the distance between the mobile robot and the obstacle during movement is less than a second preset value, the preset temporary yaw mode is enabled to avoid the obstacle; when the distance between the mobile robot and the obstacle during movement is greater than or equal to the second preset value, the preset regression global path mode is enabled to continue to use the global path planning information.
[0021] In some embodiments, step S5 further includes:
[0022] Step S11: If the obstacle is not encountered, jump to step S3 and execute sequentially to perform the next round of local navigation.
[0023] In some embodiments, in step S1, the process of loading the pre-stored multi-level map includes: initializing the current level of the multi-level map as the simplest level;
[0024] Step S2 includes:
[0025] Step S20, calculating the Euclidean distance between the starting point and the end point at the current level, and determining whether the Euclidean distance is less than a third preset value and whether the preset pathfinding length corresponding to the current level is less than or equal to the Euclidean distance;
[0026] Step S21, if the Euclidean distance is greater than or equal to a third preset value, and the preset path finding length is less than or equal to the Euclidean distance, determining whether there is a shortest path at the current level;
[0027] Step S22, if there is no shortest path, taking the next more detailed level as the current level, jumping to step S20 and executing sequentially until the shortest path is found;
[0028] Step S23, optimizing the shortest path to obtain global path planning information.
[0029] In some embodiments, after step S20, the method further includes:
[0030] Step S24, if the Euclidean distance is less than the third preset value, taking the most detailed layer as the current layer, and finding the shortest path on the current layer as the global path planning information;
[0031] Step S25, if the Euclidean distance is greater than or equal to the third preset value and the preset path finding length is greater than the Euclidean distance, then the next more detailed level is used as the current level, and the process jumps to step S20 and is executed sequentially until the shortest path is found.
[0032] In some embodiments, after step S22 and before step S23, the method further includes:
[0033] Step 26, determining whether the path refinement condition is met;
[0034] Step 27, if satisfied, the optimization process includes path refinement, redundant node deletion and path smoothing in sequence;
[0035] Step 28: If not satisfied, the optimization process includes sequentially deleting the redundant nodes and smoothing the path.
[0036] The present invention also provides a method based on D * The path planning device of the lite algorithm and the improved DWA algorithm includes:
[0037] The first processing unit is used to load a pre-stored multi-level map and obtain basic position information of the mobile robot on the multi-level map; wherein the basic position information includes a current position, a starting point, and an end point;
[0038] Generates a unit for D-based * lite algorithm, generating global path planning information based on the multi-level map and the basic location information;
[0039] A second processing unit is used to perform local path planning based on the improved DWA algorithm and the global path planning information, and output and enable robot motion control instructions for local navigation;
[0040] A first judging unit, used to judge whether the mobile robot has reached the end point;
[0041] The second judgment unit is used to judge whether an obstacle is encountered when the vehicle has not yet arrived;
[0042] A third judgment unit, used to judge whether the global path planning information is feasible when encountering the obstacle;
[0043] The third processing unit is used to update the current posture and the starting point when it is not feasible, and jump to the D-based * The lite algorithm generates the steps of global path planning information and executes them sequentially.
[0044] The present invention also provides a path planning device, comprising a memory and at least one processor, wherein the memory stores instructions; the at least one processor calls the instructions in the memory to enable the path planning device to execute the D-based * Path planning method of lite algorithm and improved DWA algorithm.
[0045] The present invention also provides a computer-readable storage medium storing instructions, which, when executed by a processor, implement the D-based *Path planning method of lite algorithm and improved DWA algorithm.
[0046] Compared with the prior art, the beneficial effect of the present invention is that by loading the pre-stored multi-level map and obtaining the basic position information of the mobile robot on the multi-level map, then based on D * lite algorithm, generates global path planning information based on multi-level maps and basic location information, and then, based on the improved DWA algorithm, performs local path planning based on the global path planning information, outputs and enables robot motion control instructions for local navigation, and then determines whether the mobile robot has reached the destination. If not, it determines whether it encounters an obstacle. If it encounters an obstacle, it determines whether the global path planning information is feasible. If not, it updates the current posture and starting point and jumps to the D-based * The lite algorithm generates the steps of global path planning information and executes them sequentially. The inventive concept of the above method is that based on multi-level maps with different resolutions, the algorithm first performs global path planning on low-resolution maps, and then successively improves and optimizes the path on high-resolution maps. After planning the optimal global path, it is passed to the local planning algorithm to achieve local obstacle avoidance, which not only retains the global optimality of the global planning algorithm, but also has the real-time obstacle avoidance capability of the local planning algorithm. BRIEF DESCRIPTION OF THE DRAWINGS
[0047] Figure 1 The present invention provides a D * Flowchart of the path planning method of the lite algorithm and the improved DWA algorithm;
[0048] Figure 2 is a schematic diagram of path refinement in the path planning method provided by the present invention;
[0049] Figure 3 is a schematic diagram of performing sparse processing in the path planning method provided by the present invention;
[0050] Figure 4 The present invention provides a D * Schematic diagram of the structure of the path planning device of the lite algorithm and the improved DWA algorithm. DETAILED DESCRIPTION
[0051] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0052] The embodiment of the present invention provides a method based on D * lite algorithm and improved DWA algorithm path planning method, such as Figure 1 As shown, the following steps are included:
[0053] Step S1, load a pre-stored multi-level map, and obtain basic position information of the mobile robot on the multi-level map; wherein the basic position information includes the current position, starting point, and end point.
[0054] In this step: (1) Multi-level map is a map that organizes and represents environmental information in a hierarchical manner. It provides a detailed and organized description of the environment by dividing the map information into different levels (or layers), each level representing information of different scales or categories. Multi-level maps include multi-level static maps and multi-level dynamic maps. More specifically, static maps are relatively fixed maps that show the state of the environment at a certain point in time or time period, but are not updated in real time over time; dynamic maps are maps that are updated in real time or can be interacted with by users, and can reflect the immediate state or changes of the environment. In some embodiments, the multi-level map is an offline a priori map. As a multi-level static map, the offline a priori map can, firstly, perform path planning and navigation without a network connection or real-time data source; secondly, provide sufficient information for long-term unchanged geographical features such as buildings, streets, rivers, etc.; thirdly, reduce the computational burden and improve the response speed of the navigation system in the absence of real-time data processing requirements. (2) Basic location information, which can be obtained by, but is not limited to, GPS, laser radar, and cameras. Position is the combination of position and posture. The starting point and end point can be manually input by the user or determined by clicking on a specific location point on a map. They are generally set in advance by the user. In addition, before obtaining the basic location information, the corresponding program will be run to open the channel between the upper computer and the underlying control module in the mobile robot to ensure the smooth transmission of subsequent data.
[0055] Step S2, based on D * Lite algorithm generates global path planning information based on multi-level maps and basic location information.
[0056] Step S3, based on the improved DWA algorithm, local path planning is performed according to the global path planning information, and the robot motion control instructions for local navigation are output and enabled.
[0057] In this step: (1) Improving the DWA algorithm refers to optimizing or improving the traditional DWA algorithm to improve its performance or applicability in specific scenarios. (2) The robot motion control instructions are generated segment by segment to guide the robot to perform the corresponding motion actions in the current time period, and after updating the robot's state, the next stage of motion control is realized.
[0058] Step S4, determining whether the mobile robot has reached the end point.
[0059] Step S5: If the target has not been reached, determine whether an obstacle is currently encountered.
[0060] Step S6: If an obstacle is encountered, determine whether the global path planning information is feasible.
[0061] In this step, the global path planning information is generated for a static environment. If a dynamic obstacle (such as a moving person or vehicle) is encountered, the dynamic obstacle may prevent the robot from using the original global path planning information. Therefore, it is necessary to check the global path planning information to confirm whether the current path is still the best and feasible choice.
[0062] Step S7: If it is not feasible, update the current posture and starting point, jump to step S2 and execute sequentially.
[0063] In this step, by regenerating the global path planning information, the robot can replan in time when facing environmental changes or unexpected situations to avoid potential collisions or navigation failures.
[0064] Compared with the prior art, the beneficial effect of the present invention is that by loading the pre-stored multi-level map and obtaining the basic position information of the mobile robot on the multi-level map, then based on D * lite algorithm, generates global path planning information based on multi-level maps and basic location information, and then, based on the improved DWA algorithm, performs local path planning based on the global path planning information, outputs and enables robot motion control instructions for local navigation, and then determines whether the mobile robot has reached the destination. If not, it determines whether it encounters an obstacle. If it encounters an obstacle, it determines whether the global path planning information is feasible. If not, it updates the current posture and starting point and jumps to the D-based * The lite algorithm generates the steps of global path planning information and executes them sequentially. The inventive concept of the above method is that based on multi-level maps with different resolutions, the algorithm first performs global path planning on low-resolution maps, and then successively improves and optimizes the path on high-resolution maps. After planning the optimal global path, it is passed to the local planning algorithm to achieve local obstacle avoidance, which not only retains the global optimality of the global planning algorithm, but also has the real-time obstacle avoidance capability of the local planning algorithm.
[0065] In some embodiments, after step S2 and before step S3, the method further includes:
[0066] Step S8, obtaining the global path point density according to the global path planning information, and determining whether the global path point density is greater than a first preset value.
[0067] In this step, if the density of path points is too high, that is, the distance between path points is too small, although this may provide a more accurate path description, when applying the improved DWA algorithm, it will cause the search space to be too complex and large, increase the computational cost and operation time, and reduce the real-time performance.
[0068] Step S9: If it is greater than the first preset value, the global path points are sparsely processed to update the global path planning information.
[0069] In this step, the Douglas-Peucker algorithm can be used to thin out the waypoints, thereby optimizing the distribution of the waypoints. Figure 3 A schematic diagram of the sparsification process is provided.
[0070] In some embodiments, after step S6, the following further includes: step S10, if feasible, when the distance between the mobile robot and the obstacle during the movement is less than a second preset value, the preset temporary yaw mode is enabled to avoid the obstacle, and when the distance between the mobile robot and the obstacle during the movement is greater than or equal to the second preset value, the preset regression global path mode is enabled to continue to use the global path planning information. The above process effectively improves the navigation capability of the mobile robot in a complex environment by combining real-time, flexibility and safety, so that it can quickly respond to changing environmental conditions and maintain a good path tracking effect.
[0071] In some embodiments, step S5 further includes:
[0072] Step S11: If no obstacle is encountered, jump to step S3 and execute sequentially to perform the next round of local navigation.
[0073] In some embodiments, in step S1, the process of loading a pre-stored multi-level map includes: initializing a current level of the multi-level map as the simplest level;
[0074] Step S2 includes:
[0075] Step S20, calculating the Euclidean distance between the starting point and the end point on the current level, and determining whether the Euclidean distance is less than a third preset value and whether the preset pathfinding length corresponding to the current level is less than or equal to the Euclidean distance.
[0076] In this step: (1) Euclidean distance refers to the straight-line distance between two points in Euclidean space, which is used to measure the "shortest path" between two points in a plane or space. (2) The preset path search length is used to limit the maximum length of the search path. By setting the maximum search length, the algorithm only searches for paths within this range, thereby controlling computing resources and time.
[0077] Step S21: if the Euclidean distance is greater than or equal to the third preset value, and the preset path search length is less than or equal to the Euclidean distance, it is determined whether there is a shortest path at the current level.
[0078] In this step: (1) The Euclidean distance is greater than or equal to the third preset value, indicating that a higher resolution map is not required for detailed path planning at this time, and it is possible to find the shortest path at the current level. The preset path finding length is less than or equal to the Euclidean distance. (2) The preset path finding length is less than or equal to the Euclidean distance, which also indicates that a higher resolution map is not required for detailed path planning at this time, and it is possible to find the shortest path at the current level. Through double judgment, it is helpful to improve the accuracy and efficiency of path query.
[0079] Step S22: If there is no shortest path, the next more detailed level is used as the current level, and the process jumps to step S20 and is executed sequentially until the shortest path is found.
[0080] Step S23, optimizing the shortest path to obtain global path planning information.
[0081] In some embodiments, an area with a radius of a fourth preset value and a starting point as the center is taken as the first target area, and the process of loading the pre-stored multi-level map further includes: searching for obstacles in the first target area, and setting the size of the obstacles to infinity. Setting the size of the identified obstacles to infinity means that these areas are considered to be impassable, which can ensure the safety and effectiveness of the path planning process, and at the same time simplify the path planning process and avoid complex obstacle avoidance logic processing.
[0082] In some embodiments, after step S20, the method further includes:
[0083] Step S24: If the Euclidean distance is less than the third preset value, the most detailed layer is used as the current layer, and the shortest path on the current layer is found as the global path planning information.
[0084] In this step, if the Euclidean distance is too small, it means that the distance between the starting point and the end point is very close. In this case, the most detailed layer is selected to calculate the shortest path in order to obtain higher path precision and navigation accuracy, avoid potential collision risks, and ensure safe and reliable arrival at the end point.
[0085] Step S25, if the Euclidean distance is greater than or equal to the third preset value and the preset path finding length is greater than the Euclidean distance, the next more detailed level is taken as the current level, and the process jumps to step S20 and is executed sequentially until the shortest path is found.
[0086] In some embodiments, after step S22 and before step S23, the method further includes:
[0087] Step 26, determining whether the path refinement condition is met.
[0088] In this step, the path refinement condition to be satisfied may be that the current level is not the most detailed level and the path finding time does not exceed the fifth preset value. The reason for this setting is that if the current level is already the most detailed level, the generated planning information is already the most detailed and no further refinement is required. If the path finding time exceeds the fifth preset value, it means that it has had a negative impact on the response speed. At this time, the response speed needs to be taken into consideration and no further refinement is required.
[0089] Step 27: If satisfied, the optimization process includes path thinning, redundant node deletion, and path smoothing in sequence.
[0090] In this step:
[0091] (1) The path refinement process may be to take the area with the current node as the center and the radius as the sixth preset value as the second target area, preset the starting point as the origin and the local search radius as the seventh preset value, traverse the nodes included in the global path planning information, add other path points in each second target area to the refined path list, until the local search radius is exceeded or the path points in each second target area are exhausted, and add the untraversed nodes to the end of the refined path list to keep the path complete. The path refinement process can optimize the initial path through a more detailed local search to make it more suitable for actual navigation and obstacle avoidance needs. Figure 4 A schematic diagram of the path refinement is provided.
[0092] Furthermore, after completing the refinement of the path list at the current level, you can traverse more detailed levels step by step to try to refine the path. If the time limit is exceeded or all levels have been traversed, the refinement is stopped. Finally, the refined path is inserted at the beginning of the initial path to ensure that it is refined step by step.
[0093] (2) The process of deleting redundant nodes can be to check whether there is a straight line of sight between the current node and the next node. If so, the next node is deleted and the current node and the second subsequent node are connected. A straight line of sight means that there is no obstacle blocking the way from one node to another and the two nodes can be seen directly. By checking the straight line of sight, the number of nodes in the path can be reduced, thereby reducing the amount of calculation and improving navigation efficiency.
[0094] (3) The process of smoothing the path can be to fit the path using Catmull-Rom spline curves and smooth the updated path. Catmull-Rom spline curves can pass through all control points (i.e., key nodes on the path), so they can maintain the overall shape and characteristics of the original path, and can generate a smooth path, reducing sharp turns and unnecessary twists and turns encountered by the robot during navigation, thereby making the movement smoother.
[0095] Step 28: If not satisfied, the optimization process includes sequentially deleting redundant nodes and smoothing the path.
[0096] In some embodiments, after step 27 and step 28, it further includes: determining whether the starting point and the end point in the path list are consistent. If they are inconsistent, traversing each node in the generated smooth path one by one, setting the currently traversed node as the new starting point in the path list in real time, and calculating the Euclidean distance between the current node and the next node, and adding it to the total cost. The aforementioned process is not only about adjusting the starting point of the path, but also involves evaluating the pros and cons of the path to ensure that the most suitable path is selected to complete the navigation task.
[0097] The embodiment of the present invention provides a method based on D * lite algorithm and improved DWA algorithm path planning device, such as Figure 4 As shown, including:
[0098] The first processing unit 100 is used to load a pre-stored multi-level map and obtain basic position information of the mobile robot on the multi-level map; wherein the basic position information includes a current position, a starting point, and an end point;
[0099] The generating unit 101 is used to generate * Lite algorithm generates global path planning information based on multi-level maps and basic location information;
[0100] The second processing unit 102 is used to perform local path planning based on the improved DWA algorithm and the global path planning information, and output and enable the robot motion control instructions for local navigation;
[0101] The first judging unit 103 is used to judge whether the mobile robot has reached the end point;
[0102] The second judgment unit 104 is used to judge whether an obstacle is currently encountered when the vehicle has not yet arrived;
[0103] The third judgment unit 105 is used to judge whether the global path planning information is feasible when encountering an obstacle;
[0104] The third processing unit 106 is used to update the current posture and starting point when it is not feasible, and jump to the D-based * The lite algorithm generates the steps of global path planning information and executes them sequentially.
[0105] The path planning device provided in this embodiment applies the D-based *The path planning method of the lite algorithm and the improved DWA algorithm, therefore, at least has the advantages of this method, that is, based on multi-level maps of different resolutions, the algorithm prioritizes global path planning on low-resolution maps, and then successively improves and optimizes the path on high-resolution maps. After planning the optimal global path, it is passed to the local planning algorithm to achieve local obstacle avoidance, which not only retains the global optimality of the global planning algorithm, but also has the real-time obstacle avoidance capability of the local planning algorithm.
[0106] An embodiment of the present invention provides a path planning device, including a memory and at least one processor, wherein the memory stores instructions; the at least one processor calls the instructions in the memory to enable the path planning device to execute the D-based * Path planning method of lite algorithm and improved DWA algorithm.
[0107] The path planning device provided in this embodiment applies the D-based * The path planning method of the lite algorithm and the improved DWA algorithm, therefore, at least has the advantages of this method, that is, based on multi-level maps of different resolutions, the algorithm prioritizes global path planning on low-resolution maps, and then successively improves and optimizes the path on high-resolution maps. After planning the optimal global path, it is passed to the local planning algorithm to achieve local obstacle avoidance, which not only retains the global optimality of the global planning algorithm, but also has the real-time obstacle avoidance capability of the local planning algorithm.
[0108] An embodiment of the present invention provides a computer-readable storage medium storing instructions, which, when executed by a processor, implement the D-based * Path planning method of lite algorithm and improved DWA algorithm.
[0109] The computer-readable storage medium provided in this embodiment uses the D-based * The path planning method of the lite algorithm and the improved DWA algorithm, therefore, at least has the advantages of this method, that is, based on multi-level maps of different resolutions, the algorithm prioritizes global path planning on low-resolution maps, and then successively improves and optimizes the path on high-resolution maps. After planning the optimal global path, it is passed to the local planning algorithm to achieve local obstacle avoidance, which not only retains the global optimality of the global planning algorithm, but also has the real-time obstacle avoidance capability of the local planning algorithm.
[0110] In addition, the storage medium includes: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and other media that can store program codes.
[0111] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described devices, equipment and storage media can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0112] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.
Claims
1. A D-based * The path planning method of the lite algorithm and the improved DWA algorithm is characterized in that: The steps include: Step S1, loading a pre-stored multi-level map and obtaining basic position information of the mobile robot on the multi-level map; wherein the basic position information includes the current position, starting point, and end point; Step S2, based on D * lite algorithm, generating global path planning information based on the multi-level map and the basic location information; Step S3, based on the improved DWA algorithm, perform local path planning according to the global path planning information, and output and enable robot motion control instructions for local navigation; Step S4, determining whether the mobile robot has reached the end point; Step S5, if it has not been reached, determine whether an obstacle is currently encountered; Step S6, if the obstacle is encountered, determining whether the global path planning information is feasible; Step S7: If it is not feasible, update the current posture and the starting point, jump to step S2 and execute sequentially.
2. The D-based method according to claim 1 * The path planning method of the lite algorithm and the improved DWA algorithm is characterized in that: After step S2 and before step S3, the method further includes: Step S8, obtaining a global path point density according to the global path planning information, and determining whether the global path point density is greater than a first preset value; Step S9: If it is greater than the first preset value, the global path points are thinned to update the global path planning information.
3. The D-based method according to claim 1 * The path planning method of the lite algorithm and the improved DWA algorithm is characterized in that: After step S6, the following steps are also included: Step S10, if feasible, when the distance between the mobile robot and the obstacle during movement is less than a second preset value, the preset temporary yaw mode is enabled to avoid the obstacle; when the distance between the mobile robot and the obstacle during movement is greater than or equal to the second preset value, the preset regression global path mode is enabled to continue to use the global path planning information.
4. The D-based method according to claim 1 * The path planning method of the lite algorithm and the improved DWA algorithm is characterized in that: After step S5, the following steps are also included: Step S11: If the obstacle is not encountered, jump to step S3 and execute sequentially to perform the next round of local navigation.
5. The D-based method according to claim 1 * The path planning method of the lite algorithm and the improved DWA algorithm is characterized in that: In step S1, the process of loading the pre-stored multi-level map includes: initializing the current level of the multi-level map as the simplest level; Step S2 includes: Step S20, calculating the Euclidean distance between the starting point and the end point at the current level, and determining whether the Euclidean distance is less than a third preset value and whether the preset pathfinding length corresponding to the current level is less than or equal to the Euclidean distance; Step S21, if the Euclidean distance is greater than or equal to a third preset value, and the preset path finding length is less than or equal to the Euclidean distance, determining whether there is a shortest path at the current level; Step S22, if there is no shortest path, taking the next more detailed level as the current level, jumping to step S20 and executing sequentially until the shortest path is found; Step S23, optimizing the shortest path to obtain global path planning information.
6. The D-based method according to claim 5 * The path planning method of the lite algorithm and the improved DWA algorithm is characterized in that: After step S20, the method further includes: Step S24, if the Euclidean distance is less than the third preset value, taking the most detailed layer as the current layer, and finding the shortest path on the current layer as the global path planning information; Step S25, if the Euclidean distance is greater than or equal to the third preset value and the preset path finding length is greater than the Euclidean distance, then the next more detailed level is used as the current level, and the process jumps to step S20 and is executed sequentially until the shortest path is found.
7. The D-based method according to claim 5. * The path planning method of the lite algorithm and the improved DWA algorithm is characterized in that: After step S22 and before step S23, the following steps are also included: Step 26, determining whether the path refinement condition is met; Step 27, if satisfied, the optimization process includes path refinement, redundant node deletion and path smoothing in sequence; Step 28: If not satisfied, the optimization process includes sequentially deleting the redundant nodes and smoothing the path.
8. A D-based * lite algorithm and improved DWA algorithm path planning device, characterized in that: include: The first processing unit is used to load a pre-stored multi-level map and obtain basic position information of the mobile robot on the multi-level map; wherein the basic position information includes a current position, a starting point, and an end point; Generates a unit for D-based * lite algorithm, generating global path planning information based on the multi-level map and the basic location information; A second processing unit is used to perform local path planning based on the improved DWA algorithm and the global path planning information, and output and enable robot motion control instructions for local navigation; A first judging unit, used to judge whether the mobile robot has reached the end point; The second judgment unit is used to judge whether an obstacle is encountered when the vehicle has not yet arrived; A third judgment unit, used to judge whether the global path planning information is feasible when encountering the obstacle; The third processing unit is used to update the current posture and the starting point when it is not feasible, and jump to the D-based * The lite algorithm generates the steps of global path planning information and executes them sequentially.
9. A path planning device, characterized in that: The invention comprises a memory and at least one processor, wherein the memory stores instructions; the at least one processor calls the instructions in the memory so that the path planning device executes the D-based method according to any one of claims 1 to 7. * Path planning method of lite algorithm and improved DWA algorithm.
10. A computer-readable storage medium storing instructions, characterized in that: When the instructions are executed by the processor, the D-based * Path planning method of lite algorithm and improved DWA algorithm.
