An efficient path planning method for a cleaning robot based on ceiling vision

Author(s):  
Junho Park ◽  
WooYeon Jeong ◽  
Hyoung-Ki Lee ◽  
Jonghwa Won
IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 135513-135523
Author(s):  
Qingfeng Yao ◽  
Zeyu Zheng ◽  
Liang Qi ◽  
Haitao Yuan ◽  
Xiwang Guo ◽  
...  

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.


Sign in / Sign up

Export Citation Format

Share Document