Pathfinding Research Articles

CPLNS: Cooperative Parallel Large Neighborhood Search for Large-Scale Multi-Agent Path Finding

CPLNS: Cooperative Parallel Large Neighborhood Search for Large-Scale Multi-Agent Path Finding

Research on Complete Coverage Path Planning of Agricultural Robots Based on Markov Chain Improved Genetic Algorithm

Due to the limitations of low coverage, high repetition rate, and slow convergence speed of the basic genetic algorithm (GA) in robot complete coverage path planning, the state transition matrix of the Markov chain is introduced to guide individual mutation based on the genetic mutation path planning algorithm, which can improve the quality of population individuals, enhancing the search ability and convergence speed of the genetic algorithm. The proposed improved genetic algorithm is used for complete coverage path planning simulation analysis in different work areas. The analysis results show that compared to traditional genetic algorithms, the improved genetic algorithm proposed in this paper reduces the average path length by 21.8%, the average number of turns by 6 times, the repetition rate by 83.8%, and the coverage rate by 7.76% in 6 different work areas. The results prove that the proposed improved genetic algorithm is applicable in complete coverage path planning. To verify whether the Markov chain genetic algorithm (MCGA) proposed is suitable for agricultural robot path tracking and operation, it was used to plan the path of an actual land parcel. An automatic navigation robot can track the planned path, which can verify the feasibility of the MCGA proposed.

Dynamic step opposition-based learning sparrow search algorithm for UAV path planning

In this paper, aiming at the problems of large randomness, low convergence accuracy, and easy falling into local optimum in the application of sparrow search algorithm to UAV three-dimensional path planning, a dynamic step opposition-based learning sparrow search algorithm is proposed. The algorithm first uses a good point set in the population initialization phase to improve the quality of the initial solution; secondly, the piecewise dynamic step size is used to optimize the update formula of the discoverer, and the extensive search is carried out in the early stage of the iteration. In the later stage, the known area is mined as much as possible to improve the search accuracy and convergence speed of the algorithm. Then, the crazy operator is integrated to optimize the predator update formula and improve the local search ability. Finally, t-distribution opposition-based learning is used to prevent the algorithm from falling into the local optimum. In this paper, the effectiveness of the improved algorithm is verified by six test functions and applied to the three-dimensional path planning of UAVs. The experimental results show that the proposed algorithm has a faster convergence speed than the traditional algorithm, and the planned path is shorter.

An Improved RRT Path-Planning Algorithm Based on Vehicle Lane-Change Trajectory Data

The Rapidly-exploring Random Tree (RRT) algorithm faces issues in path planning, including low search efficiency, high randomness, and suboptimal path quality. To overcome these issues, this paper proposes an improved RRT planning algorithm based on vehicle lane change trajectory data. This algorithm dynamically adjusts the sampling area based on road environment and trajectory change laws, allowing the random tree to sample within an effective area, thereby improving the algorithm’s sampling efficiency. After determining the sampling area, a sampling point optimization strategy is used to enhance sampling quality, resulting in a smoother and more executable path. Finally, the vehicle is processed in a standardized manner to further improve path safety. Simulation results indicate that, compared to the original RRT algorithm, the improved version reduces nodes, planning time, and path length by 12.77%, 64.79%, and 12.87%, respectively. It also improves path smoothness and more closely aligns with actual lane-change trajectories, demonstrating the effectiveness and executability of the improved algorithm.

A multi-strategy improved sparrow search algorithm for indoor AGV path planning

