The DOI matches its Crossref record.
Obstacle avoidance using an octree in the configuration space of a manipulator
Abstract
An automatic system for planning safe trajectories for a computer controlled manipulator among obstacles is a key component of robot assembly operations. This paper describes an algorithm transforming cartesian obstacles into obstacles in the space of the first three joints of a manipulator with six revolute joints (e.g. a ACMA-CRIBIER V80), and giving a hierarchical description of the free space by mean of an octree. Such a description is very useful in testing for collision between the arm of the manipulator end obstacles since it is represented by a point in this space.
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
Cited by
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
Robot Motion Planning: A Distributed Representation Approach
Barraquand, J., & Latombe, J.-C. (1991) · The International Journal of Robotics Research · doi:10.1177/027836499101000604 · Cited by 995
A simple motion-planning algorithm for general robot manipulators
Lozano-Perez, T. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087095 · Cited by 618
Multiresolution path planning for mobile robots
Kambhampati, S., & Davis, L. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087051 · Cited by 442
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., Branicky, M. S., & Lindemann, S. R. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045481 · Cited by 436
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., & Branicky, M. S. (2004) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-45058-0_5 · Cited by 338
A local based approach for path planning of manipulators with a high number of degrees of freedom
Faverjon, B., & Tournassoud, P. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1087982 · Cited by 281
Self-citationGenerating octree models of 3D objects from their silhouettes in a sequence of images
Potmesil, M. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(87)90053-3 · Cited by 257
Manipulator control with superquadric artificial potential functions: theory and experiments
Volpe, R., & Khosla, P. (1990) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.61211 · Cited by 254
Metadata
- Authors
- Faverjon, B.
- Venue
- Proceedings. 1984 IEEE International Conference on Robotics and Automation
- Published
- 2005-03-23
- Volume
- 1
- Pages
- 504-512
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1901697964
- Cited by
- 211
- References
- 0
- FWCI
- 7.55
- 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.