The DOI matches its Crossref record; 20 of the 20 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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
ALLIANCE: an architecture for fault tolerant multirobot cooperation
Parker, L. E. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.681242 · Cited by 1,312
Self-citationOptimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
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
The focussed D* algorithm for real-time replanning
Stentz, A. (1995) · Cited by 865
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
Erdmann, M., & Lozano-Pérez, T. (1987) · Algorithmica · doi:10.1007/bf01840371 · Cited by 736
Hopcroft, J. E., Schwartz, J. T., & Sharir, M. (1984) · The International Journal of Robotics Research · doi:10.1177/027836498400300405 · Cited by 467
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
Optimal robot plant planning using the minimum-time criterion
Bobrow, J. E. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.811 · Cited by 256
Multiple robot path coordination using artificial potential fields
Warren, C. W. (2002) · Proceedings., IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1990.126028 · Cited by 229
Deadlock-free and collision-free coordination of two robot manipulators
O'Donnell, P. A., & Lozano-Perez, T. (1989) · Proceedings, 1989 International Conference on Robotics and Automation · doi:10.1109/robot.1989.100033 · Cited by 227
Erdmann, M., & Lozano-Perez, T. (1986) · Proceedings. 1986 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1986.1087401 · Cited by 208
Collision-Free Motion Planning of Two Robots
Lee, B., & G. Lee, C. (1987) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1987.289330 · Cited by 186
Motion Planning in Dynamic Environments
Fujimura, K. (1991) · Computer science workbench · doi:10.1007/978-4-431-68165-6 · Cited by 151
A minimum-time trajectory planning method for two robots
Bien, Z. N., & Lee, J. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.143360 · Cited by 114
Dynamic Mission Planning for Multiple Mobile Robots
Brumitt, B. L., & Stentz, A. (1997) · Springer eBooks · doi:10.1007/978-1-4615-6325-9_12 · Cited by 109
Collision avoidance of two general robot manipulators by minimum delay time
Chang, C. H., Chung, M. J., & Lee, B. H. (1994) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.279000 · Cited by 89
Motion Planning of Multiple Mobile Robots
Arai, T., & Ota, J. (1992) · Cited by 67
Dynamic mission planning for multiple mobile robots
Brumitt, B. L., & Stentz, A. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1996.506522 · Cited by 62
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
Motion planning for multitarget surveillance with mobile sensor agents
Tang, Z., & Ozguner, U. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.847567 · Cited by 269
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
- 20
- 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
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.