The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Time-Optimal Path Tracking for Robots: A Convex Optimization Approach
Open accessAbstract
This paper focuses on time-optimal path tracking, a subproblem in time-optimal motion planning of robot systems. Through a nonlinear change of variables, the time-optimal path tracking problem is transformed here into a convex optimal control problem with a single state. Various convexity-preserving extension are introduced, resulting in a versatile approach for optimal path tracking. A direct transcription method is presented that reduces finding the globally optimal trajectory to solving a second-order cone program using robust numerical algorithms that are freely available. Validation against known examples and application to a more complex example illustrate the versatility and practicality of the new method.
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
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,149
Practical Methods for Optimal Control using Nonlinear Programming
Betts, & Kolmanovsky (2002) · Applied Mechanics Reviews · doi:10.1115/1.1483351 · Cited by 1,443
Time-Optimal Control of Robotic Manipulators Along Specified Paths
Bobrow, J. E., Dubowsky, S., & Gibson, J. S. (1985) · The International Journal of Robotics Research · doi:10.1177/027836498500400301 · Cited by 1,315
A Multiple Shooting Algorithm for Direct Solution of Optimal Control Problems *
Bock, H. G., & Plitt, K. J. (1984) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)61205-9 · Cited by 1,306
Minimum-time control of robotic manipulators with geometric path constraints
Shin, K., & McKay, N. (1985) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1985.1104009 · Cited by 996
Modeling and Control of Robot Manipulators
(2000) · Industrial Robot: An International Journal · doi:10.1108/ir.2000.04927aae.003 · Cited by 989
A concept for manipulator trajectory planning
Pfeiffer, F., & Johanni, R. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087090 · Cited by 478
Smooth and time-optimal trajectory planning for industrial manipulators along specified paths
Constantinescu, D., & Croft, E. A. (2000) · Journal of Robotic Systems · doi:10.1002/(sici)1097-4563(200005)17:5<233::aid-rob1>3.0.co;2-y · Cited by 387
Fast Direct Multiple Shooting Algorithms for Optimal Robot Control
Diehl, M., Bock, H. G., Diedam, H., & Wieber, P.-B. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-3-540-36119-0_4 · Cited by 344
Self-citationImproving the efficiency of time-optimal path-following algorithms
Slotine, J.-J. E., & Yang, H. S. (1989) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88024 · Cited by 257
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
Cited by
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
Entry Trajectory Optimization by Second-Order Cone Programming
Liu, X., Shen, Z., & Lu, P. (2016) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g001210 · Cited by 349
Metadata
- Authors
- Verscheure, D., Demeulenaere, B., Swevers, J., De Schutter, J., & Diehl, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2009-10
- Volume
- 54
- Issue
- 10
- Pages
- 2318-2327
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2099454002
- Cited by
- 536
- References
- 15
- FWCI
- 11.73
- 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.