The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
STOMP: Stochastic trajectory optimization for motion planning
Abstract
We present a new approach to motion planning using a stochastic trajectory optimization framework. The approach relies on generating noisy trajectories to explore the space around an initial (possibly infeasible) trajectory, which are then combined to produced an updated trajectory with lower cost. A cost function based on a combination of obstacle and smoothness cost is optimized in each iteration. No gradient information is required for the particular optimization algorithm that we use and so general costs for which derivatives may not be available (e.g. costs corresponding to constraints and motor torques) can be included in the cost function. We demonstrate the approach both in simulation and on a mobile manipulation system for unconstrained and constrained tasks. We experimentally show that the stochastic nature of STOMP allows it to overcome local minima that gradient-based methods like CHOMP can get stuck in.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ROS: an open-source Robot Operating System
Quigley, M. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · Cited by 8,729
Rigid Body Dynamics Algorithms
Featherstone, R. (2008) · Springer eBooks · doi:10.1007/978-1-4899-7560-7 · Cited by 1,376
CHOMP: Gradient optimization techniques for efficient motion planning
Ratliff, N., Zucker, M., Bagnell, J. A., & Srinivasa, S. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152817 · Cited by 992
Featherstone, R. (1987) · Springer eBooks · doi:10.1007/978-0-387-74315-8 · Cited by 875
Learning Attractor Landscapes for Learning Motor Primitives
Ijspeert, A. J., Nakanishi, J., Stefan Schaal, A., Becker, S., Thrun, S., & Obermayer, K. (2002) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 572
Manipulation planning on constraint manifolds
Berenson, D., Srinivasa, S. S., Ferguson, D., & Kuffner, J. J. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152399 · Cited by 296
Reinforcement learning of motor skills in high dimensions: A path integral approach
Theodorou, E., Buchli, J., & Schaal, S. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509336 · Cited by 252
Self-citationMotion Planning for Humanoid Robots
Kuffner, J., Nishiwaki, K., Kagami, S., Inaba, M., & Inoue, H. (2005) · Springer Tracts in Advanced Robotics · doi:10.1007/11008941_39 · Cited by 218
Using Expectation-Maximization for Reinforcement Learning
Dayan, P., & Hinton, G. E. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.271 · Cited by 172
Manipulation planning with Workspace Goal Regions
Berenson, D., Srinivasa, S. S., Ferguson, D., Collet, A., & Kuffner, J. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2009.5152401 · Cited by 156
Fast smoothing of manipulator trajectories using optimal bounded-acceleration shortcuts
Hauser, K. K., & Ng‐Thow‐Hing, V. (2010) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2010.5509683 · Cited by 113
Real-time perception-guided motion planning for a personal robot
Rusu, R. B., Sucan, I. A., Gerkey, B. P., Chitta, S., Beetz, M., & Kavraki, L. E. (2009) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2009.5354396 · Cited by 91
Self-citationBiSpace Planning: Concurrent Multi-Space Exploration
Diankov, R., Ratliff, N., Ferguson, D., Srinivasa, S., & Kuffner, J. (2008) · Robotics: Science and Systems IV · doi:10.15607/rss.2008.iv.021 · Cited by 89
Motion planning for cooperating mobile manipulators
Desai, J. P., & Kumar, V. (1999) · Journal of Robotic Systems · doi:10.1002/(sici)1097-4563(199910)16:10 · Cited by 47
Trajectory prediction in cluttered voxel environments
Jetchev, N., & Toussaint, M. (2010) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2010.5509825 · Cited by 34
Learning to search: structured prediction techniques for imitation learning
Bagnell, J. A., & Ratliff, N. (2009) · Cited by 21
Cited by
Motion planning with sequential convex optimization and convex collision checking
Schulman, J., Duan, Y., Ho, J., Lee, A., Awwal, I., Bradlow, H., Pan, J., Patil, S., Goldberg, K., & Abbeel, P. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914528132 · Cited by 866
Robot Collisions: A Survey on Detection, Isolation, and Identification
Haddadin, S., De Luca, A., & Albu-Schaffer, A. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2017.2723903 · Cited by 791
CHOMP: Covariant Hamiltonian optimization for motion planning
Zucker, M., Ratliff, N., Dragan, A. D., Pivtoraiko, M., Klingensmith, M., Dellin, C. M., Bagnell, J. A., & Srinivasa, S. S. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913488805 · Cited by 758
Recent Advances in Robot Learning from Demonstration
Ravichandar, H., Polydoros, A. S., Chernova, S., & Billard, A. (2020) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-100819-063206 · Cited by 752
Robust and Efficient Quadrotor Trajectory Generation for Fast Autonomous Flight
Zhou, B., Gao, F., Wang, L., Liu, C., & Shen, S. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2927938 · Cited by 747
Metadata
- Authors
- Kalakrishnan, M., Chitta, S., Theodorou, E., Pastor, P., & Schaal, S.
- Venue
- 2011 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2011-05
- Pages
- 4569-4574
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2019965290
- Cited by
- 876
- References
- 16
- FWCI
- 16.26
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.