﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-christanxw的专栏-最新评论</title><link>http://www.cppblog.com/christanxw/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Thu, 23 Oct 2008 06:21:16 GMT</pubDate><lastBuildDate>Thu, 23 Oct 2008 06:21:16 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2008/05/25/5126.html#51004</link><dc:creator>陈</dc:creator><author>陈</author><pubDate>Sun, 25 May 2008 01:18:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2008/05/25/5126.html#51004</guid><description><![CDATA[有没有代码,有的话就完美了!<img src ="http://www.cppblog.com/christanxw/aggbug/51004.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">陈</a> 2008-05-25 09:18 <a href="http://www.cppblog.com/christanxw/archive/2008/05/25/5126.html#51004#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法[未登录]</title><link>http://www.cppblog.com/christanxw/archive/2008/03/28/5126.html#45631</link><dc:creator>a</dc:creator><author>a</author><pubDate>Fri, 28 Mar 2008 08:53:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2008/03/28/5126.html#45631</guid><description><![CDATA[<a target="_new" href="http://www.gamedev.net/reference/articles/article2003.asp建议大家去看英文版的吧">http://www.gamedev.net/reference/articles/article2003.asp建议大家去看英文版的吧</a>...<img src ="http://www.cppblog.com/christanxw/aggbug/45631.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">a</a> 2008-03-28 16:53 <a href="http://www.cppblog.com/christanxw/archive/2008/03/28/5126.html#45631#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2008/02/20/5126.html#43005</link><dc:creator>metaphy</dc:creator><author>metaphy</author><pubDate>Wed, 20 Feb 2008 13:11:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2008/02/20/5126.html#43005</guid><description><![CDATA[啊，我知道了，作者把有墙的斜线定义成不可通过。<img src ="http://www.cppblog.com/christanxw/aggbug/43005.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">metaphy</a> 2008-02-20 21:11 <a href="http://www.cppblog.com/christanxw/archive/2008/02/20/5126.html#43005#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2008/02/20/5126.html#43004</link><dc:creator>metaphy</dc:creator><author>metaphy</author><pubDate>Wed, 20 Feb 2008 13:05:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2008/02/20/5126.html#43004</guid><description><![CDATA[上面的例子，最终的结果并非最优的。最优的应该是走4个斜线，&quot;V&quot;字型的走法，距离是4&#215;14 ＝ 56；上面走的距离是68<img src ="http://www.cppblog.com/christanxw/aggbug/43004.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">metaphy</a> 2008-02-20 21:05 <a href="http://www.cppblog.com/christanxw/archive/2008/02/20/5126.html#43004#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 在A*算法中使用二叉堆（译）</title><link>http://www.cppblog.com/christanxw/archive/2007/12/11/5205.html#38263</link><dc:creator>ada</dc:creator><author>ada</author><pubDate>Tue, 11 Dec 2007 11:33:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2007/12/11/5205.html#38263</guid><description><![CDATA[来学习观摩<br><img src ="http://www.cppblog.com/christanxw/aggbug/38263.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">ada</a> 2007-12-11 19:33 <a href="http://www.cppblog.com/christanxw/archive/2007/12/11/5205.html#38263#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33408</link><dc:creator>张**</dc:creator><author>张**</author><pubDate>Thu, 04 Oct 2007 04:13:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33408</guid><description><![CDATA[A和A*的区别就在于A算法由于对于估价函数没有限制，可能找不到最优解（不代表A算法不“优”）。因为有可能一个最优解所经过的某个中间点的估价函数要高于另外一个非最优解的中间点的估价函数，从而进一步导致舍弃这个能找到最优解的点。<br>可是这上面的例子为什么用A算法还能找到最优解呢。我觉得这个例子具有其特殊性。首先，这是一个地图寻路问题，而且采用了曼哈顿距离。恰好上面所提到的A算法的弊端不会出现，所以就能顺利找到一个最优解了。<br>其实我数学很烂，又是新手，没有办法严格证明，只能比较直观地说一下。如果有错误恳请指正，先谢过各位。<img src ="http://www.cppblog.com/christanxw/aggbug/33408.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">张**</a> 2007-10-04 12:13 <a href="http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33408#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33406</link><dc:creator>张**</dc:creator><author>张**</author><pubDate>Thu, 04 Oct 2007 03:55:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33406</guid><description><![CDATA[不过我还想再提一点，这里所说的A*算法实际不严格，应该叫做A算法。A*算法是A算法的一种特例，其区别就在于A*算法中对于所有中间经过的点，其启发函数h(n)都是小于实际的最小值。上文中用曼哈顿距离作为h(n)函数，有的方格到达终点的估计值固然小于实际值，比如和目标方格之间有墙隔开的格子，但是对于有的方格就不是这样，比如墙正下方的那个，其h(n)的估计是大于实际值的。因此这只能是A算法，而不是A*算法。<img src ="http://www.cppblog.com/christanxw/aggbug/33406.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">张**</a> 2007-10-04 11:55 <a href="http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33406#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33404</link><dc:creator>张**</dc:creator><author>张**</author><pubDate>Thu, 04 Oct 2007 03:40:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33404</guid><description><![CDATA[太牛了，佩服。对我帮助很大，非常感谢！<img src ="http://www.cppblog.com/christanxw/aggbug/33404.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">张**</a> 2007-10-04 11:40 <a href="http://www.cppblog.com/christanxw/archive/2007/10/04/5126.html#33404#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2007/05/23/5126.html#24696</link><dc:creator>YeSoon</dc:creator><author>YeSoon</author><pubDate>Wed, 23 May 2007 09:26:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2007/05/23/5126.html#24696</guid><description><![CDATA[最近在做交通方面的最短路径，参考了你的文章，写的非常详细，非常棒。<img src ="http://www.cppblog.com/christanxw/aggbug/24696.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">YeSoon</a> 2007-05-23 17:26 <a href="http://www.cppblog.com/christanxw/archive/2007/05/23/5126.html#24696#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: A* 寻路算法</title><link>http://www.cppblog.com/christanxw/archive/2006/12/01/5126.html#15833</link><dc:creator>吴</dc:creator><author>吴</author><pubDate>Fri, 01 Dec 2006 01:23:00 GMT</pubDate><guid>http://www.cppblog.com/christanxw/archive/2006/12/01/5126.html#15833</guid><description><![CDATA[经典文章 比其他的文章简明易懂的多<img src ="http://www.cppblog.com/christanxw/aggbug/15833.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/christanxw/" target="_blank">吴</a> 2006-12-01 09:23 <a href="http://www.cppblog.com/christanxw/archive/2006/12/01/5126.html#15833#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>