Fetching the paper…
Reading the bibliography…
Learning priors on trajectory distributions can help accelerate robot motion planning optimization.
L. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Transactions on Robotics and Automation , 1996
1996
Earlier work this paper cites.
S. M. Lavalle, “Rapidly-exploring random trees: A new tool for path planning,” 1998
1998
Earlier work this paper cites.
J. Kuffner and S. LaValle, “Rrt-connect: An efficient approach to single-query path planning,” in IEEE ICRA , 2000
2000
Earlier work this paper cites.
H. Attias, “Planning by probabilistic inference,” in Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics , vol. R4. PMLR, 2003, pp. 9–16
2003
Earlier work this paper cites.
S. M. LaValle, Planning Algorithms . Cambridge, U.K.: Cambridge University Press, 2006
2006
Earlier work this paper cites.
N. Ratliff, M. Zucker, J. A. Bagnell, and S. Srinivasa, “Chomp: Gradient optimization techniques for efficient motion planning,” in IEEE International Conference on Robotics and Automation , 2009
2009
Earlier work this paper cites.
M. Toussaint, “Robot trajectory optimization using approximate inference,” in ICML . Association for Computing Machinery, 2009
2009
Earlier work this paper cites.
K. K. Hauser and V. Ng-Thow-Hing, “Fast smoothing of manipulator trajectories using optimal bounded-acceleration shortcuts.” in ICRA . IEEE, 2010, pp. 2493–2498
2010
Earlier work this paper cites.
J. Peters, K. Mülling, and Y. Altün, “Relative entropy policy search,” in AAAI . AAAI Press, 2010
2010
Earlier work this paper cites.
M. Kalakrishnan, S. Chitta, E. Theodorou, P. Pastor, and S. Schaal, “Stomp: Stochastic trajectory optimization for motion planning,” in IEEE International Conference on Robotics and Automation , 2011
2011
Earlier work this paper cites.
S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” IJRR , vol. 30, no. 7, pp. 846–894, 2011
2011
Earlier work this paper cites.
M. Elbanhawi and M. Simic, “Sampling-based robot motion planning: A review,” IEEE Access , vol. 2, pp. 56–77, 2014
2014
Earlier work this paper cites.
T. D. Barfoot, C. H. Tong, and S. Särkkä, “Batch continuous-time trajectory estimation as exactly sparse gaussian process regression.” in RSS , 2014
2014
Earlier work this paper cites.
J. Sohl-Dickstein, E. A. Weiss, N. Maheswaranathan, and S. Ganguli, “Deep unsupervised learning using nonequilibrium thermodynamics,” in ICML . JMLR.org, 2015
2015
Earlier work this paper cites.
K. Sohn, H. Lee, and X. Yan, “Learning structured output representation using deep conditional generative models,” in NeurIPS , vol. 28. Curran Associates, Inc., 2015
2015
Earlier work this paper cites.
J. Dong, M. Mukadam, F. Dellaert, and B. Boots, “Motion planning as probabilistic inference using Gaussian processes and factor graphs,” in RSS , 2016
2016
Earlier work this paper cites.
D. Koert, G. Maeda, R. Lioutikov, G. Neumann, and J. Peters, “Demonstration based trajectory optimization for generalizable robot motions,” in IEEE-RAS Humanoids , 2016, pp. 515–522
2016
Earlier work this paper cites.
K. Lynch and F. Park, Modern Robotics: Mechanics, Planning, and Control . Cambridge Univeristy Press, 2017
2017
Earlier work this paper cites.
M. A. Rana, M. Mukadam, S. R. Ahmadzadeh, S. Chernova, and B. Boots, “Towards robust skill generalization: Unifying learning from demonstration and motion planning,” in CoRL . PMLR, 2017
2017
Cited alongside, same era.
M. Mukadam, J. Dong, X. Yan, F. Dellaert, and B. Boots, “Continuous-time gaussian process motion planning via probabilistic inference,” Int. J. Robotics Res. , vol. 37, no. 11, 2018
2018
Cited alongside, same era.
B. Ichter, J. Harrison, and M. Pavone, “Learning sampling distributions for robot motion planning,” in IEEE ICRA , 2018
2018
Cited alongside, same era.
T. Osa, J. Pajarinen, G. Neumann, J. A. Bagnell, P. Abbeel, and J. Peters, “An algorithmic perspective on imitation learning,” Found. Trends Robotics , vol. 7, no. 1-2, pp. 1–179, 2018
2018
Cited alongside, same era.
A. H. Qureshi and M. C. Yip, “Deeply informed neural sampling for robot motion planning,” in IEEE/RSJ IROS , 2018
R. Rombach, A. Blattmann, D. Lorenz, P. Esser, and B. Ommer, “High-resolution image synthesis with latent diffusion models,” 2021
2021
Later among the works it cites.
P. Dhariwal and A. Nichol, “Diffusion models beat gans on image synthesis,” 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
A. Q. Nichol and P. Dhariwal, “Improved denoising diffusion probabilistic models,” in ICML . PMLR, 2021
2021
Later among the works it cites.
P. Dhariwal and A. Q. Nichol, “Diffusion models beat gans on image synthesis,” in NeurIPS , 2021, pp. 8780–8794
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
S. Levine, “Reinforcement learning and control as probabilistic inference: Tutorial and review,” 2018
2018
Cited alongside, same era.
J. Dong, M. Mukadam, B. Boots, and F. Dellaert, “Sparse Gaussian processes on matrix Lie groups: A unified framework for optimizing continuous-time trajectories,” in IEEE ICRA , 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
A. H. Qureshi, A. Simeonov, M. J. Bency, and M. C. Yip, “Motion planning networks,” in IEEE ICRA , 2019
2019
Cited alongside, same era.
Y. Song and S. Ermon, “Generative modeling by estimating gradients of the data distribution,” in NeurIPS , 2019
2019
Cited alongside, same era.
J. Watson, H. Abdulsamad, and J. Peters, “Stochastic optimal control as approximate input inference,” in CoRL . PMLR, 2019
2019
Cited alongside, same era.
A. Paszke et al. , “Pytorch: An imperative style, high-performance deep learning library,” in NeurIPS . Curran Associates, Inc., 2019
2019
Cited alongside, same era.
J. Urain, A. Le, A. Lambert, G. Chalvatzaki, B. Boots, and J. Peters, “Learning implicit priors for motion optimization,” in IEEE/RSJ International Conference on Intelligent Robots and Systems , 2022
2022
Later among the works it cites.
J. Ortiz-Haro, J.-S. Ha, D. Driess, and M. Toussaint, “Structured deep generative models for sampling on constraint manifolds in sequential manipulation,” in CoRL . PMLR, 2022
2022
Later among the works it cites.
G. Kim, T. Kwon, and J. C. Ye, “Diffusionclip: Text-guided diffusion models for robust image manipulation,” in IEEE/CVF CVPR , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
I. Kapelyukh, V. Vosylius, and E. Johns, “Dall-e-bot: Introducing web-scale diffusion models to robotics,” 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Carvalho, M. Baierl, J. Urain, and J. Peters, “Conditioned score-based models for learning collision-free trajectory generation,” in NeurIPS 2022 Workshop on Score-Based Methods , 2022
2022
Later among the works it cites.
M. Janner, Y. Du, J. Tenenbaum, and S. Levine, “Planning with diffusion for flexible behavior synthesis,” in ICML , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Watson and J. Peters, “Inferring smooth control: Monte carlo posterior policy iteration with gaussian processes,” in CoRL , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Urain, N. Funk, J. Peters, and G. Chalvatzaki, “Se(3)-diffusionfields: Learning smooth cost functions for joint grasp and motion optimization through diffusion,” in IEEE ICRA , 2023
2023
Closest in time.