The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
M*: A complete multirobot path planning algorithm with performance bounds
Abstract
Multirobot path planning is difficult because the full configuration space of the system grows exponentially with the number of robots. Planning in the joint configuration space of a set of robots is only necessary if they are strongly coupled, which is often not true if the robots are well separated in the workspace. Therefore, we initially plan for each robot separately, and only couple sets of robots after they have been found to interact, thus minimizing the dimensionality of the search space. We present a general strategy called subdimensional expansion, which dynamically generates low dimensional search spaces embedded in the full configuration space. We also present an implementation of subdimensional expansion for robot configuration spaces that can be represented as a graph, called M*, and show that M* is complete and finds minimal cost paths.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
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 1×
“We will apply M* to more complex envrionments by using a PRM to generate the graph representing the individual robot configuration space [ 10 ].”
MethodRandomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Cited by
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
Subdimensional expansion for multirobot path planning
Wagner, G., & Choset, H. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.001 · Cited by 369
Self-citationOptimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Yu, J., & LaValle, S. M. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2593448 · Cited by 331
Trajectory Planning for Quadrotor Swarms
Honig, W., Preiss, J. A., Kumar, T. K. S., Sukhatme, G. S., & Ayanian, N. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2853613 · Cited by 315
Metadata
- Authors
- Wagner, G., & Choset, H.
- Venue
- 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2011-09
- Pages
- 3260-3267
- OpenAlex
- W2124015815
- Cited by
- 228
- References
- 3
- FWCI
- 6.22
- 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: M*: A complete multirobot path planning algorithm with performance bounds. https://app.cochat.ai/papers/10.1109/iros.2011.6095022
- The paper
- Wagner, G., & Choset, H. (2011). M*: A complete multirobot path planning algorithm with performance bounds. 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2011.6095022
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.