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.
Research of UAV communication relay deployment problems in target reconnaissance mission
01.06.2014
966791 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Genetic Design of Target Orbits for a Temporary Reconnaissance Mission
Online Contents | 2009
|Mars Reconnaissance Orbiter Mission
AIAA | 2003
|Mars Reconnaissance Orbiter mission
NTRS | 2001
|