Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
The vehicle routing problem
RoboCup Rescue: A Grand Challenge for Multi-Agent Systems
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Allocating tasks in extreme teams
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Fast winner determination for agent coordination with SBB auctions
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Heterogeneous multirobot coordination with spatial and temporal constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Coalition structure generation: dynamic programming meets anytime optimization
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Decentralized Coordination in RoboCup Rescue
The Computer Journal
Swarm-like Methodologies for Executing Tasks with Deadlines
Journal of Intelligent and Robotic Systems
AtomicOrchid: a mixed reality game to investigate coordination in disaster response
ICEC'12 Proceedings of the 11th international conference on Entertainment Computing
RMASBench: benchmarking dynamic multi-agent coordination in urban search and rescue
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Task allocation for multi-agent systems in dynamic environments
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
From supply chain formation to multi-agent coordination
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
ACM Transactions on Sensor Networks (TOSN)
A comprehensive taxonomy for multi-robot task allocation
International Journal of Robotics Research
C-link: a hierarchical clustering approach to large-scale near-optimal coalition formation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents
Artificial Intelligence
Hi-index | 0.00 |
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is the problem of forming the best teams (coalitions) of responders to perform the various tasks in the area where the disaster has struck. Moreover, these teams may have to form, disband, and reform in different areas of the disaster region. This is because in most cases there will be more tasks than agents. Hence, agents need to schedule themselves to attempt each task in turn. Second, the tasks themselves can be very complex: requiring the agents to work on them for different lengths of time and having deadlines by when they need to be completed. The problem is complicated still further when different coalitions perform tasks with different levels of efficiency. Given all these facets, we define this as The Coalition Formation with Spatial and Temporal constraints problem (CFSTP). We show that this problem is NP-hard---in particular, it contains the well-known complex combinatorial problem of Team Orienteering as a special case. Based on this, we design a Mixed Integer Program to optimally solve small-scale instances of the CFSTP and develop new anytime heuristics that can, on average, complete 97% of the tasks for large problems (20 agents and 300 tasks). In so doing, our solutions represent the first results for CFSTP.