The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Distance functions and their application to robot path planning in the presence of obstacles
Abstract
An approach to robotic path planning, which allows optimization of useful performance indices in the presence of obstacles, is given. The main idea is to express obstacle avoidance in terms of the distances between potentially colliding parts. Mathematical properties of the distance functions are studied and it is seen that various types of derivatives of the distance functions are easily characterized. The results lead to the formulation of path planning problems as problems in optimal control and suggest numerical procedures for their solution. A simple numerical example involving a three-degree-of-freedom Cartesian manipulator is described.
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
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Robot Manipulators: Mathematics, Programming, and Control
Paul, R. P. (1981) · Cumulative Index of Computer Aided Architectural Design · Cited by 2,778
Optimization—Theory and Applications
Cesari, L. (1983) · Springer eBooks · doi:10.1007/978-1-4613-8165-5 · Cited by 2,559
Spline Functions: Basic Theory.
Smith, P. W., & Schumaker, L. (1982) · Mathematics of Computation · doi:10.2307/2007301 · Cited by 2,463
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
On-Line Computational Scheme for Mechanical Manipulators
Luh, J. Y. S., Walker, M. W., & Paul, R. P. C. (1980) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3149599 · Cited by 1,585
Generalized gradients and applications
Clarke, F. H. (1975) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1975-0367131-6 · Cited by 1,206
Cited by
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
Self-citationGross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Optimal robot plant planning using the minimum-time criterion
Bobrow, J. E. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.811 · Cited by 256
Embedded nonlinear model predictive control for obstacle avoidance using PANOC
Sathya, A., Sopasakis, P., Van Parys, R., Themelis, A., Pipeleers, G., & Patrinos, P. (2018) · 2018 European Control Conference (ECC) · doi:10.23919/ecc.2018.8550253 · Cited by 105
Metadata
- Authors
- Gilbert, E., & Johnson, D.
- Venue
- IEEE Journal on Robotics and Automation
- Published
- 1985
- Volume
- 1
- Issue
- 1
- Pages
- 21-30
- ISSN
- 0882-4967 (ISSN-L)
- OpenAlex
- W2131286638
- Cited by
- 367
- References
- 14
- FWCI
- 11.65
- 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: Distance functions and their application to robot path planning in the presence of obstacles. https://app.cochat.ai/papers/10.1109/jra.1985.1087003
- The paper
- Gilbert, E., & Johnson, D. (1985). Distance functions and their application to robot path planning in the presence of obstacles. IEEE Journal on Robotics and Automation. https://doi.org/10.1109/jra.1985.1087003
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.