Path planning of UAV for oilfield inspections in a three-dimensional dynamic environment with moving obstacles based on an improved pigeon-inspired optimization algorithm

被引:38
作者
Ge, Fawei [1 ]
Li, Kun [1 ]
Han, Ying [1 ]
Xu, Wensu [1 ]
Wang, Yi'an [1 ]
机构
[1] Bohai Univ, Coll Engn, Jinzhou 121013, Liaoning, Peoples R China
基金
中国国家自然科学基金;
关键词
Oilfield inspection; Path planning; UAV; Pigeon-inspired optimization; Fruit fly optimization algorithm; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; SEARCH;
D O I
10.1007/s10489-020-01650-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, uninhabited aerial vehicles (UAV) have been used for oilfield inspections in many enterprises which can realize oilfield inspections by fewer workers. Path planning is one indispensable element in oilfield inspections through UAVs and it is also a complicated optimal problem. Now, although many researches have been focused on it, they are mainly discussed based on two-dimension planes. In practices, oilfields are complex three-dimensional spaces with many targeted points and moving obstacles between the starting and the ending point, which bring current methods some difficulties. In order to solve this problem, a three-dimensional environment model for oilfields is established for the first time, which includes: a static oil-well equipment, moving obstacles, and so on. Then, a cost function is defined to evaluate the best path, which includes: total length, average height, total time, and total electricity consumption. Finally, an improved pigeon-inspired optimization algorithm is proposed to solve problems about path planning in a three-dimensional dynamic environment of oilfields, which is named PIOFOA. In the PIOFOA, a pigeon-inspired optimization (PIO) algorithm is used to optimize the initial path and a fruit fly optimization algorithm (FOA) is used to continue local optimizations, so as to search the best path after movements of obstacles. Compared with some other methods, simulation results show that the proposed PIOFOA method is more effective.
引用
收藏
页码:2800 / 2817
页数:18
相关论文
共 43 条
[11]   Route Planning for Unmanned Aerial Vehicle (UAV) on the Sea Using Hybrid Differential Evolution and Quantum-Behaved Particle Swarm Optimization [J].
Fu, Yangguang ;
Ding, Mingyue ;
Zhou, Chengping ;
Hu, Hanping .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2013, 43 (06) :1451-1465
[12]   Small unmanned airborne systems to support oil and gas pipeline monitoring and mapping [J].
Gomez, Cristina ;
Green, David R. .
ARABIAN JOURNAL OF GEOSCIENCES, 2017, 10 (09)
[13]   Bi-level programming based real-time path planning for unmanned aerial vehicles [J].
Liu, Wei ;
Zheng, Zheng ;
Cai, Kai-Yuan .
KNOWLEDGE-BASED SYSTEMS, 2013, 44 :34-47
[14]  
Ma Y., 2013, MATH PROBL ENG, V2013, P1, DOI DOI 10.1371/J0URNAL.P0NE.0053916
[15]   Enhanced discrete particle swarm optimization path planning for UAV vision-based surface inspection [J].
Manh Duong Phung ;
Cong Hoang Quach ;
Tran Hiep Dinh ;
Ha, Quang .
AUTOMATION IN CONSTRUCTION, 2017, 81 :25-33
[16]   Path planning for mobile robots using Bacterial Potential Field for avoiding static and dynamic obstacles [J].
Montiel, Oscar ;
Orozco-Rosas, Ulises ;
Sepulveda, Roberto .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (12) :5177-5191
[17]   Path planning using a Multiclass Support Vector Machine [J].
Morales, Nestor ;
Toledo, Jonay ;
Acosta, Leopoldo .
APPLIED SOFT COMPUTING, 2016, 43 :498-509
[18]   An improved fruit fly optimization algorithm for continuous function optimization problems [J].
Pan, Quan-Ke ;
Sang, Hong-Yan ;
Duan, Jun-Hua ;
Gao, Liang .
KNOWLEDGE-BASED SYSTEMS, 2014, 62 :69-83
[19]   A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example [J].
Pan, Wen-Tsao .
KNOWLEDGE-BASED SYSTEMS, 2012, 26 :69-74
[20]   Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Real-Time UAV Path Planning [J].
Roberge, Vincent ;
Tarbouchi, Mohammed ;
Labonte, Gilles .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2013, 9 (01) :132-141