What Is Uniform Search?

in unifrom search, a state having the lowest step cost is selected from the state on expanded/open state.

To implement this search technique heap sort the set of a newly generated state must be kept in a priority queue according to increasing cost.

Algorithm

Step 1 : Initialization

Open = {s}

closed = { }

s <- initial state

S <- Total State

Step 2 : Failure

if open = { } then return n (fauiler)

Step 3 : Select

Remove a node n from open with lowest step cost.

Step 4 : Success

if n E G then return success

Step 5 : Expand

Generate of n by applying state transication operator

for each successro M

if m E open U closed

cost[m] = cost[n]+cost[n,m]

insert m in open

root

A B C

C E D

if m E open closed

cost [m] = min { cost[m], cost[m] + cost[n,m]}

if cost[m] decreased and m E closed or removed m from closed and insert in open

Liveipl2021

leave a comment

Create Account



Log In Your Account