Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Journal of Field Rob...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Journal of Field Robotics
Article . 2023 . Peer-reviewed
License: Wiley Online Library User Agreement
Data sources: Crossref
DBLP
Article . 2023
Data sources: DBLP
versions View all 2 versions
addClaim

An obstacle avoidance strategy for complex obstacles based on artificial potential field method

Authors: Wei Zhang 0134; Guojun Xu; Yan Song 0002; Yagang Wang;

An obstacle avoidance strategy for complex obstacles based on artificial potential field method

Abstract

AbstractWhen there are obstacles around the target point, the mobile robot cannot reach the target using the traditional artificial potential field (APF). Besides, the traditional APF is prone to local oscillation in complex terrain such as three‐point collinear or semiclosed obstacles. Aiming at solving the defects of traditional APF, a novel improved APF algorithm named back virtual obstacle setting strategy‐APF has been proposed in this paper. There are two main advantages of the proposed method. First, by redefining the gravitational function as a logarithmic function, the proposed method can make the mobile robot reach the target point when there are obstacles around the target. Second, the proposed method can avoid falling into local oscillation for both three‐point collinear and semiclosed obstacles. Compare with APF and other improved APF, the feasibility of the algorithm is proved through software simulation and practical application.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    48
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 1%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 1%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
48
Top 1%
Top 10%
Top 1%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!