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

Make an instruction execution feasible, Q. Make an instruction execution fe...

Q. Make an instruction execution feasible? What are the functions that a control unit performs to make an instruction execution feasible? Instruction execution is achieved by e

Display the map centered on the users location, Question: a) The follo...

Question: a) The following is a description of the navigation options in a mobile web site which provides public bus time slots for a city. It is an interesting service for m

Explain internal organization of bit cells in a memory chip, Explain with n...

Explain with neat diagram the internal organization of bit cells in a memory chip. Memory cells are usually organized in the form of an array, in which every cell is capable of

Discuss the advantages of expression tree, Discuss its advantages over the ...

Discuss its advantages over the other evaluation techniques. The expression tree is determined by using a post-order traversal of the expression tree as given here: 1. If such

What are the stages of data mining, What are the stages of data mining? ...

What are the stages of data mining? The procedure of data mining comprises three stages, which are given below: a) The initial exploration b) Model building c) Deploym

Explain traffic intensity in networking, Explain Traffic Intensity in netwo...

Explain Traffic Intensity in networking. Traffic Intensity: The traffic load on a given network may be on interoffice trunk lines, the local switching unit or other common s

Explain hybrid network in standard telephone hand set, Explain Hybrid Netwo...

Explain Hybrid Network in Standard Telephone hand set. Hybrid network: The hybrid network (sometimes termed as a duplex coil or hybrid coil) in a telephone set is a particula

Define the uniform memory access model (uma), Normal 0 false ...

Normal 0 false false false EN-US X-NONE X-NONE

Build a tv remote control, Communication by devices, such as the HC11 proce...

Communication by devices, such as the HC11 processor, is a key and vital part of most systems that are used in military, commercial, and academic settings.  In fact, most of these

Memory-to-memory architecture:, Memory-to-Memory Architecture : The pipe...

Memory-to-Memory Architecture : The pipelines can access vector operands, intermediate and final results directly in the main memory. This needs the higher memory bandwidth. How

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