Vehicle Path Planning Research Articles

Unmanned Aerial Vehicle Path-Planning Method Based on Improved P-RRT* Algorithm

This paper proposed an improved potential rapidly exploring random tree star (P-RRT*) algorithm for unmanned aerial vehicles (UAV). The algorithm has faster expansion and convergence speeds and better path quality. Path planning is an important part of the UAV control system. Rapidly exploring random tree (RRT) is a path-planning algorithm that is widely used, including in UAV, and its altered body, P-RRT*, is an asymptotic optimal algorithm with bias sampling. The algorithm converges slowly and has a large random sampling area. To overcome the above drawbacks, we made the following improvements. First, the algorithm used the direction of the artificial potential field (APF) to determine whether to perform greedy expansion, increasing the search efficiency. Second, as the random tree obtained the initial path and updated the path cost, the algorithm rejected high-cost nodes and sampling points based on the heuristic cost and current path cost to speed up the convergence rate. Then, the random tree was pruned to remove the redundant nodes in the path. The simulation results demonstrated that the proposed algorithm could significantly decrease the path cost and inflection points, speed up initial path obtaining and convergence, and is suitable for the path planning of UAVs.

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.

Robust Q‐learning‐based multi‐objective sheep flock optimizer with a Cauchy operator for effective path planning in unmanned aerial vehicles

SummaryUnmanned aerial vehicle (UAV) path planning can be treated as a nondeterministic polynomial (NP) hard concern or an optimization problem. The conventional approaches are unable to effectively handle these issues due to discontinuity, non‐linearity, multi‐modality, and inseparability. On the other hand, meta‐heuristic algorithms are effective at tackling these issues because they are simple, adaptable, and derivation free. To enhance the performance in a variety of challenging circumstances, this paper proposes a novel Q‐learning‐based multi‐objective sheep flock optimizer with a Cauchy operator (Q‐MOSFO‐CA) to solve the constrained UAV path planning issues. The multi‐objective functions considered here are costs and constraints (threat, terrain, turning, climbing, and gliding constraints) to determine the feasible and optimal path. To avoid the probability of falling into the local optimum and to address the shortcoming of unbalanced convergence and also to maintain the exploitation and exploration capability, the Cauchy operator (CA) is integrated with the sheep flock optimization (SFO) algorithm. The Q‐learning model is introduced to balance both the global and local searches. Here, the exploration model performs the global search whereas the exploitation model performs the local search to attain an optimal solution. In the simulation scenario, the statistical analysis is conducted under two scenarios, and some essential measures such as the number of iterations at convergence (NIC), evaluation time (ET), energy consumption, and convergence analysis are determined. The proposed method obtains NIC of 1305 and 1436, ET of 12.8 and 15.2 s, and energy consumption of 20,600 and 21,465 J for both Scenarios 1 and 2, respectively.

Multi-UAV Data Collection and Path Planning Method for Large-Scale Terminal Access.

In the context of the relentless evolution of network and communication technologies, the need for enhanced communication content and quality continues to escalate. Addressing the demands of data collection from the abundance of terminals within Internet of Things (IoT) scenarios, this paper presents an advanced approach to multi-Unmanned Aerial Vehicle (UAV) data collection and path planning tailored for extensive terminal accessibility. This paper focuses on optimizing the complex interplay between task completion time and task volume equilibrium. To this end, a novel strategy is devised that integrates sensor area partitioning and flight trajectory planning for multiple UAVs, forming an optimization framework geared towards minimizing task completion duration. The core idea of this work involves designing an innovative k-means algorithm capable of balancing data quantities within each cluster, thereby achieving balanced sensor node partitioning based on data volume. Then, the UAV flight trajectory paths are discretely modeled, and a grouped, improved genetic algorithm is used to solve the Multiple Traveling Salesman Problem (MTSP). The algorithm introduces a 2-opt optimization operator to improve the computational efficiency of the genetic algorithm. Empirical validation through comprehensive simulations clearly underscores the efficacy of the proposed approach. In particular, the method demonstrates a remarkable capacity to rectify the historical issue of diverse task volumes among multiple UAVs, all the while significantly reducing task completion times. Moreover, its convergence rate substantially outperforms that of the conventional genetic algorithm, attesting to its computational efficiency. This paper contributes an innovative and efficient paradigm to improve the problem of data collection from IoT terminals through the use of multiple UAVs. As a result, it not only augments the efficiency and balance of task distribution but also showcases the potential of tailored algorithm solutions for realizing optimal outcomes in complex engineering scenarios.

