The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Centralized path planning for multiple robots: Optimal decoupling into sequential plans
Open accessAbstract
We develop an algorithm to decouple a multi-robot path planning problem into subproblems whose solutions can be executed sequentially.Given an external path planner for general configuration spaces, our algorithm finds an execution sequence that minimizes the dimension of the highest-dimensional subproblem over all possible execution sequences.If the external planner is complete (at least up to this minimum dimension), then our algorithm is complete because it invokes the external planner only for spaces of dimension at most this minimum.Our algorithm can decouple and solve path planning problems with many robots, even with incomplete external planners.We show scenarios involving 16 to 65 robots, where our algorithm solves planning problems of dimension 32 to 130 using a PRM planner for at most eight dimensions. 1
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 3×
“The roadmaps RM(ri) can be constructed by, for instance, a Probabilistic Roadmap Planner [9].”
Background
Cited by
Subdimensional expansion for multirobot path planning
Wagner, G., & Choset, H. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.001 · Cited by 369
Optimal 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
Metadata
- Authors
- van den Berg, J., Snoeyink, J., Lin, M., & Manocha, D.
- Venue
- Robotics: Science and Systems V
- Published
- 2009-06-28
- OpenAlex
- W125001008
- Cited by
- 167
- References
- 1
- FWCI
- 6.27
- Type
- conference paper
- Language
- en
- Open access
- gold
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.