Research on headway control of a guided transport system based on intersection condition evaluation

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.

Wireless ultraviolet light MIMO assisted UAV direction perception and collision avoidance method

In this paper, a novel obstacle avoidance algorithm for the multi-UAV flocking was proposed by combining artificial potential field and Dubins path planning method. For the multi-UAV flocking, a virtual-leader was considered, and its flight path was designed by Dubins path planning method, which can take into account the overload constraint of the UAV. In this way, the flight path of the whole multi-UAV flocking was roughly planned, so as to save obstacle avoidance time, and the flight path of the follower-UAVs was designed according to the artificial potential field method, which has a better performance in real-time obstacle avoidance, and the algorithm is relatively simple. The simulation results show that the obstacle avoidance algorithm designed by combining the two methods has a better obstacle avoidance ability.

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.

For the time sensitive multi-target attack missions, a large amount of information in battlefield is miscellaneous and rapidly changing, so it is essential to study a more efficient and accurate decision-making method. The chief aim of this paper is to build real-time battlefield model and plan flight path with Artificial Potential Field (APF) method, meanwhile, a multi-attribute decision-making method based on information entropy-AHP is proposed to make dynamic decision of attack mission under sudden threats. In order to demonstrate the effectiveness of this method, a combat scenario model is employed. Simulation results show that the proposed decision-making method can quickly update the battlefield information and give decision results, which can meet the attack requirements of aircraft against multiple targets in time-sensitive missions.KeywordsMulti-target attackDecision-makingArtificial Potential Field (APF)Entropy-AHP

In order to make the trajectories of robot more close to the actual situation, and make the robot avoid obstacles which are very close to the target point to arrive at the target, in this paper the robot's path optimization in the 3-D space force field have been studied. By using the method of artificial potential field, the traditional artificial potential field theory will be improved. By adding an adjustment factor, a new repulsive force field function has been constructed, and the robot's motion trajectories will be extended to three-dimensional space. Simulating the trajectory planning through the platform of Matlab software, the simulation results show that robots can avoid obstacles effectively and arrive at the target quickly under the method of the improved artificial potential field, even if the obstacle and target is very close.

Motion planning for multi-HUG formation in an environment with obstacles

It is of great challenge, though promising, to coordinate collective robots for hunting an evader in a decentralized manner purely in light of local observations. In this paper, this challenge is addressed by a novel hybrid cooperative pursuit algorithm that combines reinforcement learning with the artificial potential field method. In the proposed algorithm, decentralized deep reinforcement learning is employed to learn cooperative pursuit policies that are adaptive to dynamic environments. The artificial potential field method is integrated into the learning process as predefined rules to improve the data efficiency and generalization ability. It is shown by numerical simulations that the proposed hybrid design outperforms the pursuit policies either learned from vanilla reinforcement learning or designed by the potential field method. Furthermore, experiments are conducted by transferring the learned pursuit policies into real-world mobile robots. Experimental results demonstrate the feasibility and potential of the proposed algorithm in learning multiple cooperative pursuit strategies.

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.

Background: With the development of robotics, more and more robots are being used in industrial production. However, as the production environment surrounding the robots becomes increasingly complex, there is a need for more intelligent industrial robots. For improving the intelligence of industrial robots, the most important thing is to ensure that they can carry out safe industrial production activities in a complex production environment. Therefore, studying the autonomous dynamic obstacle avoidance path planning of industrial robots in complex environments is of great significance for improving the intelligence of industrial robots and the application of human-machine collaboration. Objective: The main purpose of this paper is to improve the traditional artificial potential field method. It aims to improve the disadvantages of the traditional artificial potential field method, such as falling into the local minimum and failing to reach the target. Secondly, the background difference method, which is based on binocular vision and Kalman filtering algorithm, is used, and the environmental map containing the static and dynamic obstacles is obtained. After obtaining the information on the position of static and dynamic obstacles, the robot arm can make good use of the improved artificial potential field method to plan its own trajectory, thus realizing the dynamic obstacle avoidance of the robot arm in a complex environment. Methods: This paper proposes an improved artificial potential field method. First of all, in order to solve the problem of not being able to achieve the goal, the method of modifying the repulsion field function, as proposed by Wang Huili and others, has been cited. In the traditional repulsion function, the relative distance between the robot and the target is introduced. Due to this, the target point is always the minimum point of the potential field. It is necessary to ensure that the robot can reach the target position smoothly. For the local minimum problem, by adding a gravitational increase factor β, the gravitational force received is greater than the repulsive force, thereby breaking the balance of the resultant force. Finally, for the traditional artificial potential field method that does not consider the path planning problem in the presence of dynamic obstacles, the velocity vector of the dynamic obstacle is brought into the potential field function to improve the traditional artificial potential field method. Results: The robot easily falls into the local optimum during path planning, and the improved artificial potential field method overcomes this shortcoming. Therefore, the manipulator can perform autonomous dynamic obstacle avoidance path planning in an environment with dynamic obstacles, finally reaching the target point safely. Conclusions: The industrial production field faces an increasing demand for intelligent industrial robots. This paper improves on the traditional artificial potential field method based on binocular vision so that the mechanical arm can avoid dynamic obstacles autonomously in the presence of dynamic obstacles, thereby improving the degree of intelligence of the robotic arm, enabling the technology to meet the needs of future industrial development and contribute to the development of future industrial robot technology.

This paper presents a collision-free trajectory planning algorithm for cable-driven robots (CDPRs) in dynamic environment. As the basis, the wrench feasible workspaces (WFW) of CDPRs are obtained. The tradition artificial potential field (APF) method can quickly plan a trajectory. However, APF is not time-efficient with dynamic obstacles. In order to solve this problem, a new scope of APF based on kinematic model is used to generate a trajectory in dynamic environment. Then, Bezier curve is employed to optimize the initial trajectory making motors run smoothly. To validate the proposed improved APF method, kinematic simulations are carried out. The results demonstrate the trajectory generated by improved APF can avoid obstacles in different motion states smoothly.

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.

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.

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.