Anytime and Efficient Coalition Formation with Spatial and Temporal Constraints

The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task scheduling problem where the tasks are spatially distributed, with deadlines and workloads, and the number of agents is typically much smaller than the number of tasks, thus the agents have to form coalitions in order to maximise the number of completed tasks. The current state-of-the-art CFSTP solver, the Coalition Formation with Look-Ahead (CFLA) algorithm, has two main limitations. First, its time complexity is exponential with the number of agents. Second, as we show, its look-ahead technique is not effective in real-world scenarios, such as open multi-agent systems, where new tasks can appear at any time. In this work, we study its design and define an extension, called Coalition Formation with Improved Look-Ahead (CFLA2), which achieves better performance. Since we cannot eliminate the limitations of CFLA in CFLA2, we also develop a novel algorithm to solve the CFSTP, the first to be anytime, efficient and with provable guarantees, called Cluster-based Coalition Formation (CCF). We empirically show that, in settings where the look-ahead technique is highly effective, CCF completes up to 30% (resp. 10%) more tasks than CFLA (resp. CFLA2) while being up to four orders of magnitude faster. Our results affirm CCF as the new state-of-the-art algorithm to solve the CFSTP.

[1]  Andreas Kroll,et al.  Memetic algorithms for optimal task allocation in multi-robot systems for inspection problems with cooperative tasks , 2015, Soft Comput..

[2]  Katsunori Mikuniya.  Global Risks Report , 2013 .

[3]  Sarvapali D. Ramchurn,et al.  Decentralized Coordination in RoboCup Rescue , 2010, Comput. J..

[4]  Michael Wooldridge,et al.  Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.

[5]  Ana L. C. Bazzan,et al.  Towards efficient multiagent task allocation in the RoboCup Rescue: a biologically-inspired approach , 2011, Autonomous Agents and Multi-Agent Systems.

[6]  Illah R. Nourbakhsh,et al.  Constraint optimization coordination architecture for search and rescue robotics , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[7]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[8]  Maria L. Gini,et al.  Task Allocation for Spatially and Temporally Distributed Tasks , 2012, IAS.

[9]  Alessandro Farinelli,et al.  Efficient Inter-Team Task Allocation in RoboCup Rescue , 2015, AAMAS.

[10]  David Alexander,et al.  Principles of Emergency Planning and Management , 2002 .

[11]  Hiroaki Kitano,et al.  RoboCup Rescue: search and rescue in large-scale disasters as a domain for autonomous agents research , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[12]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[13]  Ulrich Pferschy,et al.  Optimised scheduling in human–robot collaboration – a use case in the assembly of printed circuit boards , 2018, Int. J. Prod. Res..

[14]  Agostino Poggi,et al.  Multiagent Systems , 2006, Intelligenza Artificiale.

[15]  Maja J. Matarić,et al.  Designing emergent behaviors: from local interactions to collective intelligence , 1993 .

[16]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[17]  C. Hewitt.  The challenge of open systems , 1990 .

[18]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[19]  Sarvapali D. Ramchurn,et al.  Coalition formation with spatial and temporal constraints , 2010, AAMAS.

[20]  Minjie Zhang,et al.  Self-Adaptation-Based Dynamic Coalition Formation in a Distributed Agent Network: A Mechanism and a Brief Survey , 2013, IEEE Transactions on Parallel and Distributed Systems.

[21]  Krithi Ramamritham,et al.  Distributed Scheduling of Tasks with Deadlines and Resource Requirements , 1989, IEEE Trans. Computers.

[22]  Enrico Pontelli,et al.  Distributed Constraint Optimization Problems and Applications: A Survey , 2016, J. Artif. Intell. Res..

[23]  Daniel Selva,et al.  Agent‐based simulation framework and consensus algorithm for observing systems with adaptive modularity , 2018, Syst. Eng..

[24]  Anthony Stentz,et al.  A comprehensive taxonomy for multi-robot task allocation , 2013, Int. J. Robotics Res..

[25]  Damon P. Coppola.  Introduction to International Disaster Management , 2006 .

[26]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[27]  G. Ayorkor Korsah,et al.  Exploring Bounded Optimal Coordination for Heterogeneous Teams with Cross-Schedule Dependencies , 2011 .

[28]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[29]  Nicholas R. Jennings,et al.  Decentralised coordination of low-power embedded devices using the max-sum algorithm , 2008, AAMAS.

[30]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[31]  Sarvapali D. Ramchurn,et al.  Efficient, Superstabilizing Decentralised Optimisation for Dynamic Task Allocation Environments , 2010 .

[32]  G. Mann.  The Quark and the Jaguar: adventures in the simple and the complex , 1994 .

[33]  Jing Zhou,et al.  Task Allocation for Multi-Agent Systems Based on Distributed Many-Objective Evolutionary Algorithm and Greedy Algorithm , 2020, IEEE Access.

[34]  Marco Spuri,et al.  Deadline Scheduling for Real-Time Systems , 2011 .

[35]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume IV: Fascicle 2: Generating All Tuples and Permutations , 2005 .

[36]  Marco Spuri,et al.  Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms , 2013 .

[37]  Stjepan Bogdan,et al.  Cooperative Aerial-Ground Multi-Robot System for Automated Construction Tasks , 2020, IEEE Robotics and Automation Letters.