Research of UAV communication relay deployment problems in target reconnaissance mission

被引:0
作者
Fang Bin [1 ]
Chen Tefang [1 ,2 ]
机构
[1] Cent S Univ, Sch Traff & Transportat Engn, Changsha 410075, Hunan, Peoples R China
[2] Cent S Univ, Sch Informat Sci & Engn, Changsha 410075, Hunan, Peoples R China
来源
2014 11TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA) | 2014年
关键词
uav communication relay; ahop; Steiner tree; ibf algorithm; pga algorithm;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
When UAVs carry out reconnaissance mission, it needs a reliable communication link as a guarantee for the purpose of transmitting the target intelligence data back to the ground control station. In most cases, is impossible to meet the demand of data transmission relying only on the Communication ability of one UAV. Through the use of multiple UAVs to build a communication relay link, is a feasible method to realize remote data transmission. In the presence of communication blind area and the limited number of available UAV, how to locate UAV reasonably, in order to get better communication relay link quality, is the focus of concern. The UAV deployment problem with single target and multi targets is modeled as AHOP problem and Steiner tree problem respectively. We propose the IBF algorithm based on Bellman-Ford algorithm, and propose the PGA algorithm based on the combination of Pareto solution and GA algorithm, to solve the problem of deploying UAV in the communication relay link with single and multi target respectively, carries out simulation test and analysis results, which shows the effectiveness of the IBF algorithm and PGA algorithm.
引用
收藏
页码:2382 / 2388
页数:7
相关论文
共 15 条
[1]  
[Anonymous], 2007, 2007 IEEE WIREL COMM, DOI DOI 10.1109/WCNC.2007.485
[2]  
[Anonymous], 1990, Introduction to Algorithms
[3]   Optimal placement of UV-based communications relay nodes [J].
Burdakov, Oleg ;
Doherty, Patrick ;
Holmberg, Kaj ;
Olsson, Per-Magnus .
JOURNAL OF GLOBAL OPTIMIZATION, 2010, 48 (04) :511-531
[4]  
CERASOLI C, 2007, P IEEE MIL COMM C 29, P1, DOI DOI 10.1109/MILCOM.2007.4455127
[5]   On the directed hop-constrained shortest path problem [J].
Dahl, G ;
Gouveia, L .
OPERATIONS RESEARCH LETTERS, 2004, 32 (01) :15-22
[6]   Maintaining wireless connectivity constraints for swarms in the presence of obstacles [J].
Esposito, Joel M. ;
Dunbar, Thomas W. .
2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), VOLS 1-10, 2006, :946-951
[7]   Computing shortest paths for any number of hops [J].
Guérin, R ;
Orda, A .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (05) :613-620
[8]  
Lawler E.L., 2001, Dover Books on Mathematics Series
[9]   STEINER PROBLEM IN NETWORKS - A SURVEY [J].
WINTER, P .
NETWORKS, 1987, 17 (02) :129-167
[10]  
[No title captured]