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

Show packing and unpacking data, Q. Show Packing and Unpacking Data? P...

Q. Show Packing and Unpacking Data? Packing and Unpacking Data  pvm_packs - Pack active message buffer with arrays of prescribed data type: int info = pvm_pac

Hypertext vs hypermedia, Hypertext vs Hypermedia     Hypertext is basic...

Hypertext vs Hypermedia     Hypertext is basically the similar as regular text - it can be stored, read, searched, or edited - with a significant exception: hypertext having co

Calculate grade of service in a particular excahange, In a particular excha...

In a particular exchange during busy hour 1200 calls were offered to a group of trunks, during this time 6 calls were lost. The average call duration being 3 minutes Calculate

Clocked sr flip flop, Clocked SR flip flop A clock pulse is a...

Clocked SR flip flop A clock pulse is a sequence of logic 0, logic 1, and logic 0 occuring on the CLK input. Time t n occurs before the clock pulse and time t n+1

Describe the limitation of fat16, Q. Describe the Limitation of FAT16? ...

Q. Describe the Limitation of FAT16? DOS designers decided to use clusters with as a minimum four sectors in them (so a cluster size of at least 2KB) for all FAT16 hard disks.

Explain a multiprocessing operating system, Explain a multiprocessing opera...

Explain a multiprocessing operating system? A multiprocessing system is a computer hardware configuration which contains more than one independent processing unit. Multiprocess

The current image in gimp, How do we merge an image from a file to the curr...

How do we merge an image from a file to the current image in GIMP? Ans) Use "File then Open as Layers" menu command or just take the file to a window and drop it there. The file w

What are the lists of signal available, What are the lists of signal availa...

What are the lists of signal available? Terminating and suspending method Physical circumstances Available for the Programmer Fault in power supply

Show the example of internet address, Q. Show the example of internet addre...

Q. Show the example of internet address? The following can be a typical person understandable address on Internet: VVS @ expertsmind.us VVS is an username which in gene

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