Journal of Shanghai University >
Complete coverage path planning of USV used for mapping round island
Received date: 2017-01-04
Online published: 2017-02-28
When mapping the seabed around islands independently, there are difficulties like large amount of calculation and complex task scene for mapping with an unmanned surface vehicle (USV). To solve the problems, an algorithm composed of a dynamic grids algorithm for main motion direction and a heuristic search algorithm is proposed. This algorithm establishes an environmental model based on the dynamic grids algorithm. The heuristic algorithm based on priority is used to choose an appropriate path point to travel. When the USV getting into a deadlock, an optimal path is generated with the heuristic search algorithm to get out. Simulation results show that performance of path planning is improved with the proposed algorithm. The planned path is more reasonable and effective to meet the needs when using USV to map the seabed around an island.
ZHONG Yuxuan, GE Lei, ZHANG Xin, PENG Yan, YANG Yi, LI Xiaomao . Complete coverage path planning of USV used for mapping round island[J]. Journal of Shanghai University, 2017 , 23(1) : 17 -26 . DOI: 10.3969/j.issn.1007-2861.2016.07.020
[1] 周玉坤. 基于GNSS 及物探方法的近海岛礁勘测技术研究[D]. 沈阳: 东北大学, 2014.
[2] Petillot Y R, Reed S R, Bell J M. Real time AUV pipeline detection and tracking using side scan sonar and multi-beam echo-sounder [C]// Oceans. 2002: 217-222.
[3] Yan R J, Pang S, Sun H B, et al. Development and missions of unmanned surface vehicle [J]. Journal of Marine Science and Application, 2010, 9(4): 451-457.
[4] Yan M Z, Zhu D Q. An algorithm of complete coverage path planning for autonomous underwater vehicles [J]. Key Engineering Materials, 2011, 467/468/469: 1377-1385.
[5] DeCarvalho R N, Vidal H A, Vieira P, et al. Complete coverage path planning and guidance for cleaning robots [C]// IEEE International Symposium on Industrial Electronics. 1998: 677-682.
[6] Wu J H, Qin T D, Chen J, et al. Complete coverage path planning and obstacle avoidance strategy of the robot [J]. Advanced Materials Research, 2014, 756/757/758/759: 497-503.
[7] McCulloch W S, Pitts W. A logical calculus of the ideas immanent in nervous activity [M]. Cambridge: The MIT Press, 1943: 115-133.
[8] Hodgkin A L, Huxley A F. A quantitative description of membrane current and its application to conduction and excitation in nerve [J]. Bulletin of Mathematical Biology, 1990, 117(1): 500-544.
[9] Stephen G. Nonlinear neural networks: principles, mechanisms, and architectures [J]. Neural Networks, 1988, 1(1): 17-61.
[10] Yang S X, Luo C. A neural network approach to complete coverage path planning [J]. IEEE Transactions on Systems Man & Cybernetics Part B Cybernetics A, 2004, 34(1): 718-725.
[11] 邱雪娜, 刘士荣, 俞金寿, 等. 移动机器人的完全遍历路径规划: 生物激励与启发式模板方法[J]. 模式识别与人工智能, 2006, 19(1): 122-128.
[12] 邱雪娜, 刘士荣, 宋加涛, 等. 不确定动态环境下移动机器人的完全遍历路径规划[J]. 机器人, 2006, 28(6): 586-592.
[13] 王妹婷, 齐永锋, 陆柳延, 等. 双向清洗机器人玻璃幕墙完全遍历路径规划[J]. 机械设计与制造, 2013(11): 211-213.
[14] Liu X, Qin N, Xia H. Fast dynamic grid deformation based on Delaunay graph mapping [J]. Journal of Computational Physics, 2006, 211(2): 405-423.
[15] Richards N, Sharma M, Ward D. A hybrid A*/automaton approach to on-line path planning with obstacle avoidance [C]// AIAA 1st, Intelligent Systems Technical Conference. 2004: 6629.
[16] Canny J. The complexity of robot motion planning [M]. Cambridge: The Mit Press, 1987: 27-32.
[17] Choset H. Coverage for robotics—a survey of recent results [J]. Annals of Mathematics and Artificial Intelligence, 2001, 31(1): 113-126.
/
| 〈 |
|
〉 |
