Efficient path planning for autonomous vehicles based on RRT* with variable probability strategy and artificial potential field approach

It is a hot topic in the field of road landscape planning technology that a mobile robot can quickly and safely find an optimal path in a multi-obstacle environment. In path planning, in light of the problems of poor cooperation and slow convergence of ant colony algorithm in a known environment, the existing potential field method in the local path environment focuses on avoiding dynamic obstacles but cannot guarantee an optimal path. This study provides a new fusion algorithm for path planning optimization in both static and dynamic environments. Firstly, to prevent slipping into a local optimum, create a pheromone diffusion model and adaptively tweak the population information entropy factor to speed up the convergence speed of the Adaptive Ant Colony Optimization (AACO) algorithm. Secondly, on the basis of the globally planned path, by designing the local stability detection and escape functions, the Improved Artificial Potential Field (IAPF) method is utilized to solve the problem of unreachable destination. Finally, we conduct simulation experiments through MATLAB to compare the indicators for evaluating paths, it verifies that the fusion algorithm proposed in this research has obvious advantages in path planning in both static and dynamic environments.KeywordsPath planningAdaptive ant colony optimizationPopulation information entropyImproved artificial potential field

Forest fire is a natural disaster that causes huge damage to human life and property. Emergency rescue and evacuation actions are crucial in such situations, and path planning is an important part of such actions. Artificial Potential Field (APF) method is a popular path planning method, but it has limitations in complex dynamic environments such as forest fires. In this paper, we propose an improved APF method for forest fire emergency rescue and evacuation path planning. This method uses a dynamic repulsive field to avoid obstacles in the fire scene and an improved attractive field to guide people towards the target. We also combine the classic Rothermel model in forest fire spread to further improve the realism of dynamic spread path planning in forest fires. Computational simulation results show that compared with the original APF method, this method still maintains an acceptable level of computational efficiency as the number of fire scene obstacles increases and is superior to traditional APF method in terms of path planning safety.

We propose a consensus-based artificial potential field (CAPF) approach for swarm control. The CAPF approach enables a swarm to accomplish different complex tasks including task allocation. The artificial potential field (APF) approach provides an efficient control law for different types of swarm control, such as consensus control, formation control, and coverage control. In the APF approach, the control inputs of robots are determined on the basis of a potential field, that is, a gradient of the potential function. In the existing swarm controls, the potential field for each robot depends on only local information such as the robot's own state and states of nearby robots. A swarm cannot accomplish complex tasks with the existing APF approach because of this restriction on the potential function. In our CAPF approach, in contrast, the potential function does not have this restriction and the potential field is calculated on the basis of a consensus filter that requires only local communication. We show that, by using the CAPF approach, a state of a swarm converges to a local minimum of the potential function. Moreover, we apply the CAPF approach to a multi-robot task allocation (MRTA) problem.

Artificial potential field method is widely used in robot path planning because of its simplicity, efficiency and smooth path generation. In this paper, based on the introduction of the basic principle of the artificial potential field method, the limitations of the algorithm are analysed in depth, and improvement methods are summarized for these problems. Aiming at the problem that the target near the obstacle is unreachable in the traditional artificial potential field method, an improved repulsive force potential field function is used to introduce the distance between the robot and the target point into the potential field function, so that the potential field of the target position is minimized in the global potential field, so that the robot can successfully reach the target. Using the obstacle connection method, the robot can quickly get rid of the local minimum point, go out of the local minimum area, and complete the path planning. The simulation results show that the method is effective.

Energy-optimal adaptive artificial potential field method for path planning of free-flying space robots

The goal of the motion planning algorithm is to compute an obstacle-free trajectory that satisfies the vehicle dynamics constraints and guides the vehicle from the starting position to the target position. RRT* (Rapidly-exploring Random Tree star) is a sampling-based algorithm which is widely used in many path planning applications due to its speed in quickly finding a trajectory. Although the search of RRT* can convergence to optimal solution, the optimal solution has been proven to take an infinite time to achieve convergence with a slow convergence rate. In this paper, a new parallel version of RRT* algorithm combining the artificial potential field (APF-RRT*) is proposed for 2D and 3D path planning. APF-RRT* gives an advantage over other RRT* algorithms by introducing attractive and repulsive forces into the APF algorithm, allowing for improvement in the near-optimal path. Furthermore, the path planning runs as a parallel process, which can improve the convergence speed to a certain extent. The effectiveness of the algorithm has been demonstrated in simulation based on C++. We compared our algorithm with RRT* and verified the improvement of the parallel APF-RRT* algorithm in terms of path optimization and operation time.

