CN112947491A - Unmanned vehicle rapid track planning method - Google Patents
Unmanned vehicle rapid track planning method Download PDFInfo
- Publication number
- CN112947491A CN112947491A CN202110385083.0A CN202110385083A CN112947491A CN 112947491 A CN112947491 A CN 112947491A CN 202110385083 A CN202110385083 A CN 202110385083A CN 112947491 A CN112947491 A CN 112947491A
- Authority
- CN
- China
- Prior art keywords
- coordinate
- delta
- carried out
- region
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000004364 calculation method Methods 0.000 claims abstract description 9
- 230000006870 function Effects 0.000 description 6
- 230000000694 effects Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 230000002787 reinforcement Effects 0.000 description 1
- 238000003466 welding Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0231—Control of position or course in two dimensions specially adapted to land vehicles using optical position detecting means
- G05D1/0238—Control of position or course in two dimensions specially adapted to land vehicles using optical position detecting means using obstacle or wall sensors
- G05D1/024—Control of position or course in two dimensions specially adapted to land vehicles using optical position detecting means using obstacle or wall sensors in combination with a laser
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0212—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
- G05D1/0221—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory involving a learning process
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0231—Control of position or course in two dimensions specially adapted to land vehicles using optical position detecting means
- G05D1/0246—Control of position or course in two dimensions specially adapted to land vehicles using optical position detecting means using a video camera in combination with image processing means
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0257—Control of position or course in two dimensions specially adapted to land vehicles using a radar
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0276—Control of position or course in two dimensions specially adapted to land vehicles using signals provided by a source external to the vehicle
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0276—Control of position or course in two dimensions specially adapted to land vehicles using signals provided by a source external to the vehicle
- G05D1/0278—Control of position or course in two dimensions specially adapted to land vehicles using signals provided by a source external to the vehicle using satellite positioning signals, e.g. GPS
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Electromagnetism (AREA)
- Optics & Photonics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Multimedia (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
Abstract
The invention discloses a rapid track planning method for an unmanned vehicle, belongs to the field of rapid route planning, and solves the problems of large calculation amount and high hardware requirement of unmanned vehicle track planning in the prior art, and the technical scheme is as follows: constructing an environment map, obtaining coordinate information of a robot moving environment through a sensor to form a map model, and using a grid to pixelate the map; setting the starting point coordinate P0(x0,y0) End point coordinate P1(x1,y1) (ii) a Determining a current point Pi(xi,yi) Judging whether the eight neighborhood points of the current point are obstacles or not; and determining the next track point by adopting a midpoint comparison algorithm and an A-Star (A) algorithm according to whether the obstacle is the obstacle. The method has small calculation amount and low requirement on a hardware platform.
Description
Technical Field
The invention relates to the field of unmanned vehicle route planning, in particular to a rapid unmanned vehicle trajectory planning method.
Background
The current trajectory planning method comprises an a-Star (a) algorithm, a Dijkstra algorithm, an ant colony algorithm, a genetic algorithm and the like, for example, chinese patent CN 110440822B discloses an automobile welding spot path planning method based on a slime-ant colony fusion algorithm, and chinese patent CN 111098852B discloses a parking path planning method based on reinforcement learning. However, the original a-trace algorithm needs to calculate the distances from the eight adjacent points to the starting point and the ending point, and the calculation amount is still too large, which has a high requirement on a hardware platform. In order to solve the problem of computation amount, the improved A algorithm for providing the jumping point search based on the mobile robot path planning [ J ] robot, 2018,40(6):904 and 910 ] of the improved A algorithm reduces the number of partial useless nodes and reduces partial computation amount, but the computation amount of the reserved nodes is still larger.
Disclosure of Invention
The invention aims to provide a rapid track planning method for an unmanned vehicle, which solves the problem of large calculation amount of track planning of the unmanned vehicle in the prior art, and has the technical effects that: the algorithm has small calculation amount and low requirement on a hardware platform.
In order to achieve the purpose, the invention adopts the following technical scheme:
a method for planning a rapid track of an unmanned vehicle comprises the following steps:
step 1: constructing an environment map, obtaining coordinate information of a robot moving environment through a sensor to form a map model, and using a grid to pixelate the map; step 2: given starting point coordinates P0(x0,y0) End point coordinate P1(x1,y1) (ii) a And step 3: determining a current point Pi(xi,yi) When starting, the starting point is the current point, and whether the eight neighborhoods of the current point have obstacles is judged,entering step 4 when no obstacle exists, and entering step 5 when an obstacle exists; and 4, step 4: obtaining the next track point P by the midpoint comparison methodi+1(xi+1,yi+1) (ii) a And 5: obtaining next track point P by A-Star methodi+1(xi+1,yi+1);
Further, in step 3, the coordinate determination sequence of the eight neighborhood points is: 1-upper Pi3(xi,yi+1), 2-upper right Pi4(xi+1,yi+1), 3-Right Pi5(xi+1,yi) 4-lower right Pi6(xi+1,yi-1), 5-lower Pi7(xi,yi-1), 6-lower left Pi8(xi-1,yi-1), 7-left Pi1(xi-1,yi) 8-upper left Pi2(xi-1,yi+1)。
Further, step 4.1: judging the previous track point Pi-1(xi-1,yi-1) If there is no obstacle, then using delta x and delta y in last iteration, if there is any, then calculating PiP1Increment in x and y directions on a straight line:step 4.2: judgment of PiP1If the region belongs to the region 1, the step 4.3 is carried out, otherwise, the step 4.4 is carried out; step 4.3: judging whether delta x-2 delta y is less than 0, if so, Pi+1The coordinate is (x)i+1,yi+1), otherwise Pi+1The coordinate is (x)i,yi+1), go to step 4.17; step 4.4: judgment of PiP1If the region belongs to the region 2, the step 4.5 is carried out, otherwise, the step 4.6 is carried out; step 4.5: judging whether 2 delta x-delta y is less than 0, if so, Pi+1The coordinate is (x)i,yi+1), otherwise Pi+1The coordinate is (x)i+1,yi+1), go to step 4.17; step 4.6: judgment of PiP1If the region belongs to the region 3, the step 4.7 is carried out, otherwise, the step 4.8 is carried out; step 4.7: judging whether 2 delta x plus delta y is less than 0, if so, Pi+1The coordinate is (x)i,yi+1), otherwisePi+1The coordinate is (x)i-1,yi+1), go to step 4.17; step 4.8: judgment of PiP1If yes, entering step 4.9, otherwise entering step 4.10; step 4.9: judging whether delta x +2 delta y is less than 0, if so, Pi+1The coordinate is (x)i-1,yi+1), otherwise Pi+1The coordinate is (x)i-1,yi) Entering step 4.17; step 4.10: judgment of PiP1If the region belongs to the region 5, the step 4.11 is carried out, otherwise, the step 4.12 is carried out; step 4.11: judging whether-delta x +2 delta y is less than 0, if so, Pi+1The coordinate is (x)i,yi+1), otherwise Pi+1The coordinate is (x)i-1,yi+1), go to step 4.17; step 4.12: judgment of PiP1If the region belongs to the region 6, the step 4.13 is carried out, otherwise, the step 4.14 is carried out; step 4.13: judging whether-2 delta x + delta y is less than 0, if so, Pi+1The coordinate is (x)i-1,yi-1), otherwise Pi+1The coordinate is (x)i,yi-1), go to step 4.17; step 4.14: judgment of PiP1If the region belongs to the region 7, the step 4.15 is carried out, otherwise, the step 4.14 is carried out; step 4.15: judging whether-2 delta x-delta y is less than 0, if so, Pi+1The coordinate is (x)i+1,yi-1), otherwise Pi+1The coordinate is (x)i,yi-1), go to step 4.17; step 4.16: judgment of PiP1Belongs to the region 8, further judges whether-delta x-2 delta y is less than 0, if yes, Pi+1The coordinate is (x)i+1,yi) Else Pi+1The coordinate is (x)i+1,yi-1), go to step 4.17; step 4.17: return Pi+1And (4) coordinates.
Further, in the step 4.1, P is judgediP1The judgment method of whether the region belongs to the region 1-the region 8 is as follows:
further, the step 5 includes the following implementation steps:
step 5.1: calculating the current point Pi(xi,yi) The euclidean distance from the eight neighborhood points (upper, upper right, lower left and upper left) to the starting point and the end point has the following calculation formula:
step 5.2: constructing a cost function k (n):
kj(n)=aj(n)+bj(n)
step 5.3: selecting min [ k ]j(n)]The corresponding point of eight neighborhoods corresponding to the middle j is the next point Pi+1And return to Pi+1And (4) coordinates.
Has the advantages that: the difference between the invention and the prior art is that: when no obstacle exists around eight neighborhood points of the current point, a midpoint comparison method is used for obtaining the next track point, and the next track point can be determined only by calculating few addition operations.
Drawings
FIG. 1: the algorithm of the invention realizes a flow chart;
FIG. 2: eight neighborhood sequence diagrams;
FIG. 3: a midpoint comparison algorithm flow chart;
FIG. 4: regions 1-8 are partitioned;
Detailed Description
The present invention is described in further detail below with reference to the attached drawing figures.
When an environment map is constructed, the mobile environment information of the robot is obtained through a sensor to form a map model, and the map is pixilated by using grids; in engineering, in a small and micro application scene, environmental information can be acquired through a laser radar sensor and a map is constructed, satellite map information can be used in a large scene and used in cooperation with a satellite positioning system, and obstacles and passable areas on the map are explained.
As shown in fig. 1, the search path algorithm rapidly obtains a trajectory between a start point and an end point by using a midpoint comparison method and an a-Star tracing algorithm according to whether an obstacle exists in eight neighborhoods around a current point, which is specifically as follows:
by first setting the starting coordinate to P0(x0,y0) End point coordinate P1(x1,y1) (ii) a Determining a current point Pi(xi,yi) Starting point is current point; judging whether the eight neighborhood points of the current point are obstacles, and judging the operation sequence as shown in fig. 2, wherein the judgment is as follows: 1-upper Pi3(xi,yi+1), 2-upper right Pi4(xi+1,yi+1), 3-Right Pi5(xi+1,yi) 4-lower right Pi6(xi+1,yi-1), 5-lower Pi7(xi,yi-1), 6-lower left Pi8(xi-1,yi-1), 7-left Pi1(xi-1,yi) 8-upper left Pi2(xi-1,yi+1), the judgment result is divided into the presence of obstacles and the absence of obstacles.
(1) When there is no obstacle, the processing flow is shown in fig. 3:
judging whether barriers exist in the previous eight neighborhoods;
if no obstacle exists, the delta x and delta y in the last iteration are used, otherwise, P is calculatediP1Increment of the straight line in x and y directions:
the ratio of the increments is slope k ═ Δ y/. DELTA.x.
The linear implicit function f (x, y) is:
f(x,y)=y-kx-b=0 (2)
thirdly, constructing a midpoint cost function, as shown in fig. 4, dividing into eight cases:
fourthly, the track acquisition depends on diSymbol of (2), independent of diI.e. dependent on diWhether greater than or equal to 0 or less than 0, if greater than or equal to 0 is + sign, if less than 0 is-sign, in order to reduce floating point operation, it is beneficial to hardware implementation, order di=2△xdiThe available region 1-8 cost functions are as follows:
according to diSelecting the next track point by value, and for the area 1, when d isi<At 0, the next trace point is Pi+1(xi+1,yi+1) when diWhen the point is more than or equal to 0, the next track point is Pi+1(xi+1,yi). Similarly, the coordinates of the next trace point in the regions 1-8 are as follows:
the effect is that: and the approach point is preferentially selected as a feasible path through midpoint comparison, so that the calculation is rapid and the efficiency is high.
(2) When an obstacle exists, the treatment method comprises the following steps:
calculating a current point Pi(xi,yi) The euclidean distance from the eight neighborhood points (left, upper right, lower left) to the starting point and the end point:
constructing a cost function k (n):
kj(n)=aj(n)+bj(n) (6)
③ selecting min kj(n)]The corresponding point of eight neighborhoods corresponding to the middle j is the next point Pi+1
The effect is as follows: the most recently optimized route is convenient to select preferentially, and the unmanned vehicle is convenient to avoid the obstacle and select the best route to reach the destination.
The specific working mode is as follows:
further setting the unmanned vehicle in the environment map of the component by constructing the environment map, and setting a starting point coordinate P for the unmanned vehicle0(x0,y0) End point coordinate P1(x1,y1) And determining the current coordinate of the unmanned vehicle as Pi(xi,yi) And calculating the moving position according to the mode shown in fig. 1, wherein the moving position is calculated to be the next position point according to a midpoint comparison method and an a-x algorithm in the moving process, specifically: in the process of moving the unmanned vehicle, eight areas are determined by taking the trolley as the center, and under the condition of no obstacle, each area is determined according to diThe next coordinate point is judged according to the value of the point P, the unmanned vehicle determines the driving direction according to the starting point, the end point and the series of track points, the next track point coordinate is selected to move constantly, and when an obstacle is met, the current point P is calculatedi(xi,yi) To the starting point and the end point, and according to a cost function kj(n)=aj(n)+bj(n) selecting the minimum value Pi+1As the next moving point.
Has the advantages that: compared with the traditional A-Star tracing algorithm, the method can effectively reduce the calculation amount and reduce the requirement on hardware so as to reduce the hardware cost.
In the present invention, the terms "set", "install", "connect", "fix", etc. should be understood in a broad sense, for example, they may be fixed connection or detachable connection; may be a mechanical connection; can be directly connected, and the specific meaning of the terms in the invention can be understood according to specific situations by a person skilled in the art; the terms "first", "second", and "first" are used for descriptive purposes only and may refer to one or more of such features, and in the description of the invention "plurality" means two or more unless specifically limited otherwise.
The present invention is not limited to the above-described embodiments, and all changes that do not depart from the structure and action of this embodiment are intended to be within the scope of the invention.
Claims (5)
1. The unmanned vehicle rapid track planning method is characterized in that the algorithm comprises the following steps:
step 1: constructing an environment map, obtaining coordinate information of a robot moving environment through a sensor to form a map model, and using a grid to pixelate the map;
step 2: given starting point coordinates P0(x0,y0) End point coordinate P1(x1,y1);
And step 3: determining a current point Pi(xi,yi) When starting, the starting point is the current point, whether an obstacle exists in the eight neighborhoods of the current point is judged, the step 4 is carried out when no obstacle exists, and the step 5 is carried out when an obstacle exists;
and 4, step 4: obtaining the next track point P by the midpoint comparison methodi+1(xi+1,yi+1);
And 5: obtaining next track point P by A-Star methodi+1(xi+1,yi+1)。
2. The unmanned aerial vehicle rapid trajectory planning method according to claim 2, wherein in the step 3, the order of judging the coordinates of the eight neighborhood points is as follows: 1-upper Pi3(xi,yi+1), 2-upper right Pi4(xi+1,yi+1), 3-Right Pi5(xi+1,yi) 4-lower right Pi6(xi+1,yi-1), 5-lower Pi7(xi,yi-1), 6-lower left Pi8(xi-1,yi-1), 7-left Pi1(xi-1,yi) 8-upper leftPi2(xi-1,yi+1)。
3. The unmanned vehicle rapid trajectory planning method according to claim 2, wherein the step 4 comprises the following implementation steps:
step 4.1: judging the previous track point Pi-1(xi-1,yi-1) If there is no obstacle, then using delta x and delta y in last iteration, if there is any, then calculating PiP1Increment in x and y directions on a straight line:
step 4.2: judgment of PiP1If the region belongs to the region 1, the step 4.3 is carried out, otherwise, the step 4.4 is carried out;
step 4.3: judging whether delta x-2 delta y is less than 0, if so, Pi+1The coordinate is (x)i+1,yi+1), otherwise Pi+1The coordinate is (x)i,yi+1), go to step 4.17;
step 4.4: judgment of PiP1If the region belongs to the region 2, the step 4.5 is carried out, otherwise, the step 4.6 is carried out;
step 4.5: judging whether 2 delta x-delta y is less than 0, if so, Pi+1The coordinate is (x)i,yi+1), otherwise Pi+1The coordinate is (x)i+1,yi+1), go to step 4.17;
step 4.6: judgment of PiP1If the region belongs to the region 3, the step 4.7 is carried out, otherwise, the step 4.8 is carried out;
step 4.7: judging whether 2 delta x plus delta y is less than 0, if so, Pi+1The coordinate is (x)i,yi+1), otherwise Pi+1The coordinate is (x)i-1,yi+1), go to step 4.17;
step 4.8: judgment of PiP1If yes, entering step 4.9, otherwise entering step 4.10;
step 4.9: judging whether delta x +2 delta y is less than 0, if so, Pi+1The coordinates are(xi-1,yi+1), otherwise Pi+1The coordinate is (x)i-1,yi) Entering step 4.17;
step 4.10: judgment of PiP1If the region belongs to the region 5, the step 4.11 is carried out, otherwise, the step 4.12 is carried out;
step 4.11: judging whether-delta x +2 delta y is less than 0, if so, Pi+1The coordinate is (x)i,yi+1), otherwise Pi+1The coordinate is (x)i-1,yi+1), go to step 4.17;
step 4.12: judgment of PiP1If the region belongs to the region 6, the step 4.13 is carried out, otherwise, the step 4.14 is carried out;
step 4.13: judging whether-2 delta x + delta y is less than 0, if so, Pi+1The coordinate is (x)i-1,yi-1), otherwise Pi+1The coordinate is (x)i,yi-1), go to step 4.17;
step 4.14: judgment of PiP1If the region belongs to the region 7, the step 4.15 is carried out, otherwise, the step 4.16 is carried out;
step 4.15: judging whether-2 delta x-delta y is less than 0, if so, Pi+1The coordinate is (x)i+1,yi-1), otherwise Pi+1The coordinate is (x)i,yi-1), go to step 4.17;
step 4.16: judgment of PiP1Belongs to the region 8, further judges whether-delta x-2 delta y is less than 0, if yes, Pi+1The coordinate is (x)i+1,yi) Else Pi+1The coordinate is (x)i+1,yi-1), go to step 4.17;
step 4.17: return Pi+1And (4) coordinates.
5. the unmanned vehicle rapid trajectory planning method according to claim 4, wherein the step 5 comprises the following implementation steps:
step 5.1: calculating the current point Pi(xi,yi) The euclidean distance from the eight neighborhood points (upper, upper right, lower left and upper left) to the starting point and the end point has the following calculation formula:
step 5.2: constructing a cost function k (n):
kj(n)=aj(n)+bj(n)
step 5.3: selecting min [ k ]j(n)]The corresponding point of eight neighborhoods corresponding to the middle j is the next point Pi+1And return to Pi+1And (4) coordinates.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110385083.0A CN112947491A (en) | 2021-04-09 | 2021-04-09 | Unmanned vehicle rapid track planning method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110385083.0A CN112947491A (en) | 2021-04-09 | 2021-04-09 | Unmanned vehicle rapid track planning method |
Publications (1)
Publication Number | Publication Date |
---|---|
CN112947491A true CN112947491A (en) | 2021-06-11 |
Family
ID=76231424
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110385083.0A Withdrawn CN112947491A (en) | 2021-04-09 | 2021-04-09 | Unmanned vehicle rapid track planning method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112947491A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113392378A (en) * | 2021-07-16 | 2021-09-14 | 中南大学 | Surrounding rock deformation multipoint mutation identification method and system based on time sequence |
CN114063623A (en) * | 2022-01-11 | 2022-02-18 | 中国人民解放军陆军装甲兵学院 | Robot path planning method based on multi-strategy improved slime mold algorithm |
-
2021
- 2021-04-09 CN CN202110385083.0A patent/CN112947491A/en not_active Withdrawn
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113392378A (en) * | 2021-07-16 | 2021-09-14 | 中南大学 | Surrounding rock deformation multipoint mutation identification method and system based on time sequence |
CN113392378B (en) * | 2021-07-16 | 2024-04-09 | 中南大学 | Surrounding rock deformation multipoint mutation identification method and system based on time sequence |
CN114063623A (en) * | 2022-01-11 | 2022-02-18 | 中国人民解放军陆军装甲兵学院 | Robot path planning method based on multi-strategy improved slime mold algorithm |
CN114063623B (en) * | 2022-01-11 | 2022-03-29 | 中国人民解放军陆军装甲兵学院 | Robot path planning method based on multi-strategy improved slime mold algorithm |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112673234B (en) | Path planning method and path planning device | |
CN110262518B (en) | Vehicle navigation method, system and medium based on track topological map and obstacle avoidance | |
CN109059924B (en) | Accompanying robot incremental path planning method and system based on A-x algorithm | |
CN106371445B (en) | A kind of unmanned vehicle planning control method based on topological map | |
CN112378408A (en) | Path planning method for realizing real-time obstacle avoidance of wheeled mobile robot | |
CN110553660B (en) | Unmanned vehicle trajectory planning method based on A-star algorithm and artificial potential field | |
KR101585504B1 (en) | Method and apparatus for generating pathe of autonomous vehicle | |
CN112947491A (en) | Unmanned vehicle rapid track planning method | |
CN112882469A (en) | Deep reinforcement learning obstacle avoidance navigation method integrating global training | |
CN105043376A (en) | Intelligent navigation method and system applicable to non-omnidirectional moving vehicle | |
CN112925315A (en) | Crawler path planning method based on improved ant colony algorithm and A-star algorithm | |
CN106840169B (en) | Improved method for robot path planning | |
CN111142542A (en) | Omnidirectional mobile robot autonomous navigation system based on VFH local path planning method | |
CN111006667A (en) | Automatic driving track generation system under high-speed scene | |
CN112269381A (en) | Mobile robot path planning method based on improved artificial fish swarm algorithm | |
KR101907268B1 (en) | Method and device for autonomous driving based on route adaptation | |
CN114527753A (en) | Man-machine integrated building path planning method, computer device and program product | |
CN112947476A (en) | Unmanned system of hilly tractor | |
CN116360457A (en) | Path planning method based on self-adaptive grid and improved A-DWA fusion algorithm | |
CN114815853A (en) | Path planning method and system considering road surface obstacle characteristics | |
CN110673610A (en) | ROS-based factory AGV path planning method | |
CN113296519A (en) | Mecanum wheel-based mobile robot motion planning method and system | |
CN117249842A (en) | Unmanned vehicle mixed track planning method based on track smooth optimization | |
CN113485378B (en) | Mobile robot path planning method, system and storage medium based on traffic rules | |
CN116795101A (en) | Motion planning method integrating improved A and improved DWA algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
WW01 | Invention patent application withdrawn after publication |
Application publication date: 20210611 |
|
WW01 | Invention patent application withdrawn after publication |