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

Abstract

When 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.

A Retrospective Analysis of Indoor CO2 Measurements Obtained with a Mobile Robot during the COVID-19 Pandemic

“…This LIDAR has a radial distance range of up to 40 m, with a precision between 30 and 50 mm, covers a plane of 270 • around the sensor, and provides 1081 points per scan, at a rate of 40 scans/s. The mobile robot processes the information gathered by this 2D LIDAR for simultaneous localization and mapping (SLAM) [53], obstacle avoidance [54,55], and autonomous path-planning and path-tracking.…”

Reducing Oscillations for Obstacle Avoidance in a Dense Environment Using Deep Reinforcement Learning and Time-Derivative of an Artificial Potential Field

“…For instance, Zhao et al [32] enhanced the manipulator's predictive ability by incorporating dynamic virtual target points and utilized an extreme point jump-out function to escape oscillations. Zhang et al [33] employed tangent APF to avoid local oscillations and introduced the back virtual obstacle setting strategy-APF algorithm, which enables the agent to return to previous steps and withdraw from concave obstacles. In a rule-based fashion, Zheng et al [34] specified the condition for adding obstacles, compelling the resultant force to deflect when its angle to the obstacle center is too small.…”