Path Planning Method Research Articles

Proposed Multi-ST Model for Collaborating Multiple Robots in Dynamic Environments

Coverage path planning describes the process of finding an effective path robots can take to traverse a defined dynamic operating environment where there are static (fixed) and dynamic (mobile) obstacles that must be located and avoided in coverage path planning. However, most coverage path planning methods are limited in their ability to effectively manage the coordination of multiple robots operating in concert. In this paper, we propose a novel coverage path planning model (termed Multi-ST) which utilizes the spiral-spanning tree coverage algorithm with intelligent reasoning and knowledge-based methods to achieve optimal coverage, obstacle avoidance, and robot coordination. In experimental testing, we have evaluated the proposed model with a comparative analysis of alternative current approaches under the same conditions. The reported results show that the proposed model enables the avoidance of static and moving obstacles by multiple robots operating in concert in a dynamic operating environment. Moreover, the results demonstrate that the proposed model outperforms existing coverage path planning methods in terms of coverage quality, robustness, scalability, and efficiency. In this paper, the assumptions, limitations, and constraints applicable to this study are set out along with related challenges, open research questions, and proposed directions for future research. We posit that our proposed approach can provide an effective basis upon which multiple robots can operate in concert in a range of ‘real-world’ domains and systems where coverage path planning and the avoidance of static and dynamic obstacles encountered in completing tasks is a systemic requirement.

Research on autonomous obstacle avoidance and automatic obstacle avoidance of minimally invasive surgical robots

Abstract. With the development of modern society, people pay more and more attention to health and safety, especially to the development of medical techniques. The demand for higher medical standards has led to minimally invasive surgery becoming a better choice for patients. Minimally invasive surgeries involve less trauma, lower blood loss, quicker recovery, and a lower risk of infection. However, compared to traditional surgeries, these surgeries demand higher precision and skill from the surgeons, making surgical robots the preferred tool for most minimally invasive operations. Surgical robots can eliminate the surgeon's hand tremors during the operation, enhance the precision of surgical operations, and offer greater flexibility with their small end size inside human organs. Despite these advantages, minimally invasive surgical robots can not avoid obstacles and plan the path of human organs and cavities in real-time. This paper reviews the dynamic path planning and real-time obstacle avoidance of modern minimally invasive surgical robots, including their development progress and research directions. It also introduces in detail the mainstream research methods of path planning and real-time obstacle avoidance in modern research. Finally, the current technical challenges and the prediction of the future research direction are pointed out and the reference suggestions are provided.

Continuous fiber printing path generation based on Euler diagram division

Continuous fiber printed structures are widely used in aerospace applications because of their excellent performance and high design freedom. Existing path planning methods optimize the continuous fiber printing direction by stress lines or discrete angles, but these methods are far from perfect printing paths and lack planning for connectivity relations. In this study, a planning method for continuous fiber printing paths based on constructing Eulerian circuits from a weighted undirected graph is proposed. The principal stress lines are transformed into a weighted undirected graph, which divides the Eulerian subgraph by splitting the common nodes to plan the continuous fiber printing path circuit. Subsequently, the printing structure parameters are optimized based on simulation analysis. The experimental results, taking MBB (Messerschmitt-Bolkow-Blohm) beams as an example, show that the printing path designed in this paper improves the structural strength by 52.9% and the structural stiffness by 81.7% compared with the conventional printing path.

Multi-objective optimization based robotic path planning for interpolation reconstruction model of CT data

Robotic path planning plays a pivotal role in computer-aided liver tumor thermal ablation surgery. However, traditional methods face challenges in terms of low reconstruction efficiency and planning safety. To address these issues, we propose a method for robotic path planning of liver tumor thermal ablation surgery. Firstly, an interlayer interpolation algorithm based on optical flow estimation is utilized to compensate for large interlayer spacing in computed tomography (CT) images by inserting predicted images between sequence images. Secondly, the voxel traversal strategy and patch intersection calculation strategy in the standard marching cube (MC) algorithm is optimized to improve the efficiency of abdominal tissues reconstruction. Finally, comprehensive clinical constraints are summarized to ensure the surgery safety and the strength pareto evolutionary algorithm II (SPEA-II) is leveraged to optimize surgery path, which can obtain even distribution of solutions in high-dimension optimization problems. Extensive experiments conducted on the 3Dircadb and SLIVER07 datasets revealed that our proposed method reduces reconstruction time by 21.5% compared to the standard MC algorithm, while achieving an average overlap rate of 88.25% and an average Hausdorff distance of 15.25 mm between Pareto front points and surgeon's recommended puncture points.

A Review of UAV Path-Planning Algorithms and Obstacle Avoidance Methods for Remote Sensing Applications

