The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile 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
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×
“For example, the approaches presented in [ 9 , 11, 19] restrict the trajectories of the robots to lie on independent road maps.”
MethodPrinciples of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 2×
“Our system applies the A∗ procedure [17] to compute the cost-optimal paths for the individual robots.”
BackgroundMethod
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
The increasing cost tree search for optimal multi-agent pathfinding
Sharon, G., Stern, R., Goldenberg, M., & Felner, A. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2012.11.006 · Cited by 323
Prioritized motion planning for multiple robots
van den Berg, J. P., & Overmars, M. H. (2005) · 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2005.1545306 · Cited by 308
Parker, L. E., Rus, D., & Sukhatme, G. S. (2016) · Springer Handbooks · doi:10.1007/978-3-319-32552-1_53 · Cited by 290
Metadata
- Authors
- Bennewitz, M., Burgard, W., & Thrun, S.
- Venue
- Robotics and Autonomous Systems
- Publisher
- Elsevier BV
- Published
- 2002-11
- Volume
- 41
- Issue
- 2-3
- Pages
- 89-99
- ISSN
- 0921-8890 (ISSN-L)
- OpenAlex
- W2070224057
- Cited by
- 251
- References
- 2
- FWCI
- 2.62
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. https://app.cochat.ai/papers/10.1016/s0921-8890(02)00256-7
- The paper
- Bennewitz, M., Burgard, W., & Thrun, S. (2002). Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robotics and Autonomous Systems. https://doi.org/10.1016/s0921-8890(02)00256-7
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.