Potential Field Function Research Articles

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

With the rapid development of autonomous driving technology, path planning has gained significant attention as it holds great potential for improving safety. The Rapidly-exploring Random Tree star(RRT*) algorithm has attracted much attention because of its good adaptability and expansibility. However, how solving problems in the RRT* algorithm such as slow convergence time, significant search range randomness, and unpredictability is a challenge. Therefore, an RRT* enhancement algorithm combining variable probability goal-bias strategy and artificial potential field(APF) method(Improved A-RRT*) is proposed in this paper. Firstly, the variable probability goal-bias strategy is introduced in the sampling process to make random tree expand towards the target direction and improve the directional searchability of the random tree. Secondly, the potential field function in APF is improved to prevent falling into local optimum problems during path generation. Thirdly, improved APF is combined with RRT*, the target generates a gravitational field on random tree, and the obstacle generates a repulsive force on it, leading random tree to grow toward the target region. Finally, the proposed algorithm is compared with RRT* algorithm and its derivative algorithm. The experimental results demonstrate that the proposed algorithm has obvious optimizations in convergence speed and path quality.

Leader-follower control and APF for Multi-USV coordination and obstacle avoidance

To overcome the limitations of a single USV in task execution, this paper investigates the issues of cooperative motion and obstacle avoidance for USV swarm. The leader-follower control approach is chosen as the strategy for coordinating the formation of multiple USVs. Kinematic and kinetic controllers are designed using sliding mode control, with a saturation function replacing the sign function to avoid chattering. The validity of the kinematic and kinetic controllers is demonstrated using the Lyapunov stability theorem. To tackle the problem of goal reachability when obstacles are nearby in the artificial potential field method for obstacle avoidance, the repulsive potential field function is modified by including the distance factor between the USV and the target point. To address the problem of local minimum, the simulated annealing algorithm is incorporated into the traditional artificial potential field method. Multi-condition simulation experiments are conducted using MATLAB. The experimental results demonstrate that multiple USVs can form a formation in a short time and maintain the formation while navigating, exhibiting high robustness. Furthermore, they are able to effectively navigate through complex marine environments, successfully avoiding obstacles and ultimately reaching their target destination.

Research on Real-Time Roundup and Dynamic Allocation Methods for Multi-Dynamic Target Unmanned Aerial Vehicles.

When multi-dynamic target UAVs escape, the uncertainty of the formation method and the external environment causes difficulties in rounding them up, so suitable solutions are needed to improve the roundup success rate. However, traditional methods can generally only enable the encirclement of a single target, and when the target is scattered and escaping, this will lead to encirclement failure due to the inability to sufficiently allocate UAVs for encirclement. Therefore, in this paper, a real-time roundup and dynamic allocation algorithm for multiple dynamic targets is proposed. A real-time dynamic obstacle avoidance model is established for the roundup problem, drawing on the artificial potential field function. For the escape problem of the rounding process, an optimal rounding allocation strategy is established by drawing on the linear matching method. The algorithm in this paper simulates the UAV in different obstacle environments to round up dynamic targets with different escape methods. The results show that the algorithm is able to achieve the rounding up of multiple dynamic targets in a UAV and obstacle scenario with random initial positions, and the task UAV, which is able to avoid obstacles, can be used in other algorithms for real-time rounding up and dynamic allocation. The results show that the algorithm is able to achieve the rounding up of multi-dynamic targets in scenarios with a random number of UAVs and obstacles with random locations. It results in a 50% increase in the rounding efficiency and a 10-fold improvement in the formation success rate. And the mission UAV is able to avoid obstacles, which can be used in other algorithms for real-time roundup and dynamic allocation.

Guaranteed real-time cooperative collision avoidance for n-DOF manipulators

Abstract This paper presents a decentralized, cooperative, real-time avoidance control strategy for robotic manipulators. The proposed avoidance control law builds on the concepts of artificial potential field functions and provides tighter bounds on the minimum safe distance when compared to traditional potential-based controllers. Moreover, the proposed avoidance control law is given in analytical, continuous closed form, avoiding the use of optimization techniques and discrete algorithms, and is rigorously proven to guarantee collision avoidance at all times. Examples of planar and 3D manipulators with cylindrical links under the proposed avoidance control are given and compared with the traditional approach of modeling links and obstacles with multiple spheres. The results show that the proposed avoidance control law can achieve, in general, faster convergence, smaller tracking errors, and lower control torques than the traditional approach. Furthermore, we provide extensions of the avoidance control to robotic manipulators with bounded control torques.

