The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Superquadric artificial potentials for obstacle avoidance and approach
Abstract
An obstacle-avoidance potential based on superquadrics is discussed. The superquadric formulation is a generalization of the elliptical potential function method and therefore is viable for a much larger class of object shapes. As with elliptical potentials, a modified form of the superquadric potential provides safe approach objects. The avoidance and approach potentials are implemented in simulations and the results exhibit an improvement over existing potential schemes. The simulations also use an algorithm that eliminates collisions with obstacles by calculating the repulsive forces exerted on links, based on the shortest distance to an object.>
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
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
Impedance Control: An Approach to Manipulation: Part I—Theory
Hogan, N. (1985) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3140702 · Cited by 3,673
Cited by
Numerical potential field techniques for robot path planning
Barraquand, J., Langlois, B., & Latombe, J.-C. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.148426 · Cited by 889
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Dynamic Motion Planning for Mobile Robots Using Potential Field Method
Ge, S. S., & Cui, Y. J. (2002) · Autonomous Robots · doi:10.1023/a:1020564024509 · Cited by 803
Real-time obstacle avoidance using harmonic potential functions
Kim, J.-O., & Khosla, P. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.131683 · Cited by 559
Self-citationReal-time obstacle avoidance using harmonic potential functions
Kim, J.-O., & Khosla, P. K. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.143352 · Cited by 522
Self-citation
Metadata
- Authors
- Khosla, P., & Volpe, R.
- Venue
- Proceedings. 1988 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-06
- Pages
- 1778-1784
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2160728037
- Cited by
- 237
- References
- 2
- FWCI
- 10.12
- Type
- conference paper
- 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
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.