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

Explain non-folded network, Explain Non-Folded network Non-Folded Netw...

Explain Non-Folded network Non-Folded Network: In a switching network, every inlet/outlet connection may be utilized for inter exchange transmission. In this case, the .excha

Explain the use of functions in parallel programming, Q. Explain the Use of...

Q. Explain the Use of functions in parallel programming? include "pvm3.h" main() {    int cc, tid, msgtag;    char buf[100];    printf("%x\n", pvm_mytid());

Data stream and instruction stream-flynn’s classification, Data Stream an...

Data Stream and Instruction Stream The term 'stream' refers to an order or flow of either data operated or instructions on by the computer. In the complete chain of instructi

Instruction pipeline, example of branching take place in instructon pipelin...

example of branching take place in instructon pipeline

What is a diagonalization language ld, What is a Diagonalization language L...

What is a Diagonalization language LD?  The  diagonalization  language  having  of  all  strings  w  such  that  the  TM  whose  code is w does not accept when w is given as in

Illustration of instruction format, Let's provide you a fundamental illustr...

Let's provide you a fundamental illustration by which you may be able to define the concept of instruction format.  Let us consider the instruction format of a MIPS computer. MI

Explain about two-pass assembler, Q. Explain about Two-pass assembler? ...

Q. Explain about Two-pass assembler? Assemblers usually make two or more passes through a source program in order to resolve forward references in a program. A forward referenc

Where does the cpu enhanced mode originate , Intel's 8086 was the first 32-...

Intel's 8086 was the first 32-bit processor, and as the company had to backward-support the 8086. All the modern Intel-based processors will run in the Enhanced mode, capable of sw

Hypothetical reliable data transfer protocol, the c code for hypothetical r...

the c code for hypothetical reliable data transfer protocol

Instruction length - assembly language, Instruction Length: Variabl...

Instruction Length: Variable-length instructions (Intel 80x86, VAX) need multi-step fetch and decode, but permit for a much more flexible and compressed instruction set.

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