According to the requirements of real-time obstacle avoidance of unmanned vehicles, an improved artificial potential field local obstacle avoidance path planning algorithm is proposed. Considering the influence factors of vehicle kinematics and dynamics, an improved distance adjustment factor is added to the static obstacle potential field function to construct the water drop repulsion potential field, which improves the efficiency of path planning; The relative velocity function and relative acceleration function are added to the potential field function of dynamic obstacles, which solves the problem that the traditional potential field method has no solution under the dynamic obstacle avoidance condition. The Bessel curve is used to smooth the path, and finally a fast, efficient and collision-free optimal path is generated. Using the Prescan-CarSim-Matlab/Simulink joint simulation platform, the effectiveness of the proposed path planning algorithm is verified under the conditions of lane changing obstacle avoidance of static obstacles and deceleration obstacle avoidance of lateral dynamic obstacles. The simulation results show that compared with the traditional potential field method, the change of heading angle obtained by the improved potential field method is reduced by 84% and the stability of dynamic obstacle avoidance is improved.

The objective of this study is to apply differential global positioning system (DGPS) and an improved artificial potential field (APF) method to a wheeled mobile robot (WMR) for path planning under unknown environment. A laser sensor is utilized to detect obstacles and surroundings. With the distance information given by the laser sensor, the repulsive force is used for collision-free of the WMR. By the iterative closest point (ICP) algorithm, the rotation and translation information can be calculated and utilized to aid the position and attitude determination. Fuzzy theory is applied to change the attractive factor to improve the zigzag trajectory. To deal with the local minimum problem, we add the path finding method A* algorithm to find the shortest unblocked path to destination. With the integration of fuzzy rule, positioning and path finding algorithms, the APF can be created. The experiments confirm that the proposed control scheme works properly.

Mobile robots require the ability to plan collision-free paths. This paper introduces a wheel-foot hybrid parallel-leg walking robot based on the 6-Universal-Prismatic-Universal-Revolute and 3-Prismatic (6UPUR + 3P) parallel mechanism model. To enhance path planning efficiency and obstacle avoidance capabilities, an improved artificial potential field (IAPF) method is proposed. The IAPF functions are designed to address the collision problems and issues with goals being unreachable due to a nearby problem, local minima, and dynamic obstacle avoidance in path planning. Using this IAPF method, we conduct path planning and simulation analysis for the wheel-foot hybrid parallel-legged walking robot described in this paper, and compare it with the classic artificial potential field (APF) method. The results demonstrate that the IAPF method outperforms the classic APF method in handling obstacle-rich environments, effectively addresses collision problems, and the IAPF method helps to obtain goals previously unreachable due to nearby obstacles, local minima, and dynamic planning issues.

With the popularization of UAV applications, the cooperation of multiple UAVs attracts more and more attention in the community of robotics to improve the mission efficiency and range. In practical applications, a high performance path planning result is critical to the security and efficiency of the multiple UAVs cooperation. Among these path planning methods, Artificial Potential Field Method (APFM) is simple and real-time, which has been commonly used for UAVs path planning. However, some problems may exist in APFM, such as the local optimum problem, which may make the UAV falling into a deadlock and moving unsteadily near the obstacles. To solve the problem of the existed APFM, a real-time game theory based APFM for multiple UAVs path planning is proposed in this paper. First, the artificial potential forces of each UAV are built when the UAVs move through the path. Then, to solve the problem of local minima, the collision cone of the UAV caused by the obstacles and other UAVs is applied to estimate the collision risk. Finally, game theory is applied to optimize the path planning for multiple UAVs with low overall collision risk. Experimental results show that our proposed real-time game theory based APFM for multiple UAVs can overcome the local minima of APFM and obtain more optimized path planning results and lower overall collision risk, when compared with the existed APFM for multiple UAVs.