Study of hydrogen fuel cell unmanned surface vehicle crane collision avoidance control by using an improved artificial potential field

ABSTRACT In this paper, a collision avoidance control strategy based on an enhanced Artificial Potential Field (APF) is proposed to overcome stationary and dynamic surface obstacles for Unmanned Surface Vehicle Crane (USVC) powered by hydrogen fuel cells. The proposed collision avoidance control relies on the gravitational and repulsive potential field functions. An angle limitation and speed optimisation design strategies are derived to enhance the path planning performance and guarantee the safety of the system. Finally, the simulation and experiment of USVC platform equipped with hydrogen fuel cells are developed to confirmed the effectiveness and reliability of the collision avoidance control strategy based on a novel APF under several obstacles.

Barrow entropic cosmology with exponential potential field

In this paper, we consider an exponential potential [Formula: see text] in the framework of Barrow entropy under the constant-roll inflation and check their viability in the light of observable Planck 2020 data. By applying the first law of thermodynamics to the apparent horizon of the Universe, a modification of the Friedmann–Robertson–Walker (FRW) metric is derived in the context of Barrow entropy. We consider the early inflationary period of the universe to consist phenomenologically of a single inflationary state, that is, a state of the costant-roll inflation in which inflation is driven by an exponential potential field function. By fitting the constant-roll inflationary models to the observations, we examined the effect of the Barrow parameter [Formula: see text] on the inflation mechanism with the constant-roll parameter [Formula: see text]. As a result, we concluded that for a viable inflation, the observation limits of the inflation parameters determine that the constant-roll parameter is in the range [Formula: see text].

Safe and Efficient Exploration Path Planning for Unmanned Aerial Vehicle in Forest Environments

This study presents an enhanced exploration path planning for unmanned aerial vehicles. The primary goal is to increase the chances of survival of missing people in forest environments. Exploration path planning is an essential methodology for exploring unknown three-dimensional spaces. However, previous studies have mainly focused on underground environments, not forest environments. The existing path planning methods for underground environments are not directly applicable to forest environments. The reason is that multiple open spaces exist with various obstacles, such as trees, foliage, undergrowth, and rocks. This study mainly focused on improving the safety and efficiency to be suitable for forests rather than underground environments. Paths closer to obstacles are penalized to enhance safety, encouraging exploration at a safer distance from obstacles. A potential field function is applied based on explored space to minimize overlapping between existing and new paths to increase efficiency. The proposed exploration path planning method was validated through an extensive simulation analysis and comparison with state-of-the-art sampling-based path planning. Finally, a flight experiment was conducted to verify further the feasibility of the proposed method using onboard real hardware implementation in a cluttered and complex forest environment.

Reactive Collision Avoidance Control for Nonholonomic Vehicles and Obstacles of Arbitrary Shape

Abstract Potential field-based collision avoidance algorithms for mobile robots frequently assume vehicles and obstacles to have circular or spherical shapes. This assumption not only simplifies the analysis but also limits the mobility of agents in confined spaces, particularly for vehicles with elongated or irregular shapes. To increase mobility, this letter presents a decentralized collision avoidance framework for nonholonomic systems of unicycle type that considers the non-circular shape and relative orientation of vehicles and obstacles. The framework builds on the concepts of potential field and avoidance functions. However, it proposes using a non-constant minimum safe distance radius that changes based on the shape, relative position, and relative orientation of agents. The control framework is proven to guarantee collision avoidance at all times and is shown, via simulation, to increase the ability of agents to navigate through narrow spaces safely.

An Improved Hybrid Path Planning Algorithm in Indoor Environment

