The DOI matches its Crossref record.
On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers
Abstract
We present an algorithm that solves the following motion- planning problem that arises in robotics: Given several two-dimensional circular bodies B 1, B 2, ..., and a region bounded by a collection of "walls, " either find a continuous motion connecting two given configurations of these bodies during which they avoid collision with the walls and with each other, or else establish that no such motion exists. This paper continues other studies by the authors on motion- planning algorithms for other kinds of moving objects. The algorithms presented are polynomial in the number of walls for each fixed number of moving circles (for two moving circles the algorithm is shown to run in time O(n 3) if n is the number of walls), but with exponents increasing with the number of moving circles.
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
Cited by
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
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
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kant, K., & Zucker, S. W. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500304 · Cited by 753
Optimal motion planning for multiple robots having independent goals
LaValle, S. M., & Hutchinson, S. A. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.736775 · Cited by 411
Metadata
- Authors
- Schwartz, J. T., & Sharir, M.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 1983-09
- Volume
- 2
- Issue
- 3
- Pages
- 46-75
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2022020194
- Cited by
- 248
- References
- 0
- FWCI
- 15.05
- 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: On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers. https://app.cochat.ai/papers/10.1177/027836498300200304
- The paper
- Schwartz, J. T., & Sharir, M. (1983). On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers. The International Journal of Robotics Research. https://doi.org/10.1177/027836498300200304
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.