EDMP: Ensemble-of-costs-guided Diffusion for Motion Planning (2309.11414v1)
Abstract: Classical motion planning for robotic manipulation includes a set of general algorithms that aim to minimize a scene-specific cost of executing a given plan. This approach offers remarkable adaptability, as they can be directly used off-the-shelf for any new scene without needing specific training datasets. However, without a prior understanding of what diverse valid trajectories are and without specially designed cost functions for a given scene, the overall solutions tend to have low success rates. While deep-learning-based algorithms tremendously improve success rates, they are much harder to adopt without specialized training datasets. We propose EDMP, an Ensemble-of-costs-guided Diffusion for Motion Planning that aims to combine the strengths of classical and deep-learning-based motion planning. Our diffusion-based network is trained on a set of diverse kinematically valid trajectories. Like classical planning, for any new scene at the time of inference, we compute scene-specific costs such as "collision cost" and guide the diffusion to generate valid trajectories that satisfy the scene-specific constraints. Further, instead of a single cost function that may be insufficient in capturing diversity across scenes, we use an ensemble of costs to guide the diffusion process, significantly improving the success rate compared to classical planners. EDMP performs comparably with SOTA deep-learning-based methods while retaining the generalization capabilities primarily associated with classical planners.
- “Approaches and challenges in robotic perception for table-top rearrangement and planning” In arXiv preprint arXiv:2205.04090, 2022
- “CHOMP: Gradient optimization techniques for efficient motion planning” In 2009 IEEE International Conference on Robotics and Automation, 2009, pp. 489–494 DOI: 10.1109/ROBOT.2009.5152817
- “Storm: An integrated framework for fast joint-space model-predictive control for reactive manipulation” In Conference on Robot Learning, 2022, pp. 750–759 PMLR
- “Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization”, 2013 DOI: 10.15607/RSS.2013.IX.031
- Peter E. Hart, Nils J. Nilsson and Bertram Raphael “A Formal Basis for the Heuristic Determination of Minimum Cost Paths” In IEEE Transactions on Systems Science and Cybernetics 4.2, 1968, pp. 100–107 DOI: 10.1109/TSSC.1968.300136
- “Anytime Dynamic A*: An Anytime, Replanning Algorithm.” In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2005, pp. 262–271
- Maxim Likhachev, Geoffrey J. Gordon and Sebastian Thrun “ARA*: Anytime A* with Provable Bounds on Sub-Optimality.” In NIPS MIT Press, 2003, pp. 767–774 URL: http://dblp.uni-trier.de/db/conf/nips/nips2003.html#LikhachevGT03
- James J. Kuffner and Steven M. LaValle “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) 2, 2000, pp. 995–1001 vol.2 URL: https://api.semanticscholar.org/CorpusID:17124403
- Steven M. LaValle “Rapidly-exploring random trees : a new tool for path planning” In The annual research report, 1998 URL: https://api.semanticscholar.org/CorpusID:14744621
- Moses Bangura “Real-Time Model Predictive Control for Quadrotors” In IFAC Proceedings Volumes 47, 2014, pp. 11773–11780 DOI: 10.3182/20140824-6-ZA-1003.00203
- “An integrated system for real-time model predictive control of humanoid robots” In 2013 13th IEEE-RAS International Conference on Humanoid Robots (Humanoids), 2013, pp. 292–299 DOI: 10.1109/HUMANOIDS.2013.7029990
- Grady Williams, Andrew Aldrich and Evangelos A. Theodorou “Model Predictive Path Integral Control using Covariance Variable Importance Sampling” In ArXiv abs/1509.01149, 2015 URL: https://api.semanticscholar.org/CorpusID:14146342
- “VP-STO: Via-point-based Stochastic Trajectory Optimization for Reactive Robot Behavior” In 2023 IEEE International Conference on Robotics and Automation (ICRA), 2022, pp. 10125–10131 URL: https://api.semanticscholar.org/CorpusID:252780630
- “Aggressive driving with model predictive path integral control” In 2016 IEEE International Conference on Robotics and Automation (ICRA), 2016, pp. 1433–1440 DOI: 10.1109/ICRA.2016.7487277
- “Motion Planning Networks” In 2019 International Conference on Robotics and Automation (ICRA), 2019, pp. 2118–2124 DOI: 10.1109/ICRA.2019.8793889
- “Motion policy networks” In Conference on Robot Learning, 2023, pp. 967–977 PMLR
- “Object rearrangement using learned implicit collision functions” In 2021 IEEE International Conference on Robotics and Automation (ICRA), 2021, pp. 6010–6017 IEEE
- “An algorithmic perspective on imitation learning” In Foundations and Trends® in Robotics 7.1-2 Now Publishers, Inc., 2018, pp. 1–179
- “Imitating human behaviour with diffusion models” In arXiv preprint arXiv:2301.10677, 2023
- “Learning fine-grained bimanual manipulation with low-cost hardware” In arXiv preprint arXiv:2304.13705, 2023
- “Deep unsupervised learning using nonequilibrium thermodynamics” In International conference on machine learning, 2015, pp. 2256–2265 PMLR
- Jonathan Ho, Ajay Jain and Pieter Abbeel “Denoising diffusion probabilistic models” In Advances in neural information processing systems 33, 2020, pp. 6840–6851
- “Zero-shot text-to-image generation” In International Conference on Machine Learning, 2021, pp. 8821–8831 PMLR
- “Hierarchical text-conditional image generation with clip latents” In arXiv preprint arXiv:2204.06125 1.2, 2022, pp. 3
- “Photorealistic text-to-image diffusion models with deep language understanding” In Advances in Neural Information Processing Systems 35, 2022, pp. 36479–36494
- “Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation” In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023, pp. 10219–10228
- “Planning with diffusion for flexible behavior synthesis” In arXiv preprint arXiv:2205.09991, 2022
- “Diffusion policy: Visuomotor policy learning via action diffusion” In arXiv preprint arXiv:2303.04137, 2023
- “AdaptDiffuser: Diffusion Models as Adaptive Self-evolving Planners”, 2023 arXiv:2302.01877 [cs.LG]
- “Is conditional generative modeling all you need for decision-making?” In arXiv preprint arXiv:2211.15657, 2022
- “Generative Adversarial Networks”, 2014 arXiv:1406.2661 [stat.ML]
- Diederik P Kingma and Max Welling “Auto-Encoding Variational Bayes”, 2022 arXiv:1312.6114 [stat.ML]
- “Motion Planning Diffusion: Learning and Planning of Robot Motions with Diffusion Models” In arXiv preprint arXiv:2308.01557, 2023
- “Diffusion Models Beat GANs on Image Synthesis”, 2021 arXiv:2105.05233 [cs.LG]
- E.G. Gilbert, D.W. Johnson and S.S. Keerthi “A fast procedure for computing the distance between complex objects in three-dimensional space” In IEEE Journal on Robotics and Automation 4.2, 1988, pp. 193–203 DOI: 10.1109/56.2083
- Gino Bergen “Proximity queries and penetration depth computation on 3d game objects”, 2001
- “PyBullet, a Python module for physics simulation for games, robotics and machine learning”, http://pybullet.org, 2016–2021
- Marlin P Strub and Jonathan D Gammell “Adaptively Informed Trees (AIT): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics” In 2020 IEEE International Conference on Robotics and Automation (ICRA), 2020, pp. 3191–3198 IEEE
- “Geometric Fabrics for the Acceleration-based Design of Robotic Motion”, 2021 arXiv:2010.14750 [cs.RO]
- Ioan A. Sucan, Mark Moll and Lydia E. Kavraki “The Open Motion Planning Library” In IEEE Robotics & Automation Magazine 19.4, 2012, pp. 72–82 DOI: 10.1109/MRA.2012.2205651