The DOI matches its Crossref record.
Collision-Free Motion Planning of Two Robots
Abstract
An approach to collision-free motion planning of two moving robots in a common workspace is presented. Each robot is represented by a sphere containing the wrist and the manipulator hand. The results from a strictly straight line trajectory planning method are utilized for planning a path avoiding potential collisions. Due to the distinct nature of the potential collisions between the two moving robots, a new classification of path requirement situations is presented and utilized for planning a collision-free path. Notions of collision map and time scheduling are developed and applied for realizing a collision-free motion planning. A procedure is developed for the time scheduling of the straight line trajectory. An example is shown for the time scheduling of the trajectory, which shows the significance of the proposed approach in collision-free motion planning of the two moving robots.
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
Motion Planning in Dynamic Environments Using Velocity Obstacles
Fiorini, P., & Shiller, Z. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700706 · Cited by 2,008
A distributed and optimal motion planning approach for multiple mobile robots
Guo, Y., & Parker, L. E. (2003) · Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292) · doi:10.1109/robot.2002.1013625 · Cited by 253
Metadata
- Authors
- Lee, B., & G. Lee, C.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1987-01
- Volume
- 17
- Issue
- 1
- Pages
- 21-32
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2077090901
- Cited by
- 186
- References
- 0
- FWCI
- 6.46
- 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
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.