摘要
A new dynamic path planning method in high dimensional workspace, radial based probabilistic roadmap motion (RBPRM) planning method, is presented. Different from general probabilistic roadmap motion planning methods, it uses straight lines as long as possible to construct a path graph, so the final path obtained from the graph is relatively shorter and straighter. Experimental results show the efficiency of the algorithm in finding shorter paths in sparse environment.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 89-92 |
| 页数 | 4 |
| 期刊 | Journal of Beijing Institute of Technology (English Edition) |
| 卷 | 11 |
| 期 | 1 |
| 出版状态 | 已出版 - 3月 2002 |