The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Motion planning with sequential convex optimization and convex collision checking
Open accessAbstract
We present a new optimization-based approach for robotic motion planning among obstacles. Like CHOMP (Covariant Hamiltonian Optimization for Motion Planning), our algorithm can be used to find collision-free trajectories from naïve, straight-line initializations that might be in collision. At the core of our approach are (a) a sequential convex optimization procedure, which penalizes collisions with a hinge loss and increases the penalty coefficients in an outer loop as necessary, and (b) an efficient formulation of the no-collisions constraint that directly considers continuous-time safety Our algorithm is implemented in a software package called TrajOpt. We report results from a series of experiments comparing TrajOpt with CHOMP and randomized planners from OMPL, with regard to planning time and path quality. We consider motion planning for 7 DOF robot arms, 18 DOF full-body robots, statically stable walking motion for the 34 DOF Atlas humanoid robot, and physical experiments with the 18 DOF PR2. We also apply TrajOpt to plan curvature-constrained steerable needle trajectories in the SE(3) configuration space and multiple non-intersecting curved channels within 3D-printed implants for intracavitary brachytherapy. Details, videos, and source code are freely available at: http://rll.berkeley.edu/trajopt/ijrr .
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
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×
“Trajectory optimization : Khatib proposed the use of potential fields for avoiding obstacles, including dynamic obstacles [22].”
MethodA Mathematical Introduction to Robotic Manipulation
Murray, R. M., Li, Z., & Sastry, S. S. (2017) · CRC Press eBooks · doi:10.1201/9781315136370 · Cited by 6,694
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×
“Sampling-based motion planners [21, 25] are very effective and offer probabilistic completeness guarantees.”
BackgroundSampling-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
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
ZERO-MOMENT POINT — THIRTY FIVE YEARS OF ITS LIFE
VUKOBRATOVIĆ, M., & BOROVAC, B. (2004) · International Journal of Humanoid Robotics · doi:10.1142/s0219843604000083 · Cited by 2,038
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
The Open Motion Planning Library
Sucan, I. A., Moll, M., & Kavraki, L. E. (2012) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2012.2205651 · Cited by 1,616
Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
Betts, J. T. (2010) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718577 · Cited by 1,567
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
Optimal paths for a car that goes both forwards and backwards
Reeds, J., & Shepp, L. (1990) · Pacific Journal of Mathematics · doi:10.2140/pjm.1990.145.367 · Cited by 1,447
Practical Methods for Optimal Control using Nonlinear Programming
Betts, & Kolmanovsky (2002) · Applied Mechanics Reviews · doi:10.1115/1.1483351 · Cited by 1,443
Ericson, C. (2004) · CRC Press eBooks · doi:10.1201/b14581 · Cited by 1,196
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
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
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
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
Synthesis and stabilization of complex behaviors through online trajectory optimization
Tassa, Y., Erez, T., & Todorov, E. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6386025 · Cited by 744
ARA*: Anytime A* with Provable Bounds on Sub-Optimality
Likhachev, M. A., Gordon, G. J., & Thrun, S. (2003) · Cited by 643
Nonholonomic Modeling of Needle Steering
Webster, R. J., Kim, J. S., Cowan, N. J., Chirikjian, G. S., & Okamura, A. M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906065388 · Cited by 633
Advances in Neural Information Processing Systems 15 (NIPS 2002)
Williams, C. K. I., & Shawe-Taylor, J. S. (2002) · The MIT Press eBooks · Cited by 620
Nonholonomic Modeling of Needle Steering
Webster, R. J., Cowan, N. J., Chirikjian, G., & Okamura, A. M. (2006) · Springer Tracts in Advanced Robotics · doi:10.1007/11552246_4 · Cited by 527
Chitta, S., Sucan, I., & Cousins, S. (2012) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2011.2181749 · Cited by 466
Discovery of complex behaviors through contact-invariant optimization
Mordatch, I., Todorov, E., & Popović, Z. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185539 · Cited by 451
Maneuver-based motion planning for nonlinear systems with symmetries
Frazz, E., Dahleh, M. A., & Feron, E. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.852260 · Cited by 440
Finding 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
Self-citationAn auto-generated real-time iteration algorithm for nonlinear MPC in the microsecond range
Houska, B., Ferreau, H. J., & Diehl, M. (2011) · Automatica · doi:10.1016/j.automatica.2011.08.020 · Cited by 416
Global path planning using artificial potential fields
Warren, C. W. (2003) · Proceedings, 1989 International Conference on Robotics and Automation · doi:10.1109/robot.1989.100007 · Cited by 370
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
An Analytical Continuous-Curvature Path-Smoothing Algorithm
Yang, K., & Sukkarieh, S. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2010.2042990 · Cited by 293
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
Alterovitz, R., Simeon, T., & Goldberg, K. (2007) · Robotics: Science and Systems III · doi:10.15607/rss.2007.iii.030 · Cited by 232
Self-citationKinodynamic Motion Planning by Interior-Exterior Cell Exploration
Şucan, I. A., & Kavraki, L. E. (2009) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-642-00312-7_28 · Cited by 188
Reactive Path Deformation for Nonholonomic Mobile Robots
Lamiraux, F., Bonnafous, D., & Lefebvre, O. (2004) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.829459 · Cited by 173
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
Self-citationNeedle Steering in 3-D Via Rapid Replanning
Patil, S., Burgner-Kahrs, J., Webster, R. J., III, & Alterovitz, R. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2014.2307633 · Cited by 155
Self-citationProximity Queries and Penetration Depth Computation on 3D Game Objects
van den Bergen, G. (2001) · Cited by 154
Approximate convex decomposition of polyhedra
Lien, J., & Amato, N. M. (2007) · ACM Symposium on Solid and Physical Modeling (SPM) · doi:10.1145/1236246.1236265 · Cited by 148
Direct Trajectory Optimization of Rigid Body Dynamical Systems through Contact
Posa, M., & Tedrake, R. (2013) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-36279-8_32 · Cited by 141
A simple and efficient approach for 3D mesh approximate convex decomposition
Mamou, K., & Ghorbel, F. (2009) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2009.5414068 · Cited by 131
Trajectory planning for optimal robot catching in real-time
Lampariello, R., Nguyen-Tuong, D., Castellini, C., Hirzinger, G., & Peters, J. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980114 · Cited by 117 · cited 1×
“Whereas convex-convex collision detection takes two colliding shapes and computes the minimal translation to get them out of collision, the distance field (and its gradient) merely computes how to get each robot point (or sphere) out of collision; however, two points may disagree on which way to go.”
BackgroundThree-dimensional Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics
Duindam, V., Xu, J., Alterovitz, R., Sastry, S., & Goldberg, K. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909352202 · Cited by 117
Self-citationScrew-based motion planning for bevel-tip flexible needles in 3D environments with obstacles
Duindam, V., Alterovitz, R., Sastry, S., & Goldberg, K. (2008) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2008.4543586 · Cited by 115
Self-citationFast 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
Collision-free and smooth trajectory computation in cluttered environments
Pan, J., Zhang, L., & Manocha, D. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912453186 · Cited by 93
Self-citationTrajectory optimization for domains with contacts using inverse dynamics
Erez, T., & Todorov, E. V. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6386181 · Cited by 87
Erratum: Direct Trajectory Optimization of Rigid Body Dynamical Systems through Contact
Posa, M., & Tedrake, R. (2013) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-36279-8_38 · Cited by 87
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
Planning Collision‐Free Reaching Motions for Interactive Object Manipulation and Grasping
Kallmann, M. E., Aubel, A., Abacı, T., & Thalmann, D. (2003) · Computer Graphics Forum · doi:10.1111/1467-8659.00678 · Cited by 83
Planning collision-free reaching motions for interactive object manipulation and grasping
Kallmann, M., Aubel, A., Abacı, T., & Thalmann, D. (2008) · ACM SIGGRAPH Courses · doi:10.1145/1401132.1401209 · Cited by 59
A generic infrastructure for benchmarking motion planners
Cohen, B. J., Sucan, I. A., & Chitta, S. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6386228 · Cited by 50
Design and evaluation of duty-cycling steering algorithms for robotically-driven steerable needles
Fey, A. M., Siegel, J. J., Stanley, A. A., & Okamura, A. M. (2014) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2014.6907725 · Cited by 46
Werner, A., Lampariello, R., & Ott, C. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6386154 · Cited by 18
Cited by
acados—a modular open-source framework for fast embedded optimal control
Verschueren, R., Frison, G., Kouzoupis, D., Frey, J., Duijkeren, N. V., Zanelli, A., Novoselnik, B., Albin, T., Quirynen, R., & Diehl, M. (2022) · Mathematical Programming Computation · doi:10.1007/s12532-021-00208-8 · Cited by 485
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
Geometrically Constrained Trajectory Optimization for Multicopters
Wang, Z., Zhou, X., Xu, C., & Gao, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3160022 · Cited by 434
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
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
Self-citation
Metadata
- Authors
- Schulman, J., Duan, Y., Ho, J., Lee, A., Awwal, I., Bradlow, H., Pan, J., Patil, S., Goldberg, K., & Abbeel, P.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2014-06-11
- Volume
- 33
- Issue
- 9
- Pages
- 1251-1270
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2142224528
- Cited by
- 866
- References
- 58
- FWCI
- 32.05
- 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.