【24h】

A Multiagent Planning Algorithm with Joint Actions

机译:具有联合动作的多算规划算法

获取原文

摘要

In this paper, we consider multiagent planning with joint actions––that refer to the same action being performed concurrently by a group of agents. There are few works that study specification of joint actions by extending PDDL. Since there are no multiagent planners that can handle joint actions, we propose a multiagent planning algorithm, which is capable of handling joint actions. In a multiagent setting, each agent has a different capability. The proposed algorithm obtains the number of agents involved in a joint action based on the capability of the individual agents. We have implemented our algorithm and compared its efficiency with some state-of-the-art classical planners. The results show that when the problem size increases, our algorithm can solve such problems whereas it cannot be solved by the classical planners.
机译:在本文中,我们考虑使用联合行动的多算规划 - 这将由一组代理商同时执行相同的行动。 通过扩展PDDL,少量研究联合行动的规范。 由于没有可以处理联合行动的多层计划者,我们提出了一种多算法规划算法,其能够处理联合动作。 在多重设置中,每个代理具有不同的功能。 该算法基于个体代理的能力获得了联合作用中涉及的代理的数量。 我们已经实施了我们的算法,并将其效率与某些最先进的典型规划策划进行了比较。 结果表明,当问题大小增加时,我们的算法可以解决这些问题,而它不能由经典规划者解决。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号