正在加载图片...
A Increasing Cost Infeasible Feasible 3/17/2004 opyright Brian Williams, 2002 A米 Search: Search Tree Problem: State Space Search Problem Initial State Expand(node) Children of search node next states Goal-Test(node True if search node at a goal-stat Admissible Heuristic-Optimistic cost to go Search node: Node in the search tree State State the search is at Parent Parent in search tree copyright Brian Williams, 20023/17/2004 copyright Brian Williams, 2002 11 Increasing Cost Feasible Infeasible A* 3/17/2004 copyright Brian Williams, 2002 12 A* Search: Search Tree Problem: State Space Search Problem ƒ Θ Initial State ƒ Expand(node) Children of Search Node = next states ƒ Goal-Test(node) True if search node at a goal-state h Admissible Heuristic -Optimistic cost to go Search Node: Node in the search tree ƒ State State the search is at ƒ Parent Parent in search tree ds search node to those to be expanded
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有