首页> 外文会议>2011 International Conference on Electric Information and Control Engineering >A comparative study of A-star algorithms for search and rescue in perfect maze
【24h】

A comparative study of A-star algorithms for search and rescue in perfect maze

机译:完美迷宫中A-star搜索和救援算法的比较研究

获取原文

摘要

Robots can be widely used to fulfill the task of search and rescue trapped persons in some dangerous situations, which can be abstracted as a maze. Three A-star algorithms are studied in this paper to compare the maze searching capacity and efficiency of their different heuristic functions, and the depth-first search algorithm, which has no heuristic information, is also adopted as a benchmark to judge the usefulness of the 3 heuristic functions of A-star algorithms. Experiments validated the usefulness of heuristic function with the results that the A-star algorithms outperform the depth-first search algorithm in most cases, and the A-star algorithm with the Euclidean distance from the father point of current point to the target point included in the heuristic function shows the best performance.
机译:机器人可以广泛用于完成在某些危险情况下搜寻和营救被困人员的任务,这些活动可以抽象为迷宫。本文研究了三种A-star算法,以比较其不同启发式函数的迷宫搜索能力和效率,并采用没有启发式信息的深度优先搜索算法作为判断该算法有效性的基准。 A-star算法的3种启发式功能。实验验证了启发式函数的有效性,其结果是:在大多数情况下,A-star算法的性能优于深度优先搜索算法,并且在其中包括从当前点的父点到目标点的欧几里德距离的A-star算法启发式功能显示出最佳性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号