Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning

Tianyi Zhang; Jiankun Wang; Max Q.-H. Meng

doi:10.1109/JAS.2021.1004275

Volume 9 Issue 1

Jan. 2022

IEEE/CAA Journal of Automatica Sinica

JCR Impact Factor: 15.3, Top 1 (SCI Q1)

CiteScore: 23.5, Top 2% (Q1)
Google Scholar h5-index: 77， TOP 5

Turn off MathJax

Article Contents

Article Navigation > IEEE/CAA Journal of Automatica Sinica > 2022 > 9(1): 64-74

T. Y. Zhang, J. K. Wang, and M. Q.-H. Meng, “Generative adversarial network based heuristics for sampling-based path planning,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 1, pp. 64–74, Jan. 2022. doi: 10.1109/JAS.2021.1004275

Citation:

T. Y. Zhang, J. K. Wang, and M. Q.-H. Meng, “Generative adversarial network based heuristics for sampling-based path planning,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 1, pp. 64–74, Jan. 2022. doi: 10.1109/JAS.2021.1004275

Citation:

PDF( 10361 KB)

Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning

doi: 10.1109/JAS.2021.1004275

1.
Department of Electronic and Electrical Engineering, Southern University of Science and Technology, Shenzhen 518055, China
2.
Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong, China
3.
Shenzhen Research Institute, The Chinese University of Hong Kong, Hong Kong, China

Funds: This work was partially supported by National Key R&D Program of China (2019YFB1312400), Shenzhen Key Laboratory of Robotics Perception and Intelligence (ZDSYS20200810171800001), Hong Kong RGC GRF (14200618), Hong Kong RGC CRF (C4063-18G)

More Information

Author Bio:
Tianyi Zhang received the B.E. degree in automation from Harbin Institute of Technology in 2020. She is currently a Research Assistant with the Department of Electronic and Electrical Engineering of the Southern University of Science and Technology. Her current research interests include machine learning in robotics and computer vision

Jiankun Wang received the B.E. degree in automation from Shandong University in 2015, and the Ph.D. degree in Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong, China, in 2019. He is currently a Research Assistant Professor with the Department of Electronic and Electrical Engineering of the Southern University of Science and Technology. During the Ph.D. study, he spent six months at Stanford University, USA, as a Visiting Student Scholar supervised by Prof. Oussama Khatib. His current research interests include motion planning and control, human robot interaction, and machine learning in robotics

Max Q.-H. Meng (Fellow, IEEE) is currently a Chair Professor and the Head of the Department of Electronic and Electrical Engineering at the Southern University of Science and Technology, on leave from the Department of Electronic Engineering at The Chinese University of Hong Kong, China. He received the Ph.D. degree in electrical and computer engineering from the University of Victoria, Canada, in 1992. He joined The Chinese University of Hong Kong, China, in 2001 as a Professor and later the Chairman of Department of Electronic Engineering. He was with the Department of Electrical and Computer Engineering at the University of Alberta in Canada, where he served as the Director of the ART (Advanced Robotics and Teleoperation) Lab and held the positions of Assistant Professor (1994), Associate Professor (1998), and Professor (2000), respectively. He is an Honorary Chair Professor at Harbin Institute of Technology and Zhejiang University, and also the Honorary Dean of the School of Control Science and Engineering at Shandong University. His research interests include robotics, perception, and intelligence. He has published more than 750 journal and conference papers and book chapters and led more than 60 funded research projects to completion as Principal Investigator. He has been serving as the Editor-in-Chief and editorial board of a number of international journals and as the General Chair or Program Chair of many international conferences, including the General Chair of IROS 2005 and General Chair of ICRA 2021 held in Xi’an in May 2021. He served as an Associate VP for Conferences of the IEEE Robotics and Automation Society (2004–2007), Co-Chair of the Fellow Evaluation Committee and an elected Member of the AdCom of IEEE RAS. He is a Recipient of the IEEE Millennium Medal, a Fellow of IEEE, a Fellow of Hong Kong Institution of Engineers, and an Academician of the Canadian Academy of Engineering
Corresponding author: Max Q.-H. Meng, e-mail: max.meng@ieee.org
Tianyi Zhang and Jiankun Wang contributed equally to this work.
Received Date: 2021-01-27
Revised Date: 2021-03-30
Accepted Date: 2021-06-22

