On-line estimators for ad-hoc task execution: learning types and parameters of teammates for effective teamwork

被引:0
|
作者
Elnaz Shafipour Yourdshahi
Matheus Aparecido do Carmo Alves
Amokh Varma
Leandro Soriano Marcolino
Jó Ueyama
Plamen Angelov
机构
[1] Lancaster University,
[2] Indian Institute of Technology Delhi,undefined
[3] University of São Paulo,undefined
[4] University of Southampton,undefined
关键词
Ad-hoc teamwork; Decentralised task execution; Learning; Planning;
D O I
暂无
中图分类号
学科分类号
摘要
It is essential for agents to work together with others to accomplish common objectives, without pre-programmed coordination rules or previous knowledge of the current teammates, a challenge known as ad-hoc teamwork. In these systems, an agent estimates the algorithm of others in an on-line manner in order to decide its own actions for effective teamwork. A common approach is to assume a set of possible types and parameters for teammates, reducing the problem into estimating parameters and calculating distributions over types. Meanwhile, agents often must coordinate in a decentralised fashion to complete tasks that are displaced in an environment (e.g., in foraging, de-mining, rescue or fire control), where each member autonomously chooses which task to perform. By harnessing this knowledge, better estimation techniques can be developed. Hence, we present On-line Estimators for Ad-hoc Task Execution (OEATE), a novel algorithm for teammates’ type and parameter estimation in decentralised task execution. We show theoretically that our algorithm can converge to perfect estimations, under some assumptions, as the number of tasks increases. Additionally, we run experiments for a diverse configuration set in the level-based foraging domain over full and partial observability, and in a “capture the prey” game. We obtain a lower error in parameter and type estimation than previous approaches and better performance in the number of completed tasks for some cases. In fact, we evaluate a variety of scenarios via the increasing number of agents, scenario sizes, number of items, and number of types, showing that we can overcome previous works in most cases considering the estimation process, besides robustness to an increasing number of types and even to an erroneous set of potential types.
引用
收藏
相关论文
共 10 条
  • [1] On-line estimators for ad-hoc task execution: learning types and parameters of teammates for effective teamwork
    Yourdshahi, Elnaz Shafipour
    Alves, Matheus Aparecido do Carmo
    Varma, Amokh
    Marcolino, Leandro Soriano
    Ueyama, Jo
    Angelov, Plamen
    [J]. AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2022, 36 (02)
  • [2] On-line Estimators for Ad-hoc Task Execution: Learning Types and Parameters of Teammates for Effective Teamwork JAAMAS Track
    do Carmo Alves, Matheus Ap.
    Yourdshahi, Elnaz Shafipour
    Varma, Amokh
    Marcolino, Leandro Soriano
    Ueyama, Jó
    Angelov, Plamen
    [J]. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 2023, 2023-May : 140 - 142
  • [3] Ad Hoc Teamwork by Learning Teammates' Task
    Melo, Francisco S.
    Sardinha, Alberto
    [J]. AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, : 577 - 578
  • [4] Ad hoc teamwork by learning teammates’ task
    Francisco S. Melo
    Alberto Sardinha
    [J]. Autonomous Agents and Multi-Agent Systems, 2016, 30 : 175 - 219
  • [5] Ad hoc teamwork by learning teammates' task
    Melo, Francisco S.
    Sardinha, Alberto
    [J]. AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2016, 30 (02) : 175 - 219
  • [6] Learning with Generated Teammates to Achieve Type-Free Ad-Hoc Teamwork
    Xing, Dong
    Liu, Qianhui
    Zheng, Qian
    Pan, Gang
    [J]. PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 472 - 478
  • [7] Routing in Mobile Ad-Hoc Networks as a Reinforcement Learning Task
    Chettibi, Saloua
    Chikhi, Salim
    [J]. NETWORKED DIGITAL TECHNOLOGIES, 2011, 136 : 128 - 135
  • [8] Enhancing Junction-based Routing for Vehicular Ad-hoc Networks by Effective Routing Table Learning and Maintenance
    Chuang, Po-Jen
    Liu, Ming-Chun
    [J]. INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING, 2016, 9 (01): : 135 - 148
  • [9] Optimization of Value of parameters in Ad-hoc On Demand Multipath Distance Vector Routing using Teaching-Learning Based Optimization
    Giri, A. K.
    Lobiyal, D. K.
    Katti, C. P.
    [J]. 3RD INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING 2015 (ICRTC-2015), 2015, 57 : 1332 - 1341
  • [10] Lamarckian learning-based whale optimization algorithm to localize non-line-of-sight nodes for achieving reliable data dissemination in vehicular ad-hoc networks
    Balamurugan, A.
    [J]. INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2021, 34 (07)