Abstract During the path planning of robots in the indoor unstructured complex environment, there are often problems such as unreachable target points, deflection in the planning process, and failure to avoid dynamic obstacles in time. To solve these problems, an improved hybrid indoor path planning algorithm was proposed, wherein the improved global path planning algorithm was effectually integrated with improved local path planning algorithm. Firstly, the heuristic factor of traditional A-Star algorithm was optimized, search range and nodes were reduced, and then the path generated by traditional A-Star algorithm for path planning was smoothed using the angle bisector tangent point method. Secondly, combining path and environment information, local path planning was undertaken by utilizing the improved artificial potential field algorithm, and the unreachable target points problem was addressed by adjusting the repulsive field parameters. Additionally, dynamic potential field function was constructed to make it have the ability to resolve dynamic obstacles. Finally, in the part of actual environment verification, a comparison was made in this paper to assess the performance of the traditional hybrid algorithm against the improved algorithm in terms of path planning. The consequences showed that, by the hybrid algorithm proposed in this paper, the path planning length was reduced by 10.3%, the running time was decreased by 12.5%, and 34 redundant nodes were eliminated. The consequences indicated that the hybrid algorithm can effectively address the indoor unstructured and complex path planning problems.

Graph-based multi-agent reinforcement learning for large-scale UAVs swarm system control

In this study, a novel graph-embedding technique based on a graph neural network (GNN) is proposed to identify the topology in the motion of a unmanned aerial vehicles (UAV) swarm and quickly obtain local information around each agent. We also propose a model reference reinforcement learning method to learn the potential field function and determine an appropriate strategy for each agent that can satisfy the requirements of collaborative motion and obstacle avoidance for large-scale UAV swarms. First, a new swarm structure is proposed to provide reserved maneuvering space for UAVs during flight. After encoding the obstacle avoidance behavior of multiple UAVs into spatial graphs, a graph attention mechanism (GAT) was employed to extract the dynamic information from them. Consequently, each individual autonomously generate actions based on its local data. Second, a new distributed control algorithm based on multi-agent reinforcement learning (MARL) is proposed to learn the potential field function from the local information. Each individual can repel and cooperate with the target within a short range and attract objects over a long distance. Finally, simulation results demonstrate the effectiveness and superiority of the proposed method, which has great potential for application in online autonomous collaboration.

Motion planning for off‐road autonomous driving based on human‐like cognition and weight adaptation

AbstractDriving in an off‐road environment is challenging for autonomous vehicles due to the complex and varied terrain. To ensure stable and efficient travel, the vehicle requires consideration and balancing of environmental factors, such as undulations, roughness, and obstacles, to generate optimal trajectories that can adapt to changing scenarios. However, traditional motion planners often utilize a fixed cost function for trajectory optimization, making it difficult to adapt to different driving strategies in challenging irregular terrains and uncommon scenarios. To address these issues, we propose an adaptive motion planner based on human‐like cognition and cost evaluation for off‐road driving. First, we construct a multilayer map describing different features of off‐road terrains, including terrain elevation, roughness, obstacle, and artificial potential field map. Subsequently, we employ a convolutional neural network‐long short‐term memory network to learn the trajectories planned by human drivers in various off‐road scenarios. Then, based on human‐like generated trajectories in different environments, we design a primitive‐based trajectory planner that aims to mimic human trajectories and cost weight selection, generating trajectories that are consistent with the dynamics of off‐road vehicles. Finally, we compute optimal cost weights and select and extend behavioral primitives to generate highly adaptive, stable, and efficient trajectories. We validate the effectiveness of the proposed method through experiments in a desert off‐road environment with complex terrain and varying road conditions. The experimental results show that the proposed human‐like motion planner has excellent adaptability to different off‐road conditions. It shows real‐time operation, greater stability, and more human‐like planning ability in diverse and challenging scenarios.

Prescribed-time containment control of multi-agent systems subject to collision avoidance and connectivity maintenance

In this paper, the problem of prescribed-time containment control for a second-order multiple leader–follower systems (MLFSs) is studied, in where both collision avoidance and connectivity maintenance of the agents are considered. Firstly, an effective exponential potential field function (EAPF) with constraints based on the estimated distance is designed to achieve collision resistance and connectivity preservation of the agents at a prescribed-time. Secondly, an estimator-based distributed control protocol is proposed, which drives the agents to achieve containment control in a cooperative manner at a prescribed-time. Furthermore, a novel distributed control protocol containing a collision avoidance term and a containment control term is addressed as well, which enables all followers to complete collision avoidance and connectivity maintenance in any prescribed-time and enter the leaders’ convex packet. Finally, the stability of the system is technically analyzed by using Lyapunov theory, and the effectiveness of the presented strategies is verified by several simulations.

Stability-Considered Lane Keeping Control of Commercial Vehicles Based on Improved APF Algorithm

