Learning-based collision-free planning on arbitrary optimization criteria in the latent space through cGANs

References

• Goodfellow I, Pouget-Abadie J, Mirza M, et al. Generative Adversarial Nets. Adv Neural Inf Process Syst. 2014;27.
   Google Scholar
• Mirza M, Osindero S. Conditional Generative Adversarial Nets. CoRR. 2014. http://arxiv.org/abs/1411.1784/.
   Google Scholar
• Kuffner JJ, LaValle SM. RRT-connect: An efficient approach to single-query path planning. In: Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065); San Francisco, CA, USA; Vol. 2; IEEE; 2000. p. 995–1001.
   Google Scholar
• Warren CW. Multiple robot path coordination using artificial potential fields. In: Proceedings of IEEE International Conference on Robotics and Automation; Cincinnati, OH, USA; IEEE; 1990. p. 500–505.
   Google Scholar
• Li G, Yamashita A, Asama H, et al. An efficient improved artificial potential field based regression search method for robot path planning. In: 2012 IEEE International Conference on Mechatronics and Automation; Chengdu, China; IEEE; 2012. p. 1227–1232.
   Google Scholar
• Ratliff ND, Issac J, Kappler D, et al. Riemannian motion policies. arXiv preprint arXiv:180102854. 2018.
   Google Scholar
• LaValle SM. Rapidly-Exploring Random Trees: A New Tool for Path Planning. 1998.
   Google Scholar
• LaValle SM, Kuffner Jr JJ. Randomized kinodynamic planning. Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C). 1999;1:473–479.
   Google Scholar
• Wang W, Xu X, Li Y, et al. Triple RRTs: An Effective Method for Path Planning in Narrow Passages. Adv Robot. 2010;24(7):943–962.
   Web of Science ®Google Scholar
• Hart P, Nilsson N, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybernetics. 1968;4(2):100–107.
   Web of Science ®Google Scholar
• Campana M, Lamiraux F, Laumond JP. A gradient-based path optimization method for motion planning. Adv Robot. 2016;30(17-18):1126–1144.
   Web of Science ®Google Scholar
• Karaman S, Frazzoli E. Incremental sampling-based algorithms for optimal motion planning. In: Robotics: Science and Systems VI. MIT Press; Zaragoza, Spain; 2011. p. 267–274.
   Google Scholar
• Naderi K, Rajamäki J, Hämäläinen P. RT-RRT*: a real-time path planning algorithm based on RRT*. In: Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games; Association for Computing Machinery; Paris, France; 2015. p. 113–118.
   Google Scholar
• Qureshi AH, Ayaz Y. Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Rob Auton Syst. 2015;68:1–11.
   Web of Science ®Google Scholar
• Qureshi AH, Ayaz Y. Potential functions based sampling heuristic for optimal path planning. Autonomous Robots. 2016;40(6):1079–1093.
   Web of Science ®Google Scholar
• Tahir Z, Qureshi AH, Ayaz Y, et al. Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments. Rob Auton Syst. 2018;108:13–27.
   Web of Science ®Google Scholar
• Lalibertk T, Gosselin CM. Efficient algorithms for the trajectory planning of redundant manipulators with obstacle avoidance. In: Proceedings of the 1994 IEEE International Conference on Robotics and Automation; Vol. 3; San Diego, CA, USA; IEEE; 1994. p. 2044–2049.
   Google Scholar
• Flash T, Hogan N. The coordination of arm movements: an experimentally confirmed mathematical model. J Neurosci. 1985;5:1688–1703.
   PubMed Web of Science ®Google Scholar
• Srinivas A, Jabri A, Abbeel P, et al. Universal Planning Networks: Learning Generalizable Representations for Visuomotor Control. In: International Conference on Machine Learning; PMLR; Stockholm, Sweden; 2018. p. 4732–4741.
   Google Scholar
• Tamar A, WU Y, Thomas G, et al. Value Iteration Networks. Advances in Neural Information Processing Systems; Vol. 29; Barcelona, SPAIN; 2016.
   Google Scholar
• Ichter B, Harrison J, Pavone M. Learning Sampling Distributions for Robot Motion Planning. In: 2018 IEEE International Conference on Robotics and Automation (ICRA); IEEE; Brisbane, Australia; 2018. p. 7087–7094.
   Google Scholar
• Wang A, Kurutach T, Liu K, et al.Learning Robotic Manipulation through Visual Planning and Acting. CoRR. 2019. http://arxiv.org/abs/1905.04411.
   Google Scholar
• Kumar R, Mandalika A, Choudhury S, et al. LEGO: Leveraging Experience in Roadmap Generation for Sampling-Based Planning. preprint arXiv:190709574, 2019.
   Google Scholar
• Terasawa R, Ariki Y, Narihira T, et al. 3D-CNN Based Heuristic Guided Task-Space Planner for Faster Motion Planning. In: 2020 International Conference on Robotics and Automation (ICRA); IEEE; Paris, France; 2020. p. 9548–9554.
   Google Scholar
• Ota K, Sasaki Y, Jha DK, et al.Efficient Exploration in Constrained Environments with Goal-Oriented Reference Path. In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS); IEEE; Las Vegas, NV, USA; 2020. p. 6061–6068.
   Google Scholar
• Wen S, Chen J, Wang S, et al. Path Planning of Humanoid Arm Based on Deep Deterministic Policy Gradient. In: 2018 IEEE International Conference on Robotics and Biomimetics (ROBIO); IEEE; Kuala Lumpur, Malaysia; 2018. p. 1755–1760.
   Google Scholar
• Taniguchi A, Sasaki F, Muroi M, et al. Planning on topological map using omnidirectional images and spherical CNNs. Adv Robot. 2022;36(3):153–166.
   Web of Science ®Google Scholar
• Kutsuzawa K, Kusano H, Kume A, et al. Motion Generation Considering Situation with Conditional Generative Adversarial Networks for Throwing Robots. preprint arXiv:191003253, 2019.
   Google Scholar
• Qureshi AH, Simeonov M, Bency MJ, et al. Motion Planning Networks. In: 2019 International Conference on Robotics and Automation (ICRA); IEEE; Montreal, QC, Canada; 2019. pp. 2118-2124.
   Google Scholar
• Ichter B, Pavone M. Robot Motion Planning in Learned Latent Spaces. IEEE Robot Automation Lett. 2019;4(3):2407–2414.
   Web of Science ®Google Scholar
• Kingma DP, Ba J. Adam: A Method for Stochastic Optimization. San Diego, CA: International Conference on Learning Representations (ICLR); 2014.
   Google Scholar
• Rodriguez C, Denny J, Jacobs SA, et al. Blind RRT: A probabilistically complete distributed RRT. In: 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems; IEEE; Tokyo, Japan; 2013. p. 1758–1765.
   Google Scholar
• Svenstrup M, Bak T, Andersen HJ. Minimising computational complexity of the RRT algorithm a practical approach. In: 2011 IEEE International Conference on Robotics and Automation; IEEE; Shanghai, China; 2011. p. 5602–5607.
   Google Scholar
• Ioffe S, Szegedy C. Batch normalization: accelerating deep network training by reducing internal covariate shift. In: Proceedings of the 32nd International Conference on International Conference on Machine Learning, ICML'15 – Volume 37; JMLR; Lille, France; 2015. p. 448–456.
   Google Scholar
• Miyato T, Kataoka T, Koyama M, et al. Spectral Normalization for Generative Adversarial Networks. In: International Conference on Learning Representations; Vancouver, BC, Canada; 2018.
   Google Scholar