首页    期刊浏览 2024年11月25日 星期一
登录注册

文章基本信息

  • 标题:Multi-objective Optimisation of Multi-robot Task Allocation with Precedence Constraints
  • 本地全文:下载
  • 作者:Padmanabhan Panchu K. ; M. Rajmohan ; R. Sundar
  • 期刊名称:Defence Science Journal
  • 印刷版ISSN:0976-464X
  • 出版年度:2018
  • 卷号:68
  • 期号:2
  • 页码:175-182
  • 语种:English
  • 出版社:Defence Scientific Information & Documentation Centre
  • 摘要:Efficacy of the multi-robot systems depends on proper sequencing and optimal allocation of robots to the tasks. Focuses on deciding the optimal allocation of set-of-robots to a set-of-tasks with precedence constraints considering multiple objectives. Taguchi’s design of experiments based parameter tuned genetic algorithm (GA) is developed for generalised task allocation of single-task robots to multi-robot tasks. The developed methodology is tested for 16 scenarios by varying the number of robots and number of tasks. The scenarios were tested in a simulated environment with a maximum of 20 robots and 40 multi-robot foraging tasks. The tradeoff between performance measures for the allocations obtained through GA for different task levels was used to decide the optimal number of robots. It is evident that the tradeoffs occur at 20 per cent of performance measures and the optimal number of robot varies between 10 and 15 for almost all the task levels. This method shows good convergence and found that the precedence constraints affect the optimal number of robots required for a particular task level.
  • 其他摘要:Efficacy of the multi-robot systems depends on proper sequencing and optimal allocation of robots to the tasks. Focuses on deciding the optimal allocation of set-of-robots to a set-of-tasks with precedence constraints considering multiple objectives. Taguchi’s design of experiments based parameter tuned genetic algorithm (GA) is developed for generalised task allocation of single-task robots to multi-robot tasks. The developed methodology is tested for 16 scenarios by varying the number of robots and number of tasks. The scenarios were tested in a simulated environment with a maximum of 20 robots and 40 multi-robot foraging tasks. The tradeoff between performance measures for the allocations obtained through GA for different task levels was used to decide the optimal number of robots. It is evident that the tradeoffs occur at 20 per cent of performance measures and the optimal number of robot varies between 10 and 15 for almost all the task levels. This method shows good convergence and found that the precedence constraints affect the optimal number of robots required for a particular task level.
  • 其他关键词:Multi-robot task allocation;Multi-robot task sequencing;Foraging tasks;Multi-objective optimisation; Genetic algorithm;Taguchi DOE
国家哲学社会科学文献中心版权所有