Path Planning Method Based on Triangle Inner Guided RRT Algorithm

A path planning and triangular technology, which is applied in calculation, data processing application, prediction, etc., can solve problems such as long planning time, lack of guidance information, circuitous paths, etc., and achieve the effect of improving pathfinding efficiency
CN110705803BActive Publication Date: 2022-06-21FUZHOU UNIV
5 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
FUZHOU UNIV
Publication Date
2022-06-21

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention relates to a path planning method based on a triangle inwardly guided RRT algorithm. In order to overcome the shortcomings of the RRT algorithm and the danger of falling into a local minimum if the target point appears in a random point with a certain probability, this method proposes a method to guide the random tree by using the innards of the triangle. By using the random point generated by the random function, the point closest to the random point in the random tree and the target point to form the three vertices of the triangle, then calculate the inner coordinates of the triangle, and use the inner coordinates as the growth direction of the random tree ; In addition, adjust the sampling method by recording the number of inner guides used and the growth of the random tree under a certain number of cycles. This not only guides the growth of the random tree, but also effectively avoids the risk of falling into a local minimum. The method of the invention improves planning efficiency, requires less time for path planning, fewer iterations and shorter paths.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of path planning, in particular to a path planning method based on a triangle inner-guided RRT algorithm. Background technique

[0002] Path planning has always been a research hotspot in the field of mobile robots. The main task of path planning is to find a continuous collision-free path from the initial state point to the target state point in space, while satisfying the corresponding conditions and constraints.

[0003] Commonly used trajectory planning algorithms include graph search algorithm, bionic intelligence algorithm, artificial potential field method, etc. Traditional path planning algorithms, such as the artificial potential field method, are based on vector synthesis and plan the motion path of the robot under the combined action of the repulsive force of the obstacle to the mobile robot and the attractive force of the target position to the mobile robot, but when the attractive force When the resulta...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More