首页> 外文期刊>Expert Systems with Application >A new weighted pathfinding algorithms to reduce the search time on grid maps
【24h】

A new weighted pathfinding algorithms to reduce the search time on grid maps

机译:一种新的加权寻路算法,可减少网格图上的搜索时间

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

摘要

Artificial Intelligence (AI) techniques are utilized widely in the field of Expert Systems (ES) - as applied to robotics, video games self-driving vehicles and so on. Pathfinding algorithms are a class of heuristic algorithms based on AI techniques which are used in ES as decision making functions for the purpose of solving problems that would otherwise require human competence or expertise. ES fields that use pathfinding algorithms and operate in real-time face many challenges: for example time constraints, optimality and memory overhead for storing the paths which are found. For these algorithms to work, appropriate problem-specific maps must be constructed. In relation to this, the uniform-cost grid set-up is the most appropriate for ES applications. In this method, each node in a graph is represented as a tile, and the weight "between" tiles is set at a constant value, usually this is set to 1. In the state-of-the-art heuristic algorithms used with this data structure, multiplying the heuristic function by a weight greater than one is well-known technique. In this paper, we present three new techniques using various weights to accelerate heuristic search of grid maps. The first such technique is based on the iteration of a heuristic search algorithm associated with weight-set w. The second technique is based on the length between the start node and goal node, which is then associated with w. The last technique is based on the travel cost and is associated with a weight-set a. These techniques are applicable to a wide class of heuristic search algorithms. Therefore, we implement them, here, within the A*, the Bidirectional A* (Bi-A*) and Jump Point Search UPS) algorithms; thus obtaining a family of new algorithms. Furthermore, it is seen that the use of these new algorithms results in significant improvements over current search algorithms. We evaluate them in path-planning benchmarks and show the amended JPS technique's greater stability, across weight values, over the other two techniques. However, it is also shown that this technique yields poor results in terms of cost solution. (C) 2016 Elsevier Ltd. All rights reserved.
机译:人工智能(AI)技术在专家系统(ES)领域中得到了广泛使用-应用于机器人技术,视频游戏自动驾驶汽车等。寻路算法是一类基于AI技术的启发式算法,在ES中用作决策功能,以解决原本需要人类能力或专业知识的问题。使用寻路算法并实时运行的ES领域面临许多挑战:例如时间限制,最优性和用于存储找到的路径的内存开销。为了使这些算法起作用,必须构建适当的特定于问题的映射。与此相关的是,统一成本网格设置最适合ES应用程序。在这种方法中,图形中的每个节点都表示为一个图块,并且“图块之间的权重”设置为一个恒定值,通常将其设置为1。在与此相关的最新启发式算法中在数据结构中,将启发式函数乘以一个大于1的权重是众所周知的技术。在本文中,我们提出了三种使用各种权重的新技术,以加快网格图的启发式搜索。第一种这样的技术基于与权重集w相关的启发式搜索算法的迭代。第二种技术基于起始节点和目标节点之间的长度,然后与w关联。最后一种技术基于旅行成本,并与权重集合a相关联。这些技术适用于各种启发式搜索算法。因此,我们在A *,双向A *(Bi-A *)和跳转点搜索UPS)算法中实现它们;从而获得了一系列新算法。此外,可以看出,这些新算法的使用导致了对当前搜索算法的显着改进。我们在路径规划基准中对它们进行了评估,并显示了经过修正的JPS技术在整个权重值上的稳定性比其他两种技术更高。但是,还表明,就成本解决方案而言,此技术的效果不佳。 (C)2016 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号