An Improved Genetic Algorithm for Path-Planning of Unmanned Surface Vehicle

被引:99
作者
Xin, Junfeng [1 ]
Zhong, Jiabao [1 ]
Yang, Fengru [1 ]
Cui, Ying [1 ]
Sheng, Jinlu [2 ]
机构
[1] Qingdao Univ Sci & Technol, Coll Electromech Engn, Qingdao 266061, Shandong, Peoples R China
[2] Chongqing Jiaotong Univ, Transport Coll, Chongqing 400074, Peoples R China
关键词
genetic algorithm; unmanned surface vehicle; path planning; multi-domain inversion; Monte-Carlo simulation; TRAVELING SALESMAN PROBLEM; OPTIMIZATION METHOD;
D O I
10.3390/s19112640
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
The genetic algorithm (GA) is an effective method to solve the path-planning problem and help realize the autonomous navigation for and control of unmanned surface vehicles. In order to overcome the inherent shortcomings of conventional GA such as population premature and slow convergence speed, this paper proposes the strategy of increasing the number of offsprings by using the multi-domain inversion. Meanwhile, a second fitness evaluation was conducted to eliminate undesirable offsprings and reserve the most advantageous individuals. The improvement could help enhance the capability of local search effectively and increase the probability of generating excellent individuals. Monte-Carlo simulations for five examples from the library for the travelling salesman problem were first conducted to assess the effectiveness of algorithms. Furthermore, the improved algorithms were applied to the navigation, guidance, and control system of an unmanned surface vehicle in a real maritime environment. Comparative study reveals that the algorithm with multi-domain inversion is superior with a desirable balance between the path length and time-cost, and has a shorter optimal path, a faster convergence speed, and better robustness than the others.
引用
收藏
页数:23
相关论文
共 26 条
[1]   Optimization Approaches for the Traveling Salesman Problem with Drone [J].
Agatz, Niels ;
Bouman, Paul ;
Schmidt, Marie .
TRANSPORTATION SCIENCE, 2018, 52 (04) :965-981
[2]   Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms [J].
Albayrak, Murat ;
Allahverdi, Novruz .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) :1313-1320
[3]   An introduction of dominant genes in genetic algorithm for FMS [J].
Chan, F. T. S. ;
Chung, S. H. ;
Chan, L. Y. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (16) :4369-4389
[4]   An Effective Approach for Obtaining a Group Trading Strategy Portfolio Using Grouping Genetic Algorithm [J].
Chen, Chun-Hao ;
Chen, Yu-Hsuan ;
Lin, Jerry Chun-Wei ;
Wu, Mu-En .
IEEE ACCESS, 2019, 7 :7313-7325
[5]   Bezier Curve Based Path Planning in a Dynamic Field using Modified Genetic Algorithm [J].
Elhoseny, Mohamed ;
Tharwat, Alaa ;
Hassanien, Aboul Ella .
JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 25 :339-350
[6]   3D Path Planning for Multiple UAVs for Maximum Information Collection [J].
Ergezer, Halit ;
Leblebicioglu, Kemal .
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2014, 73 (1-4) :737-762
[7]   Towards interactive Machine Learning (iML): Applying Ant Colony Algorithms to Solve the Traveling Salesman Problem with the Human-in-the-Loop Approach [J].
Holzinger, Andreas ;
Plass, Markus ;
Holzinger, Katharina ;
Crisan, Gloria Cerasela ;
Pintea, Camelia-M. ;
Palade, Vasile .
AVAILABILITY, RELIABILITY, AND SECURITY IN INFORMATION SYSTEMS, CD-ARES 2016, PAML 2016, 2016, 9817 :81-95
[8]   A hybrid genetic algorithm with Boltzmann convergence properties [J].
Jackson, W. C. ;
Norgard, J. D. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2008, 136 (03) :431-443
[9]   Multi-objective four dimensional imprecise TSP solved with a hybrid multi-objective ant colony optimization-genetic algorithm with diversity [J].
Khanra, Aditi ;
Pal, Tandra ;
Maiti, Manas Kumar ;
Maiti, Manoranjan .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2019, 36 (01) :47-65
[10]   Word sense disambiguation as a traveling salesman problem [J].
Kiem-Hieu Nguyen ;
Ock, Cheol-Young .
ARTIFICIAL INTELLIGENCE REVIEW, 2013, 40 (04) :405-427