Hybrid Layer of Improved Interfered Fluid Dynamic System and Nonlinear Model Predictive Control for Navigation and Control of Autonomous Underwater Vehicles

This study introduces a hybrid control structure called Improved Interfered Fluid Dynamic System Nonlinear Model Predictive Control (IIFDS-NMPC) for the path planning and trajectory tracking of autonomous underwater vehicles (AUVs). The system consists of two layers; the upper layer utilizes the Improved Interfered Fluid Dynamic System (IIFDS) for path planning, while the lower layer employs Nonlinear Model Predictive Control (NMPC) for trajectory tracking. Extensive simulation experiments are conducted to determine optimal parameters for both static and dynamic obstacle scenarios. Additionally, real-world testing is performed using the BlueRov2 platform, incorporating multiple dynamic and static obstacles. The proposed approach achieves real-time control at a frequency of 100 Hz and exhibits impressive path tracking accuracy, with a root mean square (RMS) of 0.02 m. This research provides a valuable framework for navigation and control in practical applications.

Backup Plan Constrained Model Predictive Control with Guaranteed Stability

This paper proposes and evaluates a new safety concept called backup plan safety for path planning of autonomous vehicles under mission uncertainty using model predictive control (MPC). Backup plan safety is defined as the ability to complete an alternative mission when the primary mission is aborted. To include this new safety concept in control problems, we formulate a feasibility maximization problem aiming to maximize the feasibility of the primary and alternative missions. The feasibility maximization problem is based on multi-objective MPC, where each objective (cost function) is associated with a different mission and balanced by a weight vector. Furthermore, the feasibility maximization problem incorporates additional control input horizons toward the alternative missions on top of the control input horizon toward the primary mission, denoted as multihorizon inputs, to evaluate the cost for each mission. We develop the backup plan constrained MPC algorithm, which designs the weight vector that ensures asymptotic stability of the closed-loop system, and generates the optimal control input by solving the feasibility maximization problem with computational efficiency. The performance of the proposed algorithm is validated through simulations of an unmanned aerial vehicle path planning problem.

Percentile-Based Adaptive Immune Plasma Algorithm and Its Application to Engineering Optimization.

The immune plasma algorithm (IP algorithm or IPA) is one of the most recent meta-heuristic techniques and models the fundamental steps of immune or convalescent plasma treatment, attracting researchers' attention once more with the COVID-19 pandemic. The IP algorithm determines the number of donors and the number of receivers when two specific control parameters are initialized and protects their values until the end of termination. However, determining which values are appropriate for the control parameters by adjusting the number of donors and receivers and guessing how they interact with each other are difficult tasks. In this study, we attempted to determine the number of plasma donors and receivers with an improved mechanism that depended on dividing the whole population into two sub-populations using a statistical measure known as the percentile and then a novel variant of the IPA called the percentile IPA (pIPA) was introduced. To investigate the performance of the pIPA, 22 numerical benchmark problems were solved by assigning different values to the control parameters of the algorithm. Moreover, two complex engineering problems, one of which required the filtering of noise from the recorded signal and the other the path planning of an unmanned aerial vehicle, were solved by the pIPA. Experimental studies showed that the percentile-based donor-receiver selection mechanism significantly contributed to the solving capabilities of the pIPA and helped it outperform well-known and state-of-art meta-heuristic algorithms.

