Homogeneous Agent Behaviours for the Multi-Agent Simultaneous Searching and Routing Problem

被引:7
作者
Kent, Thomas [1 ]
Richards, Arthur [2 ]
Johnson, Angus [3 ]
机构
[1] Univ Bristol, Dept Comp Sci, Bristol BS8 1TH, Avon, England
[2] Univ Bristol, Dept Aerosp Engn, Bristol BS8 1TH, Avon, England
[3] Thales, Reading RG2 6GF, Berks, England
基金
英国工程与自然科学研究理事会;
关键词
multi-agent systems; search and rescue; path planning; Unmanned Aerial Vehicles; Travelling Salesman Problem; FORMULATION; ALGORITHM;
D O I
10.3390/drones6020051
中图分类号
TP7 [遥感技术];
学科分类号
081102 ; 0816 ; 081602 ; 083002 ; 1404 ;
摘要
Through the use of autonomy Unmanned Aerial Vehicles (UAVs) can be used to solve a range of of multi-agent problems that exist in the real world, for example search and rescue or surveillance. Within these scenarios the global objective might often be better achieved if aspects of the problem can be optimally shared amongst its agents. However, in uncertain, dynamic and often partially observable environments centralised global-optimisation techniques are not achievable. Instead, agents may have to act on their own belief of the world, making the best decisions independently and potentially myopically. With multiple agents acting in a decentralised manner how can we discourage competitive behaviour and instead facilitate cooperation. This paper focuses on the specific problem of multiple UAVs simultaneously searching for tasks in an environment whilst efficiently routing between them and ultimately visiting them. This paper is motivated by this idea that collaboration can be simple and achieved without the need for a dialogue but instead through the design of the individual agent's behaviour. By focusing on what is communicated we expand the use of a single agent behaviour. Which through minor modifications can produce distinct agents demonstrating independent, collaborative and competitive behaviour. In particular by investigating the role of sensor and communication ranges this paper will show that increased sensor ranges can be detrimental to system performance, and instead the simple modelling of nearby agents' intent is a far better approach.
引用
收藏
页数:18
相关论文
共 27 条
  • [1] Multirobot Exploration of Communication-Restricted Environments: A Survey
    Amigoni, Francesco
    Banfi, Jacopo
    Basilico, Nicola
    [J]. IEEE INTELLIGENT SYSTEMS, 2017, 32 (06) : 48 - 57
  • [2] Beck Z., 2016, THESIS U SOUTHAMPTON
  • [3] The multiple traveling salesman problem: an overview of formulations and solution procedures
    Bektas, T
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (03): : 209 - 219
  • [4] Ceccarelli Nicola, 2007, 2007 American Control Conference, P5310, DOI 10.1109/ACC.2007.4282479
  • [5] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS
    CROES, GA
    [J]. OPERATIONS RESEARCH, 1958, 6 (06) : 791 - 812
  • [6] Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
    Englert, Matthias
    Roeglin, Heiko
    Voecking, Berthold
    [J]. ALGORITHMICA, 2014, 68 (01) : 190 - 264
  • [7] Fisher R. A., 1953, STAT TABLES BIOL AGR
  • [8] Kazil Jackie, 2020, Social, Cultural, and Behavioral Modeling. 13th International Conference, SBP-BRiMS 2020. Proceedings. Lecture Notes in Computer Science (LNCS 12268), P308, DOI 10.1007/978-3-030-61255-9_30
  • [9] Kefi S, 2016, IEEE SYS MAN CYBERN, P4866, DOI 10.1109/SMC.2016.7844999
  • [10] Single-Agent Policies for the Multi-Agent Persistent Surveillance Problem via Artificial Heterogeneity
    Kent, Thomas
    Richards, Arthur
    Johnson, Angus
    [J]. MULTI-AGENT SYSTEMS AND AGREEMENT TECHNOLOGIES, EUMAS 2020, AT 2020, 2020, 12520 : 243 - 260