To address the problems of weak search ability, easily falling into local optimal solutions and poor path quality of sparrow search algorithm in AGV path planning, a multi-strategy improved sparrow search algorithm (MISSA) is proposed in this paper. MISSA improves the global search ability by improving the discoverer position update operator and introducing the sine cosine algorithm; adopts the adaptive number of vigilantes and adaptive adjustment step size to improve the convergence speed; introduces the Levy flight variation strategy to reduce the probability of falling into any local optimal solution; optimizes the boundary handling mechanism to prevent the loss of population diversity at a later stage; finally, uses the large-scale neighborhood search strategy and path smoothing mechanism for path optimization to further improve the path quality. The superiority-seeking ability of MISSA was verified by 12 standard test functions, and then 30 simulation experiments were conducted in grid maps with two specifications of 20×20 and 30×30. The experimental results showed that, by using MISSA, the path length was reduced by 44.1% and 63.1%, the number of turns was reduced by 68.4% and 78.4%, and the risk degree was reduced by 61.3% and 77.2%, which verifies the superiority of MISSA in path planning. Finally, MISSA was ported to the QBot2e mobile robot for physical verification to prove its feasibility in practical applications.

Noisy Dueling Double Deep Q-Network algorithm for autonomous underwater vehicle path planning.

How to improve the success rate of autonomous underwater vehicle (AUV) path planning and reduce travel time as much as possible is a very challenging and crucial problem in the practical applications of AUV in the complex ocean current environment. Traditional reinforcement learning algorithms lack exploration of the environment, and the strategies learned by the agent may not generalize well to other different environments. To address these challenges, we propose a novel AUV path planning algorithm named the Noisy Dueling Double Deep Q-Network (ND3QN) algorithm by modifying the reward function and introducing a noisy network, which generalizes the traditional D3QN algorithm. Compared with the classical algorithm [e.g., Rapidly-exploring Random Trees Star (RRT*), DQN, and D3QN], with simulation experiments conducted in realistic terrain and ocean currents, the proposed ND3QN algorithm demonstrates the outstanding characteristics of a higher success rate of AUV path planning, shorter travel time, and smoother paths.

Improved ant colony algorithm for path planning based on pheromone difference distribution strategy

In view of the problems of blind search in the initial stage, slow convergence speed and easy to fall into local optimum when the traditional ant colony algorithm is used for mobile robot path planning, an improved ant colony algorithm is proposed. Firstly, according to the distance between each node and the line connecting the starting point and the target point, the initial pheromone is unevenly distributed to make it normally distributed, which reduces the blindness of the algorithm search in the initial stage and speeds up the search for the optimal solution; secondly, the volatility factor is improved, and the principle of double volatility factor is adopted to control the volatility of pheromone, which not only reduces the possibility of local optimum but also speeds up the convergence speed; the redundant path is further optimized to make the path better. Simulation results show that the improved ant colony algorithm in this paper converges faster and more stably than the traditional ant colony algorithm and other improved ant colony algorithms.

Dynamic path finding for multi-load agent pickup and delivery problem

Recently, the Multi-Agent Pickup and Delivery (MAPD) problem has attracted widespread attention from both academia and industry. In the MAPD problem, each task has its pickup and delivery locations, and the agent needs to pick this task up from the pickup location and deliver it to its delivery location. Therefore, existing works consider the MAPD problem as the core problem in industrial scenarios, e.g., logistics warehouse. Note that the agents considered in the MAPD problem are single-load agents that complete tasks one by one. However, many commercial companies have deployed agents with multi-load instead of single-load agents to improve efficiency and reduce costs. The agents with multi-load can complete multiple tasks at once, so existing solutions cannot work well with the MAPD problem for multi-agents. To solve this issue, we investigate a novel problem in this paper, namely the Multi-Load Agent Pickup and Delivery (MLAPD) problem, where the agents with multi-load not only need to complete assigned real-time tasks but also need to avoid conflicts with each other and the goal is to minimize the total cost in the warehouse. To address this novel problem, we develop a task assignment to complete the assignments between multi-load agents and online tasks in real-time and a dynamic path finding problem that enables multi-load agents to move along conflict-free paths. Finally, extensive experiments in two different warehouses examine the effectiveness of our solutions.

Online Unmanned Ground Vehicle Path Planning Based on Multi-Attribute Intelligent Reinforcement Learning for Mine Search and Rescue

