Solving airline crew scheduling problems by branch-and-cut
Management Science
Coalition structure generation with worst case guarantees
Artificial Intelligence
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Task Allocation via Multi-Agent Coalition Formation: Taxonomy, Algorithms and Complexity
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Organization-Based Cooperative Coalition Formation
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Ontology-based coalition formation in heterogeneous MRS
PCAR '06 Proceedings of the 2006 international symposium on Practical cognitive agents and robots
Coalition Formation: From Software Agents to Robots
Journal of Intelligent and Robotic Systems
An auction-based approach to complex task allocation for multirobot teams
An auction-based approach to complex task allocation for multirobot teams
Coalition Structure Generation in Task-Based Settings
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
Methods for task allocation via agent coalition formation
Artificial Intelligence
Coalition formation for task allocation: theory and algorithms
Autonomous Agents and Multi-Agent Systems
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
COBOS: Cooperative backoff adaptive scheme for multirobot task allocation
IEEE Transactions on Robotics
Multi-robot coalition formation
IEEE Transactions on Robotics
Non-additive multi-objective robot coalition formation
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
This paper focuses on task allocation with single-task robots, multi-robot tasks and instantaneous assignment, which has been shown to be strongly NP-hard. Although this problem has been studied extensively, few efficient approximation algorithms have been provided due to its inherent complexity. In this paper, we first provide discussions and analyses for two natural greedy heuristics for solving this problem. Then, a new greedy heuristic is introduced, which considers inter-task resource constraints to approximate the influence between different assignments in task allocation. Instead of only looking at the utility of the assignment, our approach computes the expected loss of utility (due to the assigned robots and task) as an offset and uses the offset utility for making the greedy choice. A formal analysis is provided for the new heuristic, which reveals that the solution quality is bounded by two different factors. A new algorithm is then provided to approximate the new heuristic for performance improvement. Finally, for more complicated applications, we extend this problem to include general task dependencies and provide a result on the hardness of approximating this new formulation. Comparison results with the two natural heuristics in simulation are provided for both formulations, which show that the new approach achieves improved performance.