返回
Non-additive multi-objective robot coalition formation
DOI:10.1016/j.eswa.2013.11.044.png)
摘要
En 中文
Manifold increase in the complexity of robotic tasks has mandated the use of robotic teams called coalitions that collaborate to perform complex tasks. In this scenario, the problem of allocating tasks to teams of robots (also known as the coalition formation problem) assumes significance. So far, solutions to this NP-hard problem have focused on optimizing a single utility function such as resource utilization or the number of tasks completed. We have modeled the multi-robot coalition formation problem as a multi-objective optimization problem with conflicting objectives. This paper extends our recent work in multi-objective approaches to robot coalition formation, and proposes the application of the Pareto Archived Evolution Strategy (PAES) algorithm to the coalition formation problem, resulting in more efficient solutions. Simulations were carried out to demonstrate the relative diversity in the solution sets generated by PAES as compared to previously studied methods. Experiments also demonstrate the relative scalability of PAES. Finally, three different selection strategies were implemented to choose solutions from the Pareto optimal set. Impact of the selection strategies on the final coalitions formed has been shown using Player/Stage. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Evolutionary algorithms
Multi-objective optimization
Coalition formation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization基于混合粒子群算法的分布式计算系统多目标任务分配
Building multirobot coalitions through automated task solution synthesis
PROCEEDINGS OF THE IEEE
IF25.9

