Multi-objective Robot Coalition Formation for Non-additive Environments
Research towards the coalition formation problem in multi-robot systems has recently gained attention. The main objective of this research is to form the best teams of heterogeneous robots (coalitions) to cater to a given set of tasks. Due to the inherently NP-hard nature of the problem, it is being addressed employing a large number of techniques ranging from heuristics based solutions to evolutionary approaches. The problem becomes more complex when the resource-distribution needed to complete a task is non-additive in nature, i.e., it may not be sufficient to just add the resources to the individual robots forming the coalition to sum up to the resource requirement of the given task but also satisfy the minimum resource distribution on each individual member of the coalition. There may be multiple alternate coalitions for a task, each of which can complete the task but with different efficiency. Traditionally the coalition formation problem has been formulated as a single objective optimization problem wherein the objective is either to maximize the number of the tasks or to maximize the overall system efficiency. In this paper, the coalition formation problem has been modeled as a multi-objective optimization problem where both the number of tasks completed as well as the overall system efficiency are considered simultaneously. Two popular multi-objective approaches are implemented and the results demonstrate their superiority over single objective solutions.
KeywordsMultiobjective Optimization Task Allocation Coalition Formation Coalition Structure Single Objective Optimization Problem
Unable to display preview. Download preview PDF.
- 2.Vig, L., Adams, J.A.: Issues in multi-robot coalition formation. In: Parker, L.E., Schultz, A., Schneider, F. (eds.) Multi-Robot Systems. From Swarms to Intelligent Automata, vol. III, Springer, Heidelberg (2005)Google Scholar
- 4.Manathara, J.G., et al.: Multiple UAV coalition for a search and prosecute mission. Journal of Intelligent and Robotic Systems, 1–34 (2010)Google Scholar
- 6.Zitzler, E., Laumanns, M., Thiele, L.: SPEA 2: Improving the strength pareto evolutionary algorithm. Technical Report 103, Computer engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich (2001)Google Scholar
- 8.Pedro, M.S., Mario, F.M.C.: CoMutaR: A framework for multi-robot coordination and task allocation. In: Proceedings of the IEEE/RSJ International conference on Intelligent Robots and Systems, St. Louis, USA (2009)Google Scholar
- 12.Liu, H.Y., Chen, J.F.: Multi-robot cooperation coalition formation based on genetic algorithm. In: Fifth International Conference on Machine Learning and Cybernetics, pp. 85–88. IEEE, Dalian (2006)Google Scholar
- 13.Li, Z., Xu, B., Yang, L., Chen, J., Li, K.: Quantum evolutionary algorithm for multi-robot coalition formation. In: Summit on Genetic and Evolutionary Computation, pp. 295–302. ACM/SIGEVO, Shanghai, China (2009)Google Scholar
- 18.Corne, D.W., Knowles, J.D., Oates, M.J.: The Pareto-envelope based selection algorithm for multiobjective optimization. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 839–848. Springer, Heidelberg (2000)CrossRefGoogle Scholar
- 19.Tang, F., Parker, L.E.: ASyMTRe: Automated synthesis of multi-robot task solutions through software reconfiguration. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Barcelona, Spain (2005)Google Scholar
- 20.Shi, Z., Chen, Q., Li, S., Cai, H., Shen, X.: Cooperative task allocation for multiple mobile robots based on multi-objective optimization method. In: 2010 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT), vol. 1, pp. 484–489 (2010)Google Scholar
- 22.Deb, K.: A robust evolutionary framework for multi-objective optimization. In: GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 633–640. ACM, New York (2008)Google Scholar