Knowledge Commons of Institute of Automation，CAS
| Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning | |
| Tianyi Zhang; Jiankun Wang; Max Q.-H. Meng | |
| Source Publication | IEEE/CAA Journal of Automatica Sinica
 |
| ISSN | 2329-9266 |
| 2022 | |
| Volume | 9Issue:1Pages:64-74 |
| Abstract | Sampling-based path planning is a popular methodology for robot path planning. With a uniform sampling strategy to explore the state space, a feasible path can be found without the complex geometric modeling of the configuration space. However, the quality of the initial solution is not guaranteed, and the convergence speed to the optimal solution is slow. In this paper, we present a novel image-based path planning algorithm to overcome these limitations. Specifically, a generative adversarial network (GAN) is designed to take the environment map (denoted as RGB image) as the input without other preprocessing works. The output is also an RGB image where the promising region (where a feasible path probably exists) is segmented. This promising region is utilized as a heuristic to achieve non-uniform sampling for the path planner. We conduct a number of simulation experiments to validate the effectiveness of the proposed method, and the results demonstrate that our method performs much better in terms of the quality of the initial solution and the convergence speed to the optimal solution. Furthermore, apart from the environments similar to the training set, our method also works well on the environments which are very different from the training set. |
| Keyword | Generative adversarial network (GAN) optimal path planning robot path planning sampling-based path planning |
| DOI | 10.1109/JAS.2021.1004275 |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.ia.ac.cn/handle/173211/45974 |
| Collection | 学术期刊_IEEE/CAA Journal of Automatica Sinica |
| Recommended Citation GB/T 7714 | Tianyi Zhang,Jiankun Wang,Max Q.-H. Meng. Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning[J]. IEEE/CAA Journal of Automatica Sinica,2022,9(1):64-74. |
| APA | Tianyi Zhang,Jiankun Wang,&Max Q.-H. Meng.(2022).Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning.IEEE/CAA Journal of Automatica Sinica,9(1),64-74. |
| MLA | Tianyi Zhang,et al."Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning".IEEE/CAA Journal of Automatica Sinica 9.1(2022):64-74. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| JAS-2021-0110.pdf（19604KB） | 期刊论文 | 出版稿 | 开放获取 | CC BY-NC-SA | View | |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment