ex03
2024-10-08 09:00:42
1. a heuristic function h(n): a heuristic value of n, that is the estimated cost of reaching goal from n.
2. How to design heuristics?
properties of a good heuristic function should have:
- admissibility: a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.[1]
- consistent: a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour.
Supplementary knowledge:
1. Admissible heuristic; consistent heuristic;
最新文章
- 如何区别exists与not exists?
- 无法在“EntityFramework”已存在的情况下创建影像复制该文件的解决方案
- 【一次面试】再谈javascript中的继承
- Tarjan算法---强联通分量
- HDU 4768 Flyer（二分）
- http://www.cnblogs.com/meiCode/p/5896239.html
- Jrebel6.3.3破解，配置图文教程
- linux下的gedit命令使用方法与技巧
- 对于百川SDK签名验证的问题
- xml中不能直接添加ViewGroup
- Head First HTML与CSS — 为你的页面加图像
- LDA-线性判别分析（三）
- WebConfig配置 文件加密处理
- flex中form表单中子元素之间的距离控制
- 配置Meld为git的默认比较工具
- 记录4-Ubuntu 16.04用gparted调整分区
- 意想不到的的异常-由于eclipse和tomcat的交互出错-eclipse断点导致debug启动缓慢
- [leet code 100] same tree
- consul vs etcd3
- JavaScript：Functions