CoChat

Hybrid Dynamic Moving Obstacle Avoidance Using a Stochastic Reachable Set-Based Potential Field

Malone, Nick, Chiang, Hao-Tien, Lesser, Kendra, Oishi, Meeko, Tapia, Lydia · 2017 · IEEE Transactions on Robotics
Cited by 173

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

Abstract

One of the primary challenges for autonomous robotics in uncertain and dynamic environments is planning and executing a collision-free path. Hybrid dynamic obstacles present an even greater challenge as the obstacles can change dynamics without warning and potentially invalidate paths. Artificial potential field (APF)-based techniques have shown great promise in successful path planning in highly dynamic environments due to their low cost at runtime. We utilize the APF framework for runtime planning but leverage a formal validation method, Stochastic Reachable (SR) sets, to generate accurate potential fields for moving obstacles. A small number of SR sets are computed a priori, then used to generate a potential field that represents the obstacle's stochastic motion for online path planning. Our method is novel and scales well with the number of obstacles, maintaining a relatively high probability of reaching the goal without collision, as compared to other traditional Gaussian APF methods. Here, we demonstrate our method with up to 900 hybrid dynamic obstacles and show that it outperforms the traditional Gaussian APF method by up to 60% in the holonomic case and up to 20% in the unicycle case.

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.1109/tro.2017.2705034

Cites

57 of 57 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

Show all 57 references

Metadata

Authors
Malone, N., Chiang, H.-T., Lesser, K., Oishi, M., & Tapia, L.
Venue
IEEE Transactions on Robotics
Published
2017-10
Volume
33
Issue
5
Pages
1124-1138
ISSN
  • 1552-3098 (ISSN-L)
  • 1941-0468
OpenAlex
W2624934338
Cited by
173
References
57
FWCI
5.50
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: Hybrid Dynamic Moving Obstacle Avoidance Using a Stochastic Reachable Set-Based Potential Field. https://app.cochat.ai/papers/10.1109/tro.2017.2705034
The paper
Malone, N., Chiang, H.-T., Lesser, K., Oishi, M., & Tapia, L. (2017). Hybrid Dynamic Moving Obstacle Avoidance Using a Stochastic Reachable Set-Based Potential Field. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2017.2705034

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.