Research on unmanned vehicle obstacle avoidance technology based on LIDAR and depth camera fusion

Abstract To address the problems of poor accuracy of traditional EKF algorithm in estimating the position of unmanned vehicles and the deficiencies in accuracy and map completeness of the traditional map building method with single-line LiDAR, this paper proposes a method to create fused raster maps realized with multi-source data. Firstly, the combined data of the inertial measurement unit and wheel encoder are corrected by adding the positional information output from the visual odometer using the error-state SLAM algorithm, and the local raster constructed by LiDAR and depth camera is fused frame by frame using the idea of Bayesian estimation to finally generate the fused global map. Then, a four-wheeled mobile unmanned vehicle with a LiDAR sensor and depth camera is selected as the experimental object, and dynamic environment avoidance simulation experiments are conducted to draw conclusions. The simulation experiment results show that when γ = 5.99, the algorithm generates a new local target point p g 2 (17.49, 13.49) and the corresponding getaway path and finally guides the unmanned vehicle to the specified target point, verifying that the method in this paper can achieve the avoidance capability of the unmanned vehicle in the process of getting away from the newly emerged obstacles. This study uses the scanned data of LiDAR for the estimation of the real-time position of the unmanned vehicle to realize obstacle avoidance and path planning of the unmanned vehicle.

Local Path Planning for Nonholonomic Mobile Robots Based on Planar G2 Pythagorean Hodograph Degree 7 Bezier Transition Curves

The paper proposes a method that joins two line segments using planar Pythagorean hodograph (PH) degree 7 Bezier transition curves. The objective is to make use of such curvature-continuous curves for the path planning of nonholonomic constrained vehicles moving in 2D space, which requires designing a smooth path while satisfying the constraint of minimum turning radius. We initially present a novel idea that employs PH degree 7 Bezier transition curves for dealing with curvature constraints, the result of which proves to be better than the traditional method based on the “forward simulation”. The properties of PH degree 7 Bezier transition curves are then fully analyzed showing that the curves can be determined by a minimum of three parameters, each of which has an intuitive geometric meaning. The paper also proposes a path planner with direct curvature constraints during the process of path generation in 2D space. The objective function of the optimal path generation can be adjusted to minimize the length of the whole path or to closely follow the original global nonsmooth sequences of line segments. Here, the optimization problem is tactfully converted to a linear programming problem that can be solved efficiently. Finally, we use a kinematic bicycle model for simulation and compare the results with those from Dubins path showing that a [Formula: see text] curve is easier to follow than a [Formula: see text] one.

Reinforcement Q-Learning for Path Planning of Unmanned Aerial Vehicles (UAVs) in Unknown Environments

Reinforcement Q-Learning for Path Planning of Unmanned Aerial Vehicles (UAVs) in Unknown Environments

Path Planning of Deep-Sea Landing Vehicle Based on the Safety Energy-Dynamic Window Approach Algorithm

To ensure the safety and energy efficiency of autonomous sampling operations for a deep-sea landing vehicle (DSLV), the Safety Energy-Dynamic Window Approach (SE-DWA) algorithm was proposed. The safety assessment sub-function formed from the warning obstacle zone and safety factor addresses the safety issue arising from the excessive range measurement error of forward-looking sonar. The trajectory comparison evaluation sub-function with the effect of reducing energy consumption achieves a reduction in path length by causing the predicted trajectory to deviate from the historical trajectory when encountering “U”-shaped obstacles. The pseudo-power evaluation sub-function with further energy consumption reduction ensures optimal linear and angular velocities by minimizing variables when encountering unknown obstacles. The simulation results demonstrate that compared with the Minimum Energy Consumption-DWA algorithm, the SE-DWA algorithm improves the minimum distance to an actual obstacle zone by 68% while reducing energy consumption by 11%. Both the SE-DWA algorithm and the Maximum Safety-DWA (MS-DWA) algorithm ensure operational safety with minimal distance to the actual obstacle zone, yet the SE-DWA algorithm achieves a 24% decrease in energy consumption. In conclusion, the path planned by the SE-DWA algorithm ensures not only safety but also energy consumption reduction during autonomous sampling operations by a DSLV in the deep sea.

