Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 256

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

Bobrow, J.E.·1988·IEEE Journal on Robotics and Automation

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/56.811

Cites

11 of 11 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 11 references

Cited by

See all 256

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.