The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Optimal motion planning for multiple robots having independent goals
Abstract
This work makes two contributions to geometric motion planning for multiple robots: 1) motion plans are computed that simultaneously optimize an independent performance measure for each robot; 2) a general spectrum is defined between decoupled and centralized planning, in which we introduce coordination along independent roadmaps. By considering independent performance measures, we introduce a form of optimality that is consistent with concepts from multiobjective optimization and game theory literature. We present implemented, multiple-robot motion planning algorithms that are derived from the principle of optimality, for three problem classes along the spectrum between centralized and decoupled planning: 1) coordination along fixed, independent paths; 2) coordination along independent roadmaps; and 3) general, unconstrained motion planning. Computed examples are presented for all three problem classes that illustrate the concepts and algorithms.
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
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Dynamic Noncooperative Game Theory
(1982) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6169-7 · Cited by 4,057
Exact robot navigation using artificial potential functions
Rimon, E., & Koditschek, D. E. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.163777 · Cited by 1,835
Theory of Multiobjective Optimization
(1985) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(09)x6017-0 · Cited by 1,508
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
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
Numerical potential field techniques for robot path planning
Barraquand, J., Langlois, B., & Latombe, J.-C. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.148426 · Cited by 889
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
A “retraction” method for planning the motion of a disc
Ó'Dúnlaing, C., & Yap, C. K. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90021-5 · Cited by 404
Learning and Sequential Decision Making
Barto, A. G., Sutton, R. S., & Watkins, C. (1989) · Cited by 357
Schwartz, J. T., & Sharir, M. (1983) · The International Journal of Robotics Research · doi:10.1177/027836498300200304 · Cited by 248
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
Planning by Incremental Dynamic Programming
Sutton, R. S. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50073-8 · Cited by 153
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
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
A game-theoretic framework for robot motion planning
LaValle, S. M. (1996) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 56
Self-citationMinimum-time collision-free trajectory planning for dual-robot systems
Shin, K. G., & Zheng, Q. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.163787 · Cited by 52
A decision-theoretic approach to planning, perception, and control
Basye, K., Dean, T., Kirman, J., & Lejter, M. (1992) · IEEE Expert · doi:10.1109/64.153465 · Cited by 34
Planning of vision and motion for a mobile robot using a probabilistic model of uncertainty
Miura, J., & Shirai, Y. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.1991.174483 · Cited by 13
Cited by
Coverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710
Reciprocal Velocity Obstacles for real-time multi-agent navigation
van den Berg, J., Lin, M., & Manocha, D. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543489 · Cited by 1,722
A Review of Motion Planning Techniques for Automated Vehicles
Gonzalez, D., Perez, J., Milanes, V., & Nashashibi, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2498841 · Cited by 1,670
Conflict-based search for optimal multi-agent pathfinding
Sharon, G., Stern, R., Felner, A., & Sturtevant, N. R. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.006 · Cited by 1,242
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
Metadata
- Authors
- LaValle, S. M., & Hutchinson, S. A.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 1998
- Volume
- 14
- Issue
- 6
- Pages
- 912-925
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2169742265
- Cited by
- 411
- References
- 22
- FWCI
- 4.13
- 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.