An Obstacle Avoidance Path Planning and Evaluation Method for Intelligent Vehicles Based on the B-Spline Algorithm.

To meet the real-time path planning requirements of intelligent vehicles in dynamic traffic scenarios, a path planning and evaluation method is proposed in this paper. Firstly, based on the B-spline algorithm and four-stage lane-changing theory, an obstacle avoidance path planning algorithm framework is constructed. Then, to obtain the optimal real-time path, a comprehensive real-time path evaluation mechanism that includes path safety, smoothness, and comfort is established. Finally, to verify the proposed approach, co-simulation and real vehicle testing are conducted. In the dynamic obstacle avoidance scenario simulation, the lateral acceleration, yaw angle, yaw rate, and roll angle fluctuation ranges of the ego-vehicle are ±2.39 m/s2, ±13.31°, ±13.26°/s, and ±0.938°, respectively. The results show that the proposed algorithm can generate real-time, available obstacle avoidance paths. And the proposed evaluation mechanism can find the optimal path for the current scenario.

Research on obstacle avoidance optimization and path planning of autonomous vehicles based on attention mechanism combined with multimodal information decision-making thoughts of robots.

With the development of machine perception and multimodal information decision-making techniques, autonomous driving technology has become a crucial area of advancement in the transportation industry. The optimization of vehicle navigation, path planning, and obstacle avoidance tasks is of paramount importance. In this study, we explore the use of attention mechanisms in a end-to-end architecture for optimizing obstacle avoidance and path planning in autonomous driving vehicles. We position our research within the broader context of robotics, emphasizing the fusion of information and decision-making capabilities. The introduction of attention mechanisms enables vehicles to perceive the environment more accurately by focusing on important information and making informed decisions in complex scenarios. By inputting multimodal information, such as images and LiDAR data, into the attention mechanism module, the system can automatically learn and weigh crucial environmental features, thereby placing greater emphasis on key information during obstacle avoidance decisions. Additionally, we leverage the end-to-end architecture and draw from classical theories and algorithms in the field of robotics to enhance the perception and decision-making abilities of autonomous driving vehicles. Furthermore, we address the optimization of path planning using attention mechanisms. We transform the vehicle's navigation task into a sequential decision-making problem and employ LSTM (Long Short-Term Memory) models to handle dynamic navigation in varying environments. By applying attention mechanisms to weigh key points along the navigation path, the vehicle can flexibly select the optimal route and dynamically adjust it based on real-time conditions. Finally, we conducted extensive experimental evaluations and software experiments on the proposed end-to-end architecture on real road datasets. The method effectively avoids obstacles, adheres to traffic rules, and achieves stable, safe, and efficient autonomous driving in diverse road scenarios. This research provides an effective solution for optimizing obstacle avoidance and path planning in the field of autonomous driving. Moreover, it contributes to the advancement and practical applications of multimodal information fusion in navigation, localization, and human-robot interaction.

Planning and tracking control of full drive-by-wire electric vehicles in unstructured scenario

Full drive-by-wire electric vehicles (FDWEV) equipped with X-by-wire technology can enable independent driving, braking, and steering of each wheel, making them an ideal platform for developing autonomous driving technology. However, designing a robust control algorithm that comprehensively integrates vehicle path planning in a complex and unstructured scenario is a challenging task for FDWEV. To address this issue, this paper (1) proposes the artificial potential field (APF) method for path planning in the prescribed park with different static obstacles to generate the reference path information, where speed planning is incorporated considering kinematics and dynamic constraints; (2) designs curvature calculation (CC-based) and model predictive control (MPC-based) tracking methods with the lateral dynamics model to track the desired path under different driving conditions, in which a forward-looking behavior model of the driver with variable preview distance is designed based on the fuzzy control theory; (3) conducts CarSim-AMESim-Simulink co-simulation with the existence of obstacles. The simulation results show that the proposed two control approaches are practical for classical driving scenarios. Especially the MPC-based path-tracking controller enhances dynamic tracking performance and ensures good maneuverability under high-dynamic driving conditions.