The rapid development of uncrewed aerial vehicles (UAVs) has significantly increased their usefulness in various fields, particularly in remote sensing. This paper provides a comprehensive review of UAV path planning, obstacle detection, and avoidance methods, with a focus on its utilisation in both single and multiple UAV platforms. The paper classifies the algorithms into two main categories: (1) global and local path-planning approaches in single UAVs; and (2) multi-UAV path-planning methods. It further analyses obstacle detection and avoidance methods, as well as their capacity to adapt, optimise, and compute efficiently in different operational environments. The outcomes highlight the advantages and limitations of each method, offering valuable information regarding their suitability for remote sensing applications, such as precision agriculture, urban mapping, and ecological surveillance. Additionally, this review also identifies limitations in the existing research, specifically in multi-UAV frameworks, and provides recommendations for future developments to improve the adaptability and effectiveness of UAV operations in dynamic and complex situations.

Integrated automatic parking path planning and trajectory tracking optimization method

Current automatic parking systems often separate path planning and trajectory tracking, increasing complexity and failing to meet the parking needs of autonomous cars. Consequently, this study presents an approach based on Multi-stage Nonlinear Model Predictive Control (MSNMPC) for integrated autonomous parking path planning and trajectory tracking optimization. The method represents the evolution of uncertainty parameters over time through a scenario tree, and the MSNMPC controller with a predictive horizon P defines P + 1 phases, each with specific cost and constraint functions that depend only on the vehicle state and control inputs of that phase to satisfy the constraints of all phases of the parking process. In addition, the method integrates path planning and tracking control into one optimization problem, which is solved online to achieve integrated parking control. Simulation confirms that, in comparison to MPC with RRT* hierarchical control, the integrated parking scheme of MSNMPC has less lateral error and offers superior flexibility and tracking performance. To verify the generality of the scheme, it was validated in the diagonal parking scenario and the vertical parking scenario, respectively. The results show that, compared to the control experiments, the parking elapsed time has been reduced by 10.76% and 9.02%, respectively, enhancing parking efficiency. In addition, the parking error has decreased by 30.77% and 38.46%, respectively, thus improving parking accuracy. Moreover, the minimum safe distance in the control scheme for addressing uncertainty factors is 0.7 m greater than that of the control experiments, meeting the driving requirements for driverless vehicles in parking scenarios.

VNS-BA*: An Improved Bidirectional A* Path Planning Algorithm Based on Variable Neighborhood Search.

The A* algorithm is an effective method for path planning; however, it has certain drawbacks, such as a high number of turns, low planning efficiency, and redundant searches. To address these issues, this paper proposes an improved bidirectional A* global path planning algorithm based on a variable neighborhood search strategy, named VNS-BA*. The new algorithm first employs an 8-11-13 neighborhood search method for node expansion. Then, the bidirectional search strategy is optimized by using the current nodes of the opposite path and the global target point, enabling the two paths to meet in the middle of the map. Finally, redundant turns are removed from the path, and cubic spline interpolation is applied to achieve local smoothing at the turns. The effectiveness of the improved algorithm was validated on different maps and compared with A* and its three derived improved versions. The simulation results indicate that VNS-BA* shows significant improvements in terms of the number of path turns, turn angles, and planning efficiency.

An Improved HBA Method for Path Planning of Substation Inspection Robots

Aiming at the problems of honey badger algorithm (HBA) in the path planning of substation inspection robot, such as long path length, time-consuming search and high obstacle risk rate, an improved HBA algorithm called IHBA is proposed. Firstly, the honey badger population is initialized by reverse learning mechanism to increase its diversity. Secondly, the adaptive weight factor is used to improve the density factor of the HBA, which effectively balances the exploration capacity in different stages and improves the optimization accuracy of the population. Finally, the elite mutation strategy is used to strengthen the honey badgers’ location, which can guide the population to produce offspring in the food source area with better adaptability. To verify the improved effect of the algorithm and its path planning performance, the path planning experiments are designed, which indicate that compared with the BOA, IACO, GFA and classic HBA, the proposed IHBA in this paper has shorter path, higher search efficiency and lower obstacle risk rate, which can not only help the substation inspection robot plan the optimal path globally, but also increase the smoothness of the planned path.

Flexible Path Planning for Multi-Agent Field Observation

