The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
CHOMP: Gradient optimization techniques for efficient motion planning
Open accessAbstract
Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by sampling-based planners to navigate “narrow passages” can be needlessly complex; furthermore, additional post-processing is required to remove the jerky or extraneous motions from the paths that such planners generate. In this paper, we present CHOMP, a novel method for continuous path refinement that uses covariant gradient techniques to improve the quality of sampled trajectories. Our optimization technique both optimizes higher-order dynamics and is able to converge over a wider range of input paths relative to previous path optimization strategies. In particular, we relax the collision-free feasibility prerequisite on input paths required by those strategies. As a result, CHOMP can be used as a standalone motion planner in many real-world planning queries. We demonstrate the effectiveness of our proposed method in manipulation planning for a 6-DOF robotic arm as well as in trajectory generation for a walking 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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Methods of Mathematical Physics
Courant, R., & Hilbert, D. (1989) · Wiley eBooks · doi:10.1002/9783527617210 · Cited by 8,067
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×
“Planners such as Probabilistic Roadmap (PRM) and Rapidly-exploring Random Tree (RRT) algorithms, along with their descendents, are now used in a multitude of robotic applications [15], [16].”
BackgroundDifferential geometry of curves and surfaces
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3330 · Cited by 3,706
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
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
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,047
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
Methods of Mathematical Physics: Partial Differential Equations
Courant, R., & Hilbert, D. (1989) · doi:10.1002/9783527617234 · Cited by 735
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
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
Differential Geometry of Curves and Surfaces
Umehara, M., Yamada, K., & Rossman, W. (2017) · WORLD SCIENTIFIC eBooks · doi:10.1142/9901 · Cited by 279
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
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
Iterative MILP methods for vehicle-control problems
Earl, M. G., & Raffaello D’andrea, B. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.853499 · Cited by 156
Bagnell, J. A., & Schneider, J. (2018) · Figshare · doi:10.1184/r1/6552458 · Cited by 148
Self-citationReal-time modification of collision-free paths
Quinlan, S. (1995) · Cited by 147
(Online) Subgradient Methods for Structured Prediction
Ratliff, N., Bagnell, J. A., & Zinkevich, M. (2018) · doi:10.1184/r1/6549506 · Cited by 136
Self-citationOptimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation
Sundar, S., & Shiller, Z. (1997) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.563653 · Cited by 131
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-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
Tunnel-MILP: Path Planning with Sequential Convex Polytopes
Vitus, M. P., Pradeep, V., Hoffmann, G. M., Waslander, S. L., & Tomlin, C. J. (2008) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2008-7132 · Cited by 92
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
Manifold Stochastic Dynamics for Bayesian Learning
Zlochin, M., & Yoram Baram, A. (2001) · Neural Computation · doi:10.1162/089976601753196021 · Cited by 10
Cited by
STOMP: 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
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
The YCB object and model set: Towards common benchmarks for manipulation research
Calli, B., Singh, A., Walsman, A., Srinivasa, S., Abbeel, P., & Dollar, A. M. (2015) · 2015 International Conference on Advanced Robotics (ICAR) · doi:10.1109/icar.2015.7251504 · Cited by 838
“Some algorithms, such as CHOMP [30], require signed-distance fields to avoid collisions which can be computed from the included watertight meshes.”
MethodSelf-citationRobot 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
Self-citation
Metadata
- Authors
- Ratliff, N., Zucker, M., Bagnell, J. A., & Srinivasa, S.
- Venue
- 2009 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2009-05
- Pages
- 489-494
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2099893201
- Cited by
- 992
- References
- 27
- FWCI
- 13.90
- Type
- conference paper
- 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.