Fetching the paper…
Reading the bibliography…
Fast and efficient sampling-based motion planning (SMP) is an integral component of many robotic systems, such as autonomous cars.
L. E. Dubins, “On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents,” American Journal of Mathematics , 1957
1957
Earlier work this paper cites.
Lozano-Perez, “Spatial planning: A configuration space approach,” IEEE Transactions on Computers , vol. C-32, no. 2, pp. 108–120, 1983
1983
Earlier work this paper cites.
L. Blackmore, M. Ono, and B. C. Williams, “Chance-constrained optimal path planning with obstacles,” IEEE Tran. on Robotics , 2011
2011
Earlier work this paper cites.
S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” The Int. Journal of Robot. Res. , no. 7, 2011
2011
Earlier work this paper cites.
S. Patil, J. van den Berg, and R. Alterovitz, “Estimating probability of collision for safe motion planning under gaussian motion and sensing uncertainty,” in IEEE Int. Conf. Robot. and Automation , 2012
2012
Earlier work this paper cites.
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 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems , 2014
2014
Earlier work this paper cites.
A. H. Qureshi and Y. Ayaz, “Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments,” Robotics and Autonomous Systems , 2015
2015
Earlier work this paper cites.
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 2015 IEEE Int. Conf. Robot. Autom. IEEE, 2015
2015
Earlier work this paper cites.
S. Ren, K. He, R. Girshick, and J. Sun, “Faster R-CNN: Towards real-time object detection with region proposal networks,” in Advances in Neural Information Processing Systems , 2015
2015
Earlier work this paper cites.
R. Girshick, “Fast r-cnn,” in Proc. of the IEEE Int. Conf. on Computer Vision , 2015
2015
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in 3rd Int. Conf. on Learning Representations, ICLR , 2015
2015
Earlier work this paper cites.
O. Ronneberger, P. Fischer, and T. Brox, “U-net: Convolutional networks for biomedical image segmentation,” in Medical Image Computing and Computer-Assisted Intervention (MICCAI) , 2015
2015
Earlier work this paper cites.
Y. Li, Z. Littlefield, and K. E. Bekris, “Asymptotically optimal sampling-based kinodynamic planning,” The Int. Journal of Robot. Res. , no. 5, 2016
2016
Cited alongside, same era.
A. Tamar, Y. Wu, G. Thomas, S. Levine, and P. Abbeel, “Value iteration networks,” in Adv. in Neural Info. Processing Systems , 2016
2016
Cited alongside, same era.
A. H. Qureshi and Y. Ayaz, “Potential functions based sampling heuristic for optimal path planning,” Autonomous Robots , 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Y. Li, Z. Littlefield, and K. E. Bekris, “Asymptotically optimal sampling-based kinodynamic planning,” The Int. Journal of Robot. Res. , vol. 35, no. 5, 2016
B. Ichter, J. Harrison, and M. Pavone, “Learning sampling distributions for robot motion planning,” in IEEE Int. Conf. Robot. Autom. , 2018
2018
Later among the works it cites.
R. Kumar, A. Mandalika, S. Choudhury, and S. Srinivasa, “Lego: Leveraging experience in roadmap generation for sampling-based planning,” in 2019 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems , 2019
2019
Later among the works it cites.
J. J. Johnson, L. Li, F. Liu, A. H. Qureshi, and M. C. Yip, “Dynamically constrained motion planning networks for non-holonomic robots,” in IEEE/RSJ Int. Conf. on Intelligent Robots and Systems , 2020
2020
Later among the works it cites.
A. H. Qureshi, Y. Miao, A. Simeonov, and M. C. Yip, “Motion planning networks: Bridging the gap between learning-based and classical motion planners,” IEEE Transactions on Robotics , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” in Advances in Neural Information Processing Systems , 2017
2017
Cited alongside, same era.
J. Gehring, M. Auli, D. Grangier, D. Yarats, and Y. N. Dauphin, “Convolutional sequence to sequence learning,” in Int. Conf. on Machine Learning . JMLR.org, 2017
2017
Cited alongside, same era.
2018
Cited alongside, same era.
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 , 2018
2018
Cited alongside, same era.
P. Lehner and A. Albu-Schäffer, “The repetition roadmap for repetitive constrained motion planning,” IEEE Robot. and Autom. Letters , 2018
2018
Cited alongside, same era.
S. Choudhury, M. Bhardwaj, S. Arora, A. Kapoor, G. Ranade, S. Scherer, and D. Dey, “Data-driven planning via imitation learning,” The Int. Journal of Robot. Res. , 2018
2018
Cited alongside, same era.
A. Srinivas, A. Jabri, P. Abbeel, S. Levine, and C. Finn, “Universal planning networks: Learning generalizable representations for visuomotor control,” in Int. Conference on Machine Learning , 2018
2018
Cited alongside, same era.
S. Macenski, F. Martín, R. White, and J. G. Clavero, “The marathon 2: A navigation system,” in IEEE/RSJ Int. Conf. on Intelligent Robots and Systems , 2020
2020
Later among the works it cites.
B. Chen, B. Dai, Q. Lin, G. Ye, H. Liu, and L. Song, “Learning to plan in high dimensions via neural exploration-exploitation trees,” in Int. Conf. on Learning Representations, ICLR , 2020
2020
Later among the works it cites.
A. H. Qureshi, J. Dong, A. Choe, and M. C. Yip, “Neural manipulation planning on constraint manifolds,” IEEE Robot. and Autom. Letters , 2020
2020
Later among the works it cites.
L. Li, Y. Miao, A. H. Qureshi, and M. C. Yip, “MPC - MPNet: Model-predictive motion planning networks for fast, near-optimal planning under kinodynamic constraints,” IEEE Robot. and Autom. Letters , 2021
2021
Closest in time.
C. Chamzas, Z. Kingston, C. Quintero-Peña, A. Shrivastava, and L. E. Kavraki, “Learning sampling distributions using local 3d workspace decompositions for motion planning in high dimensions,” in IEEE Int. Conf. on Robot. and Autom. , 2021
2021
Closest in time.
A. Dosovitskiy, L. Beyer, A. Kolesnikov, D. Weissenborn, X. Zhai, T. Unterthiner, M. Dehghani, M. Minderer, G. Heigold, S. Gelly, J. Uszkoreit, and N. Houlsby, “An image is worth 16x16 words: Transformers for image recognition at scale,” in Int. Conf. on Learning Representations , 2021
2021
Closest in time.
Z. Liu, Y. Lin, Y. Cao, H. Hu, Y. Wei, Z. Zhang, S. Lin, and B. Guo, “Swin transformer: Hierarchical vision transformer using shifted windows,” in Proc. IEEE/CVF Int. Conf. on Computer Vision (ICCV) , 2021
2021
Closest in time.