Research on Path Planning and Path Tracking Control of Autonomous Vehicles Based on Improved APF and SMC.

Path planning and tracking control is an essential part of autonomous vehicle research. In terms of path planning, the artificial potential field (APF) algorithm has attracted much attention due to its completeness. However, it has many limitations, such as local minima, unreachable targets, and inadequate safety. This study proposes an improved APF algorithm that addresses these issues. Firstly, a repulsion field action area is designed to consider the velocity of the nearest obstacle. Secondly, a road repulsion field is introduced to ensure the safety of the vehicle while driving. Thirdly, the distance factor between the target point and the virtual sub-target point is established to facilitate smooth driving and parking. Fourthly, a velocity repulsion field is created to avoid collisions. Finally, these repulsive fields are merged to derive a new formula, which facilitates the planning of a route that aligns with the structured road. After path planning, a cubic B-spline path optimization method is proposed to optimize the path obtained using the improved APF algorithm. In terms of path tracking, an improved sliding mode controller is designed. This controller integrates lateral and heading errors, improves the sliding mode function, and enhances the accuracy of path tracking. The MATLAB platform is used to verify the effectiveness of the improved APF algorithm. The results demonstrate that it effectively plans a path that considers car kinematics, resulting in smaller and more continuous heading angles and curvatures compared with general APF planning. In a tracking control experiment conducted on the Carsim-Simulink platform, the lateral error of the vehicle is controlled within 0.06 m at both high and low speeds, and the yaw angle error is controlled within 0.3 rad. These results validate the traceability of the improved APF method proposed in this study and the high tracking accuracy of the controller.

Three-Dimensional Path Planning of Deep-Sea Mining Vehicle Based on Improved Particle Swarm Optimization

Three-dimensional path planning is instrumental in path decision making and obstacle avoidance for deep-sea mining vehicles (DSMV). However, conventional particle swarm algorithms have been prone to trapping in local optima and have slow convergence rates when applied to underwater robot path planning. In order to secure a safe and economical three-dimensional path for the DSMV from the mining area to the storage base in connection with innovative mining system, this paper proposes a multi-objective optimization algorithm based on improved particle swarm optimization (IPSO) path planning. Firstly, we construct an unstructured seabed mining area terrain model with hazardous obstacles. Consequently, by considering optimization objectives such as the path length, terrain undulation, comprehensive energy consumption, and crawler slippage rate, we convert the path planning problem into a multi-objective optimization problem, constructing a multi-objective optimization mathematical model. Following that, we propose an IPSO algorithm to tackle the multi-objective non-linear optimization problem, which enables global optimization for DSMV path planning. Finally, we conduct a comprehensive set of experiments using the MATLAB simulation platform and compare the proposed method with existing advanced methods. Experimental results indicate that the path planned by the IPSO exhibits superior performance in terms of path length, terrain undulation, energy consumption, and safety.

An Automated Guided Vehicle Path Planning Algorithm Based on Improved A* and Dynamic Window Approach Fusion

