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

Develop a program octal to hexadecimal, Q.  Develop a Menu driven program w...

Q.  Develop a Menu driven program with following menu: 1.  Octal to Decimal 2.  Octal to Hexadecimal 3.  Octal to Binary

Define the state and instance of properties of object, Define the state and...

Define the state and instance of properties of object A state encompasses all properties of object along with values of each of these properties. An instance is a concr

Implementation of 3 line to 8 line decoder, Implement the following functio...

Implement the following function using a 3 line to 8 line decoder. S (A,B,C) =   ∑ m(1,2,4,7) C (A,B,C) =  ∑ m ( 3,5,6,7)         Ans. Given function S (A,B,C) = m (1,2,4,7)

Subtraction 11011-11001 using 2's complement, Subtraction 11011-11001 using...

Subtraction 11011-11001 using 2's complement. Ans. 11011 - 11001 = A - B 2's complement of B = 00111 1 1 0 1 1 + 0 0 1 1 1 1 0 0 0 1 0 Ignore carry to get answer as 00010 = 2.

Bernstein conditions for detection of parallelism, Bernstein Conditions for...

Bernstein Conditions for Detection of Parallelism For implementation of instructions or block of instructions in parallel, it should be guaranteed that the instructions are ind

Explain simple interfacing, Q. Explain Simple Interfacing? The followin...

Q. Explain Simple Interfacing? The following is a sample of the coding, used for procedure interfacing: PUBLIC CUROFF             _TEXT SEGMENT WORD PUBLIC 'CODE'

What is smoke testing, What is smoke testing? Smoke testing is a combi...

What is smoke testing? Smoke testing is a combined approach that is generally used when "shrinkwrapped" software products are being developed.

Cryptarithmetic problem in artificial intelligence, Solve the following cry...

Solve the following cryptarithmetic problem using Prolog: P I N G P O N G + F U N --------- I G N I P Each of the 7 different letters stands for a different digit. The

Calculate the switching elements in a two stage network, In a two stage ne...

In a two stage network there are 512 inlets and outlets, r=s=24. If the probability that a given inlet is active is 0.8, calculate: the switching elements Given: N =M =512,

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