A* search - artificial intelligence, Computer Engineering

Assignment Help:

A* Search - artificial intelligence:

A* search in the combines is the best parts of uniform cost search, namely the fact that it's optimal and complete, and the other best parts of greedy search, namely its speed. This kind of searching strategy simply combines the path cost function g(n)  and the heuristic function  h(n)  by summing them to form a new heuristic measure f(n): 

f(n) = g(n) + h(n) 

Remembering that g(n) gives the path cost from the start state to state  n and h(n) estimates the path cost from n to a goal state, we see that f(n) estimates the cost of the cheapest solution that passes through n. 

The most important aspect of A* search is that, given only one restriction on h(n), it is possible to prove the search strategy there which is complete and optimal. The restriction to h(n) is that it must all the time underestimate the cost to reach a goal state from n. Such heuristic measures are called admissible. Look at Russell and Norvig for proof that A* search with an admissible heuristic is complete and optimal.


Related Discussions:- A* search - artificial intelligence

Where arq is transmitted, ARQ is transmitted in the event of: (A)  Los...

ARQ is transmitted in the event of: (A)  Loss of signal                          (B) Error in received data (C)  Improve reliability                  (D) During time out

Pulse train, brief explanation on pulse train

brief explanation on pulse train

Full resolution rule - artificial intelligence, Full Resolution Rule - Arti...

Full Resolution Rule - Artificial intelligence: Now that we know about unification, we can correctly describe the complete edition of resolution: p1  ∨ ...  ∨ pj  ∨ ...  ∨ p

Implement and - or- not gates using bit wise operator, Q. Develop  a menu d...

Q. Develop  a menu driven program to implement AND, OR, NOT gates using and without using  Bit wise operator. The menu  should  be  as follows: I.  Using Bit Wise operator I

Explain what is high debugging?, It is helped to recure the bugs. A program...

It is helped to recure the bugs. A program has problem that time this debugging is helped to solve the bugs is simply, this is the method of the recure bugs in the programming lang

What is the length of function code at user-command, What is the length of ...

What is the length of function code at user-command? Every menu function, push button, or function key has an associated function code of length FOUR (for example, FREE), which

Difference between depth first and breadth first traversing, Explain the di...

Explain the difference between depth first and breadth first traversing techniques of a graph.   Depth-first search is dissimilar from Breadth-first search in the following way

What is called all exceptions in java, Al l exceptions in Java are subclass...

Al l exceptions in Java are subclasses of built in class called? Each exception in Java are subclasses of make in class termed as Throwable.

Temporary registers w and z, Why the temporary registers W and Z are named ...

Why the temporary registers W and Z are named so I mean we start from A,B,C,D,E then H and L coz H stands for higher bit nd L for lower bit of the address pointed by memory pointer

forensics capability relevant to a honeynet server, A local government org...

A local government organisation needs to deploy a honey net. To this end you are to deploy a honeynet based on the supplied network diagram (separate download) that should give sop

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd