Fetching the paper…
Reading the bibliography…
Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars.
S. M. LaValle, “Rapidly-exploring random trees: A new tool for path planning,” 1998
1998
Earlier work this paper cites.
R. Volpe, “Rover functional autonomy development for the mars mobile science laboratory,” in Proceedings of the 2003 IEEE Aerospace Conference , vol. 2, 2003, pp. 643–652
2003
Earlier work this paper cites.
S. M. LaValle, Planning algorithms . Cambridge university press, 2006
2006
Earlier work this paper cites.
S. Calinon, F. D’halluin, E. L. Sauser, D. G. Caldwell, and A. G. Billard, “Learning and reproduction of gestures by imitation,” IEEE Robotics & Automation Magazine , vol. 17, no. 2, pp. 44–54, 2010
2010
Earlier work this paper cites.
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
2011
Earlier work this paper cites.
S. Rifai, P. Vincent, X. Muller, X. Glorot, and Y. Bengio, “Contractive auto-encoders: Explicit invariance during feature extraction,” in Proceedings of the 28th International Conference on International Conference on Machine Learning . Omnipress, 2011, pp. 833–840
2011
Earlier work this paper cites.
R. B. Rusu and S. Cousins, “3D is here: Point Cloud Library (PCL),” in IEEE International Conference on Robotics and Automation (ICRA) , Shanghai, China, May 9-13 2011
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
T. Lozano-Perez, Autonomous robot vehicles . Springer Science & Business Media, 2012
2012
Earlier work this paper cites.
D. Berenson, P. Abbeel, and K. Goldberg, “A robot path planning framework that learns from experience,” in Robotics and Automation (ICRA), 2012 IEEE International Conference on . IEEE, 2012, pp. 3671–3678
2012
Earlier work this paper cites.
I. A. Şucan, M. Moll, and L. E. Kavraki, “The Open Motion Planning Library,” IEEE Robotics & Automation Magazine , vol. 19, no. 4, pp. 72–82, December 2012, http://ompl.kavrakilab.org
2012
Cited alongside, same era.
N. Srivastava, G. E. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting.” Journal of machine learning research , vol. 15, no. 1, pp. 1929–1958, 2014
2014
Cited alongside, same era.
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 Intelligent Robots and Systems (IROS 2014), 2014 IEEE/RSJ International Conference on . IEEE, 2014, pp. 2997–3004
2014
Cited alongside, same era.
——, “Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments,” Robotics and Autonomous Systems , vol. 68, pp. 1–11, 2015
2015
R. Rahmatizadeh, P. Abolghasemi, A. Behal, and L. Bölöni, “Learning real manipulation tasks from virtual demonstrations using lstm,” arXiv preprint , 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang, Z. DeVito, Z. Lin, A. Desmaison, L. Antiga, and A. Lerer, “Automatic differentiation in pytorch,” 2017
2017
Later among the works it cites.
N. Das, N. Gupta, and M. Yip, “Fastron: An online learning-based model and active learning strategy for proxy collision detection,” in Conference on Robot Learning , 2017, pp. 496–504
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Batch informed trees (bit*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,” in Robotics and Automation (ICRA), 2015 IEEE International Conference on . IEEE, 2015, pp. 3067–3074
2015
Cited alongside, same era.
J. Schmidhuber, “Deep learning in neural networks: An overview,” Neural networks , vol. 61, pp. 85–117, 2015
2015
Cited alongside, same era.
A. H. Qureshi and Y. Ayaz, “Potential functions based sampling heuristic for optimal path planning,” Autonomous Robots , vol. 40, no. 6, pp. 1079–1093, 2016
2016
Cited alongside, same era.
S. Levine, C. Finn, T. Darrell, and P. Abbeel, “End-to-end training of deep visuomotor policies,” Journal of Machine Learning Research , vol. 17, no. 39, pp. 1–40, 2016
2016
Cited alongside, same era.
A. Tamar, Y. Wu, G. Thomas, S. Levine, and P. Abbeel, “Value iteration networks,” in Advances in Neural Information Processing Systems , 2016, pp. 2154–2162
2016
Cited alongside, same era.
2016
Cited alongside, same era.
I. A. Şucan and S. Chitta, “Moveit!”, [online] available: http://moveit.ros.org.”
Cited in the paper.
J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ramalho, A. Grabska-Barwinska et al. , “Overcoming catastrophic forgetting in neural networks,” Proceedings of the National Academy of Sciences , vol. 114, no. 13, pp. 3521–3526, 2017
2017
Later among the works it cites.
Z. Tahir, A. H. Qureshi, Y. Ayaz, and R. Nawaz, “Potentially guided bidirectionalized rrt* for fast optimal path planning in cluttered environments,” Robotics and Autonomous Systems , vol. 108, pp. 13–27, 2018
2018
Closest in time.
B. Ichter, J. Harrison, and M. Pavone, “Learning sampling distributions for robot motion planning,” in 2018 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2018, pp. 7087–7094
2018
Closest in time.
A. H. Qureshi and M. C. Yip, “Deeply informed neural sampling for robot motion planning,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2018, pp. 6582–6588
2018
Closest in time.