Leader-follower based Coalition Formation in Large-scale UAV Networks, A Quantum Evolutionary Approach

被引:0
作者
Mousavi, Sajad [1 ]
Afghah, Fatemeh [1 ]
Ashdown, Jonathan D. [2 ]
Turck, Kurt [2 ]
机构
[1] No Arizona Univ, Sch Informat Comp & Cyber Syst, Flagstaff, AZ 86011 USA
[2] US Air Force, Res Lab, Rome, NY USA
来源
IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS) | 2018年
关键词
Unmanned aerial vehicles; coalition formation; mission completion; evolutionary algorithms; REINFORCEMENT LEARNING AGENT; BOTTLENECKS; SYSTEMS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The problem of decentralized multiple Point of Interests (PoIs) detection and associated task completion in an unknown environment with multiple resource-constrained and self-interested Unmanned Aerial Vehicles (UAVs) is studied. The UAVs form several coalitions to efficiently complete the compound tasks which are impossible to be performed individually. The objectives of such coalition formation are to firstly minimize resource consumption in completing the encountered tasks on time, secondly to enhance the reliability of the coalitions, and lastly in segregating the most trusted UAVs amid the self interested of them. As many previous publications have merely focused upon minimizing costs, this study considers a multi-objective optimization coalition formation problem that considers the three aforementioned objectives. In doing so, a leader-follower-inspired coalition formation algorithm amalgamating the three objectives to address the problem of the computational complexity of coalition formation in large-scale UAV networks is proposed. This algorithm attempts to form the coalitions with minimally exceeding the required resources for the encountered tasks while maximizing the number of completed tasks. The proposed algorithm is based on Quantum Evolutionary Algorithms (QEA) which are a combination of quantum computing and evolutionary algorithms. Results from simulations show that the proposed algorithm significantly outperforms the existing coalition formation algorithms such as merge-and-split and a famous multi-objective genetic algorithm called NSGA-II (1).
引用
收藏
页码:882 / 887
页数:6
相关论文
共 16 条
  • [1] [Anonymous], ARXIV170904579
  • [2] [Anonymous], ARXIV171100214
  • [3] Darrah MarjorieA., 2005, Infotech@ Aerospace, P26
  • [4] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [5] Extracting bottlenecks for reinforcement learning agent by holonic concept clustering and attentional functions
    Ghazanfari, Behzad
    Mozayani, Nasser
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 54 : 61 - 77
  • [6] Enhancing Nash Q-learning and Team Q-learning mechanisms by using bottlenecks
    Ghazanfari, Behzad
    Mozayani, Nasser
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2014, 26 (06) : 2771 - 2783
  • [7] Han KH, 2000, IEEE C EVOL COMPUTAT, P1354, DOI 10.1109/CEC.2000.870809
  • [8] Janovsky P, 2016, 2016 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE (WI 2016), P343, DOI [10.1109/WI.2016.54, 10.1109/WI.2016.0055]
  • [9] Automatic abstraction controller in reinforcement learning agent via automata
    Mousavi, Seyed Sajad
    Ghazanfari, Behzad
    Mozayani, Nasser
    Jahed-Motlagh, Mohammad Reza
    [J]. APPLIED SOFT COMPUTING, 2014, 25 : 118 - 128
  • [10] Razi A, 2017, ARXIV171011185