The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Motion planning of multiple mobile robots for cooperative manipulation and transportation
Abstract
In this paper, we propose a motion-planning method of multiple mobile robots for cooperative transportation of a large object in a three-dimensional environment. This task has various kinds of problems, such as obstacle avoidance and stable manipulation. All of these problems cannot be solved at once, since it would result in a dramatic increase of the computational time. Accordingly, we divided the motion planner into a global path planner and a local manipulation planner, designed them, and integrated them. The aim was to integrate a gross motion planner and a fine motion planner. Concerning the global path planner, we reduced the dimensions of the configuration space (C-space) using the feature of transportation by mobile robots. We used the potential field to find the solution by searching in this smaller-dimension reconstructed C-space. In the global path planner, the constraints of the object manipulation are considered as the cost function and the heuristic function in the A/sup */ search. For the local manipulation planner, we developed a manipulation technique, which is suitable for mobile robots by position control. We computed the conditions in which the object becomes unstable during manipulation and generated each robot's motion, considering the robots' motion errors and indefinite factors from the planning stage. We verified the effectiveness of our proposed motion planning method through simulations.
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
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Cited by
A Survey on Aerial Swarm Robotics
Chung, S.-J., Paranjape, A. A., Dames, P., Shen, S., & Kumar, V. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2857475 · Cited by 672
A Survey and Analysis of Multi-Robot Coordination
Yan, Z., Jouandeau, N., & Cherif, A. A. (2013) · International Journal of Advanced Robotic Systems · doi:10.5772/57313 · Cited by 647
Yang, Y., Xiao, Y., & Li, T. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3059998 · Cited by 467
Chen, J., Sun, D., Yang, J., & Chen, H. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364909104290 · Cited by 258
Jose, K., & Pratihar, D. K. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.02.003 · Cited by 170
Metadata
- Authors
- Yamashita, A., Arai, T., Ota, J., & Asama, H.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 2003-04
- Volume
- 19
- Issue
- 2
- Pages
- 223-237
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2121837035
- Cited by
- 189
- References
- 1
- FWCI
- 7.28
- 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.