首页> 外文会议>International workshop on CSCW in design >A Genetic Algorithms in Determining the Shortest Time of DAI Plan
【24h】

A Genetic Algorithms in Determining the Shortest Time of DAI Plan

机译:确定最短DAI计划时间的遗传算法

获取原文

摘要

Distributed Artificial Intelligence (DAI) is an important branch of Artificial Intelligence(AI). DAI plan is the key for DAI system to solve problems . To the user, a group of given tasks need to content with some restrictions, such as cost, quality, time and so on. To get a user satisfied planning is to find a solution according to a given constraint condition, such a problem is NP hard. To generate more quickly algorithm for determining relatively optimum plan. We give a genetic algorithm (GA) about the problem. For the selection of the new generation. We use different strategies, get different results. Finally we have a closely study of the results and make a comparison.
机译:分布式人工智能(DAI)是人工智能(AI)的重要分支。 DAI计划是DAI系统解决问题的关键。对于用户而言,一组给定的任务需要满足一些限制,例如成本,质量,时间等。要获得用户满意的计划,就是根据给定的约束条件找到解决方案,这样的问题很难解决。为了更快地生成用于确定相对最佳计划的算法。我们给出了有关该问题的遗传算法(GA)。为新一代的选择。我们使用不同的策略,得到不同的结果。最后,我们对结果进行了仔细研究并进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号