A time-optimal path planning method for AUV docking under geometrical constraints

Author(s):  
Zeyu Li ◽  
Weidong Liu ◽  
Li'e Gao ◽  
Le Li
Procedia CIRP ◽  
2021 ◽  
Vol 96 ◽  
pp. 324-329
Author(s):  
Frederik Wulle ◽  
Max Richter ◽  
Christoph Hinze ◽  
Alexander Verl

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.


Robotica ◽  
1994 ◽  
Vol 12 (5) ◽  
pp. 401-410 ◽  
Author(s):  
Chia-Ju Wu

SUMMARYIn this paper, a numerical approach is proposed to solve the time-optimal path-planning (TOPP) problem of kinematically redundant manipulators between two end-points. The first step is to transform the TOPP problem into a nonlinear programming problem by an iterative procedure. Then an approach to find the initial feasible solutions of the problem is proposed. Since initial feasible solutions can be found easily, the optimization process of the nonlinear programming problem can be started from different points to find the global minimum. A planar three-link robotic manipulator is used to illustrate the validity of the proposed approach.


2017 ◽  
Vol 133 ◽  
pp. 107-115 ◽  
Author(s):  
Ye Li ◽  
Teng Ma ◽  
Pengyun Chen ◽  
Yanqing Jiang ◽  
Rupeng Wang ◽  
...  

2003 ◽  
Vol 45 (3-4) ◽  
pp. 199-210 ◽  
Author(s):  
Marko Lepetič ◽  
Gregor Klančar ◽  
Igor Škrjanc ◽  
Drago Matko ◽  
Boštjan Potočnik

2013 ◽  
Vol 467 ◽  
pp. 475-478
Author(s):  
Feng Yun Lin

This paper presents a method of time optimal path planning under kinematic, limit heat characteristics of DC motor and dynamic constrain for a 2-DOF wheeled. Firstly the shortest path is planned by using the geometric method under kinematic constraints. Then, in order to make full use of motors capacity we have the torque limits under limit heat characteristics of DC motor, finally the velocity limit and the boundary acceleration (deceleration) are determined to generate a time optimal path.


Sign in / Sign up

Export Citation Format

Share Document