The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization
Open accessAbstract
We present a novel approach for incorporating collision avoidance into trajectory optimization as a method of solving robotic motion planning problems.At the core of our approach are (i) A sequential convex optimization procedure, which penalizes collisions with a hinge loss and increases the penalty coefficients in an outer loop as necessary.(ii) An efficient formulation of the no-collisions constraint that directly considers continuous-time safety and enables the algorithm to reliably solve motion planning problems, including problems involving thin and complex obstacles.We benchmarked our algorithm against several other motion planning algorithms, solving a suite of 7-degree-of-freedom (DOF) arm-planning problems and 18-DOF full-body planning problems.We compared against sampling-based planners from OMPL, and we also compared to CHOMP, a leading approach for trajectory optimization.Our algorithm was faster than the alternatives, solved more problems, and yielded higher quality paths.Experimental evaluation on the following additional problem types also confirmed the speed and effectiveness of our approach: (i) Planning foot placements with 34 degrees of freedom (28 joints + 6 DOF pose) of the Atlas humanoid robot as it maintains static stability and has to negotiate environmental constraints.(ii) Industrial box picking.(iii) Real-world motion planning for the PR2 that requires considering all degrees of freedom at the same time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
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
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
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
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744
A Potential Field-Based Model Predictive Path-Planning Controller for Autonomous Road Vehicles
Rasekhipour, Y., Khajepour, A., Chen, S.-K., & Litkouhi, B. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2604240 · Cited by 656
Analysis and Observations From the First Amazon Picking Challenge
Correll, N., Bekris, K. E., Berenson, D., Brock, O., Causo, A., Hauser, K., Okada, K., Rodriguez, A., Romano, J. M., & Wurman, P. R. (2018) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2016.2600527 · Cited by 425
“Other tools mentioned by the teams include “trajopt” [22], ROS’ JT Cartesian Controller [23], and the OMPL library [24], which was interfaced through MoveIt! or stand-alone in the teams’ custom implementations.”
MethodModel Predictive Control of Swarms of Spacecraft Using Sequential Convex Programming
Morgan, D., Chung, S.-J., & Hadaegh, F. Y. (2014) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g000218 · Cited by 384
Fast, On-line Collision Avoidance for Dynamic Vehicles Using Buffered Voronoi Cells
Zhou, D., Wang, Z., Bandyopadhyay, S., & Schwager, M. (2017) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2017.2656241 · Cited by 286
Learning from Demonstrations Through the Use of Non-rigid Registration
Schulman, J., Ho, J., Lee, C., & Abbeel, P. (2016) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-319-28872-7_20 · Cited by 133
Self-citationLearning force-based manipulation of deformable objects from multiple demonstrations
Lee, A. X., Lu, H., Gupta, A., Levine, S., & Abbeel, P. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7138997 · Cited by 140
Self-citationPatil, S., Kahn, G., Laskey, M., Schulman, J., Goldberg, K., & Abbeel, P. (2015) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-319-16595-0_30 · Cited by 72
Self-citationLee, M. A., Florensa, C., Tremblay, J., Ratliff, N., Garg, A., Ramos, F., & Fox, D. (2020) · 2020 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra40945.2020.9197125 · Cited by 46
Lee, A. X., Huang, S. H., Hadfield-Menell, D., Tzeng, E., & Abbeel, P. (2014) · 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2014.6943185 · Cited by 32
Self-citationHuman-like planning of swerve maneuvers for autonomous vehicles
Gu, T., Dolan, J. M., & Lee, J.-W. (2016) · 2016 IEEE Intelligent Vehicles Symposium (IV) · doi:10.1109/ivs.2016.7535466 · Cited by 24
Lee, A. X., Goldstein, M. A., Barratt, S. T., & Abbeel, P. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139289 · Cited by 12
Self-citationKineverse: 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
- Schulman, J., Ho, J., Lee, A., Awwal, I., Bradlow, H., & Abbeel, P.
- Venue
- Robotics: Science and Systems IX
- Published
- 2013-06-23
- OpenAlex
- W2293883387
- Cited by
- 430
- References
- 30
- FWCI
- 22.61
- Type
- conference paper
- Language
- en
- Open access
- gold
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.