Aiming to improve the efficiency of the online process in path planning, a novel searching method is proposed based on environmental information analysis. Firstly, a search and rescue (SAR) environmental model and an unmanned ground vehicle (UGV) motion model are established according to the characteristics of a mining environment. Secondly, an online search area path-planning method is proposed based on the gray system theory and the reinforcement learning theory to handle multiple constraints. By adopting the multi-attribute intelligent (MAI) gray decision process, the action selection decision can be dynamically adjusted based on the current environment, ensuring the stable convergence of the model. Finally, experimental verification is conducted in different small-scale mine SAR simulation scenarios. The experimental results show that the proposed search planning method can capture the target in the search area with a smoother convergence effect and a shorter path length than other path-planning algorithms.

Research on AGV Path Planning Based on Improved Directed Weighted Graph Theory and ROS Fusion

This article addresses the common issues of insufficient computing power and path congestion for automated guided vehicles (AGVs) in real-world production environments, as well as the shortcomings of traditional path-planning algorithms that mainly consider the shortest path while ignoring vehicle turning time and stability. We propose a secondary path-planning method based on an improved directed weighted graph theory integrated with an ROS. Firstly, the production environment is modeled in detail to identify the initial position of the AGV. Secondly, the operational area is systematically divided, key nodes are selected and optimized, and a directed weighted graph is constructed with optimized weights. It is integrated with the ROS for path planning, using the Floyd algorithm to find the optimal path. The effectiveness and superiority of this method have been demonstrated through simulation verification and actual AGV operation testing. The path planning strategy and fusion algorithm proposed in this article that comprehensively considers distance and angle steering are simple and practical, effectively reducing production costs for enterprises. This method is suitable for logistics sorting and small transport AGVs with a shorter overall path-planning time, higher stability, and limited computing power, and it has reference significance and practical value.

A survey of 3D Space Path-Planning Methods and Algorithms

Due to their agility, cost-effectiveness, and high maneuverability, Unmanned Aerial Vehicles (UAVs) have attracted considerable attention from researchers and investors alike. Path planning is one of the practical subsets of motion planning for UAVs. It prevents collisions and ensures complete coverage of an area. This study provides a structured review of applicable algorithms and coverage path planning solutions in Three-Dimensional (3D) space, presenting state-of-the-art technologies related to heuristic decomposition approaches for UAVs and the forefront challenges. Additionally, it introduces a comprehensive and novel classification of practical methods and representational techniques for path-planning algorithms. This depends on environmental characteristics and optimal parameters in the real world. The first category presents a classification of semi-accurate decomposition approaches as the most practical decomposition method, along with the data structure of these practices, categorized by phases. The second category illustrates path-planning processes based on symbolic techniques in 3D space. Additionally, it provides a critical analysis of crucial influential approaches based on their importance in path quality and researchers’ attention, highlighting their limitations and research gaps. Furthermore, it will provide the most pertinent recommendations for future work for researchers. The studies demonstrate an apparent inclination among experimenters toward using the semi-accurate cellular decomposition approach to improve 3D path planning.

A Path Planning and Tracking Control Algorithm for Multi-Autonomous Mobile Robot Systems Based on Spatiotemporal Conflicts and Nonholonomic Constraints

A Path Planning and Tracking Control Algorithm for Multi-Autonomous Mobile Robot Systems Based on Spatiotemporal Conflicts and Nonholonomic Constraints

A Novel Energy-Aware Path Planning by Autonomous Underwater Vehicle in Underwater Wireless Sensor Networks