Considering the collision-prone problem near the initial point, goal non-reachable with obstacle nearby (GNWON) and the chattering problem of the traditional artificial potential field algorithm(TAPF), the attractive potential field function and the repulsive potential field function are improved respectively, and an improved adaptive artificial potential field algorithm(AAPF) is proposed. The algorithm can calculate the different potential field of each path point on-line in real time. On this basis, a 2D improved adaptive artificial potential field algorithm is extended to 3D space for autonomous obstacle avoidance planning of quadrotor UAV. A 3D obstacle model is established, and the principle of obstacle avoidance at the nearest contact point is designed to calculate the repulsive potential field. Then the obstacle avoidance planning strategy of Four-rotor UAV based on 3D adaptive potential field algorithm is designed. The simulation results show that the improved adaptive algorithm effectively compensates for the shortcomings of the traditional artificial potential field method and can be applied in 3D.

Aiming at the local minimum problem and target unreachable problems in the path planning of unmanned surface vehicle (USV), a path planning algorithm of USV considering virtual target point is proposed. For the target unreachable problem, a repulsive force potential field function is created. According to the measured distance between the target and the obstacle, the repulsive force of the target is zero, so that the USV can reach the target point. For the local minimum problem, the local minimum caused by various obstacles is analyzed, simulated annealing (SA) and artificial potential field approach (APFA) are combined to solve the minimum point problem caused by general obstacles. For the local minimum problem caused by special U-shaped obstacles, a virtual target point algorithm (VTPA) is established to solve this problem. The simulation results prove that this algorithm solves the problem of long path caused by too large repulsive force. Compared with Dual-Tree Rapidly exploring Random Tree (DT-RRT) algorithm, the efficiency of this algorithm has been significantly improved. Algorithm running time was reduced by 33.4%. Path length was reduced by 17.8%. Not only the time is saved, but also the path planning is optimized, so that the speed of the algorithm is accelerated.

With the development and widely use of unmanned aerial vehicles (UAVs) in recent years, the development of efficient path planning methods for automation has become crucial. Obstacle avoidance and path planning are the key components of UAV path planning. This article provides an overview of obstacle avoidance and path planning techniques for UAVs based on the artificial potential field method (APF method). This article begins with the explaining the principles of artificial potential field on this basis discusses its advantages and limitations. The article then summarizes the improvement strategies proposed by previous researchers to address issues like local minimum values and unreachable targets, such as introducing a new repulsive potential energy function, combining APF with other planning methods, and utilizing flow functions. Furthermore, it presents examples of the application and the performance of usage of these techniques in both static and dynamic environments. Based on this, the prospects and developing trend of UAV obstacle avoidance methods based on artificial potential field are foresee, such as combined with DRL and deep learning.

This paper addresses the issues of target unreachability and local optima in traditional artificial potential field (APF) methods for UAV swarm path planning by proposing an improved collaborative obstacle avoidance algorithm. By introducing a virtual target position function to reconstruct the repulsive field model, the repulsive force exponentially decays as the UAV approaches the target, effectively resolving the problem where excessive obstacle repulsion prevents UAVs from reaching the goal. Additionally, we design a dynamic virtual target point generation mechanism based on mechanical state detection to automatically create temporary target points when UAVs are trapped in local optima, thereby breaking force equilibrium. For multi-UAV collaboration, intra-formation UAVs are treated as dynamic obstacles, and a 3D repulsive field model is established to avoid local optima in planar scenarios. Combined with a leader–follower control strategy, a hybrid potential field position controller is designed to enable rapid formation reconfiguration post-obstacle avoidance. Simulation results demonstrate that the proposed improved APF method ensures safe obstacle avoidance and formation maintenance for UAV swarms in complex environments, significantly enhancing path planning reliability and effectiveness.

Unmanned Aerial Vehicles (UAVs), particularly quadrotor UAVs, are widely recognized for their cost-effectiveness, operational flexibility, and vertical takeoff and landing capabilities, making them ideal for specific airspace operations and emergency response scenarios. Efficient path planning is critical for UAV mission execution, requiring optimal flight paths that ensure safe obstacle avoidance while addressing challenges such as dynamic environments, energy optimization, and multi-parameter management. Despite advancements in path planning techniques, including the artificial potential field (APF) method and reinforcement learning (RL), issues like local optima and parameter tuning complexity persist, limiting adaptability in dynamic environments. This study proposes a hybrid approach integrating Markov Decision Process (MDP) theory with an improved artificial potential field (IAPF) method to enhance quadrotor UAV path planning in three-dimensional environments. By generating global waypoints based on known obstacle, the method minimizes flight path deviations and improves navigation performance. The results demonstrate significant advancements in trajectory accuracy and adaptability, offering a robust solution for UAV path optimization in complex scenarios.