Local Minimum Avoidance in Potential Field Method Through Virtual-Wall Generation and Wall Following

This paper proposes a novel method to solve the local minimum problem of conventional potential field methods by generating virtual walls to achieve autonomous movement in unknown environments. The existence of local minimum can be attributed to two main factors: (i) the robot enters a concave region and becomes trapped, and (ii) the attractive and repulsive forces balance out when an obstacle is located directly in the direction of the goal. The proposed method addresses these challenges by generating a virtual wall along obstacles with concave shapes, preventing the robot from entering such regions. Furthermore, when a local minimum occurs owing to the force equilibrium caused by obstacles in the goal direction, the robot executes a wall-following behavior to escape from the local minimum. We confirmed that the proposed method enables a robot to move toward the goal more efficiently than the conventional method by generating virtual walls and following them in an environment with local minimum.

Authors

Institutions

Publication Details

Journal
Journal of Robotics and Mechatronics
Published
2025-10-19
DOI
https://doi.org/10.20965/jrm.2025.p1094
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local Minimum Avoidance in Potential Field Method Through Virtual-Wall Generation and Wall Following

Hanwool Woo, Shin Hirota
Journal of Robotics and Mechatronics
Robotic Path Planning Algorithms
article

Local Minimum Avoidance in Potential Field Method Through Virtual-Wall Generation and Wall Following

Hanwool Woo, Shin Hirota
article en

Abstract

This paper proposes a novel method to solve the local minimum problem of conventional potential field methods by generating virtual walls to achieve autonomous movement in unknown environments. The existence of local minimum can be attributed to two main factors: (i) the robot enters a concave region and becomes trapped, and (ii) the attractive and repulsive forces balance out when an obstacle is located directly in the direction of the goal. The proposed method addresses these challenges by generating a virtual wall along obstacles with concave shapes, preventing the robot from entering such regions. Furthermore, when a local minimum occurs owing to the force equilibrium caused by obstacles in the goal direction, the robot executes a wall-following behavior to escape from the local minimum. We confirmed that the proposed method enables a robot to move toward the goal more efficiently than the conventional method by generating virtual walls and following them in an environment with local minimum.

Journal of Robotics and MechatronicsVol. 37(5)
Kogakuin University (JP)
Openalex Percentile: Top 71%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.