Wireless sensor networks can monitor the environment to detect anomalies and reduce the risk of maritime traffic. Energy is necessary for low-power conditions where wireless sensor networks are used. Ensuring the lifespan of energy constraints and providing continuous environmental observation, data collecting, and communication requires management. Battery replacement and energy consumption issues can be resolved with path planning and energy-efficient autonomous underwater vehicle charging for sensor nodes. The nearest neighbour technique is used in this study to solve the energy-aware path planning problem of an autonomous underwater vehicle. Path planning simulations show that the nearest neighbour strategy converges faster and produces a better result than the genetic algorithm. We develop robust and energy-efficient path-planning algorithms that efficiently acquire sensor data while consuming less energy, allowing the monitoring system to respond to anomalies more rapidly. Increased sensor connectivity lowers energy usage and increases network longevity. This study also considers the situation when it is recommended to avoid taking direct travel paths between particular node pairs for a variety of reasons. This recommendation is considered in this study. We present a strategy based on a modified Nearest Neighbour-based Approach from the Nearest Neighbour method to address this more challenging scenario. The direct pathways between such nodes are constrained within the context of this technique. The modified version of Nearest Neighbor-based approach performs well even in that particular situation.

A path planning method based on deep reinforcement learning for AUV in complex marine environment

The potential of autonomous underwater vehicle (AUV) on future applications is significant due to advancements in autonomy and intelligence. Path planning is a critical technology for AUV to perform operational missions in complex marine environments. To this end, this paper proposes a path planning method for AUV based on deep reinforcement learning. Initially, considering actual requirements, a complex marine environment model containing underwater terrain, sonobuoy detection, and ocean currents is established. Subsequently, the corresponding state space, action space, and reward function are formulated. Furthermore, to address the inherent limitations of existing deep reinforcement learning algorithms in terms of training efficiency, a mixed experience replay (MER) strategy is proposed. This strategy aims to enhance the efficiency of sample learning by integrating prior knowledge and exploration experience. Lastly, a novel HMER-SAC algorithm for AUV path planning is proposed by integrating the Soft Actor–Critic (SAC) algorithm with the hierarchical reinforcement learning strategy and the MER strategy. The results of the simulation and experiment demonstrate that the method is capable of efficiently planning executable paths in complex marine environments and exhibits superior training efficiency, stability, and performance.

Overview of Path Planning Algorithms

Background: Path-planning algorithms are widely used in robotics, vehicles, UAVs, carrier-based aircraft towing vehicles, etc. Using these algorithms, an optimal path with safe obstacle avoidance and high efficiency can be planned. In recent years, path-planning algorithms have received more and more attention from scholars at home and abroad. Objective: In order to promote the application and development of path-planning algorithms, an in-depth analysis of the current development status of path-planning algorithms was presented. The most widely used and representative algorithms in several representative results were extracted, and the characteristics and advantages and disadvantages of each algorithm were analyzed and elaborated in detail for the readers' reference. Methods: The existing path-planning algorithms were classified, and a brief overview of each traditional algorithm was given, followed by an in-depth study of the improved algorithms to summarize the advantages and disadvantages of each type of algorithm. Finally, based on these research results, the future development trend of path-planning algorithms was projected. Results: Through the research and analysis of the path-planning algorithm, it was found that the path- planning algorithm before the improvement had the problems of an unsmooth path, low computational efficiency, a slow response time, the inability to safely avoid obstacles, etc. After the improvement and optimization of the path-planning algorithm, the performance was greatly improved. Conclusion: After research and analysis, it was found that multi-algorithm fusion had great potential for development in path-planning compared to the application and optimization of a single algorithm. In addition, further research is needed in the areas of algorithm adaptability, fusion, intelligent algorithms, and extending the range of algorithmic applications.

Global path planning of unmanned ship island region based on improved A* algorithm

Abstract To solve the path planning problem for unmanned boats in island and reef areas, this paper introduces an adaptive heuristic function specifically for island and reef areas based on the traditional A* algorithm, in order to effectively handle the obstacle avoidance problem. A new cost function is designed to balance the relationship between path length and safety. The sea chart is converted into a path planning map by using the grid method, and the path planning is carried out. The paper compares the performance of the new path-planning algorithm with other path-planning algorithms through experiments, and the improved A* algorithm for global path planning of unmanned boats in island and reef areas shows excellent performance in various complex environments, effectively improving the island and reef area navigation efficiency.

Evolution of Unmanned Surface Vehicle Path Planning: A Comprehensive Review of Basic, Responsive, and Advanced Strategic Pathfinders

