【24h】

An ACO Approach to Planning

机译:ACO规划方法

获取原文
获取原文并翻译 | 示例

摘要

In this paper we describe a first attempt to solve planning problems through an Ant Colony Optimization approach. We have implemented an ACO algorithm, called ACOPlan, which is able to optimize the solutions of propositional planning problems, with respect to the plans length. Since planning is a hard computational problem, metaheuristics are suitable to find good solutions in a reasonable computation time. Preliminary experiments are very encouraging, because ACOPlan sometimes finds better solutions than state of art planning systems. Moreover, this algorithm seems to be easily extensible to other planning models.
机译:在本文中,我们描述了通过蚁群优化方法解决规划问题的首次尝试。我们已经实现了一种称为ACOPlan的ACO算法,该算法能够针对计划长度优化命题计划问题的解决方案。由于计划是一个困难的计算问题,因此元启发法适合在合理的计算时间内找到良好的解决方案。初步实验非常令人鼓舞,因为ACOPlan有时会找到比最先进的计划系统更好的解决方案。而且,该算法似乎很容易扩展到其他计划模型。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号