Mobile device path planning method, storage medium and system
By optimizing robot path planning through gridding and dynamic window evaluation functions, the problems of low computational efficiency and path redundancy in existing technologies are solved, achieving more efficient path search and optimal path selection in narrow passages.
Patent Information
- Application Number
- CN202410936453.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-12
- Publication Date
- 2024-11-12
AI Technical Summary
Existing robot path planning algorithms search for too many nodes in high-precision maps, resulting in low computational efficiency. Local optimal selection leads to global path redundancy, and the algorithm fails to obtain the optimal path in narrow passages.
The grid is formed by rasterization, the passability status of the grid is marked, adjacent grid clusters are obtained, intermediate target grid groups are obtained based on the connection between the real-time starting point and the target position, the local path is evaluated by the dynamic window method velocity space evaluation function G(vi,ωi), and the planned path is selected.
It significantly reduces the number of global path planning search grids, improves search efficiency, optimizes path planning in narrow passages, and obtains better paths.
Smart Images

Figure CN118936469A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of automatic path planning, and in particular relates to a mobile device path planning method, storage medium and system. Background Art
[0002] Path planning is the core of autonomous robot navigation, and its ultimate goal is to calculate the best path from the starting point to the destination in a complex environment.
[0003] At present, the development of robot path planning is mainly based on ROS communication. Within the ROS framework, Willow Garage launched Move Base to facilitate robot navigation and path planning. Based on Move Base, Pütz S proposed MoveBase Flex, which provides greater flexibility and scalability. Early path planning mainly used precise mapping methods such as visibility graphs, Voronoi diagrams, Delaunay triangulations, and adaptive roadmaps, which are designed to capture the connectivity of the robot's search space. Search algorithms such as Dijkstra and A* are used to find the optimal solution in the connected graph. Graph search methods involve discretization of the workspace, and their performance tends to degrade in high dimensions. Effective discretization may sacrifice completeness, and high-resolution discretization is computationally expensive. The emergence of new computational methods has promoted their application in path planning. Methods such as fuzzy logic control, RRT algorithm, state lattice method, PRM algorithm, neural network, genetic algorithm, ant colony optimization, and simulated annealing have been applied to robot path planning.
[0004] However, the above scheme has the following defects that cannot be ignored in its specific implementation: 1. In high-precision maps, the computational efficiency is affected because there are too many search nodes. In addition, the existing scheme is a greedy algorithm that selects the current optimal path at each state. This local optimal selection may cause the path to change in the subsequent search process, resulting in a large number of global path plans, resulting in low search efficiency; 2. After the local optimal is obtained, the planned path is directly connected, and the unnecessary path redundancy generated after the local connection is returned to the global level is not paid attention to; 3. When the optimal planned path is required in a narrow channel formed between obstacles, only the minimum distance between the own contour and the obstacle is paid attention to, and the better path obtained by passing through the narrow environment is missed. Summary of the invention
[0005] In view of the deficiencies in the prior art, the present invention provides a mobile device path planning method, storage medium and system, which can select a planned path based on the shortest target path and the least change in motion state, thereby reducing the number of global path planning search grids and significantly improving search efficiency.
[0006] To achieve the above object, the present invention provides the following technical solutions:
[0007] A mobile device path planning method is used to plan a path between a predetermined mobile device and a predetermined target location, characterized in that it includes the following steps:
[0008] Step S1: identifying a predetermined area including a predetermined mobile device and a predetermined target position, and rasterizing the predetermined area to form a rasterized area;
[0009] Step S2: In the gridded area, traverse all grids, calibrate the center coordinates as grid coordinates, calibrate the passable state of the grid; and calibrate the coordinates of the predetermined target position as the target position, thereby forming a planning data map;
[0010] Step S3: obtaining the grid coordinates and moving direction of the current predetermined mobile device as the real-time starting position and the real-time moving direction, respectively, and simultaneously obtaining all grid coordinates adjacent to the real-time starting position as adjacent grid clusters;
[0011] Step S4: acquiring a first intermediate target grid group in the adjacent grid cluster based on the connection line between the real-time starting position and the target position, acquiring a second intermediate target grid group based on the real-time moving direction, and acquiring an adjacent target position based on the first intermediate target grid group and the second intermediate target grid group;
[0012] Step S5: Repeat step S4 until the current adjacent target position is the target position.
[0013] Preferably, in step S2, the grid passability status is divided into "passable" and "inpassable". When there is an obstacle at the location of the grid that makes the predetermined mobile device impassable, the grid passability status is divided into "inpassable", and the rest is "passable".
[0014] Preferably, step S4 includes the following sub-steps:
[0015] Step S4-1: Divide the entire circumference of the starting point into n consecutive and closed angle domains;
[0016] Step S4-2: obtaining a line connecting the real-time starting position and the target position, and the grids that the line passes through in the adjacent grid cluster and all grids adjacent to the grid in the adjacent grid cluster together form a first intermediate target grid group;
[0017] Step S4-3: obtaining the grids that the extended line of the real-time moving direction passes through in the adjacent grid cluster, and all grids adjacent to the grid in the adjacent grid cluster, and forming a second intermediate target grid group together;
[0018] Step S4-4: Delete the redundant grids of the first intermediate target grid group and the second intermediate target grid group to form adjacent target positions.
[0019] Further, in step S4-1, n is 8, and the angle domain is a 45° sector;
[0020] In step S4-2, the expression of the line connecting the real-time starting position and the target position is as follows:
[0021]
[0022] θ is the direction angle of the connecting line, (x E ,y E ) is the target position, (x s ,y s ) is the real-time starting position.
[0023] Furthermore, when there are multiple adjacent target positions, one of the adjacent target positions is selected by a heuristic function.
[0024] Furthermore, the present invention further comprises step S6: positioning the initial position of the predetermined device and the adjacent target position as {P i , i=0,1,2…n}, define {P j ,j=1,2…(n-1)}, traverse P j , if P j Not on straight line P j-1 P j+1 On the straight line P j-1 P j+1 If all grids passed are in the "passable" state, delete P j Otherwise, keep P j .
[0025] Furthermore, the present invention further comprises step S7: all the reserved P i The lines are connected to form a planned path, and the speed space evaluation function G(v i ,ω i ) evaluates the local path of the planned path and based on G(v i ,ω i ) to select:
[0026] G(v i ,ω i )=
[0027] σ[α·heading(v i ,ω i )+β·dist(v i ,ω i )+γ·velocity(vi ,ω i )+δ·moving(v i ,ω i )]
[0028] heading(v i ,ω i )=π-Δθ
[0029] △θ is the angle difference between the tangent line at the end point of the planned path and the target position;
[0030] dist(v i ,ω i )=min(norm(p r +v·Δt·[cos(ω·Δt),sin(ω·Δt)]-p o,i ))
[0031] p r is the current location of the predetermined mobile device; o,i is the i-th "inaccessible" location; norm() is the Euclidean distance function, which is used to calculate the straight-line distance between two points, and △t is the time step of the planned path prediction;
[0032] velocity(v i ,ω i )=|v|
[0033] v is the current linear velocity
[0034]
[0035] α, β, γ, δ are G(v i ,ω i ), σ is the weight coefficient of each item in the equation, v i is the linear velocity of the ith acquisition point, ω i is the angular velocity of the i-th acquisition point, and based on moving(v i ,ω i ) is used to determine the direction change angle of the local path.
[0036] Furthermore, the maximum / minimum speed v of the predetermined mobile device m for:
[0037] v m ={(v,ω)|v∈[v min ,v max ],ω∈[ω min ,ω max ]}
[0038] Predetermined maximum / minimum speed v of mobile device based on accelerationd for:
[0039]
[0040] Predetermined maximum / minimum speed v of the mobile device based on the braking distance m for:
[0041]
[0042] A path planning storage medium stores a computer program / instruction thereon, wherein the computer program / instruction implements the steps of the above-mentioned mobile device path planning method when executed by a processor.
[0043] A path planning system includes an IMU module, a wheel speed sensor, a laser radar, a memory, a processor and a computer program stored in the memory, characterized in that the processor executes the computer program to implement the steps of the above-mentioned mobile device path planning method.
[0044] Compared with the prior art, the present invention has the following beneficial effects:
[0045] 1. Because the mobile device path planning method of the present invention includes the following steps: first, a predetermined area is rasterized to form a rasterized area; then, in the rasterized area, all grids are traversed, grid coordinates are calibrated, grid passability is calibrated, and target positions are calibrated, thereby forming a planning data map; then, a real-time starting point position and a real-time moving direction are obtained, and adjacent grid clusters are obtained at the same time; then, based on the connection line between the real-time starting point position and the target position, a first intermediate target grid group is obtained in the adjacent grid cluster, based on the real-time moving direction, a second intermediate target grid group is obtained, and based on the first intermediate target grid group and the second intermediate target grid group, an adjacent target position is obtained. ; Finally, repeat the previous step until the current adjacent target position is the target position. Obviously, the selection of the first intermediate target grid group is based on the shortest target path, that is, the line connecting the real-time starting position and the target position is the shortest distance between the two positions, and the selection of the second intermediate target grid group is based on the least change in motion state, that is, the least change in motion direction compared to the real-time starting position, and the adjacent target position is obtained based on the first intermediate target grid group and the second intermediate target grid group. Therefore, the present invention can select a planned path based on the shortest target path and the least change in motion state, thereby reducing the number of search grids for global path planning and significantly improving search efficiency.
[0046] 2. Because in step S6 of the present invention: the initial position of the predetermined device and the adjacent target position are positioned as {P i , i=0,1,2…n}, define {P j ,j=1,2…(n-1)}, traverse P j , if P jNot on straight line P j-1 P j+1 On the straight line P j-1 P j+1 If all grids passed are in the "passable" state, delete P j Otherwise, keep P j Therefore, the present invention obtains the planned path through local optimization, and deletes the planned path when returning to the global level, so that the continuous path of the two sides of the triangle forms a single straight line path, thereby making the final planned path better.
[0047] 3. Because the present invention will all retain P i The lines are connected to form a planned path, and the speed space evaluation function G(v i ,ω i ) evaluates and selects the local path of the planned path, and G(v i ,ω i ) is heading(v i ,ω i ),dist(v i ,ω i ), velocity(v i ,ω i ) and moving(v i ,ω i ) function, and heading(v i ,ω i ) and the angle between the tangent line of the real-time moving direction and the line connecting the predetermined moving device and the target position; dist(v i ,ω i ) and the shortest distance between the potential planning path and the "inaccessible" grid; moving(v i ,ω i ) is linearly related to the tangent of the real-time moving direction and the angle of the current movement trend direction, and each sub-function is weighted by a preset weight coefficient. Therefore, when the optimal planning path is required in a narrow passage formed by multiple obstacles, the predetermined moving device of the present invention can obtain a better planning path based on the comprehensive consideration of the orientation angle of the target position relative to itself, the size of the change in the movement trend angle, and the minimum distance between its own contour and the obstacle, and through the adjustable preset weight coefficient, G(v i ,ω i ) can be adjusted more flexibly according to actual scenario conditions. BRIEF DESCRIPTION OF THE DRAWINGS
[0048] Figure 1 A schematic diagram of the steps of a mobile device path planning method according to an embodiment of the present invention;
[0049] Figure 2 A schematic diagram of a planning data map according to an embodiment of the present invention;
[0050] Figure 3 A schematic diagram of obtaining a first intermediate target grid group according to an embodiment of the present invention;
[0051] Figure 4 A schematic diagram of obtaining a second intermediate target grid group according to an embodiment of the present invention;
[0052] Figure 5 A schematic diagram of obtaining an adjacent target position according to an embodiment of the present invention;
[0053] Figure 6 A schematic diagram of obtaining a planning path according to an embodiment of the present invention;
[0054] Figure 7 G(v) of the embodiment of the present invention i ,ω i ) is an illustration of the physical meaning of . DETAILED DESCRIPTION
[0055] In order to make the technical means, creative features, objectives and effects achieved by the present invention easy to understand, the following embodiments and the accompanying drawings specifically illustrate the mobile device path planning method, storage medium and system of the present invention. It should be noted that the description of these implementation methods is used to help understand the present invention, but does not constitute a limitation of the present invention.
[0056] like Figure 1 As shown, the mobile device path planning method S100 in this embodiment is used to plan a path between a predetermined mobile device and a predetermined target location.
[0057] The mobile device path planning method S100 includes the following steps:
[0058] Step S1: identifying a predetermined area including a predetermined mobile device and a predetermined target location, and performing a rasterization process on the predetermined area to form a rasterized area.
[0059] Step S2: In the gridded area, traverse all grids, calibrate the center coordinates as the grid coordinates, calibrate the grid passability status; and calibrate the coordinates of the predetermined target position as the target position, so as to form the following Figure 2 Planning data map shown.
[0060] The passable status of the grid is divided into two types: "passable" and "inpassable". When there is an obstacle at the location of the grid that makes it impossible for the predetermined mobile device to pass, the passable status of the grid is divided into "inpassable", and the rest is "passable".
[0061] Specifically, the rasterization of the area and the coordinate calibration of the grid are achieved through lidar, and the planning data map also defines a reference direction (not shown in the accompanying drawings), which is defined by a magnetometer. When there are obstacles on the grid that prevent the intended mobile device from passing through, the grid is calibrated as "impassable".
[0062] Step S3: obtaining the grid coordinates and moving direction of the current predetermined mobile device as the real-time starting position and the real-time moving direction respectively, and simultaneously obtaining all grid coordinates adjacent to the real-time starting position as adjacent grid clusters.
[0063] Specifically, the real-time moving direction is realized by a magnetometer. In this embodiment, if there are adjacent grids around the real-time starting point position, the adjacent grid cluster includes 8 grids.
[0064] Step S4: Obtain a first intermediate target grid group in an adjacent grid cluster based on the line connecting the real-time starting position and the target position, obtain a second intermediate target grid group based on the real-time moving direction, and obtain an adjacent target position based on the first intermediate target grid group and the second intermediate target grid group.
[0065] Step S4 includes the following sub-steps:
[0066] Step S4-1: Divide the entire circumference of the starting point into n consecutive and closed angle domains, where n is 8 and the angle domain is a 45° sector.
[0067] Specifically, each angle domain corresponds to a grid in an adjacent grid cluster. When the adjacent target position is determined, the local moving path of the predetermined mobile device is a plurality of fan-shaped trajectory clusters. Therefore, by setting the angle domain, it can better conform to the actual moving condition of the predetermined mobile device, that is, based on the moving path within a certain angle domain, to determine and realize its movement to the adjacent grid, and when the predetermined mobile device changes the real-time direction of movement, due to the limitations of speed and acceleration, not all local moving paths can be realized.
[0068] Step S4-2: Figure 3 As shown, a line connecting the real-time starting position and the target position is obtained, and the grids passed by the line in the adjacent grid cluster and all grids adjacent to the grid in the adjacent grid cluster together form a first intermediate target grid group.
[0069] The expression of the line connecting the real-time starting position and the target position is as follows:
[0070]
[0071] θ is the direction angle of the connecting line, (x E ,y E ) is the target position, (x s ,ys ) is the real-time starting position.
[0072] When there are multiple adjacent target positions, one of the adjacent target positions is selected by a heuristic function.
[0073] Specifically, the first intermediate target grid group is obtained based on the minimum distance planning path to infer the adjacent grid to which the predetermined mobile device moves, and the two grids with the adjacent grid are combined and considered as alternative intermediate targets. Since the speed and acceleration of the predetermined mobile device and whether the grid is in a "passable" state must also be considered, an appropriate number of "alternative" intermediate targets must be given.
[0074] Step S4-3: Figure 4 As shown, the grids through which the extended line of the real-time moving direction passes in the adjacent grid cluster and all grids adjacent to the grid in the adjacent grid cluster together form a second intermediate target grid group.
[0075] Specifically, the second intermediate target grid group is obtained based on the planned path that produces the smallest change in motion direction based on the real-time moving direction, that is, the moving state of the predetermined mobile device remains relatively constant, and the two grids with the adjacent grid are combined and considered as alternative intermediate targets.
[0076] Step S4-4: Figure 5 As shown, the redundant grids of the first intermediate target grid group and the second intermediate target grid group are deleted to form adjacent target positions. In this embodiment, the first intermediate target grid group has three grids and the second intermediate target grid group has three grids. After merging, two grids are redundant in each group. The two grids are deleted and the remaining grids are retained as alternatives for the intermediate targets.
[0077] Step S5: Repeat step S4 until the current adjacent target position is the target position, specifically, a continuous series of adjacent grids from the real-time starting position to the target position are selected according to the above-mentioned principle of selecting intermediate targets.
[0078] Step S6: Positioning the initial position of the predetermined device and the adjacent target position as {P i , i=0,1,2…n}, define {P j ,j=1,2…(n-1)}, traverse P j , if P j Not on straight line P j-1 P j+1 On the straight line P j-1 P j+1 If all grids passed are in the "passable" state, delete P j Otherwise, keep P j.
[0079] like Figure 6 As shown, {P n ,P n+1 ,P n+2 ,P n+3} is a continuous series of adjacent grids. The function of this step is to form a single straight line path from the continuous path of two sides of a triangle when the adjacent grid line passes through the "passable" grid. When the adjacent grid line passes through the "inpassable" grid, the original continuous path of two sides of a triangle is still retained.
[0080] Step S7: All the reserved P i The lines are connected to form a planned path, and the speed space evaluation function G(v i ,ω i ) evaluates the local path of the planned path and based on G(v i ,ω i )Select each partial path:
[0081] G(v i ,ω i )=
[0082] σ[α·heading(v i ,ω i )+β·dist(v i ,ω i )+γ·velocity(v i ,ω i )+δ·moving(v i ,ω i )]
[0083] heading(v i ,ω i )=π-Δθ
[0084] △θ is the angle difference between the tangent line at the end point of the planned path and the target position;
[0085] dist(v i ,ω i )=min(norm(p r +v·Δt·[cos(ω·Δt),sin(ω·Δt)]-p o,i ))
[0086] p r is the current location of the predetermined mobile device; o,i is the i-th "inaccessible" location; norm() is the Euclidean distance function, which is used to calculate the straight-line distance between two points, and △t is the time step of the planned path prediction;
[0087] velocity(v i ,ω i )=|v|
[0088] v is the current linear velocity
[0089]
[0090] α, β, γ, δ are G(v i ,ω i ), σ is the weight coefficient of each item in the equation, v i is the linear velocity of the ith acquisition point, ω i is the angular velocity of the i-th acquisition point, and based on moving(v i ,ω i ) is used to determine the direction change angle of the local path.
[0091] Predetermine the maximum / minimum speed v of the moving device m for:
[0092] v m ={(v,ω)|v∈[v min ,v max ],ω∈[ω min ,ω max ]}
[0093] Predetermined maximum / minimum speed v of mobile device based on acceleration d for:
[0094]
[0095] Predetermined maximum / minimum speed v of the mobile device based on the braking distance m for:
[0096]
[0097] Specifically, the predetermined mobile device collects relevant motion parameters through an IMU unit, and limits its own speed through calculation based on the motion parameters.
[0098] Specifically, Figure 7 As shown in FIG. 1 , the speed / acceleration and angular velocity / acceleration are realized by the IMU unit. In the actual movement of the predetermined mobile device, since the maximum / minimum speed is constrained by the actual speed / acceleration and angular velocity / acceleration, the speed / acceleration and angular velocity / acceleration need to be taken into consideration in real time during the selection of the local path. Therefore, through G(v i ,ω i) can achieve a relatively accurate evaluation of each local path and determine the optimal choice of multiple planned paths leading to the established goal based on this evaluation.
[0099] Among them, the subfunction heading(v i ,ω i ) is used to evaluate the angle θb between the current real-time moving direction, the real-time starting position and the target position; the smaller the function value, the higher the evaluation of θb, and the more likely the corresponding local path is to be selected; the sub-function dist(v i ,ω i ) is used to represent the shortest distance D1 between the current moving trajectory of the predetermined mobile device derived from the real-time moving direction and the nearest obstacle; the larger D1 is, the higher the function evaluation is, and the corresponding local path is more likely to be selected; the sub-function velocity(v i ,ω i ) is used to evaluate the linear velocity and angular velocity of the predetermined moving device. The higher the linear velocity and the smaller the angular velocity, the higher the function evaluation, and the more likely the corresponding planned path is to be selected. The sub-function moving(v i ,ω i ) is to increase the weight of the mobile robot moving in the direction of the previous step. It is used to evaluate the difference θa between the initial moving direction of the predetermined mobile device and the current real-time moving direction, that is, the change angle of the moving direction of the predetermined mobile device. The smaller θa is, the higher the evaluation of the function is, and the corresponding local path is more likely to be selected.
[0100] A path planning storage medium stores a computer program / instruction thereon. When the computer program / instruction is executed by a processor, the steps of the mobile device path planning method S100 are implemented.
[0101] A path planning system includes an IMU module, a wheel speed sensor, a laser radar, a memory, a processor, and a computer program stored in the memory. The processor executes the computer program to implement the steps of the mobile device path planning method S100.
[0102] Specifically, the IMU module is equipped with an accelerometer, a gyroscope, and a magnetometer.
[0103] The above-mentioned implementation modes are preferred cases of the present invention and are not used to limit the protection scope of the present invention. Various deformations or modifications that can be made by ordinary technicians in this field without creative work within the scope of the attached claims are still within the protection scope of this patent.
Claims
1. A mobile device path planning method for planning a path between a predetermined mobile device and a predetermined target location, characterized in that: The following steps are involved: Step S1: identifying a predetermined area including the predetermined mobile device and the predetermined target position, and performing a rasterization process on the predetermined area to form a rasterized area; Step S2: In the gridded area, traverse all grids, calibrate the center coordinates as grid coordinates, calibrate the passable state of the grid; and calibrate the coordinates of the predetermined target position as the target position, thereby forming a planning data map; Step S3: obtaining the grid coordinates and moving direction of the current predetermined moving device as the real-time starting position and the real-time moving direction, respectively, and simultaneously obtaining all the grid coordinates adjacent to the real-time starting position as adjacent grid clusters; Step S4: acquiring a first intermediate target grid group in the adjacent grid cluster based on a line connecting the real-time starting position and the target position, acquiring a second intermediate target grid group based on the real-time moving direction, and acquiring an adjacent target position based on the first intermediate target grid group and the second intermediate target grid group; Step S5: Repeat step S4 until the current adjacent target position is the target position.
2. The mobile device path planning method according to claim 1, characterized in that: in, In step S2, the grid passability status is divided into "passable" and "inpassable". When there is an obstacle at the location of the grid that makes the predetermined mobile device inaccessible, the grid passability status is divided into "inpassable", and the rest is "passable".
3. The mobile device path planning method according to claim 1, Features: Wherein, step S4 includes the following sub-steps: Step S4-1: Divide the entire circumference of the starting point into n consecutive and closed angle domains; Step S4-2: obtaining a line connecting the real-time starting position and the target position, wherein the grids passed by the line in the adjacent grid cluster and all grids adjacent to the grid in the adjacent grid cluster together form the first intermediate target grid group; Step S4-3: acquiring the grids that the extended line of the real-time moving direction passes through in the adjacent grid cluster, and all grids adjacent to the grid in the adjacent grid cluster, to form the second intermediate target grid group together; Step S4-4: Deleting redundant grids of the first intermediate target grid group and the second intermediate target grid group to form the adjacent target position.
4. The mobile device path planning method according to claim 3, characterized in that: in, In step S4-1, n is 8, and the angle domain is a 45° sector; In step S4-2, the expression of the line connecting the real-time starting position and the target position is as follows: θ is the direction angle of the connecting line, (x E ,y E ) is the target position, (x s ,y s ) is the real-time starting point position.
5. The mobile device path planning method according to claim 3, characterized in that: in, When there are multiple adjacent target positions, one of the adjacent target positions is selected by a heuristic function.
6. The mobile device path planning method according to claim 2, characterized in that: Also includes: Step S6: Positioning the initial position of the predetermined device and the adjacent target position as {P i , i=0,1,2…n}, define {P j ,j=1,2…(n-1)}, traverse P j , if P j Not on straight line P j-1 P j+1 On the straight line P j-1 P j+1 If all grids passed are in the "passable" state, delete P j Otherwise, keep P j .
7. The mobile device path planning method according to claim 6, characterized in that: Step S7: All the reserved P i The lines are connected to form a planned path, and the speed space evaluation function G(v i ,ω i ) evaluates the local path of the planned path and based on G(v i ,ω i ) to select: G(v i ,oh i )=σ[α·heading(v i ,oh i )+β·dist(v i ,oh i )+γ·velocity(v i ,oh i )+δ·moving(v i ,oh i )] heading(v i ,ω)=π-Δθ △θ is the angle difference between the tangent line at the end point of the planned path and the target position; dist(v i ,oh i )=min(norm(p r +v·Δt·[cos(ω·Δt), sin(ω·Δt)]-p o,i )) p r is the current position of the predetermined mobile device; o,i is the i-th "inaccessible" location; norm() is the Euclidean distance function, which is used to calculate the straight-line distance between two points, and △t is the time step of the planned path prediction; velocity(v i ,ω i )=|v| v is the current linear velocity α, β, γ, δ are G(v i ,ω i ), σ is the weight coefficient of each item in the equation, v i is the linear velocity of the ith acquisition point, ω i is the angular velocity of the i-th acquisition point, and based on moving(v i ,ω i ) is used to determine the turning angle of the local path.
8. The mobile device path planning method according to claim 7, characterized in that: in, The maximum / minimum speed v of the predetermined moving device m for: v m ={(v,ω)|v∈[v min ,v max ],ω∈[ω min ,ω max ]} The maximum / minimum speed v of the predetermined mobile device based on acceleration d for: The maximum / minimum speed v of the predetermined mobile device based on the braking distance m for:
9. A path planning storage medium having a computer program / instruction stored thereon, characterized in that: When the computer program / instructions are executed by a processor, the steps of the mobile device path planning method described in any one of claims 1-8 are implemented.
10. A path planning system, comprising an IMU module, a wheel speed sensor, a laser radar, a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the steps of the mobile device path planning method according to any one of claims 1-8.
