Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 196

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

Artificial potential field based path planning for mobile robots using a virtual obstacle concept

Min Cheol Lee, Min Gyu Park · 2004 · Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003)

Abstract

The artificial potential field (APF) based path planning methods have a local minimum problem, which can trap mobile robots before reaching it's goal. In this study, a new concept using a virtual obstacle is proposed to escape local minimums occurred in local path planning. A virtual obstacle is located around local minimums to repel a mobile robot from local minimums. A sensor based discrete modeling method is also proposed for modeling of the mobile robot with range sensors. This modeling method is adaptable for a real-time path planning because it provides lower complexity.

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/aim.2003.1225434

Cites

1 of 1 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 1 references

Cited by

See all 196

Metadata

Authors
Lee, M. C., & Park, M. G.
Venue
Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003)
Publisher
IEEE
Published
2004-03-22
Volume
2
Pages
735-740
ISSN
2159-6247 (ISSN-L)
OpenAlex
W2150982344
Cited by
196
References
1
FWCI
1.75
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: Artificial potential field based path planning for mobile robots using a virtual obstacle concept. https://app.cochat.ai/papers/10.1109/aim.2003.1225434
The paper
Lee, M. C., & Park, M. G. (2004). Artificial potential field based path planning for mobile robots using a virtual obstacle concept. Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003). https://doi.org/10.1109/aim.2003.1225434

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.