1 Star 2 Fork 0

nealliu / Dubins-RRT-for-MATLAB

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
贡献代码
同步代码
取消
提示: 由于 Git 不支持空文件夾,创建文件夹后会生成空的 .keep 文件
Loading...
README

Dubins-RRT-for-MATLAB

About

RRT (Rapidly-Exploring Random Trees) using Dubins curve, with collision check in MATLAB
4000 Dubins RRT iteration with collision

Intro

RRT, the Rapidly-Exploring Random Trees is a ramdomized method of exploring within dimensions. This method can effectively generate a path to reach any point within certain limited steps due to its random characteristics. This method is proprosed by LaValle, Steven M. in October 1998, in his technical report to Computer Science Department of Iowa State University as "Rapidly-exploring random trees: A new tool for path planning" Today, multiple variation of RRT method is widely applied with path planning problem among UAVs for ground based, aerial, and marinetime vehicles.
In RRT_Dubins.m, the paths connecting each points, or the "edges" to the "vertices" are replaced with Dubins curve. This is a very common practice when dealing with dynamic system. Specifically for non-holonomic system, such as cars, airplanes or ships. Replacements of Dubins curve means the branches growing out of a vertex is always smooth in the sense tengency. This makes the path generated more feassibly then the original straight line connection style if taking dynamics into consideration.

Algorithm

For the sake of simplicity, I will discuss the algorithm only with 2-D planes. The problem is, given a starting point and limited boundary, how do we reach everypoint within the area systematically? The method itself is very simple, only repeative iteration of are 4 steps.

  1. Generate a random point, i.e, a "vertex"
  2. Find the closest vertex from the existing list (euclidean distance or dubins path distance).
  3. Create an "edge" connect the new vertex to the closest existing vertex.
  4. Check if the newly generated vertex and edge has collision with obstacles or not. Go back to step1 if conflict.
  5. Append (add) the new vertex and edge to the known vertices and edges list.
  6. Start from step1 As the iteration goes, it looks like a tree consists of edges is growing within the boundary and thus named so.

Running the programs

There are 4 main programs, see the comments in each file for more detail

  • RRT.m
    standard baseline RRT algorithm
  • RRT_Dubins.m
    RRT with Dubins curve as edge
  • RRT_obstacles.m
    RRT with obstacles and collision check
  • RRT_Dubins_obstacles.m
    Final complete algorithm: RRT with Dubins curve and collision check

Note: All plotting related function have the filename starts with plot_xxxxx_xxxx.m.

Execution Time

  • RRT_Dubins_obstacles.m
    The searching function for now is a dumb exhaustive search over a un-ordered list, program running time grows exponentially with amount of iterations. Here are some of the resutls, note the time will very each time you run the program:
    • i = 100 0.198196 / 0.292975 sec
    • i = 1000 11.011770 sec
    • i = 10000 1121.169987 sec

100 iterations1000 iterations10000 iterations

References

License

Released under GPLv3 license
Copyright (c) 2018 Ewing Kang

Dubins path generator is a MATLAB re-written from Andrew Walker's work, which was originally distributed under MIT license in C language.

See LICENSE file for more info.

TODOS

  • RRT+Dubins+collisioncheck
  • fast localsearch
  • tree growing animation

空文件

简介

RRT (Rapidly-Exploring Random Trees) using Dubins curve, with collision check in MATLAB 展开 收起
Matlab
取消

发行版

暂无发行版

贡献者

全部

近期动态

加载更多
不能加载更多了
Matlab
1
https://gitee.com/nealliu/Dubins-RRT-for-MATLAB.git
git@gitee.com:nealliu/Dubins-RRT-for-MATLAB.git
nealliu
Dubins-RRT-for-MATLAB
Dubins-RRT-for-MATLAB
master

搜索帮助

14c37bed 8189591 565d56ea 8189591