Regarding the lane keeping system, path tracking accuracy and lateral stability at high speeds need to be taken into account especially for commercial vehicles due to the characteristics of larger mass, longer wheelbase and higher mass center. To improve the performance mentioned above comprehensively, the control strategy based on improved artificial potential field (APF) algorithm is proposed. In the paper, time to lane crossing (TLC) is introduced into the potential field function to enhance the accuracy of path tracking, meanwhile the vehicle dynamics parameters including yaw rate and lateral acceleration are chosen as the repulsive force field source. The lane keeping controller based on improved APF algorithm is designed and the stability of the control system is proved based on Lyapunov theory. In addition, adaptive inertial weight particle swarm optimization algorithm (AIWPSO) is applied to optimize the gain of each potential field function. The co-simulation results indicate that the comprehensive evaluation index respecting lane tracking accuracy and lateral stability is reduced remarkably. Finally, the proposed control strategy is verified by the HiL test. It provides a beneficial reference for dynamics control of commercial vehicles and enriches the theoretical development and practical application of artificial potential field method in the field of intelligent driving.

Optimization of multi-vehicle obstacle avoidance based on improved artificial potential field method with PID control

In the context of multi-vehicle formation, obstacle avoidance in unknown environments presents a number of challenges, including obstacles near the target, susceptibility to local minima, and dynamic obstacle avoidance. To address these issues in multi-vehicle formation control and obstacle avoidance within unknown environments, this paper uses PID control to optimize the potential field function of the artificial potential field method and conducts simulation experiments. The results demonstrate that the proposed algorithm achieves reductions of 39.7%, 41.9%, 24.8% and 32.0% in four efficiency functions (total iteration times, formation efficiency function value, energy consumption and standard deviation of iteration times) compared to other algorithms. The improved algorithm more effectively addresses the challenge of slow obstacle avoidance when vehicles approach the target and can handle unexpected situations such as local minima and dynamic obstacles. It achieves energy-efficient optimization for multi-vehicle obstacle avoidance in complex environments.

Robot kinematics analysis and trajectory planning based on artificial potential field method

Abstract In order for a robot to complete a given task, it must first be made to autonomously reach a specified target location, so optimizing the robot path trajectory planning is a prerequisite for the use of robots. In this paper, for the two problems of the traditional artificial potential field method of target unreachable and local optimization, we first improve the repulsive potential field function so that the robot’s gravitational force and repulsive force are zero at the target position and then construct the robot kinematic analytical model by setting the virtual target point away from the local minimum value point. On this basis, the improved algorithm is used to compare simulation experiments in three environments with the real trajectory planning test in the showroom. In the climate “near the obstacle of the target point” and the pure U-shaped area environment, the robot of the traditional APF algorithm cannot reach the target point. However, the algorithm in this paper reaches the target point in all three environments, with a time taken of only 21, 33, and 42 seconds, respectively. In the real trajectory planning of the showroom, the improved algorithm in this paper reaches the target point quickly and accurately, with a total path trajectory length of 77.7835m, a time of 43 seconds, and a total turning angle of 793°. This paper provides an effective method for planning robot path trajectories in a complex and variable environment.

The Dynamic Path Planning of Autonomous Vehicles on Icy and Snowy Roads Based on an Improved Artificial Potential Field

The crucial dynamic path planning of autonomous vehicles is achieved via obstacle avoidance path planning technology. The reduction of the tire adhesion coefficient on icy and snowy roads (ISRs) increases the difficulty of autonomous vehicles’ control. In this paper, the driving characteristics of vehicles on ISRs are established, and the artificial potential field function is introduced to avoid collision risk when planning a path. A dynamic path planning algorithm for autonomous vehicles based on the artificial potential field (APF) is established. The adjustment factor is added to the gravitational potential field, and a judgment coefficient is added to the repulsive potential field to improve the artificial potential field function, based on the low adhesion of vehicles on ISRs. Moreover, a path with a continuous curvature is generated to achieve the driving comfort and driving safety of the planned path via trajectory smoothing. By establishing the Carsim/Simulink co-simulation platform, the effectiveness of dynamic path planning for autonomous vehicles under different algorithms and different obstacle models is compared. The results show that the improved APF algorithm has an obvious effect on the smoothness of the path and the reduction of the curvature mutation and can generate a safe and efficient path on icy and snowy roads. The dynamic obstacle avoidance of the improved APF algorithm improves the pre-judgment accuracy of the collision risk assessment of autonomous vehicles and shows the superiority of the improved algorithm.

