CoChat

Topological constraints in search-based robot path planning

Bhattacharya, S., Likhachev, M., Kumar, V. · 2012 · Autonomous Robots
Cited by 172

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10514-012-9304-1

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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 · cited 1×

    “This process continues until a desired vertex v g ∈ V is reached (Hart et al. 1968).”
    Background
  • Information based adaptive robotic exploration

    Bourgault, F., Makarenko, A. A., Williams, S. B., Grocholsky, B., & Durrant-Whyte, H. F. (2003) · IEEE/RSJ International Conference on Intelligent Robots and System · doi:10.1109/irds.2002.1041446 · Cited by 453 · cited 1×

    “…potential threats, searching for rewards/targets (Schwager et al. 2011), as well as for updating obstacle map of a partially known environment (Bourgault et al. 2002)), an efficient strategy ought to be able to identify the different homotopy classes and deploy one robot in each homotopy class.”
    Background

Cited by

See all 172

Metadata

Authors
Bhattacharya, S., Likhachev, M., & Kumar, V.
Venue
Autonomous Robots
Published
2012-06-20
Volume
33
Issue
3
Pages
273-290
ISSN
  • 0929-5593 (ISSN-L)
  • 1573-7527
OpenAlex
W1992787855
Cited by
172
References
2
FWCI
11.15
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.