Route planning method based on triangular inner center guided RRT algorithm

A path planning and triangulation technology, applied in computing, data processing applications, forecasting, etc., can solve problems such as long planning time, unable to find a path, and tortuous paths, and achieve the effect of improving the efficiency of pathfinding.
CN110705803AActive Publication Date: 2020-01-17FUZHOU UNIV
5 Cites 4 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
FUZHOU UNIV
Publication Date
2020-01-17

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 triangular inner center guided RRT algorithm. In order to overcome the defects of an RRT algorithm and avoid the risk of local minimum causedby the fact that a target point appears in a random point at a certain probability, the invention provides a method for guiding a random tree by utilizing the inner center of a triangle. Three vertexes of a triangle are formed by a random point generated by a random function, a point closest to the random point in a random tree and a target point, then an inner center coordinate of the triangle is calculated, and the inner center coordinate is used as a growth direction of the random tree; in addition, under a certain cycle index, the sampling mode is adjusted by recording the number of timesof using the inner core guidance and the growth condition of the random tree. Therefore, not only is the growth of the random tree guided, but also the local minimum risk is effectively avoided. According to the method, the planning efficiency is improved, the time required for planning the path is shorter, the number of iterations is smaller, and the path is shorter.
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 triangular inwardly guided RRT algorithm. Background technique

[0002] Path planning has always been a research hotspot in the field of mobile robotics. 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 conditional constraints.

[0003] Commonly used trajectory planning algorithms include graph search algorithm, bionic intelligent 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 robot’s motion path under the combined effect of the repulsive force of obstacles on the mobile robot and the attraction of the target position to the mobile robot, but when the attraction When the resultant force with th...

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