Improved Rapid-Expanding-Random-Tree-Based Trajectory Planning on Drill ARM of Anchor Drilling Robots

Permanent highway support in deep coal mines now depends on the anchor drilling robot’s drill arm. The drilling arm’s trajectory planning using the conventional RRT (rapid-expanding random tree) algorithm is inefficient and has crooked, rough paths. To improve the accuracy of path planning, we propose an improved RRT algorithm. Firstly, the kinematic model of the drill arm of the drill and anchor robot was established, and the improved DH solution parameters and the positive solution of the drill arm kinematics were solved. The end effector’s attainable working space was calculated using the Monte Carlo approach. Additionally, to address the problem of the slow running speed of the RRT algorithm, an artificial potential field factor was introduced to construct virtual force fields at obstacle and target points and calculate the potential field map for the entire reachable workspace to improve the speed of the sampling points close to the target point. At the same time, the greedy approach and the three-time B-sample curve-fitting method were used simultaneously to remove unnecessary points and carry out smooth path processing in order to improve the quality of the drill arm trajectory. This was carried out in order to solve the issue of rough pathways generated by the RRT algorithm. Finally, 50 time-sampling comparison experiments were conducted on 2D and 3D maps. The experimental results showed that the improved RRT algorithm improved the average sampling speed by 20% and reduced the average path length by 14% compared with the RRT algorithm, which verified the feasibility and effectiveness of this improved RRT algorithm. The improved RRT algorithm generates more efficient and smoother paths, which can improve the intelligence of the support process by integrating and automating drilling and anchoring and providing reliable support for coal mine intelligence.

Revolutionizing granular matter simulations by high-performance ray tracing discrete element method for arbitrarily-shaped particles

It remains a challenge for discrete element method to simulate large-scale systems with arbitrarily shaped particles. This paper presents a novel approach called Ray Tracing Discrete Element Method (RTDEM) to offer ultra-high efficiency in simulating particles with arbitrary shapes. In RTDEM, we use a triangular mesh to represent the surface of a particle for greater flexibility in shape representation. Template meshes are further introduced to group particles of different shapes to save computing memory. Key to RTDEM are innovative ray tracing-based algorithms specially designed for accurate and efficient contact detection and resolution between arbitrarily shaped particles. Based on the RT algorithms, discrete potential field functions are further proposed for the discrete mesh vertices and facets to define energy-conservative contact models that include vertex-potential, facet-potential models, and their combination. The integration of these key elements into RTDEM offers a whole new DEM framework that readily empowers any parallel computing architecture for high acceleration on granular media modeling. It matches particularly well with the Graphics Processing Units (GPUs) to fully unleash the computing power of ray tracing cores for large-scale DEM simulations of arbitrarily shaped particles, even on a personal computer with a common gaming GPU card.

Path planning of unmanned surface vehicle based on artificial potential field approach considering virtual target points

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.

The underwater obstacle avoidance method based on ROS

To achieve real-time obstacle avoidance for underwater robots, the artificial potential field method can be selected as the obstacle avoidance path planning algorithm. However, this method applies a large attractive force to the underwater robot when it is far from the target point, causing it to collide with obstacles. Additionally, when the underwater robot just enters the repulsion influence zone, the repulsion force that it experiences undergoes an abrupt change, resulting in a non-smooth obstacle avoidance path. Furthermore, developing the obstacle avoidance function based on software platforms such as MATLAB has a long algorithm verification cycle, and it is difficult to transfer the algorithm model to practical scenarios. Therefore, this paper proposes an underwater robot obstacle avoidance method based on ROS. Firstly, a dynamic adjustment factor is introduced into the potential field function of the artificial potential field method to redefine the obstacle influence zone, and an improved artificial potential field method is designed as the obstacle avoidance path planning algorithm for underwater robots. The experiment is conducted on the ROS simulation platform, and the results show that the improved algorithm can solve the two problems existing in the artificial potential field method. Secondly, nodes required for underwater robot obstacle avoidance are established based on the ROS operating system, and the improved artificial potential field method is integrated into the obstacle avoidance path planning node. Finally, the obstacle avoidance experiment of the Bluerov2 underwater robot is conducted in a pool, and the experimental results demonstrate that the proposed method can achieve real-time obstacle avoidance for underwater robots.