A Clustering-Based Coverage Path Planning Method for Autonomous Heterogeneous UAVs

Author(s):  
Jinchao Chen ◽  
Chenglie Du ◽  
Ying Zhang ◽  
Pengcheng Han ◽  
Wei Wei
2019 ◽  
Vol 10 (1) ◽  
pp. 305
Author(s):  
Yong Tao ◽  
Chaoyong Chen ◽  
Tianmiao Wang ◽  
Youdong Chen ◽  
Hegen Xiong ◽  
...  

A re-entry path planning method in omitting areas for service robots is suggested based on dynamic Inver-Over evolutionary algorithms after the robot automatically avoids obstacles. The complete coverage path planning is researched for cleaning service robots. Combined with features of dynamic travelling salesmen problem (DTSP), a local operator is employed for the path planning to enhance real-time dynamic properties of the Inver-Over algorithm. The method addresses the path planning problem that a number of cells undergo dynamic changes over time under work environment of cleaning robots. With simulations and experiments performed, it is discovered that the average relative error is 2.2% between the re-entry path planning and the best path, which validates the effectiveness and feasibility of the method.


2020 ◽  
Vol 10 (23) ◽  
pp. 8641
Author(s):  
Xuan Ye ◽  
Lan Luo ◽  
Li Hou ◽  
Yang Duan ◽  
Yang Wu

Coverage path planning on a complex free-form surface is a representative problem that has been steadily investigated in path planning and automatic control. However, most methods do not consider many optimisation conditions and cannot deal with complex surfaces, closed surfaces, and the intersection of multiple surfaces. In this study, a novel and efficient coverage path-planning method is proposed that considers trajectory optimisation information and uses point cloud data for environmental modelling. First, the point cloud data are denoised and simplified. Then, the path points are converted into the rotation angle of each joint of the manipulator. A mathematical model dedicated to energy consumption, processing time, and path smoothness as optimisation objectives is developed, and an improved ant colony algorithm is used to solve this problem. Two measures are proposed to prevent the algorithm from being trapped in a local optimum, thereby improving the global search ability of the algorithm. The standard test results indicate that the improved algorithm performs better than the ant colony algorithm and the max–min ant system. The numerical simulation results reveal that compared with the point cloud slicing technique, the proposed method can obtain a more efficient path. The laser ablation de-rusting experiment results specify the utility of the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document