Aimed at the problems of low search efficiency of the A* algorithm in global path planning, not considering the size of AGV and too many turns, and the DWA algorithm easily falling into local optimization, an AGV path planning algorithm based on improved A* and DWA fusion is proposed. To begin, the obstacle rate coefficient is added to the A* algorithm’s evaluation function to build an adaptive cost function; the search efficiency and path safety are increased by improving the search mode; by extracting key nodes, a global path containing only the starting point, key nodes, and endpoints is obtained. The DWA algorithm’s evaluation function is then optimized and the starting azimuth is optimized based on information from the first key node. The experimental results show that in a static environment, compared with the traditional A* algorithm and the improved A* algorithm, the path length is reduced by 1.3% and 5.6%, respectively, and the turning times are reduced by 62.5% and 70%, respectively; compared with the improved ant colony algorithm in the literature, the turning angle is reduced by 29%. In the dynamic environment, the running time of this fusion algorithm is reduced by 12.6% compared with the other hybrid algorithms.

A novel vehicle path planning method for freight enterprises considering environmental regulation

In the paper of vehicle path planning, it is necessary to factor in both governmental regulation policies and enterprise regulation investments. In this paper, a novel method for vehicle path planning is investigated, which incorporates environmental regulation to determine the transportation path, driver, and vehicle type in a joint manner. The mathematical formulation of the investment decisions related to internal self-regulation is provided, considering four external regulation policies. To address the challenges posed by the multidimensional, discrete, and non-linearity model, an improved dynamic disaster genetic algorithm with elite strategy (ED-GA) is proposed. The numerical results demonstrate the effectiveness of the ED-GA in solving large-scale path planning problems, considering both effectiveness and running time. Moreover, this paper analyzes the variations in internal environmental regulation and external environmental regulation, elucidating the impact of different degrees of internal regulation and exploring the applicability of various external regulations. The proposed method is particularly relevant for freight enterprises that possess their own vehicles and are committed to investing in emission reduction. It offers valuable guidance for decision-making and management in low carbon vehicle path planning.

Multi-UAV Coverage Path Planning: A Distributed Online Cooperation Method

Coverage path planning (CPP) for unmanned aerial vehicles (UAVs) plays a significant role in intelligent distributed surveillance systems. However, due to poor cooperation, most existing CPP methods may cause strongly overlapped trajectories, missing areas, or even collisions in uncertain and complex environments, leading to long task completion time and low coverage efficiency. To this end, in this paper we propose a novel multi-UAV distributed online cooperation (MDOC) CPP method that aims to minimize task completion time. Moreover, this method allows UAVs to quickly respond to unknown obstacles and complex emergencies, such as UAV breakdown or communication interruption. To establish close cooperation between UAVs, we propose an efficient environmental information map (EI-map) fusion technique that enables them to obtain global exploration in real-time in a cooperative manner. Then we innovatively develop a distributed cooperative deep Q-learning (DCDQN) algorithm to obtain UAVs' coverage paths online that are determined by minimizing task time and avoiding overlaps, missing areas, and collisions. Specifically, attributing to the fused EI-map, we expand the state space of DCDQN to collect sufficient observations and design a novel cooperative learning pattern to efficiently plan the path for global optimization. Simulation results show that our method outperforms the state-of-the-art in task completion time and coverage efficiency, especially in uncertain and complex environments. In addition, we validate that our method can efficiently complete full coverage even in emergencies.

Path Planning for Multiple Unmanned Surface Vehicles Using Glasius Bio-Inspired Neural Network With Hungarian Algorithm

In this article, we focus on the cooperative path planning for unmanned surface vehicles (USVs) composed of single-USV path planning and multi-USVs task assignment. First, the Glasius bioinspired neural network (GBNN) is used to calculate the neural activity for the discretized working space of USV, and the ocean current is considered in the definition of neuron connection weight especially. The standard path of single USV for obstacle avoidance between start point and destination can hence be planned. Then, based on the result of neural activity values from GBNN, the cost matrix of the Hungarian algorithm is built and modified for the task assignment among multi-USVs, and the unbalanced problem is well resolved. Consequently, the task points are allocated to USVs and prioritized effectively, and each USV just needs to visit the corresponding task points respectively along the standard paths by GBNN to accomplish the task. Finally, the simulation results demonstrate the feasibility and efficiency of the proposed algorithm.