Autonomous underwater vehicle optimal path planning method for seabed terrain matching navigation

2017 ◽  
Vol 133 ◽  
pp. 107-115 ◽  
Author(s):  
Ye Li ◽  
Teng Ma ◽  
Pengyun Chen ◽  
Yanqing Jiang ◽  
Rupeng Wang ◽  
...  
Author(s):  
Zhe Zhang ◽  
Jian Wu ◽  
Jiyang Dai ◽  
Cheng He

For stealth unmanned aerial vehicles (UAVs), path security and search efficiency of penetration paths are the two most important factors in performing missions. This article investigates an optimal penetration path planning method that simultaneously considers the principles of kinematics, the dynamic radar cross-section of stealth UAVs, and the network radar system. By introducing the radar threat estimation function and a 3D bidirectional sector multilayer variable step search strategy into the conventional A-Star algorithm, a modified A-Star algorithm was proposed which aims to satisfy waypoint accuracy and the algorithm searching efficiency. Next, using the proposed penetration path planning method, new waypoints were selected simultaneously which satisfy the attitude angle constraints and rank-K fusion criterion of the radar system. Furthermore, for comparative analysis of different algorithms, the conventional A-Star algorithm, bidirectional multilayer A-Star algorithm, and modified A-Star algorithm were utilized to settle the penetration path problem that UAVs experience under various threat scenarios. Finally, the simulation results indicate that the paths obtained by employing the modified algorithm have optimal path costs and higher safety in a 3D complex network radar environment, which show the effectiveness of the proposed path planning scheme.


Author(s):  
Mansour Ataei ◽  
Aghil Yousefi-Koma ◽  
Masoud Shariat Panahi

In this paper an optimal 3-D path is generated offline for a Biomimetic Underwater Vehicle (BUV). The BUV swims forward by oscillating its body, turns by curving its body and dives by bending its head. The BUV is intended to systematically plan its path having only the initial and final points and the positions and dimensions of the obstacles. The four widely-accepted criteria of the optimal path planning of the BUV are “overall path length”, “margin of safety”, “smoothness of planar motion” and “gradient of dive”. In this study the multi-objective GA algorithm NSGA-II is employed to find a set of Pareto-optimal solutions where each solution represents a path that cannot be outrun by any other path considering all four criteria. The solution set, also called the Pareto front, gives the designer the freedom of choice when it comes to prioritizing various criteria.


2016 ◽  
Vol 11 (4) ◽  
pp. 269-273
Author(s):  
Li Si ◽  
Wang Yuan ◽  
Li Xinzhong ◽  
Liu Shenyang ◽  
Li Zhen

Sign in / Sign up

Export Citation Format

Share Document