The DOI matches its Crossref record; 78 of the 78 references it cites were found in a registry or an index.
CHOMP: Covariant Hamiltonian optimization for motion planning
Open accessAbstract
In this paper, we present CHOMP (covariant Hamiltonian optimization for motion planning), a method for trajectory optimization invariant to reparametrization. CHOMP uses functional gradient techniques to iteratively improve the quality of an initial trajectory, optimizing a functional that trades off between a smoothness and an obstacle avoidance component. CHOMP can be used to locally optimize feasible trajectories, as well as to solve motion planning queries, converging to low-cost trajectories even when initialized with infeasible ones. It uses Hamiltonian Monte Carlo to alleviate the problem of convergence to high-cost local minima (and for probabilistic completeness), and is capable of respecting hard constraints along the trajectory. We present extensive experiments with CHOMP on manipulation and locomotion tasks, using seven-degree-of-freedom manipulators and a rough-terrain quadruped robot.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 1×
“Khatib [35] pioneered the application of the artificial potential field for real-time obstacle avoidance.”
BackgroundMultidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 1×
“, 1997) methods were shown to be well suited for path planning in C-spaces with many degrees of freedom (DOFs) (Kavraki et al., 1996), and with complex constraints, including kinodynamic (Kuffner, 1999; Hsu, 2000; Casal, 2001; Kindel, 2001).”
MethodSampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
LaValle, S. M. (2006) · Cited by 4,177
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Handbook of Markov Chain Monte Carlo
Brooks, S., Gelman, A., Jones, G., & Meng, X.-L. (2011) · Chapman & Hall/CRC eBooks · doi:10.1201/b10905 · Cited by 2,993
Methods of Information Geometry
Amari, S.-I., & Nagaoka, H. (2007) · Translations of Mathematical Monographs · doi:10.1090/mmono/191 · Cited by 2,204
Biped walking pattern generation by using preview control of zero-moment point
Kajita, S., Kanehiro, F., Kaneko, K., Fujiwara, K., Harada, K., Yokoi, K., & Hirukawa, H. (2004) · 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422) · doi:10.1109/robot.2003.1241826 · Cited by 2,104
(2003) · Cited by 1,733
A fast procedure for computing the distance between complex objects in three-dimensional space
Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.2083 · Cited by 1,513
Elementary Numerical Analysis.
G., W., & Atkinson, K. (1994) · Mathematics of Computation · doi:10.2307/2153423 · Cited by 1,253
Huber, M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-10 · Cited by 1,176
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,047
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
Self-citationSTOMP: Stochastic trajectory optimization for motion planning
Kalakrishnan, M., Chitta, S., Theodorou, E., Pastor, P., & Schaal, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980280 · Cited by 876
Elastic bands: connecting path planning and control
Quinlan, S., & Khatib, O. (2002) · [1993] Proceedings IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1993.291936 · Cited by 793
Path Integrals in Quantum Mechanics, Statistics, Polymer Physics, and Financial Markets
Kleinert, H. (2006) · WORLD SCIENTIFIC eBooks · doi:10.1142/6223 · Cited by 678
ARA*: Anytime A* with Provable Bounds on Sub-Optimality
Likhachev, M. A., Gordon, G. J., & Thrun, S. (2003) · Cited by 643
Todorov, E., & Li, W. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1469949 · Cited by 611
Ratliff, N. D., Bagnell, J. A., & Zinkevich, M. A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143936 · Cited by 606
Self-citationMixed integer programming for multi-vehicle path planning
Schouwenaars, T., De Moor, B., Feron, E., & How, J. (2001) · 2001 European Control Conference (ECC) · doi:10.23919/ecc.2001.7076321 · Cited by 566
FCL: A general purpose library for collision and proximity queries
Pan, J., Chitta, S., & Manocha, D. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6225337 · Cited by 552
Path planning in expansive configuration spaces
Hsu, D., Latombe, J.-C., & Motwani, R. (2002) · Proceedings of International Conference on Robotics and Automation · doi:10.1109/robot.1997.619371 · Cited by 552
Differential dynamic programming
Denham, W. (1971) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1971.1099760 · Cited by 530
Differential dynamic programming
Jacobson, D. H., & Mayne, D. Q. (1970) · CERN Document Server (European Organization for Nuclear Research) · Cited by 521
Path Integrals in Quantum Mechanics, Statistics, Polymer Physics, and Financial Markets
Kleinert, H. (2009) · WORLD SCIENTIFIC eBooks · doi:10.1142/7305 · Cited by 480
A fast algorithm for incremental distance calculation
Lin, M. C., & Canny, J. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131723 · Cited by 475
Automated construction of robotic manipulation programs
Takeo Kanade, A., Kuffner, J., & Diankov, R. (2010) · Cited by 458
Planning-based prediction for pedestrians
Ziebart, B. D., Ratliff, N., Gallagher, G., Mertz, C., Peterson, K., Bagnell, J. A., Hebert, M., Dey, A. K., & Srinivasa, S. (2009) · 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2009.5354147 · Cited by 456
Self-citationOn the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., Branicky, M. S., & Lindemann, S. R. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045481 · Cited by 436
G., W., Tompkins, C. B., & Wilson, W. L. (1971) · Mathematics of Computation · doi:10.2307/2004940 · Cited by 415
Modeling Purposeful Adaptive Behavior with the Principle of Maximum Causal Entropy
Ziebart, B. D. (2010) · doi:10.1184/r1/6720692 · Cited by 380
Proceedings, Twentieth International Conference on Machine Learning
Fawcett, T. E., & Mishra, N. (2003) · AAAI Press eBooks · Cited by 374
Elastic Strips: A Framework for Motion Generation in Human Environments
Brock, O., & Khatib, O. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402128964189 · Cited by 352
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., & Branicky, M. S. (2004) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-45058-0_5 · Cited by 338
Legibility and predictability of robot motion
Dragan, A. D., Lee, K. C. T., & Srinivasa, S. S. (2013) · doi:10.5555/2447556.2447672 · Cited by 337
Self-citationLinearly-solvable Markov decision problems
Todorov, E. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0176 · Cited by 334
Robot trajectory optimization using approximate inference
Toussaint, M. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553508 · Cited by 316
HERB: a home exploring robotic butler
Srinivasa, S. S., Ferguson, D., Helfrich, C. J., Berenson, D., Collet, A., Diankov, R., Gallagher, G., Hollinger, G., Kuffner, J., & Weghe, M. V. (2010) · Autonomous Robots · doi:10.1007/s10514-009-9160-9 · Cited by 306
Self-citationLearning, planning, and control for quadruped locomotion over challenging terrain
Kalakrishnan, M., Buchli, J., Pastor, P., Mistry, M., & Schaal, S. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364910388677 · Cited by 294
A Generalized Path Integral Control Approach to Reinforcement Learning
TheodorouEvangelos, BuchliJonas, & SchaalStefan (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953033 · Cited by 280
A Monte-Carlo algorithm for path planning with many degrees of freedom
Barraquand, J., & Latombe, J.-C. (2002) · Proceedings., IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1990.126256 · Cited by 247
Logarithmic Regret Algorithms for Online Convex Optimization
Hazan, E., Kalai, A. T., Kale, S., & Agarwal, A. (2006) · Lecture notes in computer science · doi:10.1007/11776420_37 · Cited by 242
Path Integrals in Physics: Volume I Stochastic Processes and Quantum Mechanics
Chaichian, M., & Demichev, A. (2018) · CRC Press eBooks · doi:10.1201/9781315273358 · Cited by 239
On computing the global time-optimal motions of robotic manipulators in the presence of obstacles
Shiller, Z., & Dubowsky, S. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.105387 · Cited by 216
A Framework for Push-Grasping in Clutter
Dogar, M., & Srinivasa, S. (2011) · Robotics: Science and Systems VII · doi:10.15607/rss.2011.vii.009 · Cited by 201
Self-citationModeling Interaction via the Principle of Maximum Causal Entropy
Ziebart, B. D., Bagnell, J. A., & Dey, A. K. (2018) · doi:10.1184/r1/6555611 · Cited by 179
Self-citationAlgorithmic and Computational Robotics: New Directions
Rigelsford, J. (2001) · Industrial Robot the international journal of robotics research and application · doi:10.1108/ir.2001.04928fae.002 · Cited by 167
Search-based planning for manipulation with motion primitives
Cohen, B. J., Chitta, S., & Likhachev, M. A. (2010) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2010.5509685 · Cited by 167
Quasi-randomized path planning
Branicky, M. S., LaValle, S. M., Olson, K., & Yang, L. (2002) · Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164) · doi:10.1109/robot.2001.932820 · Cited by 167
ITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments
Park, C., Pan, J., & Manocha, D. (2012) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v22i1.13513 · Cited by 160
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
Self-citationReal-time modification of collision-free paths
Quinlan, S. (1995) · Cited by 147
gProximity: Hierarchical GPU‐based Operations for Collision and Distance Queries
Lauterbach, C., Mo, Q., & Manocha, D. (2010) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01611.x · Cited by 146
Proceedings of the Graphics Interface 2001 Conference
Komura, T., & Shinagawa, Y. (2001) · Cited by 144
(Online) Subgradient Methods for Structured Prediction
Ratliff, N., Bagnell, J. A., & Zinkevich, M. (2018) · doi:10.1184/r1/6549506 · Cited by 136
Self-citationPractical Motion Planning in Robotics: Current Approaches and Future Directions
Gupta, K. K., & del Pobil, A. P. (1998) · John Wiley & Sons, Inc. eBooks · Cited by 122
Boosting Structured Prediction for Imitation Learning
Ratliff, N., Bradley, D., Bagnell, J. A., & Chestnutt, J. E. (2018) · Figshare · doi:10.1184/r1/6552212 · Cited by 122
Self-citationOptimization and learning for rough terrain legged locomotion
Zucker, M., Ratliff, N., Stolle, M., Chestnutt, J. E., Bagnell, J. A., Atkeson, C. G., & Kuffner, J. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364910392608 · Cited by 120
Self-citationSANDROS: a dynamic graph search algorithm for motion planning
Chen, P. C., & Hwang, Y. K. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.678449 · Cited by 110
Trends and Applications in Constructive Approximation
Mache, D. H., Szabados, J., & de Bruin, M. G. (2005) · Birkhäuser Basel eBooks · doi:10.1007/3-7643-7356-3 · Cited by 85
Single-pass gpu solid voxelization for real-time applications
Eisemann, E., Eisemann, E., Gpu, S.-P., Voxelization, S., & Eisemann, E. (2008) · Cited by 83
Manipulation planning with goal sets using constrained trajectory optimization
Dragan, A. D., Ratliff, N., & Srinivasa, S. S. (2011) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2011.5980538 · Cited by 83
Self-citationExact robot navigation using cost functions: the case of distinct spherical boundaries in E/sup n/
Rimon, E., & Koditschek, D. E. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1988.12325 · Cited by 77
Autonomous agents for real-time animation
Latombe, J., & Kuffner, J. (1999) · Cited by 70
Creating High-quality Roadmaps for Motion Planning in Virtual Environments
Gerærts, R., & Overmars, M. H. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282009 · Cited by 54
Control of Probabilistic Diffusion in Motion Planning
Dalibard, S., & Laumond, J. (2009) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-00312-7_29 · Cited by 46
Learning from Experience in Manipulation Planning: Setting the Right Goals
Dragan, A. D., Gordon, G. J., & Srinivasa, S. S. (2016) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-29363-9_18 · Cited by 41
Self-citationContextual Sequence Prediction with Application to Control Library Optimization
Dey, D., Liu, T. Y., Hebert, M., & Bagnell, J. A. (2012) · Robotics: Science and Systems · doi:10.15607/rss.2012.viii.007 · Cited by 41
Self-citationTrajectory 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
Чайчиан, М., & Demichev, A. P. (2001) · Cited by 34
An experimental evaluation of collision detection packages for robot motion planning
Reggiani, M., Mazzoli, M., & Caselli, S. (2003) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/irds.2002.1041615 · Cited by 31
Learning decisions: robustness, uncertainty, and approximation
Bagnell, J. A., & Schneider, J. (2004) · Cited by 23
Self-citationBonilla, E. V., Agakov, F. V., & Williams, C. (2007) · Cited by 18
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
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
Voxblox: Incremental 3D Euclidean Signed Distance Fields for on-board MAV planning
Oleynikova, H., Taylor, Z., Fehr, M., Siegwart, R., & Nieto, J. (2017) · 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8202315 · Cited by 658
Optimization-Based Collision Avoidance
Zhang, X., Liniger, A., & Borrelli, F. (2021) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2949540 · Cited by 444
Metadata
- Authors
- Zucker, M., Ratliff, N., Dragan, A. D., Pivtoraiko, M., Klingensmith, M., Dellin, C. M., Bagnell, J. A., & Srinivasa, S. S.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2013-08
- Volume
- 32
- Issue
- 9-10
- Pages
- 1164-1193
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2161819990
- Cited by
- 758
- References
- 78
- FWCI
- 32.71
- Type
- journal article
- Language
- en
- Open access
- green
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.