Unmanned Surface Vehicles (USVs) are rapidly becoming mission-indispensable for a variety of naval operations, from search and rescue to environmental monitoring and surveillance. Path planning lies at the heart of the operational effectiveness of USVs, since it represents the key technology required to enable the vehicle to transit the unpredictable dynamics of the marine environment in an efficient and safe way. The paper develops a critical review of the most recent advances in USV path planning and a novel classification of algorithms according to operational complexity: Basic Pathfinders, Responsive Pathfinders, and Advanced Strategic Pathfinders. Each category can adapt to different requirements, from environmental predictability to the desired degree of human intervention, and from stable and controlled environments to highly dynamic and unpredictable conditions. The review includes current methodologies and points out the state-of-the-art algorithmic approaches in their experimental validations and real-time applications. Particular attention is paid to the description of experimental setups and navigational scenarios showing the realistic impact of these technologies. Moreover, this paper goes through the key, open challenges in the field and hints at the research direction to leverage in order to enhance the robustness and adaptability of path planning algorithms. This paper, by offering a critical analysis of the current state-of-the-art, lays down the foundation of future USV path planning algorithms.

UAV path planning based on improved dung beetle algorithm with multiple strategy integration

This research presents a multi-strategy augmented dung beetle algorithm (CDBO) for UAV path planning in intricate 3D environments. Its main objective is to address the path planning challenge by formulating an integrated cost function model and environment representation that aligns the optimisation task with the navigation prerequisites and safety constraints of the UAV. Firstly, the algorithm initialises the particle population based on the Lévy flight principle to improve the species diversity and adequately search the solution space. Subsequently, an exponentially decreasing inertia weighting strategy is introduced to improve the convergence speed of the algorithm. In addition, the algorithm uses an adaptive [Formula: see text]-distribution with perturbed variation of the updated positions so that the algorithm avoids falling into a local optimum. Finally, to enhance the robustness of the system, the algorithm incorporates an elite retention strategy based on the Pareto principle. In this study, rigorous tests using 12 CEC2022 test functions and Wilcoxon rank sum test are conducted as benchmarks for the performance of the algorithm. The results show that the enhanced dung beetle algorithm outperforms the traditional algorithm, highlighting its efficiency and robustness. In addition, the efficacy of the enhanced dung beetle algorithm was validated in a variety of complex 3D environments, affirming its ability to generate optimal paths. This study further highlights the importance of effective algorithms in UAV path planning, addressing the key issue of optimising flight operations in intricate spatial scenarios.

Dynamic Scene Representation for Docking in Urban Waters Using a Stereo Camera

Abstract To navigate and dock safely in urban waters, an autonomous ferry must assess its safe navigation paths by identifying navigable free space and potential obstacles. A deep understanding of its surroundings is crucial for situational awareness. Knowing which objects are static and dynamic is an indispensable ingredient for path planning algorithms and collision avoidance systems, and is especially useful for docking operations, as moving obstacles can interfere with the optimal path to the dock. To handle all types of obstacles, we present a novel dynamic scene representation for docking in urban waters using a short baseline stereo camera. Obstacles protruding from the water surface are represented with vertically oriented rectangles, known as stixels. The stixels are tracked over consecutive frames with dense optical flow. Together with stereo correspondences, their 3D motion is estimated. Stixels representing the same object are grouped together into line segments which are classified as either dynamic or static based on the motion of its associated stixels. Our dynamic representation presents objects in the 3D camera coordinate system as a bird’s eye view map. Additionally, stereo depth uncertainty can significantly impact depth estimates and is considered using a Kalman filter, providing smooth position and velocity estimates. We test our dynamic scene representation on a real docking scenario recorded with an autonomous ferry using a stereo camera. We evaluate the accuracy of the reconstructed 3D scene points and the velocity estimates of the dynamic objects using LiDAR and GNSS.

Crowd Perception Communication-Based Multi- Agent Path Finding With Imitation Learning

Crowd Perception Communication-Based Multi- Agent Path Finding With Imitation Learning