so i need to find a path from A to G and i am having a trouble with question e.

Question

so i need to find a path from A to G and i am having a trouble with question e. it would be nice if anyone can help me out. thx!

2 h-3 h-2 2 h=1 h 2 h=0 Figure 2: The weighted graph and the h) function For parts (d) and (e) also include the node score (for A* this is g+ h) in your answer alongside with the back pointer. d) (10 Perform Uniform Cost Search. The first few steps are shown for Uniform Cost Search in the example table below. OPEN (Priority Queue)[Top is towards right CLOSED (0,Null) C(5A) B(2A DLA) A(0,Null) e) (20 Perform A" search with the given heuristic function h) in Figure 2.

Explanation / Answer

Using heuristic depth first search function

To find a path from A to G initially start at node A and from A there are 3 paths but A to D doesn't match the criteria so we do not consider

Next A to B and A to C if we consider A to B has the cost path value as 2 and h() as 7 which combines A* value as 9 and for A to C cost path is 5 and h() function as 2 which combines A* value as 7 so now considering the best path C should be considered with low value.

Now from C there are again 3 paths E,F,G but we need a path with low A* values C to E and C to F has same cost and h() value and G has more cost value so considering the next path from E and F the A* value of E to G is more as compared to F to G.

So the final A* value of the path from A to G is A->C->F->G the values are 7+2+1 =10 when considered the depth first heuristic search

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.