'Fringe nodes' presentation slideshows

Lecture 6: 25/4/1435 Informed search strategies

377 views • 24 slides

A* Search

A* Search. Tree search algorithms. Basic idea: Exploration of state space by generating successors of already-explored states (a.k.a.~ expanding states). Every states is evaluated: is it a goal state ?. Tree search example. Tree search example. Tree search example.

392 views • 22 slides

- Used to solve the single-source shortest paths problem for weighted connected graphs ? Start at a vertex designated as the source ? Find shortest paths to all other vertices - Some uses for this problem: i . Transportation planning ii. Packet routing of communication networks

492 views • 6 slides