Evaluation of Collision Avoidance path planning Algorithm

Author(s):  
Liyana Adilla Burhanuddin ◽  
Md. Nazrul Islam ◽  
Suhaila Mohd Yusof
Author(s):  
Rouhollah Jafari ◽  
Shuqing Zeng ◽  
Nikolai Moshchuk

In this paper, a collision avoidance system is proposed to steer away from a leading target vehicle and other surrounding obstacles. A virtual target lane is generated based on an object map resulted from perception module. The virtual target lane is used by a path planning algorithm for an evasive steering maneuver. A geometric method which is computationally fast for real-time implementations is employed. The algorithm is tested in real-time and the simulation results suggest the effectiveness of the system in avoiding collision with not only the leading target vehicle but also other surrounding obstacles.


2021 ◽  
Vol 11 (9) ◽  
pp. 3948
Author(s):  
Aye Aye Maw ◽  
Maxim Tyan ◽  
Tuan Anh Nguyen ◽  
Jae-Woo Lee

Path planning algorithms are of paramount importance in guidance and collision systems to provide trustworthiness and safety for operations of autonomous unmanned aerial vehicles (UAV). Previous works showed different approaches mostly focusing on shortest path discovery without a sufficient consideration on local planning and collision avoidance. In this paper, we propose a hybrid path planning algorithm that uses an anytime graph-based path planning algorithm for global planning and deep reinforcement learning for local planning which applied for a real-time mission planning system of an autonomous UAV. In particular, we aim to achieve a highly autonomous UAV mission planning system that is adaptive to real-world environments consisting of both static and moving obstacles for collision avoidance capabilities. To achieve adaptive behavior for real-world problems, a simulator is required that can imitate real environments for learning. For this reason, the simulator must be sufficiently flexible to allow the UAV to learn about the environment and to adapt to real-world conditions. In our scheme, the UAV first learns about the environment via a simulator, and only then is it applied to the real-world. The proposed system is divided into two main parts: optimal flight path generation and collision avoidance. A hybrid path planning approach is developed by combining a graph-based path planning algorithm with a learning-based algorithm for local planning to allow the UAV to avoid a collision in real time. The global path planning problem is solved in the first stage using a novel anytime incremental search algorithm called improved Anytime Dynamic A* (iADA*). A reinforcement learning method is used to carry out local planning between waypoints, to avoid any obstacles within the environment. The developed hybrid path planning system was investigated and validated in an AirSim environment. A number of different simulations and experiments were performed using AirSim platform in order to demonstrate the effectiveness of the proposed system for an autonomous UAV. This study helps expand the existing research area in designing efficient and safe path planning algorithms for UAVs.


Author(s):  
Nikolai Moshchuk ◽  
Shih-Ken Chen ◽  
Chad Zagorski ◽  
Amy Chatterjee

This paper summarizes the development of an optimal path planning algorithm for collision avoidance maneuver. The goal of the optimal path is to minimize distance to the target vehicle ahead of the host vehicle subject to vehicle and environment constraints. Such path constrained by allowable lateral (centripetal) acceleration and lateral acceleration rate (jerk). Two algorithms with and without lateral jerk limitation, are presented. The algorithms were implemented in Simulink and verified in CarSim. The results indicate that the lateral jerk limitation increases time-to-collision threshold and leads to a larger distance to the target required for emergency lane change. Collision avoidance path without lateral jerk limitation minimizes the distance to the target vehicle and is suitable for path tracking control in real-time application; however tracking such a path requires very aggressive control.


Author(s):  
Peng Hang ◽  
Sunan Huang ◽  
Xinbo Chen ◽  
Kok Kiong Tan

In addition to the safety of collision avoidance, the safety of lateral stability is another critical issue for unmanned ground vehicles in the high-speed condition. This article presents an integrated path planning algorithm for unmanned ground vehicles to address the aforementioned two issues. Since visibility graph method is a very practical and effective path planning algorithm, it is used to plan the global collision avoidance path, which can generate the shortest path across the static obstacles from the start point to the final point. To improve the quality of the planned path and avoid uncertain moving obstacles, nonlinear model predictive control is used to optimize the path and conduct second path planning with the consideration of lateral stability. Considering that the moving trajectories of moving obstacles are uncertain, multivariate Gaussian distribution and polynomial fitting are utilized to predict the moving trajectories of moving obstacles. In the collision avoidance algorithm design, a series of constraints are taken into consideration, including the minimum turning radius, safe distance, control constraint, tracking error, etc. Four simulation conditions are carried out to verify the feasibility and accuracy of the comprehensive collision avoidance algorithm. Simulation results indicate that the algorithm can deal with both static and dynamic collision avoidance, and lateral stability.


Sadhana ◽  
2021 ◽  
Vol 46 (3) ◽  
Author(s):  
A Saravanakumar ◽  
A Kaviyarasu ◽  
R Ashly Jasmine

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1339
Author(s):  
Zhenfei Wang ◽  
Chuchu Zhang ◽  
Junfeng Wang ◽  
Zhiyun Zheng ◽  
Lun Li

In recent years, crowded stampede incidents have occurred frequently, resulting in more and more serious losses. The common cause of such incidents is that when large-scale populations gather in a limited area, the population is highly unstable. In emergency situations, only when the crowd reaches the safe exit as soon as possible within a limited evacuation time to complete evacuation can the loss and casualties be effectively reduced. Therefore, the safety evacuation management of people in public places in emergencies has become a hot topic in the field of public security. Based on the analysis of the factors affecting the crowd path selection, this paper proposes an improved path-planning algorithm based on BEME (Balanced Evacuation for Multiple Exits). And pedestrian evacuation simulation is carried out in multi-exit symmetrical facilities. First, this paper optimizes the update method of the GSDL list in the BEME algorithm as the basis for evacuating pedestrians to choose an exit. Second, the collision between pedestrians is solved by defining the movement rule and collision avoidance strategy. Finally, the algorithm is compared with BEME and traditional path-planning algorithms. The results show that the algorithm can further shorten the global evacuation distance of the symmetrical evacuation scene, effectively balance the number of pedestrians at each exit and reduce the evacuation time. In addition, this improved algorithm uses a collision avoidance strategy to solve the collision and congestion problems in path planning, which helps to maximize evacuation efficiency. Whether the setting of the scene or the setting of the exit, all studies are based on symmetric implementation. This is more in line with the crowd evacuation in the real scene, making the experimental results more meaningful.


Sign in / Sign up

Export Citation Format

Share Document