文档章节

再译《A *路径搜索入门》之二

如比如比
 如比如比
发布于 2015/06/07 21:29
字数 2212
阅读 142
收藏 6

路径

Path Scoring

算出的路径时,确定要使用的方格的关下面的公式

The key to determining which squares to use when figuring out the path is the following equation:

 

F = G + H

 

where

 

G =从起点A沿着生成的路径到一个定的方形网格上运行成本

G = the movement cost to move from the starting point A to a given square on the grid, following the path generated to get there.

 

H =格子中方块到最目的地,B的运行成本通常称式,可有点混乱。因是一个猜所以这样称呼找到路径之前,真的不知道实际的距离,因各种各的事情都在途中,水等)。在本教程中给出一个H的方法,但在网计算H方法其他文章

H = the estimated movement cost to move from that given square on the grid to the final destination, point B. This is often referred to as the heuristic, which can be a bit confusing. The reason why it is called that is because it is a guess. We really don't know the actual distance until we find the path, because all sorts of things can be in the way (walls, water, etc.). You are given one way to calculate H in this tutorial, but there are many others that you can find in other articles on the web.

 

反复遍开启列表,选择具有最小F的方块来生成的路径。在本文中程将一步更详细描述。首先来仔看看如何算公式。

Our path is generated by repeatedly going through our open list and choosing the square with the lowest F score. This process will be described in more detail a bit further in the article. First let's look more closely at how we calculate the equation.

 

如上所述,G从起始点移定点所生成路径的成本。在个例子中,我将指每个移水平或垂直方成本10线成本14们使用这些数字为斜角移动2的平方根(不要害怕),水平或垂直的大1.414倍。我使用1014简单。比例大致是正确的,又能避免算平方根和小数。这不只是因为我们是愚笨的,不喜欢数学。采用些数字是让计算机更快,太快了。你很快就会发现,如果你不使用些捷径路径搜索能会很慢的。