This paper proposes a flexible path-planning method for conducting agricultural observation tasks using multiple autonomous guided vehicles. The observation task was formulated as the rural postman problem by graphing the agricultural field to be observed and assigning costs to mandatory and optional paths. The observation area was re-divided according to the progress of each robot’s work, and the latest path was planned to minimize the difference between the working time of individual robots, thereby reducing the overall working time. Simulations were conducted to verify the influence of the parameters used in the proposed method. The effect of workload adjustment on progress delay was verified, and the increase in overall working time owing to delay was reduced by an average of 32.9%. A performance comparison was conducted using Google OR-Tools, software specialized for combinatorial optimization. Superior solutions with shorter computation times were obtained using the proposed method.

Research on Global Off-Road Path Planning Based on Improved A* Algorithm

In field driving activities, off-road areas usually lack existing paths that can be directly driven on by ground vehicles, but their surface environments can still satisfy the planning and passage requirements of some off-road vehicles. Additionally, the existing path planning methods face limitations in complex field environments characterized by undulating terrains and diverse land cover types. Therefore, this study introduces an improved A* algorithm and an adapted 3D model of real field scenes is constructed. A velocity curve is fitted in the evaluation function to reflect the comprehensive influences of different slopes and land cover types on the traffic speed, and the algorithm not only takes the shortest distance as the basis for selecting extension nodes but also considers the minimum traffic speed. The 8-neighborhood search method of the traditional A* algorithm is improved to a dynamic 14-neighborhood search method, which effectively reduces the number of turning points encountered along the path. In addition, corner thresholds and slope thresholds are incorporated into the algorithm to ensure the accessibility of path planning, and some curves and steep slopes are excluded, thus improving the usability and safety of the path. Experimental results show that this algorithm can carry out global path planning in complex field environments, and the planned path has better passability and a faster speed than those of the existing approaches. Compared with those of the traditional A* algorithm, the path planning results of the improved algorithm reduce the path length by 23.30%; the number of turning points is decreased by 33.16%; and the travel time is decreased by 38.92%. This approach is conducive to the smooth progress of various off-road activities and has certain guiding significance for ensuring the efficient and safe operations of vehicles in field environments.

Research on the path planning integrated with multi-steer modes for heavy reconfigurable unit

Heavy reconfigurable units (HRUs) can form the heavy transportation vehicular platform (HTVP) to perform transportation for large equipment, by combining with each other. With all-wheel-independent-steered, the HRU can realize multi-steer modes (MSMs) such as Ackermann steer mode (ASM), diagonal steering mode (DSM), and zero radius steer mode (ZSM). However, with heavy weight and long wheelbase, the HRU’s mobility is poor if it only employs ASM. Therefore, this paper proposes a hierarchical path planning architecture, realizing path planning integrated with the above steer modes. This architecture includes the MSMs behaviors planning layer (upper layer) and smooth path planning layer (low layer). Firstly, this paper innovative proposes the MSM graph-based search algorithm in the upper layer, which extends nodes through graph-based searching on the grid map considering MSMs information. Then, the upper layer generates MSMs nodes sequence considering improved cost function for MSMs. Secondly, smooth path planning methods for the MSMs are respectively applied to the ASM sequence, DSM sequence, and ZSM sequence. Comparative simulations are shown as results based on measured parameters from real HRU. The results from the proposed method have the lowest or one of the lowest time cost compared with pure ASM planner and special steer modes planner used in the simulations. The maximum optimization rate can reach 10% or more.

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.

A Comparative Study on Autonomous Vehicle Local Path Planning Through Model Predictive Control and Frenet Frame Method

<div>In recent years, autonomous vehicles (AVs) have been receiving increasing attention from investors, automakers, and academia due to the envisioned potentials of AVs in enhancing safety, reducing emissions, and improving comfort. The crucial task in AV development boils down to perception and navigation. The research is underway, in both academia and industry, to improve AV’s perception and navigation and reduce the underlying computation and costs. This article proposes a model predictive control (MPC)-based local path-planning method in the Cartesian framework to overcome the long computation time and lack of smoothness of the Frenet method. A new equation is proposed in the MPC cost function to improve the safety in path planning. In this regard, an AV is built based on a 2015 Nissan Leaf S by modifying the drive-by-wire function and installing environment perception sensors and computation units. The custom-made AV then collected data in Norman, Oklahoma, and assisted in the performance evaluation of the two control algorithms in this work. Both straight roads and curved roads are considered in the evaluation. For the purpose of saving costs and raising real-world implementation potential, the vision-only solution is applied in object detection and bird’s-eye-view coordinate data generation. MPC and Frenet coordinate system approaches are independently employed to generate a safe and smooth path for the AV using the collected data. The two methods are compared in terms of smoothness, safety, and computation time. Compared with the Frenet-based method, the proposed MPC method reduces the computation time by 80%, and the path smoothness is significantly improved.</div>

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

Unmanned vehicle off-road path-planning method with comprehensive constraints on multiple environmental factors

