A field-based versus a protocol-based approach for adaptive task assignment

被引:12
|
作者
Weyns, Danny [1 ]
Boucke, Nelis [1 ]
Holvoet, Tom [1 ]
机构
[1] Katholieke Univ Leuven, Louvain, Belgium
关键词
task assignment; gradient fields; extended contract net protocol; automatic guided vehicles; AGN;
D O I
10.1007/s10458-008-9037-x
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Task assignment in multi-agent systems is a complex coordination problem, in particular in systems that are subject to dynamic and changing operating conditions. To enable agents to deal with dynamism and change, adaptive task assignment approaches are needed. In this paper, we study two approaches for adaptive task assignment that are characteristic for two classical families of task assignment approaches. FiTA is a field-based approach in which tasks emit fields in the environment that guide idle agents to tasks. DynCNET is a protocol-based approach that extends Standard Contract Net (CNET). In DynCNET, agents use explicit negotiation to assign tasks. We compare both approaches in a simulation of an industrial automated transportation system. Our experiences show that: (1) the performance of DynCNET and FiTA are similar, while both outperform CNET; (2) the complexity to engineer DynCNET is similar to FiTA but much more complex than CNET; (3) whereas task assignment with FiTA is an emergent solution, DynCNET specifies the interaction among agents explicitly allowing engineers to reason on the assignment of tasks, (4) FiTA is inherently robust to message loss while DynCNET requires substantial additional support. The tradeoff between (3) and (4) is an important criteria for the selection of an adaptive task assignment approach in practice.
引用
收藏
页码:288 / 319
页数:32
相关论文
共 50 条
  • [21] Firefighting and Rescue Cooperation Task Assignment Based on DBOA
    Liu, Jing
    2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5, 2010, : 3350 - 3353
  • [22] Suitability-based Task Assignment in Crowdsourcing Markets
    Wang, Pengwei
    Chen, Zhen
    Zhang, Zhaohui
    2020 IEEE 13TH INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (SCC 2020), 2020, : 361 - 369
  • [23] Dynamic pricing in profit-driven task assignment: a domain-of-influence based approach
    Zhou, Zhifeng
    Chen, Rong
    Wang, Can
    Zhang, Chengwei
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2021, 12 (04) : 1015 - 1030
  • [24] Multi-objective Task Assignment and Autonomous Approach Research Based on Multiple Unmanned Vehicles
    Zhao Ziye
    Dan, Zou
    Nan, Xiang
    Xia, Xuejiao
    Jia, Liu
    PROCEEDINGS OF 2022 INTERNATIONAL CONFERENCE ON AUTONOMOUS UNMANNED SYSTEMS, ICAUS 2022, 2023, 1010 : 3813 - 3824
  • [25] A dynamic task assignment approach based on individual worklists for minimizing the cycle time of business processes
    Xie, Yi
    Chien, Chen-Fu
    Tang, Ren-Zhong
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 401 - 414
  • [26] The bundled task assignment problem in mobile crowdsensing: A column generation-based solution approach
    Amiri, Ali
    Barkhi, Reza
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 237
  • [27] Dynamic pricing in profit-driven task assignment: a domain-of-influence based approach
    Zhifeng Zhou
    Rong Chen
    Can Wang
    Chengwei Zhang
    International Journal of Machine Learning and Cybernetics, 2021, 12 : 1015 - 1030
  • [28] The bundled task assignment problem in mobile crowdsensing: a lagrangean relaxation-based solution approach
    Amiri, Ali
    INFORMATION TECHNOLOGY & MANAGEMENT, 2024,
  • [29] An adaptive task assignment method for multiple mobile robots via swarm intelligence approach
    Zhang, DD
    Xie, GM
    Yu, JZ
    Wang, L
    2005 IEEE INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ROBOTICS AND AUTOMATION, PROCEEDINGS, 2005, : 415 - 420
  • [30] Deep Reinforcement Learning Task Assignment Based on Domain Knowledge
    Liu, Jiayi
    Wang, Gang
    Guo, Xiangke
    Wang, Siyuan
    Fu, Qiang
    IEEE ACCESS, 2022, 10 : 114402 - 114413