The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Optimal robot plant planning using the minimum-time criterion
Abstract
A path planning technique is presented which produces time-optimal manipulator motions in a workspace containing obstacles. The full nonlinear equations of motion are used in conjunction with the actuator limitations to produce optimal trajectories. The Cartesian path of the manipulator is represented with B-spline polynomials, and the shape of this path is varied in a manner that minimizes the traversal time. Obstacle avoidance constraints are included in the problem through the use of distance functions. In addition to computing the optimal path, the time-optimal open-loop joint forces and corresponding joint displacements are obtained as functions of time. The examples presented show a reduction in the time required for typical motions.>
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
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
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
Self-citationNumerical Optimization Techniques for Engineering Design: With Applications
Vanderplaats, G. N. (1984) · Cited by 1,307
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
Kirk, D. E. (1970) · Cited by 910
THE KINEMATICS OF MANIPULATORS UNDER COMPUTER CONTROL
Peiper, D. L. (1968) · Cited by 708
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
Solving the find-path problem by good representation of free space
Brooks, R. A. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313112 · Cited by 601
Solving the Find-Path Problem by Good Representation of Free Space
Brooks, R. A. (1990) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_22 · Cited by 588
HADLEY, G., & KEMP, M. C. (1971) · Variational Methods in Economics · doi:10.1016/b978-0-7204-3601-3.50008-8 · Cited by 494
Cited by
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
Efficient distance computation between non-convex objects
Quinlan, S. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351059 · Cited by 391
Metadata
- Authors
- Bobrow, J. E.
- Venue
- IEEE Journal on Robotics and Automation
- Published
- 1988
- Volume
- 4
- Issue
- 4
- Pages
- 443-450
- ISSN
- 0882-4967 (ISSN-L)
- OpenAlex
- W2110684256
- Cited by
- 256
- References
- 11
- FWCI
- 14.12
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal robot plant planning using the minimum-time criterion. https://app.cochat.ai/papers/10.1109/56.811
- The paper
- Bobrow, J. E. (1988). Optimal robot plant planning using the minimum-time criterion. IEEE Journal on Robotics and Automation. https://doi.org/10.1109/56.811
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.