As described above, G is the movement cost to move from the starting point to the given square using the path generated to get there. In this example, we will assign a cost of 10 to each horizontal or vertical square moved, and a cost of 14 for a diagonal move. We use these numbers because the actual distance to move diagonally is the square root of 2 (don't be scared), or roughly 1.414 times the cost of moving horizontally or vertically. We use 10 and 14 for simplicity's sake. The ratio is about right, and we avoid having to calculate square roots and we avoid decimals. This isn't just because we are dumb and don't like math. Using whole numbers like these is a lot faster for the computer, too. As you will soon find out, pathfinding can be very slow if you don't use short cuts like these.

 

由于我们计G值是沿特定的路径定的平方,该办找出那个方的父G,然后加1014取决于它从父方正交(非线还是线需要种方法将在本施例一步上得明一点,因得到一个以上的方

Since we are calculating the G cost along a specific path to a given square, the way to figure out the G cost of that square is to take the G cost of its parent, and then add 10 or 14 depending on whether it is diagonal or orthogonal (non-diagonal) from that parent square. The need for this method will become apparent a little further on in this example, as we get more than one square away from the starting square.

 

H各种方式。我里使用的方法被称曼哈方法,在计算从当前方块到目标方水平和垂直方向移动方块的总数忽略角运,忽略可能在程中的任何障碍。然后,我数乘以10,我的成本水平或垂直移一格。是(可能)被称曼哈方法,因它像算城市街区的数量从一个地方到另一个地方,在那里你不能穿过块对角。

H can be estimated in a variety of ways. The method we use here is called the Manhattan method, where you calculate the total number of squares moved horizontally and vertically to reach the target square from the current square, ignoring diagonal movement, and ignoring any obstacles that may be in the way. We then multiply the total by 10, our cost for moving one square horizontally or vertically. This is (probably) called the Manhattan method because it is like calculating the number of city blocks from one place to another, where you can't cut across the block diagonally.

 

阅读明,您可能已猜到了启仅仅是当前方与目的剩余距离的一个乌鸦飞似的”粗略的估。不是种情况。我们实际试图沿路径的剩余距离(通常是更)。越接近我的估实际剩余距离,快的算法。如果我高估了个距离,但是,它不能保证给的最短路径。在这样的情况下,我有所的“不可接受启式”。

Reading this description, you might guess that the heuristic is merely a rough estimate of the remaining distance between the current square and the target "as the crow flies." This isn't the case. We are actually trying to estimate the remaining distance along the path (which is usually farther). The closer our estimate is to the actual remaining distance, the faster the algorithm will be. If we overestimate this distance, however, it is not guaranteed to give us the shortest path. In such cases, we have what is called an "inadmissible heuristic."

 

从技,在个例子中,曼哈方法是不可接受的,因它稍稍高估了剩下的距离。但是我会用也无妨,因它是一个更容易理解我的目的,因它只是一个微的高估。在极少的情况下,得到的路径不是最短的,这将是近短。想了解更多?你你可以在http://www.policyalmanac.org/games/heuristics.htm找到方程和附加明启式。

Technically, in this example, the Manhattan method is inadmissible because it slightly overestimates the remaining distance. But we will use it anyway because it is a lot easier to understand for our purposes, and because it is only a slight overestimation. On the rare occasion when the resulting path is not the shortest possible, it will be nearly as short. Want to know more? You can find equations and additional notes on heuristics here.

 

FGH中的和。搜索的第一个步果可以下面的明中看出。在FGH的分数被写入在每个方格。正如在紧挨着开始方块右侧上,F被打印在左上角,G印在左下方,而H示在右下方。

F is calculated by adding G and H. The results of the first step in our search can be seen in the illustration below. The F, G, and H scores are written in each square. As is indicated in the square to the immediate right of the starting square, F is printed in the top left, G is printed in the bottom left, and H is printed in the bottom right.

 

[3]

[Figure 3]

 

所以,来看看其中的一些方。在字母上,G = 10是因它是在一个水平方向的距离起始方块仅。正方形紧邻上方,下方,及在起始的左10相同的G线14G

So let's look at some of these squares. In the square with the letters in it, G = 10. This is because it is just one square from the starting square in a horizontal direction. The squares immediately above, below, and to the left of the starting square all have the same G score of 10. The diagonal squares have G scores of 14.

 

H是通计到红色目的曼哈距离,水平和垂直方向,而忽略上那就是在算方式。使用种方法,方上开始的直接右3格是红格30。那么高于个方的方块的H4格距离(住,只能水平移和垂直)的一个H40.你也可以看到其他方块计H值的方法

The H scores are calculated by estimating the Manhattan distance to the red target square, moving only horizontally and vertically and ignoring the wall that is in the way. Using this method, the square to the immediate right of the start is 3 squares from the red square, for a H score of 30. The square just above this square is 4 squares away (remember, only move horizontally and vertically) for an H score of 40. You can probably see how the H scores are calculated for the other squares.

 

每个方格的F,再次,只是通GH一起算。

The F score for each square, again, is simply calculated by adding G and H together.

(待续)

© 著作权归作者所有

共有 人打赏支持
如比如比
粉丝 124
博文 178
码字总数 286951
作品 0
日本
程序员
再译《A *路径搜索入门》之五

■实施上的注意事项 Notes on Implementation 现在您了解了基本的方法,当你编写自己的程序时,有一些额外的事情要考虑。下面给出我用C ++和Blitz Basic编写的程序,用其他语言也同样有效。 ...

放个屁
2015/06/11
0
0
《鸡啄米C++编程入门系列》系列技术文章整理收藏

《鸡啄米C++编程入门系列》系列技术文章整理收藏 收藏整理鸡啄米C++编程入门系列文章,供个人和网友学习C++时参考 1鸡啄米:C++编程入门系列之前言 2鸡啄米:C++编程入门系列之一(进制数) ...

开元中国2015
2015/05/26
132
0
【掘金小报】第八期 怎么用 Python 实现每秒百万级的请求?

掘金小报主打分享优质深度技术内容,技术内容分:前端、后端、Android、iOS、产品设计、工具资源和一些有趣的东西。 注意:与标题的相关的文章在后端分类下的:《[译] 用 Python 实现每秒百万...

膜法小编
2017/05/05
0
0
再译《A *路径搜索入门》之流畅版??

A 路径搜索入门 帕特里克·莱斯特发表于2003年10月8日下午8点33人工智能 如果您发现文中有错误或问题(丢失的影像或文件,受损代码,不正确的文本格式等),导致无法阅读它时,请联系编辑,以...

放个屁
2015/06/17
0
0
再译《A *路径搜索入门》之一

※※※ 外语不好凑合着看吧,呵呵 ※※※ A 路径搜索入门 A Pathfinding for Beginners 帕特里克·莱斯特发表于2003年10月8日下午8点33人工智能 By Patrick Lester Published Oct 08 2003 08...

放个屁
2015/06/07
0
0

没有更多内容

加载失败,请刷新页面

加载更多

如何通过 J2Cache 实现分布式 session 存储

做 Java Web 开发的人多数都会需要使用到 session (会话),我们使用 session 来保存一些需要在两个不同的请求之间共享数据。一般 Java 的 Web 容器像 Tomcat、Resin、Jetty 等等,它们会在...

红薯
今天
1
0
C++ std::thread

C++11提供了std::thread类来表示一个多线程对象。 1,首先介绍一下std::this_thread命名空间: (1)std::this_thread::get_id():返回当前线程id (2)std::this_thread::yield():用户接口...

yepanl
今天
2
0
Nignx缓存文件与动态文件自动均衡的配置

下面这段nginx的配置脚本的作用是,自动判断是否存在缓存文件,如果有优先输出缓存文件,不经过php,如果没有,则回到php去处理,同时生成缓存文件。 PHP框架是ThinkPHP,最后一个rewrite有关...

swingcoder
今天
1
0
20180920 usermod命令与用户密码管理

命令 usermod usermod 命令的选项和 useradd 差不多。 一个用户可以属于多个组,但是gid只有一个;除了gid,其他的组(groups)叫做扩展组。 usermod -u 1010 username # 更改用户idusermod ...

野雪球
今天
1
0
Java网络编程基础

1. 简单了解网络通信协议TCP/IP网络模型相关名词 应用层(HTTP,FTP,DNS等) 传输层(TCP,UDP) 网络层(IP,ICMP等) 链路层(驱动程序,接口等) 链路层:用于定义物理传输通道,通常是对...

江左煤郎
今天
1
0

没有更多内容

加载失败,请刷新页面

加载更多

返回顶部
顶部