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
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-citationRecent 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
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
Benchmarking in Manipulation Research: Using the Yale-CMU-Berkeley Object and Model Set
Calli, B., Walsman, A., Singh, A., Srinivasa, S., Abbeel, P., & Dollar, A. M. (2015) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2015.2448951 · Cited by 602
Self-citation(2013) · doi:10.1109/hri.2013.6483603 · Cited by 595
“While efficient trajectory optimization techniques do exist for high-dimensional spaces and non-convex costs [34], they are subject to local minima, and how to alleviate this issue in practice remains an open research question [35], [36].”
BackgroundSelf-citationEGO-Planner: An ESDF-Free Gradient-Based Local Planner for Quadrotors
Zhou, X., Wang, Z., Ye, H., Xu, C., & Gao, F. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3047728 · Cited by 547
Path Planning for Autonomous Mobile Robots: A Review
Sánchez-Ibáñez, J. R., Pérez-del-Pulgar, C. J., & García-Cerezo, A. (2021) · Sensors · doi:10.3390/s21237898 · Cited by 462
Sanchez, J., Corrales, J.-A., Bouzgarrou, B.-C., & Mezouar, Y. (2018) · The International Journal of Robotics Research · doi:10.1177/0278364918779698 · Cited by 457
Socially compliant mobile robot navigation via inverse reinforcement learning
Kretzschmar, H., Spies, M., Sprunk, C., & Burgard, W. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915619772 · Cited by 452
CommonRoad: Composable benchmarks for motion planning on roads
Althoff, M., Koschi, M., & Manzinger, S. (2017) · 2017 IEEE Intelligent Vehicles Symposium (IV) · doi:10.1109/ivs.2017.7995802 · Cited by 443
“…techniques, there also exists the Covariant Hamiltonian Optimization for Motion Planning (CHOMP) library for gradient-based optimization techniques [23]. d) Automotive benchmarks beyond motion planning: One of the most successful automotive benchmarks is the KITTI benchmark targeting computer…”
BackgroundFinding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization
Schulman, J., Ho, J., Lee, A., Awwal, I., Bradlow, H., & Abbeel, P. (2013) · Robotics: Science and Systems IX · doi:10.15607/rss.2013.ix.031 · Cited by 430
Integrated Task and Motion Planning
Garrett, C. R., Chitnis, R., Holladay, R., Kim, B., Silver, T., Kaelbling, L. P., & Lozano-Pérez, T. (2021) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-091420-084139 · Cited by 409
Zebedee: Design of a Spring-Mounted 3-D Range Sensor with Application to Mobile Mapping
Bosse, M., Zlot, R., & Flick, P. (2012) · IEEE Transactions on Robotics · doi:10.1109/tro.2012.2200990 · Cited by 399
A policy-blending formalism for shared control
Dragan, A. D., & Srinivasa, S. S. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913490324 · Cited by 387
Self-citationFUEL: Fast UAV Exploration Using Incremental Frontier Structure and Hierarchical Planning
Zhou, B., Zhang, Y., Chen, X., & Shen, S. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3051563 · Cited by 351
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-citationIntegrated online trajectory planning and optimization in distinctive topologies
Rösmann, C., Hoffmann, F., & Bertram, T. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.11.007 · Cited by 324
RAPTOR: Robust and Perception-Aware Trajectory Replanning for Quadrotor Fast Flight
Zhou, B., Pan, J., Gao, F., & Shen, S. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3071527 · Cited by 308
Human-robot collaborative manipulation planning using early prediction of human motion
Mainprice, J., & Berenson, D. (2013) · 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2013.6696368 · Cited by 301
“We rely on recent developments in trajectory optimization for motion planning [1] [22] [23] to compute low-cost robot motion plans quickly.”
MethodLearning, 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
Malyuta, D., Reynolds, T. P., Szmuk, M., Lew, T., Bonalli, R., Pavone, M., & Açıkmeşe, B. (2022) · IEEE Control Systems · doi:10.1109/mcs.2022.3187542 · Cited by 259
Klingensmith, M., Dryanovski, I., Srinivasa, S., & Xiao, J. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.040 · Cited by 163
“In robotics, distance fields are used in motion planning [25], mapping [26], and scene understanding.”
MethodSelf-citationLearning force control policies for compliant manipulation
Kalakrishnan, M., Righetti, L., Pastor, P., & Schaal, S. (2011) · 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2011.6095096 · Cited by 161
Habitat 2.0: Training home assistants to rearrange their habitat
Szot, A., Clegg, A., Undersander, E., Wijmans, E., Zhao, Y., Turner, J., Maestre, N., Mukadam, M., Chaplot, D., Maksymets, O., et al. (2021) · arXiv · doi:10.48550/arxiv.2106.14405 · Cited by 143
“For instance, work in the area of motion planning has made several advancements with new sampling techniques [94, 95] and optimization based methods [86, 87, 89, 96], but largely operated on the assumption of a reliable perception stack.”
BackgroundUrain, J., Funk, N., Peters, J., & Chalvatzaki, G. (2022) · arXiv · doi:10.48550/arxiv.2209.03855 · Cited by 101
Tell Me Dave: Context-Sensitive Grounding of Natural Language to Manipulation Instructions
Kumar Misra, D., Sung, J., Lee, K., & Saxena, A. (2014) · Robotics: Science and Systems X · doi:10.15607/rss.2014.x.005 · Cited by 59
Kineverse: A Symbolic Articulation Model Framework for Model-Agnostic Mobile Manipulation
Rofer, A., Bartels, G., Burgard, W., Valada, A., & Beetz, M. (2022) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2022.3146515 · Cited by 10
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.