ABSTRACT In complex off-road environments, different slopes, slope directions, and land types differently affect unmanned vehicle trafficability. Thus, we propose an unmanned vehicle off-road path-planning method with comprehensive constraints on multiple environmental factors. First, the influence of slope, aspect, and surface-coverage type on unmanned vehicle drivability was quantitatively evaluated, and the slope and land type influence layers were formed. Concurrently, a goal guidance layer was formed using the artificial potential field method. Second, the slope influence, land type influence, and goal guidance layers were used to quantitatively evaluate each grid’s pass cost value. Finally, the traditional A* algorithm, A* algorithm considering the impassable area, A* algorithm with comprehensive constraints, and Dijkstra algorithm with comprehensive constraints were used for path planning. The results show that the path slopes planned by A* algorithm with comprehensive constraints and Dijkstra algorithm with comprehensive constraints were smaller than those planned by A* algorithm and A* algorithm considering the impassable area; particularly, the length of the uphill path was shorter and the stability was better. The relevant research results provide methods and technical guidance for obtaining the shortest length, shortest time, and most stable and passable path in off-road environments.

Optimal Trajectory Planning for Wheeled Robots (OTPWR): A Globally and Dynamically Optimal Trajectory Planning Method for Wheeled Mobile Robots

In recent years, with the widespread application of indoor inspection robots, efficient motion planning has become crucial. Addressing the issue of discontinuous and suboptimal robot trajectories resulting from the independent nature of global and local planning, we propose a novel optimal path-planning method for wheeled mobile robots. This method leverages differential flatness to reduce dimensionality and decouple the problem, achieving globally optimal, collision-free paths in a two-dimensional flat output space through diagonal search and polynomial trajectory optimization. Comparative experiments in a simulated environment demonstrate that the proposed improved path search algorithm reduces search time by 46.6% and decreases the number of visited nodes by 43.1% compared to the original algorithm. This method not only ensures the optimal path and efficient planning but also ensures that the robot’s motion trajectory satisfies the dynamic constraints, verifying the effectiveness of the proposed optimal path planning algorithm for wheeled mobile robots.

Research on Path Planning for Industrial Cleaning Robots in Complex Environments: An Enhanced Immunogenetic Algorithm Approach

As industrial automation advances, cleaning robots in complex environments have demonstrated significant value in enhancing efficiency and reducing labor costs. This paper presents a path planning method based on an improved Immune Genetic Algorithm (IGA) for comprehensive coverage path planning in complex industrial settings. Initially, the Boustrophedon Cellular Decomposition (BCD) method is employed to effectively segment the complex scene, identifying key areas for cleaning tasks. Subsequently, the path planning efficiency and adaptability are enhanced through an optimized genetic algorithm that integrates immune memory, Inver-Over operators, and 3-opt operators to refine the traversal sequence between regions. Moreover, this study incorporates the A* algorithm and the Biologically Inspired Neural Network (BINN) algorithm for efficient inter-regional path transitions and precise intra-regional traversal, respectively. A series of simulation experiments validate the superiority of the proposed algorithm in terms of path length, coverage rate, and computational time. The results demonstrate that this method not only effectively addresses the challenges of path planning in complex industrial environments but also significantly improves cleaning efficiency, offering high practical value and potential for broader application.

Knowledge hierarchy-based dynamic multi-objective optimization method for AUV path planning in cooperative search missions

This study focuses on path planning for Autonomous Underwater Vehicles (AUVs) in underwater cooperative search missions. The complexities of the ocean environment, the uncertainty of target movements, and limited communication capabilities render underwater cooperative search missions dynamic multi-objective optimization challenges. Studies focusing on communication-constrained search strategies still lack reliable metrics for assessing underwater communication quality and do not consider communication dead zones. Addressing these deficiencies, this paper introduces a novel communication optimization strategy utilizing packet error rate as a metric for assessing communication efficacy, complemented by a potential field-based method for navigating out of communication dead zones. To tackle the inherently dynamic nature of cooperative search missions for mobile underwater targets, we propose a dynamic multi-objective optimization algorithm that employs a knowledge hierarchy strategy. This method enhances the NSGA-II algorithm's efficiency by extracting effective gene segments from historical Pareto solution set and generating a new initial population through recombination, hierarchy, and prediction. Distinct from other advanced dynamic multi-objective optimization approaches that are limited to theoretical problems, our approach is directly applicable to practical scenarios. The effectiveness and practicality of the proposed method are validated through a series of simulation experiments considering the impact of underwater acoustic communication. These results demonstrate that this research is not only innovative in theory but also holds significant engineering value and practical prospects in real-world applications.