Available Online: 2021-07-20

Abstract

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.
- Generative adversarial network (GAN),
- optimal path planning,
- robot path planning,
- sampling-based path planning

FullText(HTML)

Tianyi Zhang and Jiankun Wang contributed equally to this work.

References(35)

References

[1]	B. Siciliano and O. Khatib, Springer Handbook of Robotics. Springer, 2016.
[2]	O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” Int. Journal of Robotics Research, vol. 5, no. 1, pp. 90–98, 1986. doi: 10.1177/027836498600500106
[3]	F. Lingelbach, “Path planning using probabilistic cell decomposition,” in Proc. IEEE Int. Conf. Robotics and Automation, vol. 1, 2004, pp. 467–472.
[4]	P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Trans. Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968. doi: 10.1109/TSSC.1968.300136
[5]	A. Stentz, “Optimal and efficient path planning for partially known environments,” in Intelligent Unmanned Ground Vehicles. Springer, 1997, pp. 203–220.
[6]	L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Trans. Robotics and Automation, vol. 12, no. 4, pp. 566–580, 1996. doi: 10.1109/70.508439
[7]	S. M. LaValle, “Rapidly-exploring random trees: A new tool for path planning,” 1998.
[8]	D. J. Webb and J. Van Den Berg, “Kinodynamic RRT: Asymptotically optimal motion planning for robots with linear dynamics,” in Proc. IEEE Int. Conf. Robotics and Automation*, 2013, pp. 5054–5061.
[9]	J. Wang and M. Q.-H. Meng, “Socially compliant path planning for robotic autonomous luggage trolley collection at airports,” Sensors, vol. 19, no. 12, p. 2759, 2019.
[10]	S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” The International Journal of Robotics Research, vol. 30, no. 7, pp. 846–894, 2011. doi: 10.1177/0278364911406761
[11]	A. Hentout, A. Maoudj, D. Yahiaoui, and M. Aouache, “RRT-A*-BT approach for optimal collision-free path planning for mobile robots,” 2019.
[12]	J. Wang and M. Q.-H. Meng, “Optimal path planning using generalized voronoi graph and multiple potential functions,” IEEE Trans. Industrial Electronics, vol. 67, no. 12, pp. 10621–10630, 2020.
[13]	Z. Liu, F. Lan, and H. Yang, “Partition heuristic RRT algorithm of path planning based on Q-learning,” in Proc. IEEE 4th Advanced Information Technology, Electronic and Automation Control Conf., vol. 1, 2019, pp. 386–392.
[14]	J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Informed RRT: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,” in Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems*, 2014, pp. 2997– 3004.
[15]	I. Baldwin and P. Newman, “Non-parametric learning for natural plan generation,” in Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems, 2010, pp. 4311–4317.
[16]	W. Wang, L. Zuo, and X. Xu, “A learning-based multi-RRT approach for robot path planning in narrow passages,” Journal of Intelligent &Robotic Systems, vol. 90, no. 1–2, pp. 81–100, 2018.
[17]	B. Ichter, J. Harrison, and M. Pavone, “Learning sampling distributions for robot motion planning,” in Proc. IEEE Int. Conf. Robotics and Automation, 2018, pp. 7087–7094.
[18]	A. H. Qureshi and M. C. Yip, “Deeply informed neural sampling for robot motion planning,” in Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems, 2018, pp. 6582–6588.
[19]	J. Wang, W. Chi, C. Li, C. Wang, and M. Q.-H. Meng, “Neural RRT: Learning-based optimal path planning,” IEEE Trans. Automation Science and Engineering*, vol. 17, no. 4, pp. 1748–1758, 2020.
[20]	M. Mohammadi, A. Al-Fuqaha, and J.-S. Oh, “Path planning in support of smart mobility applications using generative adversarial networks,” in Proc. IEEE Int. Conf. Internet of Things and IEEE Green Computing and Communications and IEEE Cyber, Physical and Social Computing and IEEE Smart Data, 2018, pp. 878–885.
[21]	D. Choi, S.-j. Han, K. Min, and J. Choi, “Pathgan: Local path planning with generative adversarial networks,” arXiv preprint arXiv: 2007.03877, 2020.
[22]	V. Badrinarayanan, A. Kendall, and R. Cipolla, “Segnet: A deep convolutional encoder-decoder architecture for image segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 39, no. 12, pp. 2481–2495, 2017. doi: 10.1109/TPAMI.2016.2644615
[23]	O. Ronneberger, P. Fischer, and T. Brox, “U-Net: Convolutional networks for biomedical image segmentation,” in Proc. Int. Conf. Medical Image Computing and Computer-Assisted Intervention. Springer, 2015, pp. 234–241.
[24]	K. He, G. Gkioxari, P. Dollár, and R. Girshick, “Mask R-CNN,” in Proc. IEEE Int. Conf. Computer Vision, 2017, pp. 2961–2969.
[25]	K. Sohn, H. Lee, and X. Yan, “Learning structured output representation using deep conditional generative models,” in Advances in Neural Information Processing Systems, 2015, pp. 3483–3491.
[26]	I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in Advances in Neural Information Processing Systems, 2014, pp. 2672– 2680.
[27]	Y. Lu, S. Wu, Y.-W. Tai, and C.-K. Tang, “Image generation from sketch constraint using contextual gan,” in Proc. European Conf. Computer Vision, 2018, pp. 205–220.
[28]	C. Han, H. Hayashi, L. Rundo, R. Araki, W. Shimoda, S. Muramatsu, Y. Furukawa, G. Mauri, and H. Nakayama, “GAN-based synthetic brain MR image generation,” in Proc. IEEE 15th Int. Symp. Biomedical Imaging, 2018, pp. 734–738.
[29]	M. Zhai, L. Chen, F. Tung, J. He, M. Nawhal, and G. Mori, “Lifelong GAN: Continual learning for conditional image generation,” in Proc. IEEE Int. Conf. Computer Vision, 2019, pp. 2759–2768.
[30]	A. Cherian and A. Sullivan, “Sem-GAN: Semantically-consistent image-to-image translation,” in Proc. IEEE Winter Conf. Applications of Computer Vision, 2019, pp. 1797–1806.
[31]	Y. Li, S. Tang, R. Zhang, Y. Zhang, J. Li, and S. Yan, “Asymmetric GAN for unpaired image-to-image translation,” IEEE Trans. Image Processing, vol. 28, no. 12, pp. 5881–5896, 2019. doi: 10.1109/TIP.2019.2922854
[32]	X. Guo, Z. Wang, Q. Yang, W. Lv, X. Liu, Q. Wu, and J. Huang, “GAN-based virtual-to-real image translation for urban scene semantic segmentation,” Neurocomputing, vol. 394, pp. 127–135, 2020. doi: 10.1016/j.neucom.2019.01.115
[33]	K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2016, pp. 770–778.
[34]	X. Wang, R. Girshick, A. Gupta, and K. He, “Non-local neural networks,” in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2018, pp. 7794–7803.
[35]	H. Zhang, I. Goodfellow, D. Metaxas, and A. Odena, “Self-attention generative adversarial networks,” in Proc. Int. Conf. Machine Learning. PMLR, 2019, pp. 7354–7363.

Supplements(0)

Cited By

Proportional views

Proportional views

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Figures(13)

Get Citation

PDF

XML

Article Metrics

Article views (7521) PDF downloads(140)

Highlights

Propose a heuristic method for sampling-based path planning algorithm using GAN.
Design a GAN model to predict the promising region for non-uniform sampling.
Apply the GAN-based heuristic method to case studies to demonstrate the effectiveness of the proposed method.

Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning

doi: 10.1109/JAS.2021.1004275

Abstract

References

Proportional views

Catalog

通讯作者: 陈斌, bchen63@163.com

Article Metrics

Highlights

Export File

Citation

Format

Content