The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A distributed and optimal motion planning approach for multiple mobile robots
Abstract
We propose a distributed and optimal motion planning algorithm for multiple robots. The computationally expensive problem is decomposed into two modules: path planning and velocity planning. The D* search method is applied in both modules, based on either geometric formulation or schedule formulation. Optimization is achieved at the individual robot level by defining cost functions, and also at the team level by a global measurement function reflecting performance indices of interest as a team. Contrary to our knowledge of previous results on multi-robot motion planning that either obtain optimal solutions through centralized and exhaustive computing, or achieve distributed implementations without considering any optimization issues, our approach combines these two features and explicitly optimizes performance functions through a distributed implementation. It is also one of the few that is capable of handling outdoor rough terrain environments and real time replanning. Simulations are shown on a Mars-like rough terrain using a 3D vehicle planner and control simulator. The algorithm was also implemented and successfully run on a group of Nomad 200 indoor robots.
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
Optimal and efficient path planning for partially-known environments
Stentz, A. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351061 · Cited by 929
Cited by
Perception, Planning, Control, and Coordination for Autonomous Vehicles
Pendleton, S., Andersen, H., Du, X., Shen, X., Meghjani, M., Eng, Y., Rus, D., & Ang, M. (2017) · Machines · doi:10.3390/machines5010006 · Cited by 657
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
A survey of inter-vehicle communication protocols and their applications
Willke, T., Tientrakool, P., & Maxemchuk, N. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090202 · Cited by 478
Metadata
- Authors
- Guo, Y., & Parker, L. E.
- Venue
- Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 3
- Pages
- 2612-2619
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2120633474
- Cited by
- 253
- References
- 1
- FWCI
- 12.58
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A distributed and optimal motion planning approach for multiple mobile robots. https://app.cochat.ai/papers/10.1109/robot.2002.1013625
- The paper
- Guo, Y., & Parker, L. E. (2003). A distributed and optimal motion planning approach for multiple mobile robots. Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292). https://doi.org/10.1109/robot.2002.1013625
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.