首页> 外文期刊>International Journal of Swarm Intelligence >Improving the cooperation of fuzzy simplified memory A* search and particle swarm optimisation for path planning
【24h】

Improving the cooperation of fuzzy simplified memory A* search and particle swarm optimisation for path planning

机译:提高模糊简化内存的合作*路径规划的搜索和粒子群优化

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

摘要

Problem solving is a very important subject in the world of AI. In fact, a problem can be considered one or more goals along with a set of available interactions for reaching those goals. One of the best ways of solving AI problems is to use search methods. The simplified memory bounded A* (SMA*) is one of the best methods of informed search. In this research, a hybrid method was proposed to increase the performance of SMA* search. The combining fuzzy logic with this search method and improving it with PSO algorithm brought satisfactory results. The use of fuzzy logic leads to increase the search flexibility especially when a robot dealing with lots of barriers and path changes. Furthermore, combining PSO saves the search from being trapped into local optimums and provides for search some correct and accurate suggestions. In the proposed algorithm, the results indicate that the cost of search and branching factor are decreased in comparison with other methods.
机译:问题解决是AI世界的一个非常重要的主题。事实上,一个问题可以被视为一个或多个目标以及一组可用的交互,以便到达这些目标。解决AI问题的最佳方法之一是使用搜索方法。简化的内存有界限A *(SMA *)是知情搜索的最佳方法之一。在本研究中,提出了一种混合方法来增加SMA *搜索的性能。使用PSO算法将模糊逻辑与PSO算法改进并提高了令人满意的结果。模糊逻辑的使用导致尤其是在处理大量障碍和路径的机器人变化时增加搜索灵活性。此外,组合PSO将搜索保存到被困到本地最佳上,并提供搜索一些正确和准确的建议。在所提出的算法中,结果表明,与其他方法相比,搜索和分支因子的成本降低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号