The unmanned aerial vehicle (UAV) can be an efficient and economical solution to traffic surveillance mission for collecting real-time traffic information of special areas. In some cases, UAV is unable to transmit the traffic information back to the ground control station directly. Deploying multiple UAVs and to build a communication relay link is a feasible method to avoid the building and other obstacles and finally transmit the traffic information successfully. According to the number of traffic surveillance target, the multiple UAVs deployment problem is classified into single target UAV space deployment problem (STUSD) and multi target UAV space deployment problem (MTUSD). This paper focuses on the MTUSD problem, which is modeled as the Steiner tree problem. PGA algorithm is developed based on the combination of Pareto solution and GA algorithm for MTUSD. Moreover, the experiments demonstrate the effectiveness of the PGA algorithm for the multiple UAVs space deployment problem.
Research of Multiple UAVs Space Deployment Problem in Traffic Surveillance Mission
17th COTA International Conference of Transportation Professionals ; 2017 ; Shanghai, China
CICTP 2017 ; 365-372
2018-01-18
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 2003
|